perm filename OLDTRS[LIB,DOC]67 blob
sn#874462 filedate 1989-06-15 generic text, type C, neo UTF8
COMMENT ā VALID 00092 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00007 00002 VOL. 3, NO. 1 01/15/81
C00033 00003 VOL. 3, NO. 6 06/01/81
C00063 00004
C00066 00005
C00069 00006 VOL. 4, NO. 3 03/15/82
C00092 00007 VOL. 4, NO. 4 04/23/82
C00128 00008 VOL. 4, NO. 5 05/15/82
C00153 00009 VOL. 4, NO. 6 06/01/82
C00178 00010 VOL. 4, NO. 7 06/23/82
C00202 00011 VOL. 4, NO. 8 07/15/82
C00228 00012 VOL. 4, NO. 9 09/01/82
C00256 00013 VOL. 4, NO. 10 09/28/82
C00281 00014 VOL. 4, NO. 11 10/15/82
C00313 00015 VOL. 4, NO. 12 11/15/82
C00343 00016 VOL. 4, NO. 13 01/15/83
C00370 00017 VOL. 5, NO. 1 02/01/83
C00393 00018 VOL. 5, NO. 2 03/01/83
C00417 00019 VOL. 5, NO. 3 04/01/83
C00447 00020 VOL. 5, NO. 4 04/22/83
C00475 00021 VOL. 5, NO. 5 05/09/83
C00504 00022 VOL. 5, NO. 6 05/25/83
C00534 00023 VOL. 5, NO. 7 06/08/83
C00565 00024 VOL. 5, NO. 8 07/25/83
C00595 00025 VOL. 5, NO. 9 08/10/83
C00639 00026 VOL. 5, NO. 10 08/22/83
C00674 00027 VOL. 5, NO. 11 10/22/83
C00713 00028 VOL. 5, NO. 12 11/15/83
C00753 00029 VOL. 5, NO. 13 12/22/83
C00778 00030 VOL. 6, NO. 1 02/01/84
C00807 00031 VOL. 6, NO. 2 03/01/84
C00836 00032 VOL. 6, NO. 3 03/19/84
C00876 00033 VOL. 6, NO. 4 04/26/84
C00911 00034 VOL. 6, NO. 5 05/14/84
C00948 00035 VOL. 6, NO. 6 05/28/84
C00992 00036 VOL. 6, NO. 7 06/11/84
C01030 00037 VOL. 6, NO. 8 08/06/84
C01059 00038 VOL. 6, NO. 9 08/20/84
C01086 00039 VOL. 6, NO. 10 09/20/84
C01124 00040 VOL. 6, NO. 11 10/22/84
C01160 00041 VOL. 6, NO. 12 11/15/84
C01192 00042 VOL. 6, NO. 13 11/30/84
C01220 00043 VOL. 6, NO. 14 12/26/84
C01250 00044 VOL. 7, NO. 1 03/08/85
C01283 00045 VOL. 7, NO. 2 04/24/85
C01323 00046 VOL. 7, NO. 3 05/13/85
C01384 00047 VOL. 7, NO. 4 05/28/85
C01444 00048 VOL. 7, NO. 5 06/10/85
C01504 00049 VOL. 7, NO. 6 06/28/85
C01558 00050 VOL. 7, NO. 7 07/18/85
C01620 00051 VOL. 7, NO. 8 08/23/85
C01675 00052 VOL. 7, NO. 9 09/20/85
C01747 00053 VOL. 7, NO. 10 10/21/85
C01818 00054 VOL. 7, NO. 11 11/20/85
C01882 00055 VOL. 7, NO. 12 12/27/85
C01937 00056 VOL. 8, NO. 1 01/27/86
C02016 00057 VOL. 8, NO. 2 02/28/86
C02082 00058 VOL. 8, NO. 3 03/28/86
C02152 00059 VOL. 8, NO. 4 05/19/86
C02246 00060 VOL. 8, NO. 5 06/26/86
C02334 00061 VOL. 8, NO. 6 08/04/86
C02453 00062 VOL. 8, NO. 7 09/15/86
C02527 00063 VOL. 8, NO. 8 10/03/86
C02615 00064 VOL. 9, NO. 1 01/05/87
C02703 00065 VOL. 9, NO. 2 02/05/87
C02805 00066 VOL. 9, NO. 3 03/30/87
C02908 00067 VOL. 9, NO. 4 04/20/87
C03013 00068 VOL. 9, NO. 5 05/20/87
C03088 00069 VOL. 9, NO. 6 07/10/87
C03207 00070 VOL. 9, NO. 7 07/27/87
C03292 00071 VOL. 9, NO. 8 08/20/87
C03405 00072 VOL. 9, NO. 9 09/18/87
C03485 00073 VOL. 9, NO. 10 10/01/87
C03554 00074 VOL. 9, NO. 11 10/20/87
C03623 00075 VOL. 9, NO. 12 10/06/87
C03715 00076 VOL. 9, NO. 13 12/04/87
C03785 00077 VOL. 10, NO. 1 01/08/88
C03888 00078 VOL. 10, NO. 2 01/29/88
C03979 00079 VOL. 10, NO. 3 03/25/88
C04063 00080 VOL. 10, NO. 4 04/13/88
C04187 00081 VOL. 10, NO. 5 05/04/88
C04263 00082 VOL. 10, NO. 6 06/10/88
C04354 00083 VOL. 10, NO. 7 07/15/88
C04447 00084 VOL. 10, NO. 8 08/29/88
C04546 00085 VOL. 10, NO. 9 09/12/88
C04653 00086 VOL. 10, NO. 10 10/28/88
C04746 00087 VOL. 10, NO. 11 12/12/88
C04869 00088 VOL. 11, NO. 1 01/15/88
C04973 00089 VOL. 11, NO. 2 03/01/89
C05079 00090 VOL. 11, NO. 3 04/03/89
C05184 00091 VOL. 11, NO. 4 05/10/89
C05329 00092 VOL. 11, NO. 5 06/09/89
C05452 ENDMK
Cā;
VOL. 3, NO. 1 01/15/81
014436 ADAMS, J.C. WIGHT, A.S.* EMAS PERFORMANCE MEASUREMENT EXPERIMENTS USING A
REMOTE TERMINAL EMULATOR.* EDINBURGH U. COMP.SCI.DEPT.*CSR-57-80.*1980.
014437 ADDISON, C.A.*NUMERICAL METHODS FOR A CLASS OF SECOND ORDER ODE'S ARISING
IN STRUCTURAL DYNAMICS.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT. 147.*1980.
014438 ALKHATEEB, D. KAWASAKI, S. MUROGA, S.*AN IMPROVEMENT OF A BRANCH AND
BOUND ALGORITHM FOR DESIGNING NOR OPTIMAL NETWORKS.* ILLINOIS U.
COMP.SCI.DEPT.*UIUCDCS-R-80-1033.* 1980.
014439 ALMES, G.T.* GARBAGE COLLECTION IN AN OBJECT ORIENTED SYSTEM.* CARNEGIE
MELLON U. COMP.SCI.DEPT.*CMU-CS-80-128, PH.D. THESIS. ALMES, G.T.*1980.
014440 AMAREL, S.*INITIAL THOUGHTS ON CHARACTERIZATION OF EXPERT SYSTEMS.*
RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-088.*1980.
* 014441 BANERJI, R.B. MITCHELL, T.M.* DESCRIPTION LANGUAGES AND LEARNING
ALGORITHMS: A PARADIGM FOR COMPARISON.* RUTGERS U.
COMP.SCI.RES.LAB.*CBM-TR-107.*1980.
014442 BEITRAEGE ZUR GEOMETRIE UND ALGEBRA, NR. 6: EIN BEWEIS DES BERUEHRSATZES
IN SYMMETRISCHEN HYPERBELSTRUKTUREN, VON H.-J. SAMAGA; EXAMPLES OF
PLANAR NEAR RINGS ON NON ABELIAN GROUPS, BY J.R. CLAY; TACTICAL
CONFIGURATIONS HAVING P AFFINE PLANES SHARING A PENCIL OF LINES, BY J.R.
CLAY; UEBER EIN PROBLEM VON H. KARZEL, VON H. KUEHLBRANDT; EINE BECKMAN
QUARLES CHARAKTERISIERUNG DER LORENTZTRANSFORMATIONEN DES R SUPERSCRIPT
N, VON W. BENZ; UEBER EINE VERALLGEMEINERUNG DES FUNDAMENTALSATZES IN
DESARGUESSCHEN AFFINEN EBENEN, VON H. SCHAEFFER; ZUR INZIDENZSTRUKTUR
KINEMATISCHER RAEUME UND ABSOLUTER EBENEN, VON H. KARZEL UND H.-J.
KROLL.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*
TUM-M8010.*1980.
* 014443 BRINCH HANSEN, P.*THE DESIGN OF EDISON.* SOUTHERN CAL U.
COMP.SCI.DEPT.*1980.
** 014444 BRINCH HANSEN, P.* EDISON: A MULTIPROCESSOR LANGUAGE.* SOUTHERN CAL U.
COMP.SCI.DEPT.*1980.
* 014445 BRINCH HANSEN, P.* EDISON PROGRAMS.* SOUTHERN CAL U.
COMP.SCI.DEPT.*1980.
* 014446 BRISTOW, G.*THE STATIC DETECTION OF SYNCHRONIZATION ANOMALIES IN HAL/S
PROGRAMS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-165-79.*1979.
* 014447 BRISTOW, G.*TOOLS TO AID THE SPECIFICATION AND DESIGN OF FLIGHT
SOFTWARE.* COLORADO U. COMP.SCI.DEPT.* CU-CS-168-80.*1980.
014448 BRODY, D.A.*THE POST MACOMBER CASES IN A TAXMAN II FRAMEWORK: A
PRELIMINARY ANALYSIS.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-005.*1980.
** 014449 BURSTALL, R.M. MACQUEEN, D.B. SANNELLA, D.T.* HOPE: AN EXPERIMENTAL
APPLICATIVE LANGUAGE.* EDINBURGH U. COMP.SCI.DEPT.*CSR-62-80.*1980.
* 014450 BURSTALL, R.M. GOGUEN, J.A.*THE SEMANTICS OF CLEAR, A SPECIFICATION
LANGUAGE.* EDINBURGH U. COMP.SCI.DEPT.* CSR-65-80.*1980.
* 014451 CHENG, W.Y. RAY, S. KOLSTAD, R. LUHUKAY, J. CAMPBELL, R. LIU, J.W.-S.*
ILLINET -- A 32 MBITS/SEC. LOCAL AREA NETWORK.* ILLINOIS U.
COMP.SCI.DEPT.*UIUCDCS-R-80-1035.* 1980.
014452 CHOW, C.Y.-F.*A VARIABLE PRECISION PROCESSOR MODULE.* ILLINOIS U.
COMP.SCI.DEPT.*UIUCDCS-R-80-1032, PH.D. THESIS. CHOW, C.Y.-F.*1980.
014453 CIESIELSKI, V.*A METHODOLOGY FOR THE CONSTRUCTION OF NATURAL LANGUAGE
FRONT ENDS FOR MEDICAL CONSULTATION SYSTEMS.* RUTGERS U.
COMP.SCI.RES.LAB.*CBM-TR-112, PH.D. THESIS. CIESIELSKI, V.*1980.
014454 CLEMM, G.M.* CLEMSW USER'S MANUAL.* COLORADO U.
COMP.SCI.DEPT.*CS-CU-167-79.*1979.
014455 CLEMM, G.M.* FSCANN REPORT AND USER'S MANUAL.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-166-79.*1979.
014456 COX, M.G.* DIRECT VERSUS ITERATIVE METHODS FOR MULTIVARIATE SPLINE
FITTING PROBLEMS.* U.K. NATIONAL PHYSICAL LAB. NUM.ANAL. &
COMP.SCI.DIV.*DNACS 37/80.*1980.
014457 DENNIS, J.E. SCHNABEL, R.B.*A NEW DERIVATION OF SYMMETRIC POSITIVE
DEFINITE SECANT UPDATES.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-185-80.*1980.
014458 EDWARDS, B.*FUNCTIONAL SPECIFICATIONS OF THE ANNULAR SUSPENSION POINTING
SYSTEM.* COLORADO U. COMP.SCI.DEPT.* CU-CS-171-80.*1980.
* 014459 EHRENFEUCHT, A. ROZENBERG, G. VERRAEDT, R.*BASIC FORMULAS AND
LANGUAGES. PART I. THE THEORY.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-191-80.*1980.
* 014460 EHRENFEUCHT, A. ROZENBERG, G. VERRAEDT, R.*BASIC FORMULAS AND
LANGUAGES. PART II. APPLICATIONS TO EOL SYSTEMS AND FORMS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-192-80.*1980.
* 014461 EHRENFEUCHT, A. ENGELFRIET, J. ROZENBERG, G.* CONTEXT FREE NORMAL
SYSTEMS AND ETOL SYSTEMS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-194-80.*1980.
* 014462 EHRENFEUCHT, A. MAURER, H. ROZENBERG, G.* CONTINUOUS GRAMMARS.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-162-79.* 1979.
* 014463 EHRENFEUCHT, A. ROZENBERG, G.* DOS SYSTEMS AND LANGUAGES.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-160-79.*1979.
* 014464 EHRENFEUCHT, A. ROZENBERG, G.* FPOL SYSTEMS GENERATING COUNTING
LANGUAGES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-156-79.*1979.
* 014465 EHRENFEUCHT, A. ROZENBERG, G. RUOHONEN, K.*A MORPHIC REPRESENTATION OF
COMPLEMENTS OF RECURSIVELY ENUMERABLE SETS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-193-80.*1980.
* 014466 EHRENFEUCHT, A. ROZENBERG, G.*ON A BOUND FOR THE DOL SEQUENCE
EQUIVALENCE PROBLEM.* COLORADO U. COMP.SCI.DEPT.* CU-CS-163-79.*1979.
* 014467 EHRENFEUCHT, A. ROZENBERG, G.*ON AMBIGUITY IN EOL SYSTEMS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-158-79.*1979.
* 014468 EHRENFEUCHT, A. ROZENBERG, G.*ON THE EMPTINESS OF THE INTERSECTION OF
TWO DOS LANGUAGES PROBLEM.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-159-79.*1979.
* 014469 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SEPARATING POWER OF EOL SYSTEMS.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-186-80.* 1980.
* 014470 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SUBWORD COMPLEXITY OF SQUARE FREE
DOL LANGUAGES.* COLORADO U. COMP.SCI.DEPT.* CU-CS-174-80.*1980.
* 014471 EHRENFEUCHT, A. PARIKH, R. ROZENBERG, G.* PUMPING LEMMAS FOR REGULAR
SETS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-155-79.*1979.
* 014472 EHRENFEUCHT, A. ROZENBERG, G.*REPRESENTATION THEOREMS USING DOS
LANGUAGES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-161-79.* 1979.
* 014473 EHRENFEUCHT, A. ROZENBERG, G.*THE SEQUENCE EQUIVALENCE PROBLEM IS
DECIDABLE FOR OS SYSTEMS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-157-79.*1979.
014474 FAHLMAN, S.E.*THE HASHNET INTERCONNECTION SCHEME.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-125.*1980.
* 014475 FEILER, P.H. MEDINA-MORA, R.*AN INCREMENTAL PROGRAMMING ENVIRONMENT.*
CARNEGIE-MELLON U. COMP.SCI.DEPT.* CMU-CS-80-126.*1980.
* 014476 FISCHER, M.J. MEYER, A.R. PATERSON, M.S.*OMEGA (N LOG N) LOWER BOUNDS
ON LENGTH OF BOOLEAN FORMULAS.* M.I.T. LAB. FOR COMP.SCI.*TM-187.*1980.
014477 FOSDICK, L.D.*A STUDY OF ERRORS CAUSED BY TRANSCRIPTION MISTAKES IN
FORTRAN PROGRAMS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-146-79.*1979.
* 014478 FUERER, M.*THE COMPLEXITY OF THE INEQUIVALENCE PROBLEM FOR REGULAR
EXPRESSIONS WITH INTERSECTION.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-59-80.*1980.
* 014479 GABOW, H.N.*AN ALMOST-LINEAR ALGORITHM FOR TWO PROCESSOR SCHEDULING.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-196-80.* 1980.
** 014480 GABOW, H.N.*A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-180-80.* 1980.
* 014481 GAJSKI, D.D.* RECURRENCE SEMIGROUPS AND THEIR RELATION TO DATA STORAGE
IN FAST RECURRENCE SOLVERS ON PARALLEL MACHINES.* ILLINOIS U.
COMP.SCI.DEPT.*UIUCDCS-R-80-1037.* 1980.
014482 GALIL, Z. SEIFERAS, J.* TIME SPACE OPTIMAL STRING MATCHING (EXTENDED
ABSTRACT).*NO ISSUING AGENCY INDICATED (AUTHORS' ADDRESSES: Z. GALIL -
DEPARTMENT OF MATHEMATICAL SCIENCES/TEL-AVIV UNIVERSITY/TEL-AVIV/ISRAEL;
J.I. SEIFERAS - DEPARTMENT OF COMPUTER SCIENCE/UNIVERSITY OF
ROCHESTER/ROCHESTER, NEW YORK 14627).*1980.
014483 GARY, J.*THE MULTIGRID ITERATION APPLIED TO THE COLLOCATION METHOD.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-164-79.*1979.
014484 GERASOULIS, A.*ON THE EXISTENCE OF APPROXIMATE SOLUTIONS FOR SINGULAR
INTEGRAL EQUATIONS OF CAUCHY TYPE DISCRETIZED BY GAUSS CHEBYSHEV
QUADRATURE FORMULAE.* RUTGERS U. COMP.SCI.DEPT.*DCS-TR-094.*1980.
014485 GOLDBERG, R.N. WEISS, S.M.*AN EXPERIMENTAL TRANSFORMATION OF A LARGE
EXPERT KNOWLEDGE BASE.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-110.*1980.
014486 GOLDBERG, R.N.* SOFTWARE DESIGN ISSUES IN THE ARCHITECTURE AND
IMPLEMENTATION OF DISTRIBUTED TEXT EDITORS. DISSERTATION PROPOSAL.*
RUTGERS U. COMP.SCI.DEPT.* DCS-TM-014.*1980.
014487 GOLDBERG, R.N.*USING BRIGHT FOR MAINTAINING CLASS ROSTERS AND GRADES.*
RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TM-001.* 1980.
014488 GOLDMAN, N.M. WILE, D.S.*A DATABASE FOUNDATION FOR PROCESS
SPECIFICATIONS.* SOUTHERN CAL U. INFO.SCI.INST.* ISI/RR-80-84.*1980.
014489 GOODSON, J.L.*A PROCESS FOR EVALUATING TREE CONSISTENCY.* RUTGERS U.
COMP.SCI.RES.LAB.*CBM-TR-111.*1980.
014490 GORIN, R.E.*INTRODUCTION TO DECSYSTEM-20 ASSEMBLY LANGUAGE PROGRAMMING.
(STANFORD UNIVERSITY, COMPUTER SCIENCE DEPARTMENT: CS109B, WINTER
1981).* ST. U. COMP.SCI.DEPT.* 1980.
014491 HAMMARLING, S. WILKINSON, J.H.*ON LINEAR SYSTEMS ARISING FROM FINITE
DIFFERENCE APPROXIMATIONS TO ELLIPTIC DIFFERENTIAL EQUATIONS.* U.K.
NATIONAL PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.*DNACS 34/80.*1980.
* 014492 HAUSSLER, D.* MODEL COMPLETENESS OF AN ALGEBRA OF LANGUAGES.* COLORADO
U. COMP.SCI.DEPT.*CU-CS-178-80.* 1980.
* 014493 HAUSSLER, D. ZEIGER, H.P.*VERY SPECIAL LANGUAGES AND REPRESENTATIONS OF
RECURSIVELY ENUMERABLE LANGUAGES VIA COMPUTATION HISTORIES.* COLORADO U.
COMP.SCI.DEPT.* CU-CS-177-80.*1980.
** 014494 HOEY, D. LEISERSON, C.E.*A LAYOUT FOR THE SHUFFLE EXCHAGE NETWORK.*
CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-80-139.*1980.
* 014495 HOLTZMAN, S.R.* GGDL: GENERATIVE GRAMMAR DEFINITIONAL LANGUAGE.*
EDINBURGH U. COMP.SCI.DEPT.*CSR-56-80.*1980, REVISED.
014496 JERRUM, M. SNIR, M.*SOME EXACT COMPLEXITY RESULTS FOR STRAIGHT-LINE
COMPUTATIONS OVER SEMIRINGS.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-58-80.*1980.
014497 KUNG, H.-T. PAPADIMITRIOU, C.H.*AN OPTIMALITY THEORY OF CONCURRENCY
CONTROL FOR DATABASES.* M.I.T. LAB. FOR COMP.SCI.*TM-185.*1980.
014498 LESZCZYLOWSKI, J.*THEORY OF FP SYSTEMS IN EDINBURGH LCF.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-61-80.*1980.
014499 LEV, G. PIPPENGER, N. VALIANT, L.G.*A FAST PARALLEL ALGORITHM FOR ROUTING
IN PERMUTATION NETWORKS.* EDINBURGH U. COMP.SCI.DEPT.*CSR-63-80.*1980.
014500 LIBES, D.*A GUIDE TO APPLYING TO GRADUATE SCHOOL (IN COMPUTER SCIENCE).*
RUTGERS U. COMP.SCI.DEPT.*DCS-TM-013.* 1980.
014501 MCCARTY, L.T. SRIDHARAN, N.S.*THE REPRESENTATION OF AN EVOLVING SYSTEM OF
LEGAL CONCEPTS: I. LOGICAL TEMPLATES.* RUTGERS U.
COMP.SCI.RES.LAB.*LRP-TR-007.*1980.
014502 MCCARTY, L.T. SRIDHARAN, N.S.*THE REPRESENTATION OF CONCEPTUAL STRUCTURES
IN TAXMAN II.* RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-004.*1980.
014503 MCCARTY, L.T.*SOME NOTES ON THE MAP FORMALISM OF TAXMAN II, WITH
APPLICATIONS TO EISNER V. MACOMBER.* RUTGERS U.
COMP.SCI.RES.LAB.*LRP-TR-006.*1980.
014504 MCCARTY, L.T.*SOME REQUIREMENTS FOR A COMPUTER-BASED LEGAL CONSULTANT. *
RUTGERS U. COMP.SCI.RES.LAB.*LRP-TR-008.* 1980.
014505 MITCHELL, T.M. UTGOFF, P.E. BANERJI, R.B.* LEARNING PROBLEM SOLVING
HEURISTICS BY EXPERIMENTATION.* RUTGERS U.
COMP.SCI.RES.LAB.*CBM-TR-114.*1980.
* 014506 MOORE, R.C.* REASONING ABOUT KNOWLEDGE AND ACTION.* SRI INTERNATIONAL.
A.I. CENTER.*TECH. NOTE 191, PH.D. THESIS. MOORE, R.C. (M.I.T.).*1980.
014507 MYERS, E.W. OSTERWEIL, L.J.* FLAT: A FORTRAN LANGUAGE AUGMENTATION TOOL.*
COLORADO U. COMP.SCI.DEPT.* CU-CS-179-80.*1980.
* 014508 MYERS, E.W.*A PRECISE AND EFFICIENT ALGORITHM FOR DETERMINISTIC
EXISTENTIAL SUMMARY DATA FLOW INFORMATION.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-175-80.*1980.
014509 NAGEL, D.*SOME CONSIDERATIONS ON EXTRACTING DEFINITIONAL INFORMATION
ABOUT RELATIONS.* RUTGERS U. COMP.SCI.DEPT.* CBM-TM-085.*1980, REVISED.
014510 NATIONAL SCIENCE FOUNDATION. MATH. & PHYSICAL SCIENCES DIRECTORATE. MATH.
& COMP. SCIENCES DIV. COMP.SCI. SECTION.*COMPUTER SCIENCE SECTION:
SUMMARY OF AWARDS. FISCAL YEAR 1980.*
014511 NEALE, P.T.*THE DEMOS MULTICOMPUTER RING: THE RING CLOSER.* U.K. NATIONAL
PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.* DNACS 36/80.*1980.
014512 OSTERWEIL, L.J.* SOFTWARE ENVIRONMENT RESEARCH: DIRECTIONS FOR THE NEXT
FIVE YEARS.* COLORADO U. COMP.SCI.DEPT.* CU-CS-195-80.*1980.
014513 OSTERWEIL, L.J.*A SOFTWARE LIFECYCLE METHODOLOGY AND TOOL SUPPORT.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-154-79.*1979.
* 014514 OSTERWEIL, L.J.*A STRATEGY FOR EFFECTIVE INTEGRATION OF VERIFICATION
AND TESTING TECHNIQUES.* COLORADO U. COMP.SCI.DEPT.*CU-CS-181-80.*1980.
014515 PAIGE, R. KOENIG, S.* FINITE DIFFERENCING OF COMPUTABLE EXPRESSIONS.*
RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-008.* 1980.
014516 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-182-80.*1980.
014517 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS: A BIBLIOGRAPHY.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-184-80.* 1980.
014518 RIDDLE, W.E.* SOFTWARE DEVELOPMENT ENVIRONMENTS: PRESENT AND FUTURE.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-170-80.* 1980.
014519 RIDDLE, W.E.* SOFTWARE DEVELOPMENT TOOLS: A BIBLIOGRAPHY.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-183-80.*1980.
014520 RUSCHITZKA, M.* POLICY FUNCTION SCHEDULING.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-091.*1980.
014521 SCHMIDT, C.F.* PLAN RECOGNITION AND REVISION: UNDERSTANDING THE OBSERVED
ACTIONS OF ANOTHER ACTOR.* RUTGERS U.
COMP.SCI.RES.LAB.*CBM-TR-115.*1980.
014522 SCHMIDT, C.F.*THE ROLE OF OBJECT KNOWLEDGE IN HUMAN PLANNING.* RUTGERS U.
COMP.SCI.DEPT.*CBM-TM-087.*1980.
014523 SCHNABEL, R.B.*DETERMINING FEASIBILITY OF A SET OF NONLINEAR INEQUALITY
CONSTRAINTS.* COLORADO U. COMP.SCI.DEPT.*CU-CS-172-80.*1980.
014524 SMITH, L.D.*THE ELEMENTARY STRUCTURAL DESCRIPTION LANGUAGE.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-53-80.*1980.
* 014525 SMITH, L.D.* SIM, A GATE LEVEL SIMULATOR (USER'S MANUAL).* EDINBURGH U.
COMP.SCI.DEPT.*CSR-60-80.*1980.
014526 SNIR, M.* COMPARISONS BETWEEN LINEAR FUNCTIONS CAN HELP.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-66-80.*1980.
014527 SNIR, M.*ON THE COMPLEXITY OF SIMPLIFYING QUADRATIC FORMS.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-67-80.*1980.
014528 SRIDHARAN, N.S.*REPRESENTATIONAL FACILITIES OF AIMDS: A SAMPLING.*
RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-086.*1980.
014529 SRIDHARAN, N.S. SCHMIDT, C.F. GOODSON, J.L.*THE ROLE OF WORLD KNOWLEDGE
IN PLANNING.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-109.*1980.
014530 SRINIVASAN, C.V.* KNOWLEDGE BASED LEARNING, AN EXAMPLE.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-090.*1980.
014531 SRINIVASAN, C.V.* KNOWLEDGE BASED LEARNING SYSTEMS. PART 1: A PROPOSAL
FOR RESEARCH, BY CHITOOR V. SRINIVASAN AND DAVID M. SANDFORD. PART II:
AN INTRODUCTION TO THE META-THEORY, BY CHITOOR V. SRINIVASAN; PART III:
LOGICAL FOUNDATION, BY CHITOOR V. SRINIVASAN.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-089.*1980.
014532 SYMM, G.T.*THE ROBIN PROBLEM FOR LAPLACE'S EQUATION.* U.K. NATIONAL
PHYSICAL LAB. NUM.ANAL. & COMP.SCI.DIV.*DNACS 32/80.*1980.
014533 SZOLOVITS, P. MARTIN, W.A.* BRAND X MANUAL.* M.I.T. LAB. FOR
COMP.SCI.*TM-186.*1980.
* 014534 TRAUB, J.F. BIRNBAUM, J.S. HARTMANIS, J. REDDY, D.R. TAYLOR, R.W.
VYSSOTSKY, V.A.*QUO VADIMUS: COMPUTER SCIENCE IN A DECADE. PANEL
ORGANIZER AND MODERATOR: J.F. TRAUB; PANELISTS: J.S. BIRNBAUM, J.
HARTMANIS, D.R. REDDY, R.W. TAYLOR, V.A. VYSSOTSKY.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-127.*1980.
014535 VALIANT, L.G.* REDUCIBILITY BY ALGEBRAIC PROJECTIONS.* EDINBURGH U.
COMP.SCI.DEPT.*CSR-64-80.*1980.
* 014536 VALIANT, L.G.* UNIVERSALITY CONSIDERATIONS IN VLSI CIRCUITS.* EDINBURGH
U. COMP.SCI.DEPT.*CSR-54-80.*1980.
014537 YASUHARA, A. HAWRUSIK, F. VENKATARAMAN, K.N.* COMPUTABILITY ON BINARY
TREES - AN EXTENDED ABSTRACT.* RUTGERS U.
COMP.SCI.RES.LAB.*CTA-TR-002.*1980.
014538 YASUHARA, A.* COMPUTABILITY ON TERM ALGEBRAS. PART II - MULTISUCCESSOR:
THE REPRESENTABILITY OF COMPUTABILITY ON STRINGS.* RUTGERS U.
COMP.SCI.RES.LAB.*CTA-TR-001.*1980.
VOL. 3, NO. 6 06/01/81
014956 ABBOTT, V. BLACK, J.B.*THE REPRESENTATION OF SCRIPTS IN MEMORY.* YALE U.
COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 005.*1980.
014957 ABELSON, R.P.*DIFFERENCES BETWEEN BELIEF AND KNOWLEDGE SYSTEMS.* YALE U.
COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 001.*1980.
014958 ABELSON, R.P.*IN DEFENSE OF COMMON SENSE REPRESENTATIONS OF KNOWLEDGE.*
YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 006.*1980.
014959 ABELSON, R.P.*THE PSYCHOLOGICAL STATUS OF THE SCRIPT CONCEPT.* YALE U.
COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 002.*1980.
014960 ALELIUNAS, R. ROSENBERG, A.L.*ON EMBEDDING RECTANGULAR GRIDS IN SQUARE
GRIDS.* IBM WATSON RES. CENTER.*RC 8404.* 1980.
014961 BARNES, E.R. HOFFMAN, A.J.*ON BOUNDS FOR EIGENVALUES OF REAL SYMMETRIC
MATRICES.* IBM WATSON RES. CENTER.*RC 8441.*1980.
* 014962 BARSTOW, D.R.*THE ROLES OF KNOWLEDGE AND DEDUCTION IN ALGORITHM
CREATION.* YALE U. COMP.SCI.DEPT.*RES.RPT. 178.* 1980.
* 014963 BARZILAI, Z. SAVIR, J. MARKOWSKY, G. SMITH, M.G.*THE WEIGHTED SYNDROME
SUMS APPROACH TO VLSI TESTING.* IBM WATSON RES. CENTER.*RC 8475.*1980.
014964 BELADY, L.A.* MODIFIABILITY OF LARGE SOFTWARE SYSTEMS.* IBM WATSON RES.
CENTER.*RC 8525.*1980.
014965 BHAT, K.V.S.*A GRAPH THEORETIC APPROACH TO SWITCHING FUNCTION
MINIMIZATION.* IOWA U. COMP.SCI.DEPT.*TECH.RPT. 81-02.*1981.
014966 BLACK, J.B. BERN, H.* CAUSAL COHERENCE AND MEMORY FOR EVENTS IN
NARRATIVES.* YALE U. COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 003.*1980.
014967 BLACK, J.B.*THE EFFECTS OF READING PURPOSE ON MEMORY FOR TEXT.* YALE U.
COGNITIVE SCIENCE PROGRAM.*TECH.RPT. 007.* 1980.
014968 BLACK, J.B.* PSYCHOLINGUISTIC PROCESSES IN WRITING.* YALE U. COGNITIVE
SCIENCE PROGRAM.*TECH.RPT. 004.*1980.
014969 BONGIOVANNI, G. TANG, D.T. WONG, C.K.*A GENERAL MULTIBEAM SWITCHING
ALGORITHM.* IBM WATSON RES. CENTER.*RC 8541.* 1980.
014970 BRINCH HANSEN, P.*THE PROGRAMMING LANGUAGE EDISON.* SOUTHERN CAL U.
COMP.SCI.DEPT.*1980.
014971 BRUIJN, H.G. DE*A SURVEY OF THE PROJECT AUTOMATH.* NO ISSUING AGENCY
INDICATED (AUTHOR'S ADDRESS: DEPARTMENT OF MATHEMATICS/EINDHOVEN
UNIVERSITY OF TECHNOLOGY/P.O. BOX 513/5600MB EINDHOVEN/THE
NETHERLANDS).*N.D.
014972 BURKS, A.W.*THE ENIAC: FIRST GENERAL-PURPOSE ELECTRONIC COMPUTER.*
MICHIGAN U. LOGIC OF COMPUTERS GROUP.* TECH.RPT. 236.*1981.
014973 CHAITIN, G.J. AUSLANDER, M.A. CHANDRA, A.K. COCKE, J. HOPKINS, M.E.
MARKSTEIN, P.W.* REGISTER ALLOCATION VIA COLORING.* IBM WATSON RES.
CENTER.*RC 8395.*1980.
014974 CHANDRA, A.K. HAREL, D.*STRUCTURE AND COMPLEXITY OF RELATIONAL QUERIES.*
IBM WATSON RES. CENTER.*RC 8418.* 1980.
014975 CHATELIN, F. MIRANKER, W.L.* ACCELERATION BY AGGREGATION OF SUCCESSIVE
APPROXIMATION METHODS.* IBM WATSON RES. CENTER.*RC 8508.*1980.
014976 CHAZELLE, B.M.* COMPUTATIONAL GEOMETRY AND CONVEXITY. CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-150, PH.D. THESIS. CHAZELLE, B.M.*1980.
014977 CIEPIELEWSKI, A. JUNGEFELDT, T. LINNELL, J.*CONNECTING A MINICOMPUTER TO
AN X.25 NETWORK - A CASE STUDY.* ROYAL INST. OF TECH., STOCKHOLM.
TELECOMM. & COMP. SYSTEMS DEPT.*TRITA-CS-8101.*1981.
014978 COLBOURN, C.J.*THE CONSTRUCTION OF DISJOINT CYCLIC STEINER TRIPLE SYSTEMS
(TWO PAPERS): DISJOINT CYCLIC STEINER TRIPLE SYSTEMS.* SASKATCHEWAN U.
COMPUTATIONAL SCI.DEPT.* RPT. 81-04.*1981.
014979 COLLIER, W.W.*PRINCIPLES OF ARCHITECTURE FOR SYSTEMS OF PARALLEL
PROCESSES.* IBM. POUGHKEEPSIE LAB.*TR 00.3100.* 1981.
014980 DAHLQUIST, G.G. LINIGER, W. NEVANLINNA, O.* STABILITY OF TWO-STEP METHODS
FOR VARIABLE INTEGRATION STEPS.* IBM WATSON RES. CENTER.*RC 8494.*1980.
014981 DAHMEN, W.* APPROXIMATION BY LINEAR COMBINATIONS OF MULTIVARIATE B
SPLINES.* IBM WATSON RES. CENTER.*RC 8405.* 1980.
014982 DAHMEN, W. MICCHELLI, C.A.*ON LIMITS OF MULTIVARIATE B SPLINES.* IBM
WATSON RES. CENTER.*RC 8495.*1980.
014983 DANTZIG, G.B.*EXPECTED NUMBER OF STEPS OF THE SIMPLEX METHOD FOR A LINEAR
PROGRAM WITH A CONVEXITY CONSTRAINT.* ST. U. O.R. DEPT. SYSTEMS
OPTIMIZATION LAB.*SOL 80-03R.* 1980, REVISED.
014984 DAVENPORT, J.H. JENKS, R.D.* MODLISP.* IBM WATSON RES. CENTER.*RC
8537.*1980.
014985 DE JONG, S.P. BYRD, R.J.*INTELLIGENT FORMS CREATION IN THE SYSTEM FOR
BUSINESS AUTOMATION ( SBA).* IBM WATSON RES. CENTER.*RC 8529.*1980.
024846 DOLEV, D.*THE BYZANTINE GENERALS STRIKE AGAIN.* ST. U.
COMP.SCI.DEPT.*T.R.-C.S. 846.*1981.
014986 DUERINCKX, A.J.* MATCHED GAUSSIAN APODIZATION OF PULSED ACOUSTIC PHASED
ARRAYS.* IBM WATSON RES. CENTER.*RC 8463.*1980.
014987 DYER, M.G. LEHNERT, W.G.* MEMORY ORGANIZATION AND SEARCH PROCESSES FOR
NARRATIVES.* YALE U. COMP.SCI.DEPT.* RES.RPT. 175.*1980.
014988 ENOMOTO, H.*A GENERALIZATION OF ORE'S CONDITION FOR A GRAPH TO BE
HAMILTON CONNECTED.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-07.*1980.
014989 ENOMOTO, H.*LONG PATHS AND LARGE CYCLES IN FINITE GRAPHS.* TOKYO U.
INFO.SCI.DEPT.*TECH.RPT. 80-15.*1980.
014990 ENOMOTO, H. USAMI, Y.*MINIMUM NUMBER OF EDGES IN PATH CONNECTED GRAPHS.
I.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-02.*1980.
014991 FARIS, S.M.* JOSEPHSON LSI CIRCUITS.* IBM WATSON RES. CENTER.*RC
8467.*1980.
014992 FORD, R.F.*DESIGN OF ABSTRACT DATA STRUCTURES TO FACILITATE STORAGE
STRUCTURE SELECTION.* IOWA U. COMP.SCI.DEPT.* TECH.RPT. 81-01, PH.D.
THESIS. FORD, R.F. (UNIVERSITY OF PITTSBURGH).*1981.
014993 FORTUNE, S. LEIVANT, D. O'DONNELL, M.*THE EXPRESSIVENESS OF SIMPLE AND
SECOND ORDER TYPE STRUCTURES.* IBM WATSON RES. CENTER.*RC 8542.*1980.
014994 GOLDSTEIN, B.C.* AMBLE: A MULTI-PROGRAMMING LANGUAGE EXTENSION.* IBM
WATSON RES. CENTER.*RC 8417.*1980.
014995 GOODMAN, J.R. SEQUIN, C.H.* HYPERTREE, A MULTIPROCESSOR INTERCONNECTION
TOPOLOGY.* WISCONSIN U. COMP.SCI.DEPT.* TECH.RPT. 427.*1981.
014996 GOTO, E.*INTEGRATION OF MULTIVARIATE RATIONALS IN POLYHEDRA BY NUMERICAL
ANALYTIC CONTINUATION.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-17.*1980.
014997 GOULD, J.D.* COMPOSING LETTERS WITH COMPUTER-BASED TEXT EDITORS.* IBM
WATSON RES. CENTER.*RC 8446.*1980.
014998 GROBMAN, W.D.*STATUS OF X-RAY LITHOGRAPHY.* IBM WATSON RES. CENTER.*RC
8480.*1980.
014999 GUZMAN, M.E.*A QUEUEING MODEL FOR BUFFER ANALYSIS OF AUTOMATIC REPEAT
REQUEST CONCENTRATORS.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. &
COMP. SYSTEMS DEPT.* TRITA-CS-8101.*1980.
015000 HANSSON, A. HARIDI, S. TAERNLUND, S.-A.*A PROGRAMMING LANGUAGE BASED ON A
NATURAL DEDUCTION SYSTEM.* ROYAL INST. OF TECH., STOCKHOLM. TELECOMM. &
COMP. SYSTEMS DEPT.*TRITA-CS-8005.*1980.
015001 HARADA, M. KUNII, T.L. KITAGAWA, H. KAIHARA, S. OHBO, N.*A GRAPHICAL
DESIGN SPECIFICATION LANGUAGE FOR A HOSPITAL ADMINISTRATION SYSTEM
GDSL/HA - WITH THE APPLICATION TO DESIGN CONSISTENCY VERIFICATION.*
TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-04.*1980.
015002 HARBISON, S.P.*A COMPUTER ARCHITECTURE FOR THE DYNAMIC OPTIMIZATION OF
HIGH-LEVEL LANGUAGE PROGRAMS.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-143, PH.D. THESIS. HARBISON, S.P.*1980.
015003 HIKITA, T. KAWAI, S.*PARALLEL SIEVE METHODS FOR GENERATING PRIME
NUMBERS.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-06.* 1980.
015004 HIRAGA, Y. ONO, Y. YAMADA, H.*AN ANALYSIS OF THE STANDARD ENGLISH
KEYBOARD.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-11.*1980.
015005 HIRAGA, Y. ONO, Y. YAMADA, H.*AN ASSIGNMENT OF KEY-CODES FOR A JAPANESE
CHARACTER KEYBOARD.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-12.*1980.
015006 HONG, J.-W. ROSENBERG, A.L.*GRAPHS THAT ARE SIMILAR TO BINARY TREES.* IBM
WATSON RES. CENTER.*RC 8402.*1980.
015007 HU, J.K.-C.* LOGIC DESIGN METHODS FOR IRREDUNDANT MOS NETWORKS.* ILLINOIS
U. COMP.SCI.DEPT.*UIUCDCS-R-80-1053, PH.D. THESIS. HU, J.K.-C.*1980.
015008 INGEMARSSON, I.* KNAPSACKS WHICH ARE NOT PARTLY SOLVABLE AFTER
MULTIPLICATION MODULO Q.* IBM WATSON RES. CENTER.* RC 8515.*1980.
015009 INTERNATIONAL CONFERENCE ON RESEARCH AND TRENDS IN DOCUMENT PREPARATION
SYSTEMS, LAUSANNE, SWITZERLAND, 1981.* ABSTRACTS OF THE PRESENTED
PAPERS: INTERNATIONAL CONFERENCE..., FEBRUARY 27-28, 1981. J.D. NICOUD,
PROGRAM CHAIRMAN. ORGANIZED BY THE SWISS INSTITUTES OF TECHNOLOGY
(LAUSANNE & ZURICH).
015010 JAFFE, J.M. MOSS, F.H.*A RESPONSIVE DISTRIBUTED ROUTING ALGORITHM FOR
COMPUTER NETWORKS.* IBM WATSON RES. CENTER.*RC 8479.*1980.
015011 JEGADO, M.* RECOVERABILITY ASPECTS OF A DISTRIBUTED FILE SYSTEM.*
NEWCASTLE UPON TYNE U. COMPUTING LAB.*NO. 160.* 1981.
015012 JIMENEZ, A. RUDD, D.F. MEYER, R.R.*A STUDY OF THE DEVELOPMENT OF A
MEXICAN PETROCHEMICAL INDUSTRY USING MIXED INTEGER PROGRAMMING.*
WISCONSIN U. COMP.SCI.DEPT.* TECH.RPT. 420.*1981.
015013 JINN-KE, J. YAMADA, H.*A CODING SYSTEM OF CHINESE CHARACTERS FOR TOUCH
TYPING (A SUMMARY VERSION).* TOKYO U. INFO.SCI.DEPT.*TECH.RPT.
80-14.*1980.
015014 JINN-KE, J. YAMADA, H.*A CODING SYSTEM OF CHINESE CHARACTERS FOR TOUCH
TYPING.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-09.*1980.
015015 JOHNSON, E.L. PADBERG, M.W.*A NOTE ON THE KNAPSACK PROBLEM WITH SPECIAL
ORDERED SETS.* IBM WATSON RES. CENTER.*RC 8396.*1980.
015016 JOHNSON, O. RAMANATHAN, J.*RECENT DIRECTIONS IN CONCURRENT PROGRAMMING
LANGUAGES.* IBM WATSON RES. CENTER.*RC 8378.*1980.
015017 JOHNSON, R. SHORE, J.* MINIMUM CROSS ENTROPY SPECTRAL ANALYSIS OF
MULTIPLE SIGNALS.* U.S. NAVAL RES.LAB.*NRL MEMO.RPT. 4492.*1981.
015018 KAMEL, M.S.*IMPROVING THE EFFICIENCY OF STIFF ODE SOLVERS BY
PARTITIONING.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT. 149, PH.D. THESIS.
KAMEL, M.S.*1981.
015019 KEAST, P. FAIRWEATHER, G. DIAZ, J.C.*A COMPARATIVE STUDY OF FINITE
ELEMENT METHODS FOR THE SOLUTION OF SECOND ORDER LINEAR TWO POINT
BOUNDARY VALUE PROBLEMS.* TORONTO U. COMP.SCI.DEPT.*TECH.RPT.
150.*1981.
020255 KENT, S.T.* PROTECTING EXTERNALLY SUPPLIED SOFTWARE IN SMALL COMPUTERS.*
M.I.T. LAB. FOR COMP.SCI.*TR-255, PH.D. THESIS. KENT, S.T.*1980.
015020 KERMANI, P.*A CONGESTION CONTROL SCHEME FOR WINDOW FLOW CONTROLLED
COMPUTER NETWORKS.* IBM WATSON RES. CENTER.* RC 8401.*1980.
015021 KITAGAWA, H. KUNII, T.L. HARADA, M. KAIHARA, S. OHBO, N.*A LANGUAGE FOR
OFFICE FORM PROCESSING ( OFP) - WITH APPLICATION TO MEDICAL FORMS.*
TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-03.*1980.
015022 KITAGAWA, H. KUNII, T.L. AZUMA, M. MIZUNO, Y.*USER- AND ADMINISTRATOR-
FRIENDLY ARCHITECTURE FOR INTERACTIVE SOFTWARE DEVELOPMENT.* TOKYO U.
INFO.SCI.DEPT.*TECH.RPT. 80-25.*1980.
024841 KNUTH, D.E.* HUFFMAN'S ALGORITHM VIA ALGEBRA.* ST. U.
COMP.SCI.DEPT.*T.R.-C.S. 841.*1981.
015023 KOLODNER, J.L.*RETRIEVAL AND ORGANIZATIONAL STRATEGIES IN CONCEPTUAL
MEMORY: A COMPUTER MODEL.* YALE U. COMP.SCI.DEPT.*RES.RPT. 187, PH.D.
THESIS. KOLODNER, J.L.* 1980.
015024 KONHEIM, A.G. MEILIJSON, I.* GREED IS GOOD.* IBM WATSON RES. CENTER.*RC
8505.*1980.
015025 KONHEIM, A.G. MEILIJSON, I. MELKMAN, A.*PROCESSOR-SHARING OF TWO PARALLEL
LINES.* IBM WATSON RES. CENTER.*RC 8452.* 1980.
024847 KORTH, H.F.*THE OPTIMAL LOCKING PROBLEM IN A DIRECTED ACYCLIC GRAPH.* ST.
U. COMP.SCI.DEPT.*T.R.-C.S. 847.* 1981.
015026 KOZEN, D.*ON INDUCTION VS. *-CONTINUITY.* IBM WATSON RES. CENTER.*RC
8468.*1980.
015027 KUNG, H.T. PAPADIMITRIOU, C.H.*AN OPTIMALITY THEORY OF CONCURRENCY
CONTROL FOR DATABASES.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-147.*1979.
015028 LAVENBERG, S.S.* CLOSED MULTICHAIN PRODUCT FORM QUEUEING NETWORKS WITH
LARGE POPULATION SIZES.* IBM WATSON RES. CENTER.*RC 8496.*1980.
015029 LEAVENWORTH, B.*AN INTEGRATED DATABASE PROGRAMMING LANGUAGE.* IBM WATSON
RES. CENTER.*RC 8462.*1980.
015030 LEBOWITZ, M.* GENERALIZATION AND MEMORY OF AN INTEGRATED UNDERSTANDING
SYSTEM.* YALE U. COMP.SCI.DEPT.*RES.RPT. 186, PH.D. THESIS. LEBOWITZ,
M.*1980.
015031 LEE, D.T. CHANG, H. WONG, C.K.*AN ON-CHIP COMPARE/STEER BUBBLE SORTER.*
IBM WATSON RES. CENTER.*RC 8414.*1980.
015032 LEHNERT, W.G. BAIN, W.M.* VEGE: VARIABLE PROCESSING IN A NATURAL LANGUAGE
QUERY SYSTEM.* YALE U. COMP.SCI.DEPT.* RES.RPT. 183.*1980.
015033 MCDERMOTT, D.*NON-MONOTONIC LOGIC II: NON-MONOTONIC MODAL THEORIES.* YALE
U. COMP.SCI.DEPT.*RES.RPT. 174.*1980.
015034 MCDERMOTT, D.* SPATIAL INFERENCES WITH GROUND, METRIC FORMULAS ON SIMPLE
OBJECTS.* YALE U. COMP.SCI.DEPT.* RES.RPT. 173.*1980.
015035 MAEKAWA, M.*EVALUATION AND COMPARISON OF PROCESS COORDINATION
MECHANISMS.* TOKYO U. INFO.SCI.DEPT.* TECH.RPT. 80-23.*1980.
015036 MALHOTRA, A. MARKOWITZ, H.M. PAZEL, D.P.* EAS-E: AN INTEGRATED APPROACH
TO APPLICATION DEVELOPMENT.* IBM WATSON RES. CENTER.*RC 8457.*1980.
015037 MARKOWSKY, G.*BEST HUFFMAN TREES.* IBM WATSON RES. CENTER.* RC
8526.*1980.
015038 MARKSTEIN, V. COCKE, J. MARKSTEIN, P.*OPTIMIZATION OF RANGE CHECKING.*
IBM WATSON RES. CENTER.*RC 8456.*1980.
015039 MARUYAMA, K. TANG, D.T.*ON THE SELECTION OF OPTIMAL PATHS WHICH SATISFY
ADDITIONAL CONSTRAINTS.* IBM WATSON RES. CENTER.*RC 8458.*1980.
015040 MEKETON, M.S. HEIDELBERGER, P.* BIAS REDUCTION IN REGENERATIVE
SIMULATIONS.* IBM WATSON RES. CENTER.*RC 8397.*1980.
015041 MIKELSONS, M. WEGMAN, M.N.* PDE1L: THE PL1L PROGRAM DEVELOPMENT
ENVIRONMENT. PRINCIPLES OF OPERATION.* IBM WATSON RES. CENTER.*RC
8513.*1980.
015042 NELSON, T.H.* LITERACY MACHINES: THE REPORT ON, AND OF, PROJECT XANADU
CONCERNING WORD PROCESSING, ELECTRONIC PUBLISHING, HYPERTEXT,
THINKERTOYS, TOMORROW'S INTELLECTUAL REVOLUTION, AND CERTAIN OTHER
TOPICS INCLUDING KNOWLEDGE, EDUCATION AND FREEDOM.*TED NELSON, PUBLISHER
(P.O. BOX 128/SWARTHMORE, PA. 19081).*1981.
015043 NEWELL, A.* DUNCKER ON THINKING: AN INQUIRY INTO PROGRESS IN COGNITION.*
CARNEGIE MELLON U. COMP.SCI.DEPT.* CMU-CS-80-151.*1981.
015044 NEWELL, A. ROSENBLOOM, P.S.*MECHANISMS OF SKILL ACQUISITION AND THE LAW
OF PRACTICE.* CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-80-145.*1980.
015045 NEWMAN, D.J. RIVLIN, T.J.*OPTIMAL RECOVERY AMONG THE POLYNOMIALS.* IBM
WATSON RES. CENTER.*RC 8433.*1980.
024849 NISHIGAKI, T.*EXPERIMENTS ON THE KNEE CRITERION IN A MULTIPROGRAMMED
COMPUTER SYSTEM.* ST. U. COMP.SCI.DEPT.* T.R.-C.S. 849.*1981.
015046 ONO, K. SUZUKI, M. GOTO, E.*COMPILE TIME IMPROVEMENT OF GARBAGE
COLLECTION.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-08.*1980.
015047 PAN, V.Y.*APPROXIMATION TO THE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS
VIA APPROXIMATION TO A BISECTOR.* IBM WATSON RES. CENTER.*RC 8492.*1980.
015048 PAN, V.Y.* PROJECTIONS O APPROXIMATIONS IN LINEAR ALGEBRA (IN
DETERMINISTIC AND PROBABILISTIC APPROACHES).* IBM WATSON RES. CENTER.*RC
8491.*1980.
015049 PENEDO, M.H.*THE USE OF A MODULE INTERFACE DESCRIPTION IN THE SYNTHESIS
OF RELIABLE SOFTWARE SYSTEMS.* CAL U., L.A. ENG. & APPL.SCI.SCH.
COMP.SCI.DEPT.*UCLA-ENG-8091; CSD-810115, PH.D. THESIS. PENEDO,
M.H.*1981.
015050 REID, L.G.* CONTROL AND COMMUNICATION IN PROGRAMMED SYSTEMS.* CARNEGIE
MELLON U. COMP.SCI.DEPT.* CMU-CS-80-142, PH.D. THESIS. REID, L.G.*1980.
015051 ROHLF, F.J. SOKAL, R.R.*COMPARING NUMERICAL TAXONOMIC STUDIES.* IBM
WATSON RES. CENTER.*RC 8535.*1980.
015052 ROSEN, B.K.*A LUBRICANT FOR DATA FLOW ANALYSIS.* IBM WATSON RES.
CENTER.*RC 8481.*1980.
015053 ROSENBERG, A.L.* BANDWIDTH AND PEBBLING.* IBM WATSON RES. CENTER.*RC
8477.*1980.
015054 ROSENBERG, A.L.*ISSUES IN THE STUDY OF GRAPH EMBEDDINGS.* IBM WATSON RES.
CENTER.*RC 8403.*1980.
015055 ROSENBERG, A.L. SNYDER, L.*PERFECT STORAGE REPRESENTATIONS FOR FAMILIES
OF DATA STRUCTURES.* IBM WATSON RES. CENTER.*RC 8518.*1980.
* 015056 ROTH, J.P.* RELIABLE VLSI SYSTEMS: DESIGN AND VALIDATION.* IBM WATSON
RES. CENTER.*RC 8524.*1980.
015057 ROTH, M.G.* DIFFERENCE METHODS FOR STIFF DELAY DIFFERENTIAL EQUATIONS.*
ILLINOIS U. COMP.SCI.DEPT.* UIUCDCS-R-80-1012, PH.D. THESIS. ROTH,
M.G.*1980.
015058 RUBINSTEIN, R.*GENERATING RANDOM VECTORS UNIFORMLY DISTRIBUTED INSIDE AND
ON THE SURFACE OF DIFFERENT REGIONS.* IBM WATSON RES. CENTER.*RC
8409.*1980.
024839 SAMUEL, A.L.* SHORT WAITS.* ST. U. COMP.SCI.DEPT.*T.R.-C.S. 839.*1981.
015059 SATO, M.*THEORY OF SYMBOLIC EXPRESSIONS.* TOKYO U.
INFO.SCI.DEPT.*TECH.RPT. 80-16.*1980.
015060 SCHANK, R.C.*LEBOWITZ, M.*DOES A HIPPIE OWN A HAIRDRIER?* YALE U.
COMP.SCI.DEPT.*RES.RPT. 144.*1979.
015061 SCHANK, R.C. BIRNBAUM, L.*MEMORY, MEANING, AND SYNTAX.* YALE U.
COMP.SCI.DEPT.*RES.RPT. 189.*1980.
015062 SCHANK, R.C.* REMINDING AND MEMORY ORGANIZATION: AN INTRODUCTION TO
MOPS.* YALE U. COMP.SCI.DEPT.*RES.RPT. 170.*1979.
015063 SCHILD, W. POWER, L.R. KARNAUGH, M.* PICTUREWORLD: A CONCEPT FOR FUTURE
OFFICE SYSTEMS.* IBM WATSON RES. CENTER.*RC 8384.*1980.
015064 SCHWARTZ, M.* PERFORMANCE ANALYSIS OF THE SNA VIRTUAL ROUTE PACING
CONTROL.* IBM WATSON RES. CENTER.*RC 8490.*1980.
015065 SELFRIDGE, M.G.R.*A PROCESS MODEL OF LANGUAGE ACQUISITION.* YALE U.
COMP.SCI.DEPT.*RES.RPT. 172, PH.D. THESIS. SELFRIDGE, M.G.R.*1980.
015066 SNODGRASS, R.*AN OBJECT ORIENTED COMMAND LANGUAGE.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-80-146.*1980.
015067 SUNSHINE, C.A.*FORMAL MODELING OF COMMUNICATION PROTOCOLS.* SOUTHERN CAL
U. INFO.SCI.INST.*ISI/RR-81-89.*1981.
015068 SUZUKI, M. ONO, K. GOTO, E.*A PRIMITIVE FOR NON-RECURSIVE LIST
PROCESSING.* TOKYO U. INFO.SCI.DEPT.*TECH.RPT. 80-26.*1980.
024848 TANG, C.-S.*ON THE PROBLEM OF INPUTTING CHINESE CHARACTERS.* ST. U.
COMP.SCI.DEPT.*T.R.-C.S. 848.*1981.
015069 TANG, D.T. MARUYAMA, K.*ON CRITERIA AND GENERATION OF OPTIMAL PATHS.* IBM
WATSON RES. CENTER.*RC 8411.*1980.
015070 THORELLI, L.-E. CIEPIELEWSKI, A.*A COURSE IN SYSTEMS PROGRAMMING.* ROYAL
INST. OF TECH., STOCKHOLM. TELECOMM. & COMP. SYSTEMS
DEPT.*TRITA-CS-80058.*1980.
015071 TOUEG, S.*A MINIMUM HOP PATH FAILSAFE AND LOOP-FREE DISTRIBUTED
ALGORITHM.* IBM WATSON RES. CENTER.*RC 8530.* 1980.
015072 TREDENNICK, N.*HOW TO DO FLOWCHARTS FOR A CONTROLLER.* IBM WATSON RES.
CENTER.*RC 8426.*1980.
015073 UHR, L.* NETWORK AND ARRAY ARCHITECTURES FOR REAL-TIME PERCEPTION.*
WISCONSIN U. COMP.SCI.DEPT.*TECH.RPT. 424.* 1981.
015074 WHITEBREAD, K.*THE RELATION BETWEEN CONVENTIONAL INFERENCE AND SOME
APPROACHES TO DEFAULT REASONING.* WISCONSIN U. COMP.SCI.DEPT.*TECH.RPT.
422.*1981.
015075 WHITFIELD, H.*THE CHALLENGE OF THE CHIP.* NEWCASTLE UPON TYNE U.
COMPUTING LAB.*NO. 159.*1981.
015076 WULF, W.A.* PQCC: A MACHINE RELATIVE COMPILER TECHNOLOGY.* CARNEGIE
MELLON U. COMP.SCI.DEPT.*CMU-CS-80-144.*1980.
015077 YAMAGUCHI, K. OHBO, N. KUNII, T.L. KITAGAWA, H.*HARADA, M.* ELF: EXTENDED
RELATIONAL MODEL FOR LARGE, FLEXIBLE PICTURE DATABASES.* TOKYO U.
INFO.SCI.DEPT.*TECH.RPT. 80-10.*1980.
015078 YEMINI, S.*THE REPLACEMENT MODEL FOR MODULAR, VERIFIABLE EXCEPTION
HANDLING.* CAL U., L.A. ENG. & APPL.SCI.SCH.
COMP.SCI.DEPT.*UCLA-ENG-8200; CSD-810204, PH.D. THESIS. YEMINI,
S.*1981.
015079 YU, P.S. LIN, S.*AN EFFICIENT SELECTIVE-REPEAT ARQ SCHEME FOR SATELLITE
CHANNELS AND ITS THROUGHPUT ANALYSIS.* IBM WATSON RES. CENTER.*RC
8399.*1980.
015871 HOFRI, M.*ON THE NUMBER OF BINS REQUIRED TO PACK N PIECES USING THE
NEXT-FIT ALGORITHM.* TECHNION - ISRAEL INST. OF TECH.
COMP.SCI.DEPT.*TECH.RPT. 203.*1981, REVISED.
015881 MACEWEN, G.H.*THE DESIGN FOR A SECURE SYSTEM BASED ON PROGRAM ANALYSIS.*
QUEEN'S U. COMPUTING & INFO.SCI.DEPT.* TECH.RPT. 81-118.*1981.
015883 MARINOV, V.* RESOLUTION THEOREM PROVER IN A PROGRAM VERIFICATION
ENVIRONMENT.* OSLO U. INFORMATICS INST.* RES.RPT. 055.*1981.
041603 MINSKY, M.* JOKES AND THE LOGIC OF THE COGNITIVE UNCONSCIOUS.* M.I.T.
A.I. LAB.*MEMO 603.*1980.
015888 OVERMAN, W.T.* VERIFICATION OF CONCURRENT SYSTEMS: FUNCTION AND TIMING.*
CAL U., L.A. ENG. & APPL.SCI.SCH.* UCLA-ENG-8120; CAL U., L.A.
COMP.SCI.DEPT.*CSD-810814, PH.D. THESIS. OVERMAN, W.T.*1981.
015889 RISHE, N.*ON FORMAL SEMANTICS OF DATA BASES.* TECHNION - ISRAEL INST. OF
TECH. COMP.SCI.DEPT.*TECH.RPT. 198.*1981.
015895 SEROUSSI, G. LEMPEL, A.*ON SYMMETRIC REPRESENTATIONS OF FINITE FIELDS.*
TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT 206.*1981.
015896 SHILOACH, Y. VISHKIN, U.*AN EFFICIENT PARALLEL MAX FLOW ALGORITHM.*
TECHNION - ISRAEL INST. OF TECH. COMP.SCI.DEPT.*TECH.RPT. 196.*1981.
015898 SOUNDARARAJAN, N.* AXIOMATIC SEMANTICS OF COMMUNICATING SEQUENTIAL
PROCESSES.* OSLO U. INFORMATICS INST.*RES.RPT. 056.*1981.
015899 SOUNDARARAJAN, N.* CONSISTENCY AND COMPLETENESS OF A PROOF SYSTEM FOR
CSP.* OSLO U. INFORMATICS INST.*RES.RPT. 058.* 1981.
015901 SOUNDARARAJAN, N.* PROOFS OF CORRECTNESS OF CSP PROGRAMS.* OSLO U.
INFORMATICS INST.*RES.RPT. 059.*1981.
015908 WINKOWSKI, J.*TOWARDS AN ALGEBRAIC DESCRIPTION OF DISCRETE PROCESSES AND
SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT.
NO. 408.*1980.
015912 ARVIND. THOMAS, R.E.* I-STRUCTURES: AN EFFICIENT DATA TYPE FOR FUNCTIONAL
LANGUAGES.* M.I.T. LAB. FOR COMP.SCI.* TM-210.*1981, REVISED.
015915 BAWDEN, A. BURKE, G.S. HOFFMAN, C.W.* MACLISP EXTENSIONS.* M.I.T. LAB.
FOR COMP.SCI.*TM-203.*1981.
015925 COSMADAKIS, S.S. PAPADIMITRIOU, C.H.*THE TRAVELING SALESMAN PROBLEM WITH
MANY VISITS TO FEW CITIES.* M.I.T. LAB. FOR COMP.SCI.*TM-208.*1981.
015930 FREDKIN, E. TOFFOLI, T.* CONSERVATIVE LOGIC.* M.I.T. LAB. FOR
COMP.SCI.*TM-197.*1981.
015938 HALPERN, J.Y.*ON THE EXPRESSIVE POWER OF DYNAMIC LOGIC, II.* M.I.T. LAB.
FOR COMP.SCI.*TM-204.*1981.
015939 HALPERN, J.Y. REIF, J.H.*THE PROPOSITIONAL DYNAMIC LOGIC OF
DETERMINISTIC, WELL-STRUCTURED PROGRAMS.* M.I.T. LAB. FOR
COMP.SCI.*TM-198.*1981.
015943 JOHNSON, D. PAPADIMITRIOU, C.*COMPUTATIONAL COMPLEXITY AND THE TRAVELING
SALESMAN PROBLEM.* M.I.T. LAB. FOR COMP.SCI.*TM-209.*1981.
015964 MINTZER, F. DAVIES, K. PELED, A. RIS, F.*THE REAL TIME SIGNAL PROCESSOR.*
IBM WATSON RES. CENTER.*RC 9081.*1981.
015969 OPPEN, D.C. DALAL, V.K.*THE CLEARINGHOUSE: A DECENTRALIZED AGENT FOR
LOCATING NAMED OBJECTS IN A DISTRIBUTED ENVIRONMENT.* XEROX. PALO ALTO
RES. CENTER. OFFICE PRODUCTS DIV.*OPD-T8103.*1981.
015979 SALTZER, J.H.* COMMUNICATION RING INITIALIZATION WITHOUT CENTRAL
CONTROL.* M.I.T. LAB. FOR COMP.SCI.*TM-202.* 1981.
020263 STREETT, R.S.* PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSE.*
M.I.T. LAB. FOR COMP.SCI.*TR-263, PH.D. THESIS. STREETT, R.S.*1981.
020265 THOMAS, R.E.*A DATAFLOW ARCHITECTURE WITH IMPROVED ASYMPTOTIC
PERFORMANCE.* M.I.T. LAB. FOR COMP.SCI.* TR-265, PH.D. THESIS. THOMAS,
R.E.*1981.
020262 TODD, K.W.*HIGH LEVEL VAL CONSTRUCTS IN A STATIC DATA FLOW MACHINE.*
M.I.T. LAB. FOR COMP.SCI.*TR-262.*1981.
VOL. 4, NO. 3 03/15/82
015996 ALELIUNAS, R. ROSENBERG, A.L.*ON EMBEDDING RECTANGULAR GRIDS IN SQUARE
GRIDS.* DUKE U. COMP.SCI.DEPT.* CS-1981-11.*1981.
015997 AULICK, C.M.*A GENERALIZED APPROACH TO REGULARIZATION.* DUKE U.
COMP.SCI.DEPT.*CS-1981-05.*1981.
015998 AULICK, C.M.*ISOLATING ERROR EFFECTS IN SOLVING ILL POSED PROBLEMS.* DUKE
U. COMP.SCI.DEPT.*CS-1981-06.*1981.
015999 DANIEL, S. GEIST, S.* V-SCAN: AN ADAPTIVE DISK SCHEDULING ALGORITHM.*
DUKE U. COMP.SCI.DEPT.*CS-1981-07.*1981.
016000 FINK, P.K.* CONDITIONALS IN A NATURAL LANGUAGE SYSTEM.* DUKE U.
COMP.SCI.DEPT.*CS-1981-12.*1981.
016001 ROSENBERG, A.L.* ROUTING WITH PERMUTERS: TOWARD RECONFIGURABLE AND
FAULT-TOLERANT NETWORKS.* DUKE U. COMP.SCI.DEPT.*CS-1981-13.*1981.
016002 SMITH, C.U.*A METHODOLOGY FOR PREDICTING THE MEMORY MANAGEMENT OVERHEAD
OF NEW SOFTWARE SYSTEMS.* DUKE U. COMP.SCI.DEPT.*CS-1981-04.*1981.
016003 WAGNER, R.A.*THE ARCHITECTURE OF A BOOLEAN VECTOR MACHINE.* DUKE U.
COMP.SCI.DEPT.*CS-1981-10.*1981.
016004 WAGNER, R.A.*COMPUTING POWERS OF PRIMITIVE NTH ROOTS OF UNITY.* DUKE U.
COMP.SCI.DEPT.*CS-1981-09.*1981.
016005 WAGNER, R.A.*A PROGRAMMER'S VIEW OF THE BOOLEAN VECTOR MACHINE, MODEL-2.*
DUKE U. COMP.SCI.DEPT.*CS-1981-08.* 1981.
016006 ANDLER, S. DING, I. ESWARAN, K. HAUSER, C. KIM, W. MEHL, J. WILLIAMS,
R.* SYSTEM D: A DISTRIBUTED SYSTEM FOR AVAILABILITY.* IBM WATSON RES.
CENTER.*RJ 3313.*1981.
016007 CHAITIN, G.J.* REGISTER ALLOCATION & SPILLING VIA COLORING.* IBM WATSON
RES. CENTER.*RC 9124.*1981.
016008 CHING, W.-M.*A DESIGN FOR DATA FLOW ANALYSIS IN AN APL COMPILER.* IBM
WATSON RES. CENTER.*RC 9151.*1981.
016009 DERVEER, E.J. VAN.* JOSEPHSON INTEGRATED CIRCUITS.* IBM WATSON RES.
CENTER.*RZ 1111.*1981.
016010 GOULD, J.D. CONTI, J. HOVANYECZ, T.* COMPOSING LETTERS WITH A SIMULATED
LISTENING TYPEWRITER.* IBM WATSON RES. CENTER.*RC 9119.*1981.
016011 HAILPERN, B. OWICKI, S.* MODULAR VERIFICATION OF CONCURRENT PROGRAMS.*
IBM WATSON RES. CENTER.*RC 9130.*1981.
016012 HASKIN, R.L. LORIE, R.A.*ON EXTENDING THE FUNCTIONS OF A RELATIONAL
DATABASE SYSTEM.* IBM WATSON RES. CENTER.*RJ 3182.*1981.
016013 ORTH, D.L.*A COMPARISON OF THE IPSA AND STSC IMPLEMENTATIONS OF OPERATORS
AND GENERAL ARRAYS EXTENSIONS OF APL.* IBM WATSON RES. CENTER.*RC 9135.*
1981.
016014 RICHARDS, J.T.*THE IBM RESEARCH SPEECH FILING SYSTEM: ANALYSIS OF THE
SYSTEM 7/S 370 PROTOTYPE.* IBM WATSON RES. CENTER.*RC 9114.*1981.
016015 ABRAMS, M. CHU, Y.*EVALUATION OF NEBULA ARCHITECTURE FOR JOVIAL CONTROL
CONSTRUCTS.* MARYLAND U. COMP.SCI. CENTER.* TR-1052.*1981.
016016 ABRAMS, M. CHU, Y.*READER IN ADA PROGRAMS: 1.* MARYLAND U. COMP.SCI.
CENTER.*TR-1062.*1981.
016017 BASILI, V.R. HUTCHENS, D.H.*ANALYZING A SYNTACTIC FAMILY OF COMPLEXITY
METRICS.* MARYLAND U. COMP.SCI. CENTER.* TR-1053.*1981.
016018 DIIENNO, T. CHU, Y.*EVALUATION OF NEBULA ARCHITECTURE FOR JOVIAL DATA
CONSTRUCTS.* MARYLAND U. COMP.SCI. CENTER.* TR-1051.*1981.
016019 GORDON, K.D.*ON THE CONSTRUCTION OF REPRESENTATIVE TEST WORKLOADS.*
MARYLAND U. COMP.SCI. CENTER.*TR-1054, PH.D. THESIS. GORDON, K.D.*1981.
016020 GOUGH, K.J.*CONCEPTUAL DESIGN OF THE DATA PROCESSOR OF A PASCAL DIRECT
EXECUTION COMPUTER.* MARYLAND U. COMP.SCI. CENTER.*TR-1060.*1981.
016021 JACOBS, B.E. JACOBS, T.E.*ON THE FUNCTIONAL REQUIREMENTS OF A GLOBAL DATA
MANAGER FOR A SET OF DISTRIBUTED HETEROGENEOUS DATABASES I.* MARYLAND U.
COMP.SCI. CENTER.*TR-1068.*N.D.
016022 KANAL, L.N. KUMAR, V.*BRANCH & BOUND FORMULATION FOR SEQUENTIAL AND
PARALLEL GAME TREE SEARCHING: PRELIMINARY RESULTS.* MARYLAND U.
COMP.SCI. CENTER.*TR-1063.*1981.
016023 KANAL, L.N.*PARALLEL IMPLEMENTATION OF A STRUCTURAL ANALYSIS ALGORITHM.*
MARYLAND U. COMP.SCI. CENTER.* TR-1064.*1981.
016024 LARSEN, R.L.*CONTROL OF MULTIPLE EXPONENTIAL SERVERS WITH APPLICATION TO
COMPUTER SYSTEMS.* MARYLAND U. COMP.SCI. CENTER.*TR-1041, PH.D. THESIS.
LARSEN, R.L.*1981.
016025 LOR, K.-W.E.*DESIGN OF EXECUTION SNAPSHOTS FOR DIRECT EXECUTION.*
MARYLAND U. COMP.SCI. CENTER.*TR-1044.*1981.
016026 MORELL, L.J. HAMLET, R.G.* ERROR PROPAGATION AND ELIMINATION IN COMPUTER
PROGRAMS.* MARYLAND U. COMP.SCI. CENTER.*TR-1065.*1981.
016027 RIEGER, C.* ZMOB: HARDWARE FROM A USER'S VIEWPOINT.* MARYLAND U.
COMP.SCI. CENTER.*TR-1042.*1981.
016028 ROUSSOPOULOS, N.* VIEW INDEXING IN RELATIONAL DATABASES.* MARYLAND U.
COMP.SCI. CENTER.*TR-1046.*1981.
016029 SAWYERS, S. RADELAT, C.*A LIST OF PUBLICATIONS ON JOVIAL DIRECT EXECUTION
COMPUTER ARCHITECTURE, EDITED BY SUSAN SAWYERS AND CARMEN RADELAT.*
MARYLAND U. COMP.SCI. CENTER.*TR-1066.*1981.
016030 SMALL, S. RIEGER, C.* PARSING AND COMPREHENDING WITH WORD EXPERTS (A
THEORY AND ITS REALIZATION).* MARYLAND U. COMP.SCI.
CENTER.*TR-1039.*1981.
016031 STANFILL, C.* PARTITIONED CONSTRAINT NETWORKS: A PRESCRIPTION FOR
REPRESENTING MACHINES.* MARYLAND U. COMP.SCI. CENTER.*TR-1037.*1981.
MICROFICHE.
110601 ANTONISSE, H.J.* IMAGE SEGMENTATION IN PYRAMIDS.* MARYLAND U. COMP.SCI.
CENTER.*TR-1045.*1981. MICROFICHE.
110602 BECK, J. PRAZDNY, K.* HIGHLIGHTS AND THE PERCEPTION OF GLOSSINESS.*
MARYLAND U. COMP.SCI. CENTER.*TR-1047.*1981. MICROFICHE.
110603 CHELLAPPA, R.*ON AN ESTIMATION SCHEME FOR GAUSS MARKOV RANDOM FIELD
MODELS.* MARYLAND U. COMP.SCI. CENTER.* TR-1040.*1981. MICROFICHE.
110604 DUNN, S.M.*GENERALIZED BLOMQVIST CORRELATION.* MARYLAND U. COMP.SCI.
CENTER.*TR-1043.*1981. MICROFICHE.
110605 KIM, C.E.*DIGITAL CONVEXITY, STRAIGHTNESS AND CONVEX POLYGONS.* MARYLAND
U. COMP.SCI. CENTER.*TR-1055.*1981. MICROFICHE.
110606 KRISHNAMURTHY, E.V. NARAYANAN, K.A.*A RELAXATION PROCEDURE FOR AUTOMATIC
SPELLING CORRECTION IN ENGLISH.* MARYLAND U. COMP.SCI.
CENTER.*TR-1059.*1981. MICROFICHE.
110607 NARAYANAN, K.A. ROSENFELD, A.*APPROXIMATION OF WAVEFORMS AND CONTOURS BY
ONE-DIMENSIONAL PYRAMID LINKING.* MARYLAND U. COMP.SCI.
CENTER.*TR-1057.*1981. MICROFICHE.
110608 NARAYANAN, K.A. O'LEARY, D.P. ROSENFELD, A.* IMAGE SMOOTHING AND
SEGMENTATION BY COST MINIMIZATION.* MARYLAND U. COMP.SCI.
CENTER.*TR-1049.*1981. MICROFICHE.
110609 NARAYANAN, K.A. O'LEARY, D.P. ROSENFELD, A.* MULTI-RESOLUTION
RELAXATION.* MARYLAND U. COMP.SCI. CENTER.*TR-1070.*1981. MICROFICHE.
110610 PIETIKAEINEN, M. ROSENFELD, A.* EDGE BASED TEXTURE MEASURES.* MARYLAND U.
COMP.SCI. CENTER.*TR-1050.*1981. MICROFICHE.
110611 PIETIKAEINEN, M. ROSENFELD, A.* GRAY LEVEL PYRAMID LINKING AS AN AID IN
TEXTURE ANALYSIS.* MARYLAND U. COMP.SCI. CENTER.*TR-1061.*1981.
MICROFICHE.
110612 ROSENFELD, A.* CELLULAR ARCHITECTURES: FROM AUTOMATA TO HARDWARE.*
MARYLAND U. COMP.SCI. CENTER.*TR-1048.*1981. MICROFICHE.
110613 ROSENFELD, A.* PARALLEL STRING PARSING USING LATTICE GRAPHS.* MARYLAND U.
COMP.SCI. CENTER.*TR-1036.*1981. MICROFICHE.
110614 ROSENFELD, A.* QUADTREE GRAMMARS FOR PICTURE LANGUAGES.* MARYLAND U.
COMP.SCI. CENTER.*TR-1058.*1981. MICROFICHE.
110615 RUTKOWSKI, W.S.* SHAPE SEGMENTATION USING RELAXATION.* MARYLAND U.
COMP.SCI. CENTER.*TR-1038.*1981. MICROFICHE.
110616 STEWART, G.W.* RANK DEGENERACY.* MARYLAND U. COMP.SCI.
CENTER.*TR-1056.*1980. MICROFICHE.
040623 BRUSS, A.R.*THE IMAGE IRRADIANCE EQUATION: ITS SOLUTION AND APPLICATION.*
M.I.T. A.I. LAB.*TR-623, PH.D. THESIS. BRUSS, A.R.*1981.
041624 DAVIS, R. SMITH, R.G.*NEGOTIATION AS A METAPHOR FOR DISTRIBUTED PROBLEM
SOLVING.* M.I.T. A.I. LAB.*MEMO 624.* 1981.
041592 HOFFMAN, D.D.*INFERRING SHAPE FROM MOTION FIELDS.* M.I.T. A.I. LAB.*MEMO
592.*1980.
041614 RICHARDS, W.A. RUBIN, J.M. HOFFMAN, D.D.* EQUATION COUNTING AND THE
INTERPRETATION OF SENSORY DATA.* M.I.T. A.I. LAB.*MEMO 614.*1981.
041631 RUBIN, J.M. RICHARDS, W.A.* COLOR VISION AND IMAGE INTENSITIES: WHEN ARE
CHANGES MATERIAL?* M.I.T. A.I. LAB.* MEMO 631.*1981.
040619 WHITE, B.Y.*DESIGNING COMPUTER GAMES TO FACILITATE LEARNING.* M.I.T. A.I.
LAB.*TR-619, PH.D. THESIS. WHITE, B.Y.*1981.
040589 WITKIN, A.P.* SHAPE FROM CONTOUR. M.I.T. A.I. LAB.*TR-589, PH.D. THESIS.
WITKIN, A.P.*1980.
016032 JAEGERMANN, M. MAREK, W.*ON DEPENDENCIES OF ATTRIBUTES IN INFORMATION
SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT.
NO. 428.*1981.
016033 KONIKOWSKA, B. MEZYNSKA, E. SENDOVA, E.*A THEORY OF INFORMATION SYSTEMS.*
POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO.
421.*1980.
016034 KONRAD, E. ORLOWSKA, E. PAWLAK, Z.* KNOWLEDGE REPRESENTATION SYSTEMS:
DEFINABILITY OF INFORMATIONS.* POLISH ACADEMY OF SCIENCES. INST. OF
COMP.SCI.*ICS PAS RPT. NO. 433.*1981.
016035 LIPSKI, W.*BIBLIOGRAPHY ON INFORMATION SYSTEMS, CONSECUTIVE RETRIEVAL
PROPERTY, INTERVAL GRAPHS AND RELATED TOPICS.* POLISH ACADEMY OF OF
SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 427.*1981.
016036 MICHALEWICZ, Z.*A COIN WEIGHING PROBLEM AND ITS CONNECTION WITH THE
SECURITY OF STATISTICAL DATABASE.* POLISH ACADEMY OF SCIENCES. INST. OF
COMP.SCI.*ICS PAS RPT. NO. 426.*1980.
016037 ORLOWSKA, E.* DEPENDENCY OF ATTRITUTES IN INFORMATION SYSTEMS.* POLISH
ACADEMY OF SCIENCES. INST. OF COMP.SCI.* ICS PAS RPT. NO. 425.*1980.
016038 ORLOWSKA, E.* DYNAMIC INFORMATION SYSTEMS.* POLISH ACADEMY OF SCIENCES.
INST. OF COMP.SCI.*ICS PAS RPT. NO. 434.* 1981.
016039 ORLOWSKA, E. PAWLAK, Z.* EXPRESSIVE POWER OF KNOWLEDGE REPRESENTATION
SYSTEMS.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT.
NO. 432.*1981.
016040 ORLOWSKA, E.* LOGIC APPROACH TO INFORMATION SYSTEMS.* POLISH ACADEMY OF
SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 437.*1981.
016041 ORLOWSKA, E.* PROGRAM LOGIC WITH QUANTIFIABLE PROPOSITIONAL VARIABLES.*
POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO.
422.*1980.
016042 PAWLAK, Z.* CLASSIFICATION OF OBJECTS BY MEANS OF ATTRIBUTES: AN APPROACH
TO INDUCTIVE INFERENCE.* POLISH ACADEMY OF SCIENCES. INST. OF
COMP.SCI.*ICS PAS RPT. NO. 429.*1981.
016043 PAWLAK, Z.* ROUGH RELATIONS.* POLISH ACADEMY OF SCIENCES. INST. OF
COMP.SCI.*ICS PAS RPT. NO. 435.*1981.
016044 PAWLAK, Z.* ROUGH SETS: BASIC NOTIONS.* POLISH ACADEMY OF SCIENCES. INST.
OF COMP.SCI.*ICS PAS RPT. NO. 431.*1981.
016045 STANCZAK, W.* MINIMAL SETS: THEORY AND APPLICATIONS.* POLISH ACADEMY OF
SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO. 430.*1981.
016046 ZIELONKA, W.*PROVING ASSERTIONS ABOUT PARALLEL PROGRAMS BY MEANS OF
TRACES.* POLISH ACADEMY OF SCIENCES. INST. OF COMP.SCI.*ICS PAS RPT. NO.
424.*1980.
016047 DRASTAL, G.A. KULIKOWSKI, C.A.* KNOWLEDGE BASED ACQUISITION OF RULES FOR
MEDICAL DIAGNOSIS.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TM-092.*1981.
016048 EASTMAN, C.M. LAFUE, G.M.E.* SEMANTIC INTEGRITY TRANSACTIONS IN DESIGN
DATABASES.* RUTGERS U. COMP.SCI.RES.LAB.*LCSR-TR-020.*1981.
016049 GERASOULIS, A.* SINGULAR INTEGRAL EQUATIONS - THE CONVERGENCE OF THE
NYSTROEM INTERPOLANT OF THE GAUSS CHEBYCHEV METHOD.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-108.* 1981.
016050 GOLDBERG, R.N.* MEDIT USER MANUAL. A MACHINE INDEPENDENT TEXT EDITOR.*
RUTGERS U. COMP.SCI.DEPT.*DCS-TR-105.* 1981, FIRST EDITION - DRAFT OF
SEPTEMBER 17, 1981.
016051 KING, R.*A FILE ORGANIZATION BASED ON EXTENSIBLE HASHING.* RUTGERS U.
COMP.SCI.RES.LAB.*LCSR-TR-022.*1981.
016052 KOENIG, S.*A TRANSFORMATIONAL FRAMEWORK FOR AUTOMATIC DERIVED DATA
CONTROL AND ITS APPLICATIONS IN AN ENTITY RELATIONSHIP DATA MODEL.*
RUTGERS U. COMP.SCI.RES.LAB.* LCSR-TR-023, PH.D. THESIS. KOENIG,
S.*1981.
016053 NUDEL, B.*IMPROVED CONSTRAINT SATISFACTION ALGORITHMS USING
INTER-VARIABLE COMPATIBILITIES.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-109.*1981.
016054 SANDHU, R.S.*THE CASE FOR A SETL BASED QUERY LANGUAGE.* RUTGERS U.
COMP.SCI.RES.LAB.*LCSR-TR-024.*1981.
016055 SCHWANKE, B.* COMMON VIRTUAL ARRAYS IN PDP 11 FORTRAN: AN EXERCISE IN
SOFTWARE ENGINEERING.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-124.*1981.
016056 SRIDHARAN, N.S.*REPRESENTING KNOWLEDGE IN AIMDS: INTRODUCTION USING
TAXMAN EXAMPLES.* RUTGERS U. COMP.SCI.RES.LAB.*CBM-TR-125; RUTGERS U.
COMP.SCI.RES.LAB.*LRP-TR-012.*1981.
016057 SRINIVASAN, C.V.* KNOWLEDGE REPRESENTATION AND PROBLEM SOLVING IN MDS.*
RUTGERS U. COMP.SCI.DEPT.*DCS-TR-106.* 1981.
016058 SRINIVASAN, C.V.*NOTE ON LEARNING IN MDS BASED ON PREDICATE SIGNATURES.*
RUTGERS U. COMP.SCI.RES.LAB.*DCS-TR-107.* 1981.
016059 VICHNEVETSKY, R. SCIUBBA, E. PAK, Y.*NUMERICAL UPSTREAM BOUNDARY
CONDITIONS THAT REDUCE SPURIOUS REFLECTION.* RUTGERS U.
COMP.SCI.DEPT.*DCS-TR-103.*1981.
016060 CORDY, J.R. HOLT, R.C.*SPECIFICATION OF CONCURRENT EUCLID (VERSION 1).*
TORONTO U. COMP. SYSTEMS RES. GROUP.* CSRG-133.*1981.
016061 EAGER, D.L.*ROBUST CONCURRENCY CONTROL IN DISTRIBUTED DATABASES.* TORONTO
U. COMP. SYSTEMS RES. GROUP.* CSRG-135.*1981.
016062 HEHNER, E.C.R. HOARE, C.A.R.*ANOTHER LOOK AT COMMUNICATING PROCESSES.*
TORONTO U. COMP. SYSTEMS RES. GROUP.* CSRG-134.*1981.
016063 HO-TAE, S.A.*A PROTOTYPE KNOWLEDGE BASED SYSTEM FOR COMPUTER-ASSISTED
MEDICAL DIAGNOSIS.* TORONTO U. COMP. SYSTEMS RES.
GROUP.*CSRG-132.*1981.
016064 BURKHART, H. NIEVERGELT, J.* STRUCTURE ORIENTED EDITORS.* EIDGENOESSISCHE
TECHNISCHE HOCHSCHULE ZURICH. INSTITUT FUER INFORMATIK.*BERICHT
38.*1980.
016065 BURRAGE, K.* ITERATION SCHEMES FOR SINGLY-IMPLICIT RUNGE KUTTA METHODS.*
AUCKLAND U. COMP.SCI.DEPT.*RPT. 024.* 1981.
016066 BUTCHER, J.C.* AN STABILITY IS NOT EQUIVALENT TO ALGEBRAIC STABILITY.*
AUCKLAND U. COMP.SCI.DEPT.*RPT. 026.*1981.
016067 DEKKER, K.* ALGEBRAIC STABILITY OF GENERAL LINEAR METHODS.* AUCKLAND U.
COMP.SCI.DEPT.*RPT. 025.*1981.
016068 HAYNES, S.M. JAIN, R.*DETECTION OF MOVING EDGES.* WAYNE STATE U.
COMP.SCI.DEPT.*CSC-82-004.*1981.
016069 JAIN, R.*DIRECT COMPUTATION OF THE FOCUS OF EXPANSION.* WAYNE STATE U.
COMP.SCI.DEPT.*CSC-82-005.*1982.
016070 LUNE, J. VAN DE. TE RIELE, H.J.J. WINTER, D.T.*RIGOROUS HIGH SPEED
SEPARATION OF ZEROS OF RIEMANN'S ZETA FUNCTION.* MATHEMATISCH
CENTRUM.*NW 113/81.*1981.
016071 PEACHEY, J.B.*THE BRADFORD ZIPF DISTRIBUTION AND PROGRAM BEHAVIOUR.*
SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT. 82-01.*1982.
016072 SHAMIR, E.*A SHARP THRESHOLD FOR HAMILTONIAN PATHS IN RANDOM GRAPHS.*NO
ISSUING AGENCY INDICATED (AUTHOR'S ADDRESS: MATHEMATICS INSTITUTE/THE
HEBREW UNIVERSITY/JERUSALEM).*1981.
016073 SHOCH, J.F. DALAL, Y.K. CRANE, R.C. REDELL, D.D.*EVOLUTION OF THE
ETHERNET LOCAL COMPUTER NETWORK.* XEROX. PALO ALTO RES. CENTER. OFFICE
PRODUCTS DIV.*OPD-T8102.*1981.
VOL. 4, NO. 4 04/23/82
016074 ANDREWS, G.R.*THE DESIGN AND IMPLEMENTATION OF SR.* ARIZONA U.
COMP.SCI.DEPT.*TR 81-15.*1981.
016075 ANDREWS, G.R.* SR: A LANGUAGE FOR DISTRIBUTED PROGRAMMING.* ARIZONA U.
COMP.SCI.DEPT.*TR 81-14.*1981.
016076 BUDD, T.A.*AN APL COMPILER.* ARIZONA U. COMP.SCI.DEPT.*TR 81-17.*1981.
016077 CHIMENTI, D.S. FRASER, C.W. HANSON, D.R.*THE S PROGRAMMING LANGUAGE.*
ARIZONA U. COMP.SCI.DEPT.*TR 81-13.*1981.
016078 DAVIDSON, J.W.*SIMPLIFYING CODE GENERATION THROUGH PEEPHOLE
OPTIMIZATION.* ARIZONA U. COMP.SCI.DEPT.*TR 81-19.*1981.
016079 MILLER, W.*TOOLS FOR NUMERICAL PROGRAMMING.* ARIZONA U.
COMP.SCI.DEPT.*TR 81-16.*1981.
016080 WAMPLER, S.B.* CONTROL MECHANISMS FOR GENERATORS IN ICON.* ARIZONA U.
COMP.SCI.DEPT.*TR 81-18.*1981.
016081 AKIN, O. RAO, D.R.*WORKING PAPERS IN USER-COMPUTER INTERFACE.* CARNEGIE
MELLON U. COMP.SCI.DEPT.* CMU-CS-81-140.*1981. CONTENTS: (WORKING
PAPER: 1): AKIN, O.*EFFICIENT COMPUTER USER INTERFACE IN ELECTRONIC MAIL
SYSTEMS; (WORKING PAPER: 2): RAO, D.R. AKIN, O.*SUMMARY OF USER ERRORS
AT THE TERMINAL.
016082 BATES, J.*ON INTENSIONALITY AND REFERENTIAL TRANSPARENCY.* CARNEGIE
MELLON U. COMP.SCI.DEPT.*CMU-CS-81-144.*1981.
016083 CHAZELLE, B. MONIER, L.* OPTIMALITY IN VLSI.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-81-141.*1981.
016084 CHAZELLE, B. MONIER, L.*UNBOUNDED HARDWARE IS EQUIVALENT TO DETERMINISTIC
TURING MACHINES.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-81-143.*1981.
016085 MEDINA-MORA, R. NOTKIN, D.S.* ALOE USERS' AND IMPLEMENTORS' GUIDE.*
CARNEGIE MELLON U. COMP.SCI.DEPT.*CMU-CS-81-145.* 1981.
016086 NELSON, B.J.* REMOTE PROCEDURE CALL.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-81-119, PH.D. THESIS. NELSON, B.J.* 1981.
016087 NESTOR, J.R. WULF, W.A. LAMB, D.A.* IDL - INTERFACE DESCRIPTION LANGUAGE:
FORMAL DESCRIPTION.* CARNEGIE MELLON U.
COMP.SCI.DEPT.*CMU-CS-81-139.*1981.
016088 BROWN, W.W.* NONLINEAR CLASSIFICATION OF TRANSLATIONAL INITIATION SITES.*
COLORADO U. COMP.SCI.DEPT.* CU-CS-211-91.*1981.
016089 EHRENFEUCHT, A. ROZENBERG, G.*ON THE SUBWORD COMPLEXITY OF DOL LANGUAGES
WITH A CONSTANT DISTRIBUTION.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-206-81.*1981.
016090 EHRENFEUCHT, A. ROZENBERG, G. KARHUMAKI, J.*THE (GENERALIZED) POST
CORRESPONDENCE PROBLEM WITH LISTS CONSISTING OF TWO WORDS IS DECIDABLE.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-204-81.*1981.
016091 FEIBER, J.D. TAYLOR, R.N. OSTERWEIL, L.* NEWTON -- A DYNAMIC PROGRAM
ANALYSIS TOOL CAPABILITIES SPECIFICATION.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-200-81.*1981.
016092 FOSDICK, L.D.* POLISH-X TRANSFORMATIONS.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-203-81.*1981.
016093 GABOW, H.N.*AN ALMOST-LINEAR ALGORITHM FOR TWO PROCESSOR SCHEDULING.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-212-81.* 1981 (REVISED VERSION OF
CU-CS-169-80).
016094 GALLUCCI, M.A.* SAM/SAL REPORT AND USER MANUAL.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-198-81.*1981.
016095 HAUSSLER, D.*SOME RESULTS ON SYMMETRIC DGSMS AND DGSM EQUIVALENCE.*
COLORADO U. COMP.SCI.DEPT.*CU-CS-199-79.* 1979.
016096 HAVENS, B.P.* NUMERICAL OPTIMIZERS FOR USE IN FLOATING POINT DATA
GENERATION.* COLORADO U. COMP.SCI.DEPT.* CU-CS-197-80.*1980.
016097 ROZENBERG, G.*ON SUBWORDS OF FORMAL LANGUAGES.* COLORADO U.
COMP.SCI.DEPT.*CU-CS-205-81.*1981.
016098 ABU-SUFAH, W. LEE, R. MALKAWI, M. YEW, P.-C.*EMPIRICAL RESULTS ON THE
BEHAVIOR OF NUMERICAL PROGRAMS IN VIRTUAL MEMORY SYSTEMS.* ILLINOIS U.
COMP.SCI.DEPT.* UIUCDCS-R-81-1076.*1981.
016099 CHENG, W.K.* PERFORMANCE ANALYSIS OF UPDATE SYNCHRONIZATION ALGORITHMS IN
DISTRIBUTED DATABASES.* ILLINOIS U. COMP.SCI.DEPT.*UIUCDCS-R-81-1068,
PH.D. THESIS. CHENG, W.K.*1981.
016100 CHENG, W.-Y.* PERFORMANCE EVALUATION OF TOKEN CONTROL NETWORKS.* ILLINOIS
U. COMP.SCI.DEPT.*UIUCDCS-R-82-1079, PH.D. THESIS. CHENG, W.-Y.*1982.
016101 GRCAR, J.F.*ANALYSES OF THE LANCZOS ALGORITHM AND OF THE APPROXIMATION
PROBLEM IN RICHARDSON'S METHOD.* ILLINOIS U.
COMP.SCI.DEPT.*UIUCDCS-R-81-1074, PH.D. THESIS. GRCAR, J.F.*1981.
016102 AUMANN, G.*KEGELIGE HYPERREGELFLAECHEN.* TECHNISCHE UNIVERSITAET
MUENCHEN. INSTITUT FUER MATHEMATIK.* TUM-M8105.*1981.
016103 BAYER, R. ELHARDT, K. HEIGERT, J. REISER, A.*DYNAMIC TIMESTAMP ALLOCATION
AND ITS APPLICATIONS TO THE BEHR METHOD.* TECHNISCHE UNIVERSITAET
MUENCHEN. INSTITUT FUER INFORMATIK.*TUM-I8107.*1981.
016104 CASTRIGIANO, D.P.L.* POSITION OPERATORS AS INTEGRALS WITH RESPECT TO
EUCLIDEAN SYSTEMS OF COVARIANCE.* TECHNISCHE UNIVERSITAET MUENCHEN.
INSTITUT FUER MATHEMATIK.* TUM-M8109.*1981.
016105 GANZINGER, H.*PARAMETERIZED SPECIFICATIONS: PARAMETER PASSING AND
OPTIMIZING IMPLEMENTATION.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT
FUER INFORMATIK.* TUM-I8110.*1981.
016106 GIEGERICH, R.*AUTOMATISCHE ERZEUGUNG VON MASCHINENCODE-OPTIMIERERN.*
TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
INFORMATIK.*TUM-I8112.*1981.
016107 JAKUBOWICZ, A.*UEBER DEN HOMOMORPHISMUS, DER DURCH EINE DERIVATION IM
ANTISYMMETRISCHEN TENSORRAUM VOM TYP (0,2) INDUZIERT IST.* TECHNISCHE
UNIVERSITAET MUENCHEN. INSTITUT FUER MATHEMATIK.*TUM-M8111.*1981.
016108 JOCHUM, G.*AUTOMATISCHE KONSTRUKTION UND EINHEITLICHE DARSTELLUNG VON
ATTRIBUTAUSWERTUNGSALGORITHMEN.* TECHNISCHE UNIVERSITAET MUENCHEN.
INSTITUT FUER INFORMATIK.*TUM-I8113.*1981.
016109 KREDLER, C.*SCHRITTWEISE VERFAHREN FUER MULTINOMIALE UND VERWANDTE
REGRESSIONSMODELLE.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
MATHEMATIK.*TUM-M8107.*1981.
016110 MEIXNER, W.* DUALITY OF VECTOR VALUED (AL)-NORMS AND (AM)-NORMS ON
ORDERED VECTOR SPACES.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
INFORMATIK.* TUM-I8105.*1981.
016111 NAEGELE, R. SCHLICHTER, J.*BETRIEBSSYSTEMKERN EINES
MEHRPROZESSORSYSTEMS.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
INFORMATIK.*TUM-I8111.*1981.
016112 PARTSCH, H. STEINBRUEGGEN, R.*A COMPREHENSIVE SURVEY ON PROGRAM
TRANSFORMATION SYSTEMS.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
INFORMATIK.*TUM-I8108.*1981.
016113 REINSCH, K.-D.*NUMERISCHE BERECHNUNG VON BIEGELINIEN IN DER EBENE.*
TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
MATHEMATIK.*TUM-M8108.*1981.
016114 RIEDEL, N.*ON UNIQUELY ERGODIC C* DYNAMICAL SYSTEMS AND THE DIXMIER
PROPERTY.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
MATHEMATIK.*TUM-M8106.*1981.
016115 WENDEL, H.*BERECHNUNG DER SCHALTKOMBINATIONEN IN EINER
SAMMELSCHIENENSCHALTSTATION BEI BERUECKSICHTIGUNG VON NEBENBEDINGUNGEN
DER BETRIEBSFUEHRUNG.* TECHNISCHE UNIVERSITAET MUENCHEN. INSTITUT FUER
INFORMATIK.* TUM-I8109.*1981.
024873 CARR, R.W.* VIRTUAL MEMORY MANAGEMENT.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-873; STANFORD U. SLAC.* SLAC-244, PH.D.
THESIS. CARR, R.W.*1981.
024884 CERI, S. NAVATHE, S. WIEDERHOLD, G.*OPTIMAL DESIGN OF DISTRIBUTED
DATABASES.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-884.*1981.
024896 CLANCEY, W.J.*THE EPISTEMOLOGY OF A RULE BASED EXPERT SYSTEM: A FRAMEWORK
FOR EXPLANATION.* STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-896; STANFORD
U. COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-017.*1981.
024894 CLANCEY, W.J.*METHODOLOGY FOR BUILDING AN INTELLIGENT TUTORING SYSTEM.*
STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-894; STANFORD U. COMP.SCI.DEPT.
HEURISTIC PROGRAMMING PROJECT.*HPP-81-018.*1981.
024891 DIETTERICH, T.G. BUCHANAN, B.G.*THE ROLE OF THE CRITIC IN LEARNING
SYSTEMS.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-891; STANFORD U.
COMP.SCI.DEPT. HEURISTIC PROGRAMMING PROJECT.*HPP-81-019.*1981.
024897 GOAD, C.*AUTOMATIC CONSTRUCTION OF SPECIAL PURPOSE PROGRAMS.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-82-897; STANFORD U. COMP.SCI.DEPT. A.I.
LAB.*AIM-344.*1982.
024819 GOAD, C.*COMPUTATIONAL USES OF THE MANIPULATION OF FORMAL PROOFS.*
STANFORD U. COMP.SCI.DEPT.*STAN-CS-80-819, PH.D. THESIS. GOAD, C.*1980.
024887 GRAHAM, R.L. YAO, F.F.*FINDING THE CONVEX HULL OF A SIMPLE POLYGON.*
STANFORD U. COMP.SCI.DEPT.*STAN-CS-81-887.* 1981.
024890 HIGDON, R.L.* BOUNDARY CONDITIONS FOR HYPERBOLIC SYSTEMS OF PARTIAL
DIFFERENTIAL EQUATIONS HAVING MULTIPLE TIME SCALES.* STANFORD U.
COMP.SCI.DEPT.* STAN-CS-81-890, PH.D. THESIS. HIGDON, R.L.*1981.
024875 HU, T.C. SHING, M.T.*COMPUTATION OF MATRIX CHAIN PRODUCTS, PART I, PART
II.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-875.*1981.
024886 KNUTH, D.E.*THE CONCEPT OF A META-FONT.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-886.*1981.
024892 KUPER, G.M.*AN ALGORITHM FOR REDUCING ACYCLIC HYPERGRAPHS.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-82-892.*1982.
024880 MAYR, E.W.* WELL STRUCTURED PARALLEL PROGRAMS ARE NOT EASIER TO
SCHEDULE.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-880.*1981.
024889 MUJTABA, S. GOLDMAN, R.* AL USERS' MANUAL.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-889; STANFORD U. COMP.SCI.DEPT. A.I.
LAB.*AIM-344.*1981.
024895 NOVAK, G.S. JR.* GLISP USERS' MANUAL.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-82-895; STANFORD U. COMP.SCI.DEPT. HEURISTIC
PROGRAMMING PROJECT.*HPP-82-001.*1982.
024882 PAN, V.*FAST MATRIX MULTIPLICATION WITHOUT APA-ALGORITHMS.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-882.*1981.
024893 PAULSON, L.*A COMPILER GENERATOR FOR SEMANTIC GRAMMARS.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-893, PH.D. THESIS. PAULSON, L.*1981.
024883 PEPPER, P.*ON PROGRAM TRANSFORMATIONS FOR ABSTRACT DATA TYPES AND
CONCURRENCY.* STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-883.*1981.
024881 ULLMAN, J.D.*THE U. R. STRIKES BACK.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-881.*1981.
024885 VAN MELLE, W. SCOTT, A.C. BENNETT, J.S. PEAIRS, M.*THE EMYCIN MANUAL.*
STANFORD U. COMP.SCI.DEPT.* STAN-CS-81-885; STANFORD U. COMP.SCI.DEPT.
HEURISTIC PROGRAMMING PROJECT.*HPP-81-016.*1981.
024898 WHANG, K. WIEDERHOLD, G. SAGALOWICZ, D.* SEPARABILITY AS A PHYSICAL
DATABASE DESIGN METHODOLOGY.* STANFORD U.
COMP.SCI.DEPT.*STAN-CS-81-898; STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH.RPT. 222.*1981.
025211 BUTNER, S.E.* TRIPLE TIME REDUNDANCY, FAULT MASKING IN BYTE SLICED
SYSTEMS. STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 211; STANFORD U.
SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-02.*1981.
025218 BUTNER, S.E.*A UNIVERSAL SLICE ELEMENT FOR TRIPLE TIME REDUNDANT
SYSTEMS.* STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 218; STANFORD
U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT.
81-09.*1981.
025221 CLARK, J.H.* PARAMETRIC CURVES, SURFACES AND VOLUMES IN COMPUTER GRAPHICS
AND COMPUTER AIDED GEOMETRIC DESIGN.* STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH.RPT. 221.*1981.
038193 DONG, H. MCCLUSKEY, E.J.*DESIGN OF FULLY TESTABLE PROGRAMMABLE LOGIC
ARRAYS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 193; STANFORD
U. SEL. COMP. SYSTEMS LAB. CENTER. FOR RELIABLE COMPUTING.*RPT. 81-20.*
1981.
038186 DONG, H. MCCLUSKEY, E.J.* MATRIX REPRESENTATION OF PLA'S AND AN
APPLICATION TO CHARACTERIZING ERRORS.* STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH. NOTE 186; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR
RELIABLE COMPUTING.* RPT. 81-11.*1981.
038189 DONG, H.* MODIFIED BERGER CODES FOR DETECTION OF UNIDIRECTIONAL ERRORS.*
STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 189; STANFORD U. SEL.
COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-16.*1981.
038194 FLYNN, M. HUCK, J. WAKEFIELD, S.* ARCHITECTURE AND LANGUAGE EMULATION
RESEARCH.* STANFORD U. SEL. COMP. SYSTEMS LAB.* TECH. NOTE 194.*1982.
025219 FU, P.L.* CONSISTENCY IN INTERPROCESSOR COMMUNICATIONS FOR FAULT TOLERANT
MULTIPROCESSORS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 219;
STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT.
81-10.* 1981.
025225 GANAPATHI, M. FISCHER, C.N. HENNESSY, J.L.*AUTOMATIC COMPILER CODE
GENERATION.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 225.*1981.
025213 GONZALEZ-CAWLEY, N. TOBAGI, F.A.*SIMULATION OF MESSAGE BASED PRIORITY
FUNCTIONS IN CARRIER SENSE MULTIACCESS/BROADCAST SYSTEMS.* STANFORD U.
SEL. COMP. SYSTEMS LAB.*TECH.RPT. 213.*1981.
025224 HENNESSY, J. GROSS, T.* CODE GENERATION AND REORGANIZATION IN THE
PRESENCE OF PILELINE CONSTRAINTS.* STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH.RPT. 224.*1981.
025223 HENNESSY, J. JOUPPI, N. BASKETT, F. GILL, J.* MIPS: A VLSI PROCESSOR
ARCHITECTURE.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 223.*1981.
038191 IYER, R.K. ROSSETTI, D.J.*A STATISTICAL LOAD DEPENDENCY MODEL FOR CPU
ERRORS AT SLAC.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 191;
STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT.
81-19.* 1981.
038187 KHAKBAZ, J.*A NOVEL TOTALLY SELF CHECKING 1-OUT-OF-N CHECKER.* STANFORD
U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 187; STANFORD U. SEL. COMP.
SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-12.*1981.
038188 KHAKBAZ, J. MCCLUSKEY, E.J.*CONCURRENT ERROR DETECTION AND TESTING FOR
LARGE PLA'S.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 188;
STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT.
81-14.*1981.
025214 IYER, R.K. BUTNER, S.E. MCCLUSKEY, E.J.*AN EXPONENTIAL FAILURE/LOAD
RELATIONSHIP: RESULTS OF A MULTI-COMPUTER STATISTICAL STUDY.* STANFORD
U. SEL. COMP. SYSTEMS LAB.* TECH.RPT. 214; STANFORD U. SEL. COMP.
SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-06.*1981.
025212 LU, D.J.* WATCHDOG PROCESSORS AND STRUCTURAL INTEGRITY CHECKING.*
STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH.RPT. 212; STANFORD U. SEL.
COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-05.*1981.
038185 MCCLUSKEY, E.J.* TESTING VHSIC DEVICES.* STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH. NOTE 185; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR
RELIABLE COMPUTING.*RPT. 81-03.* 1981.
038190 NAMJOO, M. MCCLUSKEY, E.J.* WATCHDOG PROCESSORS AND DETECTION OF
MALFUNCTIONS AT THE SYSTEM LEVEL.* STANFORD U. SEL. COMP. SYSTEMS
LAB.*TECH. NOTE 190; STANFORD U. SEL. COMP. SYSTEMS LAB. CENTER FOR
RELIABLE COMPUTING.* RPT. 81-17.*1981.
038195 ROSSETTI, D.J. IYER, R.K.*A SOFTWARE SYSTEM FOR RELIABILITY AND WORKLOAD
ANALYSIS.* STANFORD U. SEL. COMP. SYSTEMS LAB.*TECH. NOTE 195; STANFORD
U. SEL. COMP. SYSTEMS LAB. CENTER FOR RELIABLE COMPUTING.*RPT.
81-18.*1981.
025220 TOBAGI, F.A. BORGONOVO, F. FRATTA, L.*THE EXPRESS-NET: A LOCAL AREA
COMMUNICATION NETWORK INTEGRATING VOICE AND DATA.* STANFORD U. SEL.
COMP. SYSTEMS LAB.*TECH.RPT. 220.*1980.
038192 XU, X.*A MODULARIZED TEST GENERATION METHOD USING MATRICES.* STANFORD U.
SEL. COMP. SYSTEMS LAB.*TECH. NOTE 192; STANFORD U. SEL. COMP. SYSTEMS
LAB. CENTER FOR RELIABLE COMPUTING.*RPT. 81-15.*1981.
016116 DIVITO, B.L.*A MECHANICAL VERIFICATION OF THE ALTERNATING BIT PROTOCOL.*
TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER
PROJECT.* ICSCA-CMP-021.*1981.
016117 DIVITO, B.L.*TRANSCRIPTS FOR THE PROOF OF THE ALTERNATING BIT PROTOCOL.*
TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER
PROJECT.* ICSCA-CMP-022.*1981.
016118 HARE, D.F.*A STRUCTURE PROGRAM EDITOR FOR THE GYPSY VERIFICATION
ENVIRONMENT.* TEXAS U. COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE
MINICOMPUTER PROJECT.* ICSCA-CMP-016.*1979.
016119 HUNTER, L.W.*THE FIRST GENERATION GYPSY COMPILER.* TEXAS U. COMPUTING
SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER
PROJECT.*ICSCA-CMP-023.*1981.
016120 SMITH, L.M.* COMPILING FROM THE GYPSY VERIFICATION ENVIRONMENT.* TEXAS U.
COMPUTING SCI. AND COMP.APPL.INST. CERTIFIABLE MINICOMPUTER
PROJECT.*ICSCA-CMP-020.*1980.
110620 RALL, L.B.*A THEORY OF INTERVAL ITERATION.* WISCONSIN U. MATH.RES.
CENTER.*MRC TECH.SUM.RPT. 2196.*1981. MICROFICHE.
110621 RITTER, K.*ON PARAMETRIC LINEAR AND QUADRATIC PROGRAMMING PROBLEMS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2197.*1981.
MICROFICHE.
110623 MARKOVICH, P.A. WEISS, R.* NONLINEAR EIGENVALUE PROBLEMS ON INFINITE
INTERVALS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2199.*1981.
MICROFICHE.
110628 SAFF, E.B. SHARMA, A. VARGA, R.S.*AN EXTENSION TO RATIONAL FUNCTIONS OF A
THEOREM OF J.L. WALSH ON DIFFERENCES OF INTERPOLATING POLYNOMIALS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2204.*1981.
MICROFICHE.
110629 MARKOVICH, P.A. RINGHOFER, C.A.*THE NUMERICAL SOLUTION OF BOUNDARY VALUE
PROBLEMS ON 'LONG' INTERVALS.* WISCONSIN U. MATH.RES. CENTER.*MRC
TECH.SUM.RPT. 2205.*1981. MICROFICHE.
110637 MARKOVICH, P.A. RENARDY, M.*A NONLINEAR VOLTERRA INTEGRO DIFFERENTIAL
EQUATION DESCRIBING THE STRETCHING OF POLYMERIC LIQUIDS.* WISCONSIN U.
MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2213.*1981. MICROFICHE.
110639 DE BOOR, C. HOELLIG, R.* RECURRENCE RELATIONS FOR MULTIVARIATE
B-SPLINES.* WISCONSIN U. MATH.RES. CENTER.* MRC TECH.SUM.RPT.
2215.*1981. MICROFICHE.
110640 ROGERS, J.C.W.*NUMERICAL SOLUTION OF A GASIFICATION PROBLEM.* WISCONSIN
U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2216.*1981. MICROFICHE.
110641 FENG, Y.Y. QI, D.X.*A SEQUENCE OF PIECEWISE ORTHOGONAL POLYNOMIALS. (I).
(LINEAR CASE).* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT.
2217.*1981. MICROFICHE.
110651 DYN, N. WONG, W.H.*ON THE SOLUTION OF A CONSTRAINED MINIMIZATION PROBLEM
IN H'(OMEGA) RELATED TO DENSITY ESTIMATION.* WISCONSIN U. MATH.RES.
CENTER.*MRC TECH.SUM.RPT. 2227.*1981. MICROFICHE.
110653 FENG, Y.Y. QI, D.X.*A SEQUENCE OF PIECEWISE ORTHOGONAL POLYNOMIALS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2229.*1981.
MICROFICHE.
110655 MANGASARIAN, O.L.*A CONDITION NUMBER FOR LINEAR INEQUALITIES AND LINEAR
PROGRAMS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2231.*1981.
MICROFICHE.
110656 RUSSELL, D.L.*OPTIMAL ORBITAL REGULATION IN DYNAMICAL SYSTEMS SUBJECT TO
HOPF BIFURCATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT.
2232.*1981. MICROFICHE.
110658 SCHOENBERG, I.J.*INTERPOLATING SPLINES AS LIMITS OF POLYNOMIALS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2234.*1981.
MICROFICHE.
110659 FENG, Y.Y. QI, D.X.*ON THE HAAR AND WALSH SYSTEMS ON A TRIANGLE.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2235.*1981.
MICROFICHE.
110662 QI, D.X.*A CLASS OF LOCAL EXPLICIT MANY KNOT SPLINE INTERPOLATION
SCHEMES.* WISCONSIN U. MATH.RES. CENTER.* MRC TECH.SUM.RPT. 2238.*1981.
MICROFICHE.
110665 FUJIWARA, O.* DUALITY IN NONCONCAVE PROGRAMS USING TRANSFORMATIONS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2241.*1981.
MICROFICHE.
110666 QI, D.X.*A NEW WAY FOR CONSTRUCTING HIGHER ORDER ACCURACY SPLINE
SMOOTHING FORMULAS.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT.
2242.*1981. MICROFICHE.
110681 HAN, S.-P. MANGASARIAN, O.L.*A DUAL DIFFERENTIABLE EXACT PENALTY
FUNCTION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2257.*1981.
MICROFICHE.
110684 MANGASARIAN, O.L.*SPARSITY-PRESERVING SOR ALGORITHMS FOR SEPARABLE
QUADRATIC AND LINEAR PROGRAMMING.* WISCONSIN U. MATH.RES. CENTER.*MRC
TECH.SUM.RPT. 2260.*1981. MICROFICHE.
110686 GREVILLE, T.N.E. VAUGHAN, H.*SMOOTHEST LOCAL INTERPOLATION FORMULAS FOR
EQUALLY SPACED DATA.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT.
2262.*1981. MICROFICHE.
110692 RALL, L.B.*INTERVAL ANALYSIS: A TOOL FOR APPLIED MATHEMATICS.* WISCONSIN
U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2268.*1981. MICROFICHE.
110693 DEVORE, R.A. SCOTT, L.R.*ERROR ESTIMATES FOR GAUSSIAN QUADRATURE AND
WEIGHTED L SUPERSCRIPT 1 POLYNOMIAL APPROXIMATION.* WISCONSIN U.
MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2269.*1981. MICROFICHE.
110695 RALL, L.B.*SOLUTION OF FINITE SYSTEMS OF EQUATIONS OF INTERVAL
ITERATION.* WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2271.*1981.
MICROFICHE.
110698 CRYER, C.W. ZHOU, S.Z.*NUMERICAL SOLUTION OF DEGENERATE VARIATIONAL
INEQUALITY ARISING IN THE FLUID FLOW THROUGH POROUS FLOW.* WISCONSIN U.
MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2274.*1981. MICROFICHE.
110709 MARKOVICH, P.A. RINGHOFER, C.A.* SINGULAR PERTURBATION PROBLEMS WITH A
SINGULARITY OF THE SECOND KIND.* WISCONSIN U. MATH.RES. CENTER.*MRC
TECH.SUM.RPT. 2285.* 1981. MICROFICHE.
110710 RALL, L.B.* MEAN VALUE AND TAYLOR FORMS IN INTERVAL ANALYSIS.* WISCONSIN
U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2286.*1981. MICROFICHE.
110714 STRIKWERDA, J.C.*A GENERALIZED CONJUGATE GRADIENT METHOD FOR NONSYMMETRIC
SYSTEMS OF LINEAR EQUATIONS.* WISCONSIN U. MATH.RES. CENTER.*MRC
TECH.SUM.RPT. 2290.*1981. MICROFICHE.
110716 ZHONG, X.-C.*NUMERICAL METHODS FOR SOLVING A PREMIXED LAMINAR FLAME.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2292.*1981.
MICROFICHE.
110720 GOODMAN, T.N.T. SCHOENBERG, I.J. SHARMA, A.*HIGH ORDER CONTINUITY IMPLIES
GOOD APPROXIMATIONS TO SOLUTIONS OF CERTAIN FUNCTIONAL EQUATIONS.*
WISCONSIN U. MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2296.*1981.
MICROFICHE.
110723 SCHOENBERG, I.J.*A NEW APPROACH TO EULER SPLINES. I.* WISCONSIN U.
MATH.RES. CENTER.*MRC TECH.SUM.RPT. 2299.* 1981. MICROFICHE.
016122 BARLOW, R.E.*ASSESSMENT OF SUBJECTIVE PROBABILITY.* CAL U., BERKELEY.
O.R. CENTER.*ORC 81-23.*1981.
016123 BARLOW, R.E.*SET THEORETIC SIGNED DOMINATION FOR COHERENT SYSTEMS.* CAL
U., BERKELEY. O.R. CENTER.*ORC 81-01.* 1982.
016124 BUNT, R.B. HARBUS, R.S. PLUMB, S.J.*THE EFFECTIVE MANAGEMENT OF PAGING
STORAGE HIERARCHIES.* SASKATCHEWAN U. COMPUTATIONAL SCI.DEPT.*RPT.
82-03.*1982.
016125 JEWELL, W.S.*TWO PAPERS ON BAYESIAN DATA TRIMMING.* CAL U., BERKELEY.
O.R. CENTER.*ORC 81-24.*1981.
016126 LAMPSON, B.W. HORNING, J.J. LONDON, R.L. MITCHELL, J.G. POPEK,
G.J.*REPORT ON THE PROGRAMMING LANGUAGE EUCLID.* XEROX. PALO ALTO RES.
CENTER.*CSL-81-12.*1981.
016127 LUSKIN, M. TEMPLE, B.*THE EXISTENCE OF A GLOBAL WEAK SOLUTION TO THE
NONLINEAR WATERHAMMER PROGRAM.* NEW YORK U. COURANT MATH. AND COMPUTING
LAB.*DOE/ER/03077-174.* 1981.
016128 PEACHEY, J.B.*SOME EMPIRICAL OBSERVATIONS ON PROGRAM BEHAVIOUR WITH
APPLICATIONS TO PROGRAM RESTRUCTURING.* SASKATCHEWAN U. COMPUTATIONAL
SCI.DEPT.*RPT. 82-04.*1982.
016129 PEACHEY, J.B.*TOWARDS A MEASURE OF PROGRAM LOCALITY.* SASKATCHEWAN U.
COMPUTATIONAL SCI.DEPT.*RPT. 82-02.*1982.
016131 ROLAND, R.J.*AN INTERACTIVE DECISION SUPPORT SYSTEM FOR TECHNOLOGY
TRANSFER PERTAINING TO ORGANIZATION AND MANAGEMENT.* U.S. NAVAL
POSTGRADUATE SCH.*NPS52-80-009.* 1980.
VOL. 4, NO. 5 05/15/82
016132 Berliner, H.J.* Search vs. knowledge: an analysis from the domain of
games.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-104.*1981.
016133 Hilfinger, P.N.* Abstraction mechanisms and language design.* Carnegie
Mellon U. Comp.Sci.Dept.*CMU-CS-81-147, Ph.D. Thesis. Hilfinger,
P.N.*1981.
016134 Kung, H.T.*Why systolic architectures?* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-81-148.*1981.
016135 Lai, K.-W.* Functional testing of digital systems.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-81-148, Ph.D. Thesis. Lai, K.-W.*1981.
016136 Leiserson, C.E. Saxe, J.B.*Optimizing synchronous systems.* Carnegie
Mellon U. Comp.Sci.Dept.*CMU-CS-82-101.*1982.
016137 Shafer, S.A. Kanade, T.*Using shadows in finding surface orientations.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-100.*1982.
016138 Casey, R.G. Nagy, G.* Decision tree design using a probabilistic model.*
IBM Watson Res. Center.*RJ 3358.* 1981.
016139 Chow, W.-M.*Allocation of computational elements in multiprocessor
systems.* IBM Watson Res. Center.*RC 9152.*1981.
016140 Codd, E.F.* Relational database: a practical foundation for
productivity.* IBM Watson Res. Center.*RJ 3339.*1981.
016141 Conrads, D. Kermani, P.*A feasibility study of using store-and-forward
data communication networks to transmit digitized speech.* IBM Watson
Res. Center.*RC 9157.*1981.
016142 Dolev, D. Strong, H.R.* Polynomial algorithms for multiple processor
agreement.* IBM Watson Res. Center.*RJ 3342.* 1981.
016143 Fagin, R.*Types of acyclicity for hypergraphs and relational database
schemes.* IBM Watson Res. Center.*RJ 3330.*1981.
016144 Heidelberger, P. Trivedi, K.S.*Analytic queueing models for programs with
internal concurrency.* IBM Watson Res. Center.*RC 9194.*1982.
016145 Heidelberger, P. Trivedi, K.S.* Queueing network models for parallel
processing with asynchronous tasks.* IBM Watson Res. Center.*RC
9102.*1981.
016146 Hofri, M. Konheim, A.G.* Padded lists revisited.* IBM Watson Res.
Center.*RC 9161.*1981.
016147 Itai, A. Konheim, A.G. Rodeh, M.*A sparse table implementation of sorted
lists.* IBM Watson Res. Center.* RC 9146.*1981.
016148 Kim, J.*Register to register move generation in register assignment of
optimizing compilers.* IBM Watson Res. Center.*RC 9110.*1981.
016149 Konheim, A.G.*A one-way sequence for transaction verification.* IBM
Watson Res. Center.*RC 9147.*1981.
016150 Langdon, G.G.*A note on the Ziv Lempel model for compressing individual
sequences.* IBM Watson Res. Center.*RJ 3318.*1981.
016151 Mueller, H.R. Keller, H.*Transmission in a synchronous token ring.* IBM
Watson Res. Center.*RZ 1122.*1981.
016152 Ni, L.M. Wong, K.Y. Lee, D.T.*A multiple microprocessor system for office
image processing.* IBM Watson Res. Center.*RJ 3357.*1981.
016153 Ortiz, E.L. Rivlin, T.J.*Another look at the Chebyshev polynomials.* IBM
Watson Res. Center.*RC 9107.*1981.
016154 Radin, G.*The 801 minicomputer.* IBM Watson Res. Center.* RC 9125.*1981.
016155 Sacco, G.M. Schkolnick, M.*A mechanism for managing the buffer pool in a
relational database system using the hot set model.* IBM Watson Res.
Center.*RJ 3354.*1981.
016156 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The research queueing package:
past, present and future.* IBM Watson Res. Center.*RC 9123.*1981.
016157 Savir, J. Roth, J.P.*Testing for, and distinguishing between failures.*
IBM Watson Res. Center.*RC 9164.*1981.
016158 Stockmeyer, L.J. Vazirani, V.V.* NP-completeness of some generalizations
of the maximum matching problem.* IBM Watson Res. Center.*RC 9160.*1981.
016159 Vishkin, U.*An optimal parallel connectivity algorithm.* IBM Watson Res.
Center.*RC 9149.*1981.
016160 Wagner, E.G.*Lecture notes on the algebraic specification of data types
(delivered at the Seventh National School for Young Scientists, held in
Varna, Bulgaria, September 7-13, 1981).* IBM Watson Res. Center.*RC
9203.*1981.
016161 Wahl, F.M. Wong, K.Y. Casey, R.G.*Block segmentation and text extraction
in mixed text/image documents.* IBM Watson Res. Center.*RJ 3356.*1981.
016162 Baccelli, F. Gelenbe, E. Plateau, B.*An end to end approach to the
resequencing problem.* INRIA.*Rapport de Recherche 097.*1981.
016163 Gelenbe, E. Mitrani, I.* Control policies in CSMA local area networks:
Ethernet controls.* INRIA.*Rapport de Recherche 106.*1981.
016164 Gelenbe, E. Gardy, D.*On the size of projections: I.* INRIA.*Rapport de
Recherche 105.*1981.
016165 Herskovits, J.*A two-stage feasible direction algorithm for nonlinearly
constrained optimization.* INRIA.*Rapport de Recherche 103.*1981.
016166 Melese, B.* MENTOR: l'environnement PASCAL.* INRIA.*Rapport Technique
005.*1981.
016167 Miranda, S.M.*Aspects of data security in general-purpose data base
management systems.* INRIA.*Rapport de Recherche 100.*1981.
016168 Miranda, S.M.*Formalization of DLP (a Decentralized Locking Protocol)
using abstract data types.* INRIA.*Rapport de Recherche 099.*1981.
041642 Attardi, G. Simi, M.* Semantics of inheritance and attributions in the
description system Omega.* M.I.T. A.I. Lab.*Memo 642.*1981.
041653 Brady, M.*Computational approaches to image understanding.* M.I.T. A.I.
Lab.*Memo 653.*1981.
041654 Brady, M. Horn, B.K.P.* Rotationally symmetric operators for surface
interpolation.* M.I.T. A.I. Lab.*Memo 654.* 1981.
041662 Bruss, A.R. Horn, B.K.P.* Passive navigation.* M.I.T. A.I. Lab.*Memo
662.*1981.
041651 Chapman, D.*A program testing assistant.* M.I.T. A.I. Lab.* Memo
651.*1981.
040633 Clinger, W.D.*Foundations of actor semantics.* M.I.T. A.I. Lab.*TR-633,
Ph.D. Thesis. Clinger, W.D.*1981.
041646 Hillis, W.D.*The connection machine (computer architecture for the new
wave).* M.I.T. A.I. Lab.*Memo 646.*1981.
041635 Hollerbach, J.M. Flash, T.* Dynamic interactions between limb segments
during planar arm movement.* M.I.T. A.I. Lab.*Memo 635.*1981.
041641 Kornfeld, W.A. Hewitt, C.*The scientific community metaphor.* M.I.T. A.I.
Lab.*Memo 641.*1981.
041627 Kornfeld, W.A.*The use of parallelism to implement a heuristic search.*
M.I.T. A.I. Lab.*Memo 627.*1981.
041640 Miller, L.*Natural learning.* M.I.T. A.I. Lab.*Memo 640; M.I.T. A.I.
Lab.*Logo Memo 61.*1981.
041647 Minsky, M.* Nature abhors an empty vacuum.* M.I.T. A.I. Lab.*Memo
647.*1981.
041628 Moon, D.A.* Chaosnet.* M.I.T. A.I. Lab.*Memo 628.*1981.
041650 Poggio, T. Koch, C. Torre, V.* Microelectronics in nerve cells: dendritic
morphology and information processing.* M.I.T. A.I. Lab.*Memo 650.*1981.
040604 Rich, C.* Inspection methods in programming.* M.I.T. A.I. Lab.*TR-604,
Ph.D. Thesis. Rich, C.*1981.
041648 Richards, W.A.*A lightness scale from image intensity distributions.*
M.I.T. A.I. Lab.*Memo 648.*1981.
040649 Riley, M.D.*The representation of image texture.* M.I.T. A.I.
Lab.*TR-649.*1981.
040636 Steele, B.S.K.*An accountable source-to-source transformation system.*
M.I.T. A.I. Lab.*TR-636.*1981.
041611 Waters, R.C.* GPRINT: a LISP pretty printer providing extensive user
format-control mechanisms.* M.I.T. A.I. Lab.*Memo 611.*1981.
016169 Bechtolsheim, A. Baskett, F. Pratt, V.*The SUN Workstation architecture.*
Stanford U. Comp.Sci.Dept.*January 15, 1982 (copyright 1982 - Stanford
University).
016170 Pratt, V.R.*The SUN Workstation.* Preprint of a paper delivered at the
Office Automation Conference, San Francisco, April 5-7, 1982.
016171 Bechtolsheim, A.* SUN graphics board.* No issuing agency indicated
(copies available from: SUN Microsystems Inc./2310 Walsh/Santa Clara,
Calif.).*1982 (copyright - VLSI Systems Inc.).
016172 Bechtolsheim, A.* SUN 68000 board.* No issuing agency indicated (copies
available from: SUN Microsystems Inc./2310 Walsh/Santa Clara,
Calif.).*n.d.
016173 Bechtolsheim, A.* SUN 3 MBit Ethernet board.* No issuing agency indicated
(copies available from: SUN Microsystems Inc./2310 Walsh/Santa Clara,
Calif.).*1982 (copyright - VLSI Systems Inc.).
016174 Babaoglu, OE.* Virtual storage management in the absence of reference
bits.* Cal U., Berkeley. Electronics Res.Lab.* Memo. No. UCB/ERL-M81/92;
Cal U., Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 81.8, Ph.D.
Thesis. Babaoglu, OE.*1981.
016175 Cabrera, L.F. Paris, J.-F.*Comparing user response times on paged and
swapped UNIX.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M81/39; Stanford U. Electronics Res.Lab. PROGRES Group.*Rpt.
81.4.*1981.
016176 Cabrera, L.F.* First order logic syntax and the dynamic behavior of
programs.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M81/48; Cal U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 81.6.*1981.
016177 Faller, N.*Design and analysis of program behavior models for the
reproduction of working set characteristics.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL-M81/59; Cal U., Berkeley.
Electronics Res.Lab. PROGRES Group.*Rpt. 81.7, Ph.D. Thesis. Faller,
N.*1981.
016178 Ferrari, D.*Characterization and reproduction of the referencing dynamics
of programs.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M81/22; Cal U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 81.1.* 1981.
016179 Lau, E.J. Ferrari, D.* Program restructuring in a multilevel virtual
memory.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M81/26; Cal U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 81.2.* 1981.
016180 Paris, J.-F.*Application of restructuring techniques to the optimization
of program behavior in virtual memory systems.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL-M81/44; Cal U., Berkeley.
Electronics Res.Lab. PROGRES Group.*Rpt. 81.5, Ph.D. Thesis. Paris,
J.-F.*1981.
016181 Arbib, M.A.*Modelling neural mechanisms of visuomotor coordination in
frog and toad.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt.
82-01.*1982.
016182 McDonald, D.D.* Language production: the source of the dictionary.*
Massachusetts U. Comp. & Info.Sci.Dept.* COINS Tech.Rpt. 82-07.*1982.
016183 McDonald, D.D.* Natural language generation as a computational problem:
an introduction.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS
Tech.Rpt. 81-33.*1981.
016184 Overton, K.J. Arbib, M.A.*The extended branch arrow model of the
formation of retino-tectal connections.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS Tech.Rpt. 82-08.*1982 (revised version of COINS
Technical Report 81-14).
016185 Bochmann, G.V. Cerny, E. Gagne, M. Jard, C. Leveille, A. Lacaille, C.
Maksud, M. Raghunathan, K.S. Sarikaya, B.* Some experience with the use
of formal specifications.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.* Publ. 433.*n.d.
016186 Bochmann, G.V. Raynal, M.* Structured specification of communicating
systems.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 428.*1982.
016187 Ferland, J.A. Lemaire, B.* Quadratic programming with one constraint and
bounded variables.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 429.*1981.
016188 Gecsei, J.* Montreal Keyword System.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 431.*1981.
016189 Jard, C. Bochmann, G.V.*An approach to testing specifications.* Montreal
U. Dept. d'Info. et de Recherche Operationnelle.*Publ. 430.*1981.
016190 Stewart, N.F.*Implementation of fixed-route based virtual circuits for
large networks.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 432.*1981.
016191 Gregory, R.T.*A Method for and application of error free computation.*
Tennessee U. Comp.Sci.Dept.*CS-81-52.* 1981.
016192 Gregory, R.T.*On residue arithmetic with rational operands.* Tennessee U.
Comp.Sci.Dept.*CS-80-47.*1980.
016193 Hughes, C.E. Selkow, S.M.*the finite power property for context free
languages.* Tennessee U. Comp.Sci.Dept.* CS-80-48.*1980.
016194 O'Kennon, M.R.*A functional language and a theoretical model for
implementation.* Tennessee U. Comp.Sci.Dept.* CS-81-51.*1981.
016195 Rao, T.M. Gregory, R.T.*The conversion of Hensel codes to rational
numbers.* Tennessee U. Comp.Sci.Dept.*CS-81-49.* 1981.
016196 Rao, T.M.*The problems of conversion, sign detection and maximal set for
p-adic number systems.* Tennessee U. Comp.Sci.Dept,.*CS-81-50.*1981.
016197 Christodoulakis, S.*Estimating selectivities in data bases.* Toronto U.
Comp. Systems Res. Group.*CSRG-136, Ph.D. Thesis. Christodoulakis,
S.*1981.
016198 Graham, M.H.*Satisfying database states.* Toronto U. Comp. Systems Res.
Group.*CSRG-137.*1981.
016199 Levesque, H.J.*A formal treatment of incomplete knowledge bases.* Toronto
U. Comp. Systems Res. Group.*CSRG-139, Ph.D. Thesis. Levesque,
H.J.*1982.
016200 Magalhaes, G.C.*Improving the performance of data base systems.* Toronto
U. Comp. Systems Res. Group.*CSRG-138, Ph.D. Thesis. Magalhaes,
G.C.*1981.
016201 Agrawal, R. DeWitt, D.J.*Further optimism in optimistic methods of
concurrency control.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 470.*1982.
016202 Boral, H. DeWitt, D.J. Bates, D.*A framework for research in database
management for statistical analysis.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 465.*1982.
016203 Desautels, E.*Producing Braille with a computer; a guide for people who
fear computers.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 469.*1982.
016204 Fujiwara, O. Han, S.-P. Mangasarian, O.L.* Local duality of nonlinear
programs.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 463.*1982.
016205 Johnson, D.S. Klug, A.*Optimizing conjunctive queries that contain
untyped variables.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 467.*1982.
016206 Kreiss, H.-O. Parter, S.V.*On the swirling flow between rotating coaxial
disks: existence and nonuniqueness.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 466.*1982.
016207 Bhat, K.V.S.*Algorithms for finding diagnosability level and t-diagnosis
in a network of processors.* Iowa U. Comp.Sci.Dept.*Tech.Rpt.
82-01.*1982.
016208 Geoffroy, A. Norman, D.A.*Ease of tapping the fingers in a sequence
depends on the mental encoding.* Cal U., San Diego. Human Info.Proces.
Center.*Rpt. 8203.*1982.
016209 Grudin, J.T.*Central control of timing in skilled typing.* Cal U., San
Diego. Human Info.Proces. Center.*Rpt. 8202.* 1982.
016210 Grudin, J.T. Larochelle, S.* Digraph frequency effects in skilled
typing.* Cal U., San Diego. Human Info.Proces. Center.*CHIP 110.*1982.
016211 Hille, G.*Methoden und Modelle in der Bildsegmentation Eine Uebersicht.*
Hamburg U. Fachbereich Informatik.*Bericht nr. 080.*1981.
016212 Jarke, M. Schmidt, J.W.*Evaluation of first-order relational
expressions.* Hamburg U. Fachbereich Informatik.*Bericht nr. 078.*1981.
016213 Rieger, N.*Implementation und Vergleich approximativer Verfahren zur
Analyse von geschlossenen Wartenetzen.* Hamburg U. Fachbereich
Informatik.*Bericht nr. 082.*1981.
016214 Shultz, R.K. Zingg, R.J.*A performance analysis of database computers.*
Iowa U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982.
016215 Technical Database Corp.*Report on industrial robots in japan, including
coverage of the 1981 International Industrial Robot Exhibition and
factory tour in Tokyo.*No issuing agency indicated (copies available
from: Technical Database Corp./P.O. Box 725/La Canada, California
91011).*1982.
VOL. 4, NO. 6 06/01/82
016216 Coughran, W.M. Herriot, J.G.*An algorithm to construct complete
interpolating splines.* Bell Labs.* Comp.Sci.Tech.Rpt. 101.*1981.
016217 Holbrook, B.D. Brown, W.S.*A history of computing research at Bell
Laboratories (1937-75).* Bell Labs.* Comp.Sci.Tech.Rpt. 099.*1982, 2nd
printing.
016218 Johnson, S.C. Ritchie, D.M.*The C language calling sequence.* Bell
Labs.*Comp.Sci.Tech.Rpt. 102.*1981.
016219 Kernighan, B.W.*A typesetter independent TROFF.* Bell
Labs.*Comp.Sci.Tech.Rpt. 097.*n.d.
016220 Kernighan, B.W.*Why Pascal is not my favorite programming language.* Bell
Labs.*Comp.Sci.Tech.Rpt. 100.*1981.
016221 Pavlidis, T.* Contour filling in raster graphics.* Bell
Labs.*Comp.Sci.Tech.Rpt. 096.*1981.
016222 Sethi, R.* Control flow aspects of semantics directed compiling.* Bell
Labs.*Comp.Sci.Tech.Rpt. 098.*1981.
016223 Van Wyk, C.J.* IDEAL user's manual.* Bell Labs.* Comp.Sci.Tech.Rpt.
103.*1981.
016224 Archer, J. Conway, R.* COPE: a cooperative programming environment.*
Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-459.*1981.
016225 Borodin, A. Von zur Gathen, J. Hopcroft, J.* Fast parallel matrix and GCD
computations.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-487.*1982.
016226 Cline, A.K. Conn, A.R. Van Loan, C.*Generalizing the LINPACK condition
estimator.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 81-462.*1981.
016227 Constable, R.L. Zlatin, D.R.*Report on the type theory (V3) of the
programming logic PL/CV3.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
81-454.*1981.
016228 Gries, D. Mills, H.* Swapping sections.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 81-452.*1981.
016229 Krafft, D.B. Demers, A.J.*Determining logical dependency in a decision
procedure for equality.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
81-458.*1981.
016230 Krol, J.S.*Simple error recovery scheme for optimized LR parsers.*
Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-456.* 1981.
016231 Leivant, D.*The optimality of induction as an axiomatization of
arithmetic.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 80-450.*1981.
016232 Lermen, C.W. Schneider, F.B.*Detecting distributed termination when
processors can fail.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 80-449.*1980.
016233 Melville, R.C.* Asymptotic complexity of iterative computations.* Cornell
U. Comp.Sci.Dept.*Tech.Rpt. 81-451, Ph.D. Thesis. Melville, R.C.*1981.
016234 Reps, T.*Optimal-time incremental semantic analysis for syntax directed
editors.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 81-453.*1981, revised.
016235 Wu, H. Salton, G.*A comparison of search term weighting: term relevance
vs. inverse document frequency.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
81-457.*1981.
016236 Appel, A. Chess, D.M.* PC by example.* IBM Watson Res. Center.*RA
133.*1981.
016237 Auslander, L. Feig, E. Winograd, S.* Abelian semi-simple algebras and
algorithms for the discrete fourier transform.* IBM Watson Res.
Center.*RC 9234.*1982.
016238 Bhattacharya, A.K.*The IBM Selective Sequence Electronics Calculator.*
IBM Watson Res. Center.*RC 9225.*1982.
016239 Bloom, S.L.* Elgot's analysis of monadic computation.* IBM Watson Res.
Center.*RC 9248.*1982.
016240 Bloom, S.L. Thatcher, J.W. Wagner, E.G. Wright, J.B.* Recursion and
iteration in continuous theories: the "M-construction".* IBM Watson Res.
Center.*RC 9184.* 1981.
016241 Brieger, L. Miranker, W.L.*Three applications of ultra-arithmetic.* IBM
Watson Res. Center.*RC 9235.*1982.
016242 Burge, W.H.* ISWIM programming manual.* IBM Watson Res. Center.*RA
129.*1981.
016243 Burkhardt, H. Barbosa, L.C.*Contributions to the application of the
Viterbi algorithm.* IBM Watson Res. Center.*RJ 3377.*1982.
016244 Burstein, M.* Partitioning of VLSI networks.* IBM Watson Res. Center.*RC
9180.*1981.
016245 Bux, W. Closs, F. Janson, P.A. Kuemmerle, K. Mueller, H.R. Rothauser,
E.H.*A local area communication network based on a reliable token ring
system.* IBM Watson Res. Center.* RZ 1117.*1981.
016246 Byrd, R.J. Smith, S.E. de Jong, S.P.*An actor based programming system.*
IBM Watson Res. Center.*RC 9204.* 1982.
016247 Carlson, E.D. Rhyne, J.R. Weller, D.L.*A design for a family of display
management systems.* IBM Watson Res. Center.*RJ 3372.*1982.
016248 Cullum, J. Willoughby, R.A. Lake, M.*A Lanczos algorithm for computing
singular values and vectors of large matrices.* IBM Watson Res.
Center.*RC 9166.*1981.
016249 Dolev, D. Trickley, H.*Embedding a tree on a line.* IBM Watson Res.
Center.*RJ 3368.*1982.
016250 Ekanadham, K. Nigam, A.*On serializability.* IBM Watson Res. Center.*RC
9257.*1981.
016251 Ercolano, J.L. Rosenthal, S.E.* Graphics compatibility system ( GCS)
primer: graphics by example.* IBM Watson Res. Center.*RA 134.*1981.
016252 Ercolano, J.L. Rosenthal, S.E.* RGRAFGA primer: graphics by example.* IBM
Watson Res. Center.*RA 135.*1981.
016253 Ferrante, J.* High level language debugging with a compiler.* IBM Watson
Res. Center.*RC 9210.*1982.
016254 Fratta, L.*An improved access protocol for data communication bus
networks with control wire.* IBM Watson Res. Center.*RJ 3401.*1982.
016255 Gazis, D.C. Mosco, V.* Videotex, the frontier of the information
explosion.* IBM Watson Res. Center.*RC 9170.* 1981.
016256 Geihs, K. Kobayashi, H.*Bounds on buffer overflow probabilities in
communication systems.* IBM Watson Res. Center.*RC 9275.*1982.
016257 Gupta, U.I. Lee, D.T. Wong, C.K.* Ranking and unranking of b-trees.* IBM
Watson Res. Center.*RC 9252.*1982.
016258 Jaffe, J.M.* Distributed multi-destination routing: the constraints of
local information.* IBM Watson Res. Center.*RC 9243.*1982.
016259 Jenny, C.J.*On the allocation of computational objects in distributed
systems.* IBM Watson Res. Center.*RZ 1123, Ph.D. Thesis. Jenny, C.J.
(Zurich University. Institut fuer Informatik).*1982.
016260 Kobayashi, H.*Communication network design and control algorithms - a
survey.* IBM Watson Res. Center.*RC 9233.* 1982.
016261 Kroll, Y. Levy, H. Markowitz, H.M.* Mean variance versus direct utility
maximization.* IBM Watson Res. Center.*RC 9176.*1981.
016262 Kuemmerle, K.* Local area communication networks - an overview.* IBM
Watson Res. Center.*RZ 1127.*1982.
016263 Lewis, C.*Using the "thinking-aloud" method in cognitive interface
design.* IBM Watson Res. Center.*RC 9265.* 1982.
016264 Lomet, D.B. Carter, W.C. Ellozy, H. Fortune, S. Kosinski, P.R. Markstein,
P.*A study of provably secure operating systems.* IBM Watson Res.
Center.*RC 9239.*1982.
016265 Lum, V.Y. Choy, D.M. Shu, N.C.* OPAS: an office procedure automation
system.* IBM Watson Res. Center.*RJ 3394.* 1982.
016266 Nigel, G. Martin, N. Langdon, G.G. Jr. Todd, S.J.P.* Arithmetic codes for
constrained channels.* IBM Watson Res. Center.*RJ 3381.*1982.
016267 Paul, G.*Studies in vector architecture.* IBM Watson Res. Center.*RC
9245.*1982.
016268 Raimondi, D.L. Alger, E.A. Martin, R.W. Swalen, J.D.*The automation of
laboratory operations using a distributed computing environment.* IBM
Watson Res. Center.*RJ 3387.* 1982.
016269 Rivlin, T.J.*On Walsh equiconvergence.* IBM Watson Res. Center.*RC
9260.*1982.
016270 Roth, J.P.*An application of the D-algorithm to minimization.,* IBM
Watson Res. Center.*RC 9219.*1982.
016271 Roth, J.P. Tsai, M.Y. Woo, L.S.* Pass transistor circuit failure
analysis.* IBM Watson Res. Center.*RC 9249.*1982.
016272 Rudin, H.* Validation of a token ring protocol.* IBM Watson Res.
Center.*RZ 1119.*1981.
016273 Rudin, H. West, C.H.*A validation technique for tightly-coupled
protocols.* IBM Watson Res. Center.*RZ 1114.*1981.
016274 Schkolnick, M. Tiberio, P.*A note on estimating the maintenance cost in a
relational database.* IBM Watson Res. Center.*RJ 3327.*1981.
016275 Simons, B. Sipser, M.*On scheduling unit time jobs with multiple release
time/deadline intervals.* IBM Watson Res. Center.*RJ 3236.*1981.
016276 Sporer, A.H.*The impact of digital storage on micrographic storage.* IBM
Watson Res. Center.*RJ 3383.*1982.
016277 Todd, S.J.P. Langdon, G.G. Jr. Martin, G.N.N.*A general fixed-rate
arithmetic coding method for constrained channels.* IBM Watson Res.
Center.*RJ 3382.*1982.
016278 Visvanathan, V. Hachtel, G.D.*An optimization based approach to model
simplification.* IBM Watson Res. Center.*RC 9175.*1981.
016279 Wahl, F.M.*A new distance mapping and its use for shape measurement on
binary patterns.* IBM Watson Res. Center.* RJ 3361.*1982.
016280 Wegman, M. Alberga, C.N.* Parsing for a structural editor (part ii).* IBM
Watson Res. Center.*RC 9197.*1982.
016281 Wong, W.W. Wong, C.K.* Minimum k-hamiltonian graphs.* IBM Watson Res.
Center.*RC 9254.*1982.
016282 Yu, P.S.* Interconnection structures of backend storage networks.* IBM
Watson Res. Center.*RC 9165.*1981.
016283 MacEwen, G.H.* Specification prototyping.* Queen's U. Computing &
Info.Sci.Dept.*Tech.Rpt. 82-135.*1982.
016284 Meijer, H.*An exponential lower bound on the complexity of the
cryptographic knapsack problem.* Queen's U. Computing &
Info.Sci.Dept.*Tech.Rpt. 82-137.*1982.
016285 Pennycook, B.W.*Computer music at Queen's University.* Queen's U.
Computing & Info.Sci.Dept.*Tech.Rpt. 82-136.* 1982.
016286 Amarel, S.*Expert behavior and problem representations.* Rutgers U.
Comp.Sci.Res.Lab.*CBM-TR-126.*1982.
016287 Bresina, J.L.*An interactive planner that creates a structured, annotated
trace of its operation.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-123.*1981.
016288 Gerasoulis, A.* Nystrom's interpolation formula in the solution of
singular integral equations discretized by the Gauss Jacobi quadrature.*
Rutgers U. Comp.Sci.Dept.* DCS-TR-111.*1982.
016289 Goldberg, R.N.* Software design issues in the architecture and
implementation of distributed text editors.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-110, Ph.D. Thesis. Goldberg, R.N.*1982.
016290 Hall, J.S.*System design and programming methodology for a CAM based
general purpose computer.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-016.*1981.
016291 Lafue, G.M.E.* Semantic integrity dependencies and delayed integrity
checking.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-026.*1982.
016292 Lockman, A. Klappholz, D.*The control of inferencing in natural language
understanding.* Rutgers U. Comp.Sci.Dept.*DCS-TR-114.*1982.
016293 McCarty, L.T. Sridharan, N.S.*A computational theory of legal argument.*
Rutgers U. Comp.Sci.Res.Lab.*LRP-TR-013.* 1982.
016294 Mitchell, T.M.* AI research at Rutgers.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-025.*1982.
016295 Mitchell, T.M.*Toward combining empirical and analytical methods for
inferring heuristics.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-027.*1982.
016296 Paige, R. Koenig, S.* Finite differencing of computable expressions.*
Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-008.* 1981, revised.
016297 Politakis, P. Weiss, S.M.*Designing consistent knowledge bases: an
approach to expert knowledge acquisition (working paper).* Rutgers U.
Comp.Sci.Res.Lab.* CBM-TR-113.*1980.
016298 Sridharan, N.S.* AIMDS: applications and performance enhancements.*
Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-093.* 1982.
016299 Sridharan, N.S. Bresina, J.L.* Plan formation in large, realistic
domains.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-127.*1982.
016300 Cox, M.G.*Practical spline approximation.* U.K. National Physical Lab.
Info. Technology and Computing Div.*DITC 1/82.*1982.
016301 Ferriss, D.H.*Numerical determination of the configuration of an
underwater umbilical subjected to steady hydrodynamic loading.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
2/82.*1982.
016302 Symm, G.T.*A critical evaluation of various methods for the solution of
Laplace's equation.* U.K. National Physical Lab. Num.Anal. &
Comp.Sci.Div.*DNACS 54/81.*1981.
016303 Lai, H.C. Muroga, S.* Logic networks of carry-save adders.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1080.*1982.
016304 McKendry, M.S.*Language mechanisms for context switching and protection
in level structured operating systems.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-81-1078, Ph.D. Thesis. McKendry, M.S.*1981.
016305 Smolarski, D.C.*Optimum semi-iterative methods for the solution of any
linear algebraic system with a square matrix.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-81-1077, Ph.D. Thesis. Smolarski, D.C.*1981.
016306 Cristian, F.* Exception handling and software fault tolerance.* Newcastle
upon Tyne U. Computing Lab.*No. 173.*1982.
016307 Shrivastava, S.K. Panzieri, F.*The design of a reliable remote procedure
call mechanism.* Newcastle upon Tyne U. Computing Lab.*No. 171.*1981.
016308 Treleaven, P.C.* VLSI processor architectures.* Newcastle upon Tyne U.
Computing Lab.*No. 172.*1982.
016309 Bieger, G.R. Glock, M.D.*The information content of picture text assembly
instructions.* Cornell U. Education Dept.* Tech.Rpt. 05.*1982.
024900 Blum, R.L.*Discovery and representation of causal relationships from a
large time-oriented clinical database: the RX Project.* Stanford U.
Comp.Sci.Dept.* STAN-CS-82-900, Ph.D. Thesis. Blum, R.L.*1982.
016310 Clifford, J. Warren, D.S.* Formal semantics for time in databases.* SUNY,
Stony Brook. Comp.Sci.Dept.*Tech.Rpt. 81/025.*1981, revised.
016311 Culik, K.*Proving optimal relative utilization of resources and other
properties of parallel programs.* Wayne State U.
Comp.Sci.Dept.*CSC-82-010.*1982.
016312 Dahlquist, G.*On the local and global errors of one-leg methods.* Royal
Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8110.*1981.
016313 Gifford, D.K.* Information storage in a decentralized computer system.*
Xerox. Palo Alto Res. Center.* CSL-81-08, Ph.D. Thesis. Gifford,
D.K.*1982, revised.
016314 Hu, Y.-S.* Global estimation of the Lebesque constant for polynomial
interpolation on an equidistant grid.* Royal Inst. of Tech., Stockholm.
Num.Anal. & Computing Sci.Dept.*TRITA-NA-8203.*1982.
016315 Jayaramamurthy, S.N. Jain, R.*An approach for the segmentation of
textured dynamic scenes.* Wayne State U.
Comp.Sci.Dept.*CSC-82-009.*1982.
016316 Kambayashi, Y.*Proceedings of the Conference on Consecutive Retrieval
Property: Theory and Applications, Warsaw, August 18-20, 1981. Parts
1-2. Edited by Yahiko Kambayashi.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 438.*1981. 2 volumes.
024903 McCarthy, J.* Coloring maps and the Kowalski doctrine.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-903; Stanford U. Comp.Sci.Dept. A.I.
Lab.*AIM-346.*1982.
016318 McCreight, E.M.* Priority search trees.* Xerox. Palo Alto Res.
Center.*CSL-81-05.*1982.
016319 Mann, W.C. Bates, M. Grosz, B.J. McDonald D.D. McKeown, K.R. Swartout,
W.R.* Text generation: the state of the art and the literature.*
Southern Cal U. Info.Sci.Inst.* ISI/RR-81-101.*1981.
024902 Manna, Z. Waldinger, R.*Special relations in program-synthetic
deduction.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-902; Stanford U.
Comp.Sci.Dept. A.I. Lab.* AIM-345.*1982.
016322 Sakarovitch, J. Nishida, T. Kobuchi, Y.* Recurrent words for
substitution.* Kyoto U. Res.Inst.Math.Sci.*RIMS-396.* 1982.
VOL. 4, NO. 7 06/23/82
016323 Bergstra, J.A. Klop, J.W.* Initial algebra specifications for
parametrized data types.* Mathematisch Centrum.*IW 186/81.*1981.
016324 Brent, R.P. Lune, J. van de. Te Riele, H.J.J. Winter, D.T.* On the zero
of the Riemann zeta function.* Mathematisch Centrum.*NW 121/82.*1982.
016325 Brunner, H. Te Riele, H.J.J.*Volterra-type integral equations of the
second kind with non-smooth solutions: high-order methods based on
collocation techniques.* Mathematisch Centrum.*NW 118/82.*1982.
016326 Hemker, P.W.*Mixed defect correction iteration for the accurate solution
of the convection diffusion equation.* Mathematisch Centrum.*NW
122/82.*1982.
016327 Hemker, P.W.*An accurate method without directional bias for the
numerical solution of a 2-D elliptic singular perturbation problem.*
Mathematisch Centrum.*NW 117/81.* 1981.
016328 Lenstra, A.K.* Lattices and factorization of polynomials.* Mathematisch
Centrum.*IW 190/81.*1981.
016329 Meertens, L.G.L.T.*Definition of an abstract ALGOL 68 machine.*
Mathematisch Centrum.*IW 188/81.*1981.
016330 Meertens, L.G.L.T.*Draft proposal for the B programming language.*
Mathematisch Centrum.*1981.
016331 Meertens, L.G.L.T. Vliet, J.C. van.*On the MC ALGOL 68 compiler.*
Mathematisch Centrum.*IW 189/81.*1981.
016332 Noot, H.* Structured text formatting.* Mathematisch Centrum.*IW
191/82.*1982.
016333 Sint, H.J.* MIDL - a microinstruction description language.* Mathematisch
Centrum.*IW 187/81.*1981.
016334 Vries, H.B. de.*Two-step splitting methods for semi-discrete second order
hyperbolic partial differential equations.* Mathematisch Centrum.*NW
120/82.*1982.
016335 Wolff, H.* Multiple grid method for the calculation of potential flow
around 3-D bodies.* Mathematisch Centrum.* NW 119/82.*1982.
016336 Cottle, R.W.*Application of a block successive overrelaxation method to a
class of constrained matrix problems.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 81-20.*1981.
016337 Friedman, J.H. Wright, M.H.*An adaptive importance sampling procedure.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-23.*1981.
016338 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*A procedure for
computing forward-difference intervals for numerical optimization.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-25.*1981.
016339 Hu, T.C. Shing, M.T.*Multi-terminal flows in outerplanar networks.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 81-19.*1981.
016340 McCormick, S.T.*Optimal approximation of sparse Hessians and its
equivalence to a graph coloring problem.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 81-22.*1981.
016341 Tovey, C.A.*Polynomial local improvement algorithms in combinatorial
optimization.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
81-21.*1981.
016342 Findler, N.V. Brown, J.E. Lo, R. Han, Y.Y.*A module to estimate numerical
values of hidden variables for expert systems.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 190; SUNY, Buffalo. Comp.Sci.Dept. Comp.
Studies of Strategies Group.*Tech.Rpt. 004.*1981.
016343 Findler, N.V. Morgado, E.* Morph fitting -- an effective technique of
approximation.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 188; SUNY,
Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.* Tech.Rpt.
002.*1981.
016344 Findler, N.V. Mazur, N. McCall, B.*A note on computing the asymptotic
form of a limited sequence of decision trees.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 189; SUNY, Buffalo. Comp.Sci.Dept. Comp.
Studies of Strategies Group.*Tech.Rpt. 003.*1981.
016345 Findler, N.V.*An overview of the quasi-optimizer system.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 196; SUNY, Buffalo. Comp.Sci.Dept. Comp.
Studies of Strategies Group.*Tech.Rpt. 007.*1982.
016346 Findler, N.V.*A preliminary report on a multi-level learning technique
using production systems.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 187;
SUNY, Buffalo. Comp.Sci.Dept. Comp. Studies of Strategies Group.*
Tech.Rpt. 001.*1981.
016347 Findler, N.V.*Toward a theory of strategies.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 194; SUNY, Buffalo. Comp.Sci.Dept. Comp.
Studies of Strategies Group.* Tech.Rpt. 006.*1981.
016348 Moriya, S.*An algebraic structure theory of rule sets I: a formalization
of both production systems and decision tables.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 195.* 1982.
016349 Shubin, H.* Inference and control in multiprocessing environments.* SUNY,
Buffalo. Comp.Sci.Dept.*Tech.Rpt. 186.*1981.
016350 Sicherman, G.L.*The advice-taker/inquirer.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 193; SUNY, Buffalo. Comp.Sci.Dept. Comp.
Studies of Strategies Group.* Tech.Rpt. 005.*1981.
016351 Srihari, R.K.*Combining path-based and node-based inference in SNEPS.*
SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 183.* 1981.
016352 Srihari, S.N. Hull, J.J. Choudhari, R.*An algorithm for integrating
diverse knowledge sources in text recognition.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 192.*1981.
016353 Srihari, S.N. Hull, J.*Experiments in text recognition with binary n-gram
and viterbi algorithms.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt.
184.*1981.
016354 Srihari, S.N. Yau, M.-M.*A hierarchical data structure for
multidimensional digital images.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 185.*1981.
016355 Srihari, S.N. Bozinovic, R.*A string correction algorithm for cursive
script recognition.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.Rpt. 181.*1981.
016356 Broy, M. Pepper, P. Wirsing, M.*On the algebraic definition of
programming languages.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8204.*1982.
016357 Castrigiano, D.P.L.* Causal transformations of Wightman localizations.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8112.*1981.
016358 Eichholz, S.*Zur Verteilung von nichtsequentiellen Programmen auf
Rechnernetze unter Beruecksichtigung der Realisierbarkeit.* Technische
Universitaet Muenchen. Institut fuer Informatik.*TUM-I8205.*1982.
016359 Friede, D.* Partitioned context free grammars.* Technische Universitaet
Muenchen. Institut fuer Informatik.* TUM-I8115.*1981.
016360 Groeger, D.* Beitraege zur Geometrie und Algebra, Nr. 7: Ueber
Angeordnete Fastkoerper, von D. Groeger.* Technische Universitaet
Muenchen. Institut fuer Mathematik.*TUM-M8201.*1982.
016361 Lasser, R.* Orthogonal polynomials and hypergroups: contributions to
analysis and probability theory.* Technische Universitaet Muenchen.
Institut fuer Mathematik.*TUM-M8110.*1981.
016362 Laut, A.*Von abstrakter Syntax zu verketteten Baeumen - Entwicklung einer
Datenstruktur fuer die Programm-Manipulation.* Technische Universitaet
Muenchen. Institut fuer Informatik.*TUM-I8114.*1981.
016363 Riedel, N.*An example on strong shift equivalence of positive integral
matrices.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8203.*1982.
016364 Tempelmeier, T.*Antwortzeitverhalten eines Echtzeit-Rechensystems bei
Auslagerung des Betriebssystemkerns auf einen eigenen Prozessor. Teil 2:
Messergebnisse.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8201.*1982.
016365 Vogel, H.*A term calculus of deterministic data flow nets.* Technische
Universitaet Muenchen. Institut fuer Informatik.*TUM-I8203.*1982.
016366 Wildgruber, R.*ROMEO: ein Mehrrechner-Echtzeit-Betriebssystem.*
Technische Universitaet Muenchen. Institut fuer Informatik.*
TUM-I8116.*1981.
016371 Guttman, A. Stonebraker, M.*Using a relational database management system
for computer aided design data.* Cal U., Berkeley. Electronics
Res.Labs.*Memo. no. UCB/ERL-M82/37.*1982.
016372 Hawthorne, P. Stonebraker, M.*The use of technological advances to
enhance data management system performance.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. no. UCB/ERL-M79/03.*1979.
016375 Rowe, L.A. Shoens, K.A.*A form application development system.* Cal U.,
Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M82/38.*1982.
016376 Skeen, D.*A decentralized termination protocol.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. no. UCB/ERL-M81/50.* 1981.
016378 Skeen, D.* Nonblocking commit protocols.* Cal U., Berkeley. Electronics
Res.Lab.*Memo. no. UCB/ERL-M81/11.* 1981.
016379 Stonebraker, M.*Application of artificial intelligence techniques to
database systems.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no.
UCB/ERL-M82/31.*1982.
016380 Stonebraker, M. Stettner, H. Kalash, J. Guttman, A. Lynn, N.* Document
processing in a relational data base system.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. no. UCB/ERL-M82/32.*1982.
016384 Stonebraker, M. Woodfill, J. Ranstrom, J. Murphy, M. Meyer, M. Allman,
E.*Performance enhancements to a relational data base system.* Cal U.,
Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/62.*1982, revised.
016386 Stonebraker, M. Kalash, J.* TIMBER: a sophisticated relational browser.*
Cal U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL-M81/94.*1982,
revised.
016388 Woodfill, J. Siegal, P. Ranstrom, J. Meyer, M. Allman, E.* INGRES version
7 reference manual.* Cal U., Berkeley. Electronics Res.Lab.*Memo. no.
UCB/ERL-M81/61.*1981.
016389 Davis, L.S. Kunii, T.L.* Pattern databases.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 81-05.*1981.
016390 Enomoto, H. Yoshizawa, M.*On block-schematic Steiner systems.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 81-06.*1981.
016391 Enomoto, H.*The linear arboricity of 5-regular graphs.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 81-19.*1981.
016392 Imori, M. Yamada, H.*A noninjective mapping of periodic sequences by
cellular automata.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 81-11.*1981.
016393 Ishikawa, C. Sakamura, K. Maekawa, M.* Adaptation and personalization of
vlsi-based computer architecture.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
81-22.*1981.
016394 Kawai, S.*On topology preservation property of local parallel
operations.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-16.*1981.
016395 Kawai, S.*A proof method with program and data structure transformation.*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 81-03.*1981.
016396 Kitagawa, H. Kunii, T.L.* APAD: application adaptable database system -
its architecture and design.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
81-04.*1981.
016397 Kotoh, K. Yamada, H.*An incompleteness problem on a tessellation
automaton with injective functions.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
81-10.*1981.
016398 Sasaki, T. Murao, H.*Efficient Gaussian elimination method for symbolic
determinants and linear systems.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
81-09.*1981.
016399 Sato, M.*Theory of symbolic expressions, I.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 81-13.*1981.
110781 de Boor, C. deVore, T.*Approximation by smooth multivariate splines.*
Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2319.*1982.
Microfiche.
110782 de Boor, C. Hoellig, K.*B-splines from parallelepipeds.* Wisconsin U.
Math.Res. Center.*MRC Tech.Sum.Rpt. 2320.* 1982. Microfiche.
110783 de Boor, C. Jia, R.-Q. Pinkus, A.*Structure of invertible (bi)infinite
totally positive matrices.* Wisconsin U. Math.Res. Center.*MRC
Tech.Sum.Rpt. 2311.*1981. Microfiche.
110787 Dyn, N.*A new class of Hermite Birkhoff quadrature formulas of Gaussian
type.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2314.*1981.
Microfiche.
110788 Dyn, N. Ferguson, W.E.*The numerical solution of a class of constrained
minimization problems.* Wisconsin U. Math.Res. Center.*MRC
Tech.Sum.Rpt. 2340.*1982. Microfiche.
110791 Fujiwara, O. Han, S.-P. Mangasarian, O.L.*Local duality of nonlinear
programs.* Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2329.*1982.
Microfiche.
110794 Jia, R.-Q.*L subscript infinity upper bound of L subscript 2 projections
onto splines at a geometric mesh.* Wisconsin U. Math.Res. Center.*MRC
Tech.Sum.Rpt. 2335.* 1982. Microfiche.
110795 Jia, R.-Q.*On a conjecture of C.A. Micchelli concerning cubic spline
interpolation at a biinfinite knot sequence.* Wisconsin U. Math.Res.
Center.*MRC Tech.Sum.Rpt. 2334.* 1982. Microfiche.
110811 Markowich, P.* Difference methods for parabolic history value problems.*
Wisconsin U. Math.Res. Center.*MRC Tech.Sum.Rpt. 2346.*1982.
Microfiche.
110818 Schoenberg, I.J.*A new approach to Euler splines II.* Wisconsin U.
Math.Res. Center.*MRC Tech.Sum.Rpt. 2313.* 1981. Microfiche.
016400 Chinosi, C. Della Croce, L. Marini, L.D. Sacchi, G. Scapolla, T.* PIRE:
a library of programs for plate bending problems - users manual.*
Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto de Analisi
Numerica.*Pubblicazioni n. 306.*1981.
016401 Gazzaniga, G. Ironi, L.*LANFIT: un package grafico interattivo per
l'approxximazione de dati sperimentali.* Consiglio Nazionale delle
Ricerche, Pavia, Italy. Istituto de Analisi Numerica.*Pubblicazioni n.
262.*1980.
016402 Gifford, D.K.* Cryptographic sealing for information secrecy and
authentication.* Xerox. Palo Alto Res. Center.*CSL-82-01.*1982.
024888 Gropp, W.D.*Numerical solution of transport equations.* Stanford U.
Comp.Sci.Dept.*STAN-CS-81-888, Ph.D. Thesis. Gropp, W.D.*1981. 104
pages.
016403 Gueting, R.H.*An optimal contour algorithm for iso-oriented rectangles.*
McMaster U. Comp.Sci. Unit.*Comp.Sci. Tech.Rpt. no. 82-CS-03.*1982.
016404 Han, S.-P. Mangasarian, O.L.*Conjugate cone characterization of positive
definite and semidefinite matrices.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 471.* 1982.
016405 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a
special case).* Kyoto U. Res.Inst.Math.Sci.* RIMS-398.*1982.
016406 Jones, D.W.* Machine independent SMAL: a symbolic macro assembly
language.* Iowa U. Comp.Sci.Dept.*Tech.Rpt. 82-03.*1982.
016407 Klug, A.* ABE: a query language for constructing aggregates-by-example.*
Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 475.*1982.
016408 Klug, A.* Access paths in the "ABE" statistical query facility.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 474.* 1982.
016409 Lursinsap, C.*Automatic layout generation for if and case structures.*
Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1082.*1982.
016410 Niezgodka, M. Pawlow, I. Visintin, A.*On multi-phase Stefan type problems
with nonlinear flux at the boundary in several space variables.*
Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi
Numerica.* Pubblicazioni n. 293.*1981.
016412 Vilnrotter, F.M.D.* Structural analysis of natural textures.* Southern
Cal U. E.E. Dept. & Comp.Sci.Dept. Intelligent Systems Group.* USCISG
100; USCIPI 1040, Ph.D. Thesis. Vilnrotter, F.M.D.*1981.
016413 Yokomori, T. Wood, D.*Some representation theorems in terms of L
languages.* McMaster U. Comp.Sci. Unit.*Comp.Sci. Tech.Rpt. no.
82-CS-02.*1982.
VOL. 4, NO. 8 07/15/82
016414 Chazelle, B.*The bottom-left bin-packing heuristic.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-104.*1981.
016415 Chazelle, B.*An improved algorithm for fixed-radius neighbor problem.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-109.*1982.
016416 Chazelle, B.*The polygon containment problem.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-106.*1981.
016417 Leiserson, C.E.*Area-efficient VLSI computation.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-108, Ph.D. Thesis. Leiserson, C.E.*1981.
016418 McDonald, D.B.*Understanding noun compounds.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-102, Ph.D. Thesis. McDonald, D.B.*1982.
016419 Sproull, R.F. Sutherland, I.E. Thompson, A. Gupta, S. Minter, C.*The 8
by 8 display.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-105.*1981.
016420 Berestycki, H. Fernandez Cara, E. Glowinski, R.*A numerical study of some
questions in vortex rings theory.* INRIA.* Rapport de Recherche
116.*1982.
016421 Bernadou, M. Ducatel, Y.* Approximation of general arch problems by
straight beam elements.* INRIA.*Rapport de Recherche 120.*1982.
016422 Boudol, G. Kott, L.* Recursion induction principle revisited.*
INRIA.*Rapport de Recherche 115.*1982.
016423 Gardarin, G. Melkanoff, M.* Concurrency control principles in distributed
and centralized databases.* INRIA.* Rapport de Recherche 113.*1982.
016424 Gardarin, G. Valduriez, P.* Join and semi-join algorithms for a
multiprocessor database machine.* INRIA.*Rapport Technique 011.*1982.
016425 Gelenbe, E. Gardy, D.*On the size of projections: II. The case of a
single functional dependency.* INRIA.*Rapport de Recherche 117.*1982.
016426 Herskovits, J.*A two-stage feasible direction algorithm including
variable metric techniques for nonlinear optimization problems.*
INRIA.*Rapport de Recherche 118.* 1982.
016427 Janet, E.*Analyse du langage employe dans les communications d'un systeme
de controle.* INRIA.*Rapport Technique 012.*1982.
* 016428 Katai, O.* Completeness and the expressive power of nexttime temporal
logical system by semantic tableau method.* INRIA.*Rapport de Recherche
109.*1981.
016429 Lichnewsky, A.*Sur la resolution de systemes lineaires issus de la
methode des elements finis par une machine "multiprocesseur".*
INRIA.*Rapport de Recherche 119.* 1982.
016430 Samson, C.* Stability analysis of adaptively controlled not-necessarily
minimum phase systems with disturbances.* INRIA.*Rapport de Recherche
110.*1982.
016431 Schroeder, A.*Outils de mesures de programmes PASCAL: manuel
d'utilisation.* INRIA.*Rapport Technique 010.* 1982.
016432 Church, K. Patil, R.*Coping with syntactic ambiguity or how to put the
block in the box on the table.* M.I.T. Lab. for Comp.Sci.*TM-216.*1982.
016433 Elias, P.* Minimax optimal universal codeword sets.* M.I.T. Lab. for
Comp.Sci.*TM-212.*1982.
016434 Greif, I.*Cooperative office work, teleconferencing and calendar
management: a collection of papers (presented at conferences).* M.I.T.
Lab. for Comp.Sci.*TM-218.*1982.
016435 Grief, I.* PCAL: a personal calendar.* M.I.T. Lab. for
Comp.Sci.*TM-213.*1982.
016436 Leiserson, C.E. Saxe, J.B.*Optimizing synchronous systems.* M.I.T. Lab.
for Comp.Sci.*TM-215.*1982.
016437 Meyer, A.R. Mitchell, J.C.* Termination assertions for recursive
programs: completeness and axiomatic definability.* M.I.T. Lab. for
Comp.Sci.*TM-214.*1982.
016492 Wright, K.D.*A file transfer program for a personal computer.* M.I.T.
Lab. for Comp.Sci.*TM-217.*1982.
020259 Bryant, R.E.*A switch-level simulation model for integrated logic
circuits.* M.I.T. Lab. for Comp.Sci.*TR-259, Ph.D. Thesis. Bryant,
R.E.*1981.
020257 Cesari, C.A.*Application of data flow architecture to computer music
synthesis.* M.I.T. Lab. for Comp.Sci.* TR-257.*1981.
020273 Estrin, D.L.* Data communications via cable television networks:
technical and policy considerations.* M.I.T. Lab. for
Comp.Sci.*TR-273.*1982.
020256 Faust, G.G.*Semiautomatic translation of COBOL to HIBOL.* M.I.T. Lab. for
Comp.Sci.*TR-256.*1981.
020268 Guttag, J.V. Kapur, D. Musser, D.R.* Derived pairs, overlap closures, and
rewrite dominoes: new tools for analyzing term rewriting systems.*
M.I.T. Lab. for Comp.Sci.* TR-268.*n.d.
020269 Kanellakis, P.C.*The complexity of concurrency control for distributed
databases.* M.I.T. Lab. for Comp.Sci.* TR-269, Ph.D. Thesis. Kanellakis,
P.C.*1981.
020254 Ruth, G. Alter, S. Martin, W.*A very high level language for business
data processing.* M.I.T. Lab. for Comp.Sci.* TR-254.*n.d.
020271 Rutherford, C.J. Davies, B. Barnett, A.I. Desforges, J.F.*A computer
system for decision analysis in Hodgkins disease.* M.I.T. Lab. for
Comp.Sci.*TR-271.*1981.
020258 Singh, N.P.*A design methodology for self-timed systems.* M.I.T. Lab. for
Comp.Sci.*TR-258.*1981.
020270 Singh, V.*The design of a routing service for campus-wide internet
transport.* M.I.T. Lab. for Comp.Sci.*TR-270.* 1981.
020272 Smith, B.C.* Reflection and semantics in a procedural language.* M.I.T.
Lab. for Comp.Sci.*TR-272, Ph.D. Thesis. Smith, B.C.*1982.
016438 Bassein, R.*The influence of program dynamics on performance.* Cal U.,
Berkeley. Electronics Res.Lab.* Memo. No. UCB/ERL-M82/33; Cal U.,
Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.5.*1982.
016439 Dutt, C.R. Ferrari, D.*Characterizing and reproducing program referencing
dynamics.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M82/20; Cal U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 82.4.* 1982.
016440 Ferrari, D. Yih, Y.-Y.* VSWS: the variable-interval sampled working set
policy.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M82/16; Cal U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 82.3.*1982.
016441 Hagmann, R. Fabry, R.* Program page reference patterns.* Cal U.,
Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M82/15; Cal U.,
Berkeley. Electronics Res.Lab. PROGRES Group.*Rpt. 82.2.*1982.
016442 Paris, J.-F. Ferrari, D.*An analytical study of strategy-oriented
restructuring algorithms.* Cal U., Berkeley. E.E. &
Comp.Sci.Dept.*CSD-TR-395; Cal U., Berkeley. Electronics Res.Lab.
PROGRES Group.*Rpt. 82.1.* 1982.
016443 Abrams, M. Chu, Y.* Ada program reader 2: an I/O system.* Maryland U.
Comp.Sci. Center.*TR-1089.*1981.
016444 Abrams, M. Chu, Y.* Ada program reader 3: an output spooling system.*
Maryland U. Comp.Sci. Center.*TR-1094.* 1981.
016445 Abrams, M. Chu, Y.* Direct execution of JOVIAL subroutines.* Maryland U.
Comp.Sci. Center.*TR-1102.*1981.
016446 Abrams, M. Chu, Y.* Program representation in direct execution
computers.* Maryland U. Comp.Sci. Center.* TR-1110.*1981.
016447 Abrams, M. DiIenno, T. Chu, Y.*Proposed enhancement of Nebula instruction
set.* Maryland U. Comp.Sci. Center.* TR-1074.*1981.
016448 Agre, J.R.*Approximate solutions to queueing networks with state
dependent parameters.* Maryland U. Comp.Sci. Center.*TR-1092, Ph.D.
Thesis. Agre, J.R.*1981.
016449 Allen, E.M.* ISFL: the I-space frame language.* Maryland U. Comp.Sci.
Center.*TR-1100.*1981.
016450 Chu, Y. Abrams, M.*Low-level and high-level computer architectures.*
Maryland U. Comp.Sci. Center.*TR-1101.* 1981.
016451 Dunn, S. Janos, L. Rosenfeld, A.* Bimean clustering.* Maryland U.
Comp.Sci. Center.*TR-1106.*1981.
016452 Hartley, R.L. Kitchen, L.J. Wang, C.-Y. Rosenfeld, A.*A comparative study
of segmentation algorithms for FLIR images.* Maryland U. Comp.Sci.
Center.*TR-1104.*1981.
016453 Itano, K.* CDL design of a pipelined lexical scanner.* Maryland U.
Comp.Sci. Center.*TR-1093.*1981.
016454 Lor, K.-W.E. Chu, Y.*Design of a PASCAL interactive direct execution
computer.* Maryland U. Comp.Sci. Center.* TR-1088.*1981.
016455 Minker, J.*On indefinite databases and the closed world assumption.*
Maryland U. Comp.Sci. Center.*TR-1076.* 1981.
016456 Narayanan, K.A. O'Leary, D.P. Rosenfeld, A.*An optimization approach to
edge reinforcement.* Maryland U. Comp.Sci. Center.*TR-1109.*1981.
016457 O'Leary, D.P. Peleg, S.*Digital image compression by outer product
expansion.* Maryland U. Comp.Sci. Center.* TR-1108.*1981.
016458 Pietikaeinen, M. Rosenfeld, A. Davis, L.S.* Texture classification using
averages of local pattern matches.* Maryland U. Comp.Sci.
Center.*TR-1098.*1981.
016459 Prazdny, K.*Computing motions of (locally) planar surfaces from
spatio-temporal changes in image brightness: a note.* Maryland U.
Comp.Sci. Center.*TR-1090.*1981.
016460 Rieger, C.J.*From office automation to personal automation: an AI
perspective.* Maryland U. Comp.Sci. Center.* TR-1085.*1981.
016461 Rieger, C. Bane, R. Stanfill, C. Trigg, R. Weiser, M.*Three ZMOB papers
for the CAPAIDM Hot Springs Conference.* Maryland U. Comp.Sci.
Center.*TR-1099.*1981. CONTENTS: ZMOB: doing it in parallel!, by Chuck
Rieger; Operating system strategy on ZMOB, by Robert Bane, Craig
Stanfill, and Mark Weiser; Software on ZMOB: an object oriented
approach, by Randy Trigg.
016462 Sun, H.* Image registration by combining feature matching and gray level
correlation.* Maryland U. Comp.Sci. Center.*TR-1091.*1981.
016463 Tang, C.-S.*Expressing the formal semantics of CSP and CP or ADA tasking
with the temporal logic language XYZ/E.* Maryland U. Comp.Sci.
Center.*TR-1107.*n.d.
016464 Thareja, A.K. Agrawala, A.K.*On the design of optimal policy for sharing
finite buffers.* Maryland U. Comp.Sci. Center.*TR-1081.*1981.
016465 Thareja, A.K. Tripathi, S.K. Upton, R.A.*On updating buffer allocation.*
Maryland U. Comp.Sci. Center.*TR-1103.*1981.
016466 Thrift, P.R. Dunn, S.M.*Approximating point set images by line segments
using a variation of the Hough transform.* Maryland U. Comp.Sci.
Center.*TR-1105.*1981.
016467 Wang, C.-Y. Rosenfeld, A.* Elevation texture.* Maryland U. Comp.Sci.
Center.*TR-1086.*1981.
016468 Wang, C.-Y. Sun, H. Yada, S. Rosenfeld, A.*Some experiments in relaxation
image matching using corner features.* Maryland U. Comp.Sci.
Center.*TR-1071.*1981.
016469 Wu, Z.-Q. Rosenfeld, A.*Filtered projections as an aid in corner
detection.* Maryland U. Comp.Sci. Center.* TR-1078.*1981.
110825 Beck, J. Prazdny, S. Rosenfeld, A.*A theory of textural segmentation.*
Maryland U. Comp.Sci. Center.*TR-1083.* 1981. Microfiche.
110826 Chellappa, R.*Synthesis of textures using simultaneous autoregressive
models.* Maryland U. Comp.Sci. Center.* TR-1084.*1981. Microfiche.
110827 Dowdy, L.W. Gordon, K.D.*Algorithms for nonintegral degrees of
multiprogramming in closed queueing networks.* Maryland U. Comp.Sci.
Center.*TR-1075.*1981. Microfiche.
110828 Dunn, S.M.* Texture classification with change point statistics.*
Maryland U. Comp.Sci. Center.*TR-1082.* 1981. Microfiche.
110829 Grant, J.* Normalization of relational database theories by adequate
decomposition.* Maryland U. Comp.Sci. Center.* TR-1001.*1981.
Microfiche.
110830 Kasif, S. Rosenfeld, A.* Pyramid linking as a special case of ISODATA.*
Maryland U. Comp.Sci. Center.*TR-1096.* 1981. Microfiche.
110831 Kim, C.E.* Three dimnesional digital line segments.* Maryland U.
Comp.Sci. Center.*TR-1087.*1981. Microfiche.
110832 Kitchen, L. Krishnamurthy, E.V.*Fast, parallel, relaxation screening for
chemical patent data base search.* Maryland U. Comp.Sci.
Center.*TR-1095.*1981. Microfiche.
110833 Krishnamurthy, E.V.*Fast parallel exact computation of the generalized
inverse and rank of a matrix.* Maryland U. Comp.Sci.
Center.*TR-1079.*1981. Microfiche.
110834 Mittermeir, R.T. Yeh, R.T.*Modelling control structures using semantic
nets.* Maryland U. Comp.Sci. Center.* TR-1077.*1981. Microfiche.
110835 Rosenfeld, A. Kim, C.E.*How a digital computer can tell that a straight
line is straight.* Maryland U. Comp.Sci. Center.*TR-1072.*1981.
Microfiche.
110836 Rosenfeld, A.*On connectivity properties of grayscale pictures.* Maryland
U. Comp.Sci. Center.*TR-1097.*1981. Microfiche.
110837 Shneier, M.*Models and strategies for matching in industrial vision.*
Maryland U. Comp.Sci. Center.* TR-1073.*1981. Microfiche.
016470 Allen, J.F.*A general model of action and time.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 097.*1981.
016471 Allen, J.F.*Maintaining knowledge about temporal intervals.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 086.*1981.
016472 Ballard, D.H. Sabbah, D.*On shapes.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 092.*1982.
016473 Feldman, J.A.* Memory and change in connection networks.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 096.*1981.
016474 Fleisch, B.D. Burke, E.J. Parker, C.W.* Amps: an environment for personal
computers.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 094.*1981.
016475 Gacs, P. Levin, L.A.* Causal nets or what is a deterministic
computation?* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 088.*1981.
016476 Gacs, P.* Memory allocation games arising in algorithmic information
theory.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 089.*1981.
016477 Galil, Z. Seiferas, J.*Time-space-optimal string matching (preliminary
report).* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 087.*1981.
016478 Kedem, G.* Distributed control architecture for wafer scale integration.*
Rochester U. Comp.Sci.Dept.*Tech.Rpt. 098.* 1981.
016479 Kedem, G.*A first in, first out and a priority queue.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 090.*1981.
016480 Kedem, G.*The quad-CIF tree: a data structure for hierarhical on-line
algorithms.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 091.*1981.
016481 Small, S.* Parsing as cooperative distributed inference: understanding
through memory interactions.* Rochester U. Comp.Sci.Dept.*Tech.Rpt.
093.*1981, revised.
016482 Watanabe, H.* VLSI implementation of odd-even sorter using a uniform
ladder.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 085.*1981.
016483 Chorley, B.J. Parkin, G.I.*A revised definition of a secure communication
protocol and its implementation.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 05/82.*1982.
016484 Ehrman, J.R. Hamilton, H.*The thrill of programming, the agony of
debugging.* Stanford U. SLAC.*SLAC-PUB-2806.* 1981.
016485 Friesen, A. Wig, E. Tremblay, J.P. Sorenson, P.G.* SPSL/ SPSA primer
(version 1.1).* Saskatchewan U. Computational Sci.Dept.*Rpt.
82-05.*1982.
016486 Gonsalves, T.A.* Packet voice communication on an Ethernet local computer
network: an experimental study.* Xerox. Palo Alto Res.
Center.*CSL-82-05.*1982.
016487 Guerra, J. Gustafsson, B.*A semi-implicit method for hyperbolic problems
with different time-scales.* Uppsala U. Comp.Sci.Dept.*Rpt. 90.*1982.
016488 Harten, A.*High resolution schemes for hyperbolic conservation laws.* New
York U. Inst. of Math. Sci.* DOE/ER/03077-175.*1982.
016489 Koskimies, K.*An experience on language implementation using attribute
grammars.* Helsinki U. Comp.Sci.Dept.* Rpt. A-1982-02.*1982.
016490 Norman, D.A.*Five papers on human machine interaction.* Cal U., San
Diego. Human Info.Proces. Center.*CHIP 112.*1982. CONTENTS: Some
observations on mental models, by D.A. Norman; A psychologist views
human processing; human errors and other phenomena suggest processing
mechanisms, by D.A. Norman; Steps toward a cognitive engineering:
design rules based on analysis of human error, by D.A. Norman; The
trouble with UNIX, by D.A. Norman; The trouble with networks, by D.A.
Norman.
016491 Saltzman, J.*A variational method for generating multidimensional
adaptive grids.* New York U. Inst. of Math. Sci.*DOE/ER/03077-174, Ph.D.
Thesis. Saltzman, J.* 1982.
016493 Satyanarayana, A. Wood, R.K.*Polygon-to-chain reductions and network
reliability.* Cal U., Berkeley. O.R. Center.* ORC 82-04.*1982.
016494 Seydel, R.*Numerical computation of periodic orbits that bifurcate from
stationary solutions of ordinary differential equations.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8112.*1981.
VOL. 4, NO. 9 09/01/82
016495 Blaustein, B.T.*Enforcing database assertions: techniques and
applications.* Harvard U. Comp.Tech.Res. Center.* TR-21-81, Ph.D.
Thesis. Blaustein, B.T.*1981.
016496 Bush, W.R.* User server communication in MSG: an example of abstraction
and refinement.* Harvard U. Comp.Tech.Res. Center.*TR-27-81.*1982.
016497 Clarke, E.M.*Research directions in programming language semantics and
formal program verfication.* Harvard U. Comp.Tech.Res.
Center.*TR-22-81.*1981.
016498 Emerson, E.A.*Alternative semantics for temporal logics.* Harvard U.
Comp.Tech.Res. Center.*TR-26-81.*1981.
016499 German, S.M.* Verifying the absence of common runtime errors in computer
programs.* Harvard U. Comp.Tech.Res. Center.*TR-02-82, Ph.D. Thesis.
German, S.M.*1981.
016500 Goodman, N. Shmueli, O.* NP-complete problems simplified on tree
schemas.* Harvard U. Comp.Tech.Res. Center.* TR-03-82.*1981.
016501 Gurevich, Y. Lewis, H.R.*The inference problem for template
dependencies.* Harvard U. Comp.Tech.Res. Center.* TR-01-82.*1982.
016502 Gurevich, Y. Lewis, H.R.*The word problem for cancellation semigroups
with zero.* Harvard U. Comp.Tech.Res. Center.* TR-08-82.*1982.
016503 Karp, R.M. Rabin, M.O.*Efficient randomized pattern matching algorithms.*
Harvard U. Comp.Tech.Res. Center.* TR-31-81.*1981.
016504 Konchan, T.E. Klausner, A.* DBS a relational data base system.* Harvard
U. Comp.Tech.Res. Center.*TR-18-81.* 1981.
016505 Lewis, H.R. Denenberg, L.*A hard problem for NTIME (n superscript d).*
Harvard U. Comp.Tech.Res. Center.* TR-23-81.*1981.
016506 Lewis, H.R. Statman, R.*Unifiability is complete for co-NLog space.*
Harvard U. Comp.Tech.Res. Center.* TR-09-82.*1982.
016507 Newsam, G.N. Ramsdell, J.D.* Estimation of sparse Jacobian matrices.*
Harvard U. Comp.Tech.Res. Center.*TR-17-81.* 1981.
016508 Nikolaou, C.N. Clarke, E.M. Schuman, S.A.*A proof methodology for
verifying request processing protocols.* Harvard U. Comp.Tech.Res.
Center.*TR-04-82.*1982.
016509 Rabin, M.O.* Transaction protection by beacons.* Harvard U.
Comp.Tech.Res. Center.*TR-29-81.*1981.
016510 Reif, J.H.*The complexity of two player games of incomplete information.*
Harvard U. Comp.Tech.Res. Center.* TR-35-81.*1981.
016511 Reif, J.H. Peterson, G.* Decision algorithms for multiplayer games of
incomplete information.* Harvard U. Comp.Tech.Res.
Center.*TR-34-81.*1981.
016512 Reif, J.H. Spirakis, P.G.* K-connectivity in random undirected graphs.*
Harvard U. Comp.Tech.Res. Center.* TR-19-81.*1981.
016513 Reif, J.H.*On the power of probabilistic choice in synchronous parallel
computations.* Harvard U. Comp.Tech.Res. Center.*TR-30-81.*1982.
016514 Reif, J.H.* Parallel interpolation search.* Harvard U. Comp.Tech.Res.
Center.*TR-07-82.*1982.
016515 Reif, J.H. Spirakis, P.G.* Probabilistic analysis of random extension
rotation algorithms.* Harvard U. Comp.Tech.Res. Center.*TR-28-81.*1981.
016516 Reif, J.H. Spirakis, P.G.* Random independence systems. Harvard U.
Comp.Tech.Res. Center.*TR-32-81.*1981.
016517 Reif, J.H. Spirakis, P.G.* Real time resouce allocation in a distributed
system.* Harvard U. Comp.Tech.Res. Center.* TR-06-82.*1982.
016518 Sattley, J.Z. Sattley, K. Schaffner, S.C. Schuman, S.C. Clarke, E.M.*
ADAPT: ada distributed application prototyping technique.* Harvard U.
Comp.Tech.Res. Center.* TR-20-81.*1981.
016519 Shmueli, O.*The fundamental role of tree schemas in relational query
processing.* Harvard U. Comp.Tech.Res. Center.*TR-16-81, Ph.D Thesis.
Shmueli, O.*1981.
016520 Sistla, A.P. Clarke, E.M.*The complexity of propositional temporal
logics.* Harvard U. Comp.Tech.Res. Center.* TR-05-82.*1982.
016521 Spirakis, P.G.* Probabilistic algorithms, algorithms with random inputs
and random combinatorial structures.* Harvard U. Comp.Tech.Res.
Center.*TR-33-81, Ph.D. Thesis. Spirakis, P.G.*1981.
016522 Spirakis, P.G. Reif, J.H.* Strong K-connectivity in digraphs and random
digraphs.* Harvard U. Comp.Tech.Res. Center.*TR-25-81.*1981.
016523 Townley, J.A.*The use of transformation to implement an algorithm.*
Harvard U. Comp.Tech.Res. Center.*TR-24-81.* 1981.
016524 Bennett, J.L.*Managing to meet usability goals in the development of
office systems.* IBM Watson Res. Center.* RJ 3412.*1982.
016525 Bullen, C.V.*A case study of office workstation use.* IBM Watson Res.
Center.*RJ 3405.*1982.
016526 Bux, W.*An approximate method for the performance analysis of buffer
insertion rings.* IBM Watson Res. Center.*RZ 1129.*1982.
016527 Casanova, M.A.* Inclusion dependencies and their interaction with
functional dependencies.* IBM Watson Res. Center.*RJ 3380.*1982.
016528 Chang, C.L.* Decision support in an imperfect world.* IBM Watson Res.
Center.*RJ 3421.*1982.
016529 Dahmen, W.*Some remarks on multivariate B-splines.* IBM Watson Res.
Center.*RC 9296.*1982.
016530 Daniels, D.* Query compilation in a distributed database system.* IBM
Watson Res. Center.*RJ 3423.*1982.
016531 Dolev, D.* Authenticated algorithms for Byzantine agreement. IBM Watson
Res. Center.*RJ 3416.*1982.
016532 Dolev, D. Strong, R.* Distributed commit with bounded waiting.* IBM
Watson Res. Center.*RJ 3417.*1982.
016533 Dolev, D.*An efficient Byzantine agreement without authentication. IBM
Watson Res. Center.*RJ 3428.*1982.
016534 Dolev, D. Strong, R.*Requirements for agreement in distributed systems.*
IBM Watson Res. Center.*RJ 3418.* 1982.
016535 Dolev, D.* Scheduling flat graphs.* IBM Watson Res. Center.*RJ
3398.*1982.
016536 Dolev, D.* Scheduling precedence graphs of bounded height.* IBM Watson
Res. Center.*RJ 3399.*1982.
016537 Farrell, E.J.* Image3D (version 2).* IBM Watson Res. Center.*RC
9303.*1982.
016538 Fisher, S.D.* Optimal sampling for holomorphic functions.* IBM Watson
Res. Center.*RC 9297.*1982.
016539 Franaszek, P.A.*On address independent routing in local networks.* IBM
Watson Res. Center.*RC 9324.*1982.
016540 Gelenbe, E.* Stationary deterministic flows: the single server queue.*
IBM Watson Res. Center.*RZ 1136.*1982.
016541 Gladney, H.M.* Concise language reference manual.* IBM Watson Res.
Center.*RJ 3408.*1982.
016542 Gladney, H.M.* Generic operators in concise programs.* IBM Watson Res.
Center.*RJ 3441.*1982.
016543 Gladney, H.M.*How to print with style.* IBM Watson Res. Center.*RJ
3409.*1982.
016544 Hagouel, J. Schwartz, M.*A distributed failsafe route table update
algorithm.* IBM Watson Res. Center.*RC 9294.*1982.
016545 Iglehart, D.L.*Comparison of regenerative simulation methods for networks
of queues with general service times.* IBM Watson Res. Center.*RJ
3415.*1982.
016546 Jensen, K.*New tools for old tasks: an introductory course in
computational linguistics.* IBM Watson Res. Center.*RC 9314.*1982.
016547 Liniger, W.* Contractivity of multistep and one leg methods with variable
steps.* IBM Watson Res. Center.*RC 9306.* 1982.
016548 Liniger, W.* A-contractivity of second-order multistep formulas with
variable steps.* IBM Watson Res. Center.* RC 9281.*1982.
016549 Markowitz, H.M.*A classification of job shop simulation models.* IBM
Watson Res. Center.*RC 9301.*1982.
016550 Miranker, W.L.*An overview of the highly oscillatory initial value
problem.* IBM Watson Res. Center.*RC 9282.* 1982.
016551 Myers, R.A.*Trends in office automation technology.* IBM Watson Res.
Center.*RC 9321.*1982.
016552 Nair, R. Hong, S.J. Liles, S. Villani, R.*Global wiring on a wire routing
machine.* IBM Watson Res. Center.*RC 9328.* 1982.
016553 Nelson, R.A. Haibt, L.M. Sheridan, P.B.* Specification, design, and
implementation via annotated petri nets.* IBM Watson Res. Center.*RC
9317.*1982.
016554 Nix, D.H.* LINKS: a teaching approach to developmental progress in
children's reading comprehension and meta-comprehension.* IBM Watson
Res. Center.*RC 9286.* 1982.
016555 Otten, R.H.J.M.* Eigensolutions in top down layout design.* IBM Watson
Res. Center.*RC 9334.*1982.
016556 Reischuk, R.*A lower time-bound for parallel random access machines
without simultaneous writes.* IBM Watson Res. Center.*RJ 3431.*1982.
016557 Robinson, J.T.*Separating policy from correctness in concurrency control
design.* IBM Watson Res. Center.*RC 9308.*1982.
016558 Roth, J.P. Tsai, M.Y.* Testing and failure in static pass transistor
logic.* IBM Watson Res. Center.*RC 9313.*1982.
016559 Selinger, R.D. Patlach, A.M. Carlson, E.D.*The 925 family of office
workstations.* IBM Watson Res. Center.*RJ 3406.* 1982.
016560 Tetzlaff, W. Beretvas, T.*A new approach to VM performance analysis.* IBM
Watson Res. Center.*RC 9299.*1982.
016561 Wagner, E.G.*Functorial hierarchies of functional languages.* IBM Watson
Res. Center.*RC 9327.*1982.
016562 Wahl, F.M. Wong, K.Y.*An efficient method for running a constrained run
length algorithm (CRLA) in vertical and horizontal direction on binary
image data.* IBM Watson Res. Center.*RJ 3438.*1982.
016563 Asselt, E.J. Van*The multi-grid method and artificial viscosity.*
Mathematisch Centrum.*NW 123/82.*1982.
016564 Bakker, J.W. de. Meyer, J.-J.Ch. Zucker, J.I.*On infinite computations in
denotational semantics.* Mathematisch Centrum.*IW 196/82.*1982.
016565 Bergstra, J.A. Klop, J.W.* Formal proof systems for program equivalence.*
Mathematisch Centrum.*IW 194/82.*1982.
016566 Bohm, A.P.W. Bruin, A. de.*Dynamic networks of parallel processes.*
Mathematisch Centrum.*IW 192/82.*1982.
016567 Lenstra, A.K. Lenstra, H.W. Lovasz, L.* Factoring polynomials with
rational coefficients.* Mathematisch Centrum.*IW 195/82.*1982.
016568 Te Riele, H.J.J.*Rules for constructing hyperperfect numbers.*
Mathematisch Centrum.*NW 127/82.*1982.
016569 Verwer, J.G. Scholz, S. Blom, J.G. Louter-Noll, M.*A class of Runge Kutta
Rosenbrock methods for solving stiff differential equations.*
Mathematisch Centrum.*NW 125/82.*1982.
016570 Verwer, J.G.* Contractivity of locally one-dimensional splitting
methods.* Mathematisch Centrum.*NW 124/82.* 1982.
016571 Vitanyi, P.M.B.*Efficient simulations of multicounter machines
(preliminary version).* Mathematisch Centrum.* IW 197/82.*1982.
016572 Vitanyi, P.M.B.* Real time simulation of multicounters by oblivious one
tape turing machines (preliminary draft).* Mathematisch Centrum.*IW
193/82.*1982.
016573 Bar-Yehuda, R. Even, S.*On approximating a vertex cover for planar
graphs.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt.
221.*1981.
016574 Etzion, T. Yoeli, M.*The hierarchy of labeled super-nets.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 226.*1981.
016575 Etzion, T. Yoeli, M.* Super-nets and their hierarchy.* Technion - Israel
Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 218.*1981.
016576 Even, S. Goldreich, O.*Des-like functions can generate the alternating
group.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt.
207.*1981.
016577 Even, S. Yacobi, Y.* NP-comleteness and conventional cryptosystems.*
Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 212.*1981.
016578 Even, S. Yacobi, Y.*On the complexity of problems with few solutions.*
Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 213.*1981.
016579 Even, S. Goldreich, O. Tong, P.*On the NP-completeness of certain network
testing problems.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 230.*1981.
016580 Itai, A.*On the complexity of contractions.* Technion - Israel Inst. of
Tech. Comp.Sci.Dept.*Tech.Rpt. 211.*1981.
016581 Lempel, A. Seroussi, G. Winograd, S.*On the complexity of multiplication
in finite fields.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 214.*1981.
016582 Porat, S. Yoeli, M.*Towards a hierarchy of nets.* Technion - Israel Inst.
of Tech. Comp.Sci.Dept.*Tech.Rpt. 224.* 1981.
016583 Selman, A.L. Yacobi, Y.*The complexity of promise problems.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 222.*1981.
016584 Tomer, A. Yoeli, M.*On the application of extended petri nets to the
verification of protocols.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 228.*1981.
016585 Zaks, S.*A new algorithm for generation of permutations.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 220.*1981.
016586 Bank, R.E.*Analysis of a multi level inverse iteration procedure for
Eigenvalue problems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 199.*1980.
016587 Bank, R.E. Rose, D.J.*Analysis of a multilevel iterative method for
nonlinear finite element equations.* Yale U. Comp.Sci.Dept.*Res.Rpt.
202.*1981.
016588 Chan, T.F. Golub, G.H. LeVeque, R.J.*Algorithms for computing the sample
variance: analysis and recommendations.* Yale U. Comp.Sci.Dept.*Res.Rpt.
222.* 1981.
016589 Chan, T.F. Jackson, K.R. Zhu, B.*Alternating direction incomplete
factorizations.* Yale U. Comp.Sci.Dept.* Res.Rpt. 208.*1981.
016590 Chan, T.F. Keller, H.B.*Arc-length continuations and multi-grid
techniques for nonlinear elliptic eigenvalue problems.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 197.*1981.
016591 Chan, T.F.* Deflated decomposition of solutions of nearly singular
systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 225.* 1982.
016592 Chan, T.F.* Deflation techniques and block elimination algorithms for
solving bordered singular systems.* Yale U. Comp.Sci.Dept.*Res.Rpt.
226.*1982.
016593 Chan, T.F.*Numerical computation of large amplitude internal solitary
waves.* Yale U. Comp.Sci.Dept.* Res.Rpt. 198.*1981.
016594 Chan, T.F.*On the existence and computation of Lu factorizations with
small pivots.* Yale U. Comp.Sci.Dept.* Res.Rpt. 227.*1982.
016595 Davis, E.*Organizing spatial knowledge.* Yale U. Comp.Sci.Dept.*Res.Rpt.
193.*1981.
016596 Douglas, C.C.*Multi-grid algorithms for elliptic boundary-value
problems.* Yale U. Comp.Sci.Dept.* Res.Rpt. 223.* Ph.D. Thesis. Douglas,
C.C.*1982.
016597 Eisenstat, S.C. Schultz, M.H.*On some trends in elliptic problem
solvers.* Yale U. Comp.Sci.Dept.*Res.Rpt. 194.* 1981.
016598 Eisenstat, S.C. Lewis, J.W. Schultz, M.H.*Optimal block diagonal scaling
of block 2-cyclic matrices.* Yale U. Comp.Sci.Dept.*Res.Rpt. 204.*1981.
016599 Eisenstat, S.C. Jackson, K.R. Lewis, J.W.*The order of monotone piecewise
cubic interpolation.* Yale U. Comp.Sci.Dept.*Res.Rpt. 207.*1981.
016600 Eisenstat, S.C. Elman, H.C. Schultz, M.H.* Variational iterative methods
for nonsymmetric systems of linear equations.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 209.*1981.
016601 Ellis, J.R. Mishkin, N. Nix, R.P. Wood, S.R.*A BLISS programming
environment.* Yale U. Comp.Sci.Dept.*Res.Rpt. 231.*1982.
016602 Ellis, J.R.* Multiple context shells.* Yale U. Comp.Sci.Dept.*Res.Rpt.
191.*1981.
016603 Ellis, J.R. Mishkin, N. Leunen, M.-C. van. Wood, S.R.* Tools: an
environment for timeshared computing and programming.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 232.*1982.
016604 Elman, H.C.* Preconditioned conjugate gradient methods for nonsymmetric
systems of linear equations.* Yale U. Comp.Sci.Dept.*Res.Rpt.
203.*1981.
016605 Fisher, J.A.*Computer systems architecture at Yale. The enormous longword
instruction ( ELI) machine progress and research plans.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 241.* 1982.
016606 McDermott, D.*Finding objects with given spatial properties.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 195.*1981.
016607 McDermott, D.*A temporal logic for reasoning about processes and plans.*
Yale U. Comp.Sci.Dept.*Res.Rpt. 196.*1981.
016608 Perry, J.R.* Secondary storage methods for solving symmetric, positive
definite, banded linear systems.* Yale U. Comp.Sci.Dept.*Res.Rpt. 201,
Ph.D. Thesis. Perry, J.R.*1981.
016609 Saad, Y.* Iterative solution of indefinite symmetric systems by methods
using orthogonal polynomials over two disjoint intervals.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 212.* 1981.
016610 Saad, Y.*Practical use of some Krylov subspace methods for solving
indefinite and unsymmetric linear systems.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 214.*1982.
016611 Sayward, F.G. Lipton, R.J.*Steps towards efficiently implementing program
mutation systems: the high level design of a distributed mutation
system.* Yale U. Comp.Sci.Dept.*Res.Rpt. 200.*n.d.
016612 Schank, R. Kolodner, J. DeJong, G.* Conceptual information retrieval.*
Yale U. Comp.Sci.Dept.*Res.Rpt. 190.*1980.
016613 Shapiro, E.Y.* Algorithmic program debugging.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 237, Ph.D. Thesis. Shapiro, E.Y.* 1982.
016614 Weiser, A.* Local mesh, local order, adaptive finite element methods with
a posteriori error estimators for elliptic partial differential
equations.* Yale U. Comp.Sci.Dept.*Res.Rpt. 213, Ph.D. Thesis. Weiser,
A.* 1981.
016615 Zhu, B.*The positive solution of a certain nonlinear parabolic system and
it's computation I.* Yale U. Comp.Sci.Dept.*Res.Rpt. 210.*1981.
016616 Zhu, B.* Stability of high order difference equations and its algebraic
survey.* Yale U. Comp.Sci.Dept.*Res.Rpt. 211.*1981.
VOL. 4, NO. 10 09/28/82
016627 Ballard, B.W.*A "domain class" approach to transportable natural language
processing.* Duke U. Comp.Sci.Dept.* CS-1982-11.*1982.
016628 Ballard, B.W.* Pronominal processing in a computational domain.* Duke U.
Comp.Sci.Dept.*CS-1982-01.*1982.
016629 Ballard, B.W.*A search procedure for perfect information games of
chance.* Duke U. Comp.Sci.Dept.*CS-1982-08.* 1982.
016630 Biermann, A.W.* Natural language programming.* Duke U.
Comp.Sci.Dept.*CS-1982-02.*1982.
016631 Freeman, R.W.*Automated design specification system.* Duke U.
Comp.Sci.Dept.*CS-1982-10.*1982.
016632 Geist, R. Fink, P. Kraines, D.* Natural language computing in a linear
algebra course.* Duke U. Comp.Sci.Dept.* CS-1982-09.*1982.
016633 Loveland, D.W.*Performance bounds for binary testing with arbitrary
weights.* Duke U. Comp.Sci.Dept.*CS-1982-04.* 1982.
016634 Rosenberg, A.L.* Bandwidth and pebbling.* Duke U.
Comp.Sci.Dept.*CS-1982-03.*1982.
016635 Rosenberg, A.L.*The diogenes approach to testable fault tolerant networks
of processors.* Duke U. Comp.Sci.Dept.* CS-1982-06.1.*1982.
016636 Rosenberg, A.L.* Three dimensional VLSI: a case study.* Duke U.
Comp.Sci.Dept.*CS-1981-15.*1981.
016637 Smith, C.U. Loendorf, D.D.* Performance analysis of software for an MIMD
computer.* Duke U. Comp.Sci.Dept.* CS-1982-07.*1982.
016638 Smith, C.U. Browne, J.C.* Performance engineering of software systems: a
case study.* Duke U. Comp.Sci.Dept.* CS-1981-14.*1981.
016639 Trivedi, K.S. Bannister, J.A.*An algorithm with applications to two
problems in the design and operation of fault tolerant distributed
systems.* Duke U. Comp.Sci.Dept.*CS-1982-05.*1982.
016640 Lauchli, P.*PG - ein interaktives System fur die Manipulation von
FigurenGder projektiven Geometrie.* Eidgenossische Technische Hochschule
Zurich. Institut fuer Informatik.*Bericht 48.*1982.
016641 Meier, A.*A graph grammar approach to geographic data bases.*
Eidgenossische Technische Hochschule Zurich. Institut fuer
Informatik.*Bericht 49.*1982.
016642 Nievergelt, J. Hinterberger, H. Sevcik, K.C.*The grid file: an
adaptable, symmetric multi-key file structure.* Eidgenossische
Technische Hochschule Zurich. Institut fuer Informatik.*Bericht
46.*1981.
016643 Reimer, M. Schmidt, J.W.* Transaction procedures with relational
parameter.* Eidgenossische Technische Hochschule Zurich. Institut fuer
Informatik.Bericht 45.* 1981.
024918 Appelt, D.E.* Planning natural-language utterances to satisfy multiple
goals.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-918; SRI International.
A.I. Center.*Tech. note 259, Ph.D. Thesis. Appelt, D.E.*1981. 177p.
024916 Bent, S.W.* Dynamic weighted data structures.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-916, Ph.D. Thesis. Bent, S.W.* 1982. 75p.
024899 Bolstad, J.H.*An adaptive finite difference method for hyperbolic systems
in one space dimension.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-899; Cal
U., Berkeley. Lawrence Berkeley Lab.*LBL-13287, Ph.D. Thesis. Bolstad,
J.H.* 1982. 210p.
024910 Clancey, W.J. Buchanan, B.*Exploration of teaching and problem-solving
strategies, 1979-1982. (Final Report for Contract N-00014-79-C-0302,
covering the period of 15 March 1979 through 14 March 1982).* Stanford
U. Comp.Sci.Dept.*STAN-CS-82-910; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-008.*1982. 13p.
024908 Clancey, W.J.*Letsinger, R.* Neomycin: reconfiguring a rule-based expert
system for application to teaching.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-908; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-81-002.* 1982. 8p.
024901 Fuchs, D.R. Knuth, D.E.*Optimal font caching.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-901.*1982. 19p.
024914 Guoan, G. Hobby, J.*Using string matching to compress Chinese
characters.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-914.*1982. 15p.
024904 LeVeque, R.J.*Time-split methods for partial differential equations.*
Stanford U. Comp.Sci.Dept.*STAN-CS-82-904, Ph.D. Thesis. LeVeque,
R.J.*1982. 99p.
024909 London, B. Clancey, W.J.* Plan recognition strategies in student
modeling: prediction and description.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-909; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-007.* 1982. 9p.
024915 Manna, Z. Pnueli, A.* Verification of concurrent programs: proving
eventualities by well-founded ranking.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-915.*1982. 25p.
024907 Mayr, E.W.* Combinatorial algorithms I. (Edited collection of the class
notes prepared for Computer Science 253A, Winter Quarter 1982).*
Stanford U. Comp.Sci.Dept.* STAN-CS-82-907.*1982. 79p.
024906 Nash, S.G.*Truncated-Newton methods.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-906, Ph.D. Thesis. Nash, S.G.* 1982. 114p.
024920 Roberts, T.L.*Evaluation of computer text editors.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-920; Xerox. Palo Alto Res. Center.*SSL-79-09,
Ph.D. Thesis. Roberts, T.L.* 1979. 184p.
024905 Trefethen, L.N.* Wave propagation and stability for finite difference
schemes.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-905, Ph.D. Thesis.
Trefethen, L.N.*1982. 197p. (reduced and printed 2 pages to 1 so that
there are only 98 physical pages).
024912 Varde, M.Y.*The implication and finite implication problems for typed
template dependencies.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-912.*1982. 34p.
016644 Brassard, G. Monet, S. Zuffellato, D.*Schonhage-Strassen? Mais c'est
enfantin....* Montreal U. Dept. d'info. et de recherche
operationnelle.*Publ. 402.*1981.
016645 Chapleau, S. Lapalme, G.*Athena: un programme joueur de scrabble
duplicate.* Montreal U. Dept. d'info. et de recherche
operationnelle.*Publ. 443.*1982.
016646 Maculan, N.*Relaxation Lagrangienne: le probleme du knapsack 0-1.*
Montreal U. Dept. d'info. et de recherche operationnelle.*Publ.
435.*1982.
016647 Magnenat-Thalmann, N. Thalmann, D. Bergeron, P.*A computer graphical tool
for analyzing user reaction to videotex systems.* Montreal U. Dept.
d'info. et de recherche operationnelle.*Publ. 439.*1982.
016648 Magnenat-Thalmann, N. Thalmann, D.*La conception de cartes geographiques
assistee par ordinateur.* Montreal U. Dept. d'info. et de recherche
operationnelle.*Publ. 441.*1982.
016649 Magnenat-Thalmann, N. Thalmann, D.*Some unusual primitives in the MIRA
graphical extension of PASCAL.* Montreal U. Dept. d'info. et de
recherche operationnelle.*Publ. 440.* 1982.
016650 Thalmann, D. Ouimet, D. Roy, C.*Drawing bridges by computer.* Montreal U.
Dept. d'info. et de recherche operationnelle.*Publ. 437.*1982.
016651 Zahar, R.V.M.*The computation of subdominant solutions of linear
difference systems.* Montreal U. Dept. d'info. et de recherche
operationnelle.*Publ. 434.*1982.
016652 Deering, M. Faletti, J. Wilensky, R.*Using the PEARL AI package ( package
for efficient access to representation in Lisp).* Cal U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL-M82/19.*1982.
016653 Henry, R.R.*The code generator generators' work station:
reimplementation and experimentation with th Graham Glanville machine
independent algorithms for code generation.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL-M81/47.*1981.
016654 Horton, M.R.*Design of a multi-language editor with static error
detection capabilities.* Cal U., Berkeley. Electronics Res.Lab.*Memo.
No. UCB/ERL-M81/53.*1981.
016655 Wilensky, R.*A model for planning in complex situations.* Cal U.,
Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/49.*1981.
016656 Wilensky, R. Morgan, M.*One analyzer for three languages.* Cal U.,
Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL-M81/67.*1981.
016657 Wilensky, R. Arens, Y.* PHRAN: a knowledge-based approach to natural
language analysis.* Cal U., Berkeley. Electronics Res.Lab.*Memo. No.
UCB/ERL-M80/34.*1980.
016658 Wilensky, R.* Points: a theory of story content.* Cal U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL-M80/17.* 1980.
016659 Agre, J.R. Tripathi, S.K.*Approximate solutions to queueing networks with
state dependent parameters.* Maryland U. Comp.Sci.
Center.*TR-1139.*1981.
016660 Davis, L.S. Wang, C.-Y. Xie, H.-C.*Some experiments in multi-spectral,
multi-temporal crop classification using relaxation techniques.*
Maryland U. Comp.Sci. Center.* TR-1131.*1981.
016661 Dunlop, D.D. Basili, V.R.*Generalizing specifications for uniformly
implemented loops.* Maryland U. Comp.Sci. Center.*TR-1116.*1981.
016662 Dunlop, D.D. Basili, V.R.*A heuristic for deriving loop functions.*
Maryland U. Comp.Sci. functions; BU Center.* TR-1115.*1981.
016663 Dunlop, D.D.*An investigation of functional correctness issues.* Maryland
U. Comp.Sci. Center.*TR-1135, Ph.D. Thesis. Dunlop, D.D.*1982.
016664 Dunlop, D.D. Basili, V.R.*A new verification strategy for iterative
programs.* Maryland U. Comp.Sci. Center.* TR-1114.*1981.
016665 Dunn, S.M.* Generalized Blomqvist correlation: a new U statistic and some
examples.* Maryland U. Comp.Sci. Center.*TR-1125.*1981.
016666 Eisinger, N. Kasif, S. Minker, J.* Logic programming: a parallel
approach.* Maryland U. Comp.Sci. Center.* TR-1124.*1981.
016667 Harbitter, A. Tripathi, S.K.*A model of transport level flow control.*
Maryland U. Comp.Sci. Center.*TR-1140.* 1982.
016668 Itano, K.*High-speed character string interface for the direct execution
computer.* Maryland U. Comp.Sci. Center.* TR-1128.*1981.
016669 Kedem, B.*Qualitative texture discrimination.* Maryland U. Comp.Sci.
Center.*TR-1117.*1981.
016670 Peleg, S.* Classification by discrete optimization.* Maryland U.
Comp.Sci. Center.*TR-1112.*1981.
016671 Pietikainen, M. Rosenfeld, A.* Multispectral image smoothing by local use
of global information.* Maryland U. Comp.Sci. Center.*TR-1113.*1981.
016672 Reggia, J.A. Perricone, B.T.* KMS manual.* Maryland U. Comp.Sci.
Center.*TR-1136.*1982.
016673 Reggia, J.A.* Knowledge based decision support systems: development
through KMS.* Maryland U. Comp.Sci. Center.* TR-1121, Ph.D. Thesis.
Reggia, J.A.*1981.
016674 Rosenfeld, A.* Image analysis.* Maryland U. Comp.Sci.
Center.*TR-1129.*1981.
016675 Rosenfeld, A.*The state of the art in image analysis.* Maryland U.
Comp.Sci. Center.*TR-1127.*1981.
016676 Roussopoulos, N.*The logical access path schema of a database.* Maryland
U. Comp.Sci. Center.*TR-1138.*1982.
016677 Thrift, P. Lee, C.-H.*Using highlights to constrain object size and
location.* Maryland U. Comp.Sci. Center.* TR-1122.*1981.
016678 Weiss, D.M.*Evaluating software development by analysis of change data.*
Maryland U. Comp.Sci. Center.*TR-1120, Ph.D. Thesis. Weiss, D.M.*1981.
016679 Wong, R.W.H. Rosenfeld, A.*Some experiments in waveform approximation.*
Maryland U. Comp.Sci. Center.*TR-1111.* 1981.
016680 Yan, C.*Design of the control processor of a Pascal direct execution
computer.* Maryland U. Comp.Sci. Center.* TR-1126.*1981.
016681 Henningsen, I. Liestol, K.*The behaviour of a nerve cell model with
strong inhibitory postsynaptic potentials.* Oslo U. Informatics
Inst.*Res.Rpt. 062.*1981.
016682 Kirkerud, B.R.*The semantics of programming languages. Volumes I-II.*
Oslo U. Informatics Inst.*Res.Rpt. 061.* 1981. 2 volumes.
016684 Koch, P.E.* Collocation by L splines at Gaussian points.* Oslo U.
Informatics Inst.*Res.Rpt. 068, Ph.D. Thesis. Koch, P.E.*1982.
016685 Nossum, R.* Algebraic simplification in the prover system.* Oslo U.
Informatics Inst.*Res.Rpt. 067.*1982.
016686 Owe, O.*A note on quantifier removal.* Oslo U. Informatics Inst.*Res.Rpt.
065.*1981.
016687 Soundararajan, N. Dahl, O.-J.* Partial correctness semantics of
communicating sequential processes.* Oslo U. Informatics Inst.*Res.Rpt.
066.*1982.
016688 Wang, A.* Denotational and axiomatic semantics for non deterministic goto
programs. Part 1: Denotational semantics.* Oslo U. Informatics
Ins.*Res.Rpt. 060.*1981.
016689 Bank, R.E. Dupont, T.F.*Analysis of a two-level scheme for solving finite
element equations.* Texas U. Numerical Analysis Center.*CNA-159.*1980.
016690 Bank, R.E. Dupont, T.F.*An optimal order process for solving finite
element equations.* Texas U. Numerical Analysis Center.*CNA-158.*1980.
016691 Bank, R.E. Sherman, A.H.*A refinement algorithm and dynamic data
structure for finite element meshes.* Texas U. Comp.Sci.Dept.*TR-159;*
Texas U. Numerical Analysis Center.*CNA-166.*1980.
016692 Cline, A.K.*Reproducing positivity, monotonicity, and convexity in curves
with splines under tension.* Texas U. Numerical Analysis
Center.*CNA-169.*1980.
016693 Cline, A.K.* Smoothing by splines under tension.* Texas U. Numerical
Analysis Center.*CNA-168.*1981.
016694 Cline, A.K.* Surface smoothing with splines under tension.* Texas U.
Numerical Analysis Center.*CNA-170.*1981.
016695 Franchetti, C. Cheney, E.W.*Simultaneous approximation and restricted
Chebyshev centers in function spaces.* Texas U. Numerical Analysis
Center.*CNA-157.*1980.
016696 Grimes, R.G. Kincaid, D.R. Young, D.M.* ITPACK 2A: a Fortran
implementation of adaptive accelerated iterative methods for solving
large sparse linear systems.* Texas U. Numerical Analysis
Center.*CNA-164.*1980.
016697 Jea, K.C.* Generalized conjugate gradient acceleration of iterative
methods.* Texas U. Numerical Analysis Center.* CNA-176, Ph.D. Thesis.
Jea, K.C.*1982.
016698 Kincaid, D.R.* Acceleration parameters for a symmetric successive
overrelaxation conjugate gradient method for nonsymmetric systems.*
Texas U. Numerical Analysis Center.*CNA-171.*1981.
016699 Kincaid, D.R. Young, D.M.*Adapting iterative algorithms developed for
symmetric systems to nonsymmetric systems.* Texas U. Numerical Analysis
Center.*CNA-161.*1980.
016700 Kincaid, D.R. Grimes, R.G. Respess, J.R. Young, D.M.* ITPACK 2B: a
Fortran package for solving large sparse linear systems by adaptive
accelerated iterative methods.* Texas U. Numerical Analysis
Center.*CNA-173; Texas U. Comp. Center.*CCSN-44.*1981.
016701 Light, W.A. Cheney, E.W.*The characterization of best approximations in
tensor product spaces.* Texas U. Numerical Analysis
Center.*CNA-175.*1981.
016702 Light, W.A. Cheney, E.W.*Some proximinality theorems in tensor product
spaces.* Texas U. Numerical Analysis Center.*CNA-165.*1980.
016703 Respess, J.R. Jr. Cheney, E.W.*Best approximation problems in tensor
product spaces.* Texas U. Numerical Analysis Center.*CNA-167.*1981.
016704 Respess, J.R. Cheney, E.W.*On Lipschitzian proximity maps.* Texas U.
Numerical Analysis Center.*CNA-174.*1981.
016705 von Golitschek, M. Cheney, E.W.*Failure of the alternating direction
algorithm for best approximation of multivariate functions.* Texas U.
Numerical Analysis Center.*CNA-172.*1981.
016706 White, A.B. Jr.*On the numerical solution of initial boundary value
problems in one space solution.* Texas U. Numerical Analysis
Center.*CNA-156.*1980.
016707 Young, D.M. Hayes, L.J. Jea, K.C.* Generalized conjugate gradient
acceleration of iterative methods. Part I: The symmetrizable case.*
Texas U. Numerical Analysis Center.* CNA-162.*1980.
016708 Young, D.M. Jea, K.C.* Generalized conjugate gradient acceleration of
iterative methods. Part II: The nonsymmetrizable case.* Texas U.
Numerical Analysis Center.*CNA-163.*1980.
016709 Young, D.M. Kincaid, D.R.*The ITPACK package for large sparse linear
systems.* Texas U. Numerical Analysis Center.*CNA-160.*1980.
VOL. 4, NO. 11 10/15/82
016710 Adler, R.L. Coppersmith, D. Hassner, M.*Algorithms for sliding block
codes (an application of symbolic dynamics to information theory).* IBM
Watson Res. Center.*RJ 3480.* 1982.
016711 Bhattacharya, A.K.*The IBM selective sequence electronic calculator.* IBM
Watson Res. Center.*RC 9225.*1982.
016712 Bloom, S.L. Wright, J.B.* P-varieties: (a signature independent
characterization of varieties of ordered algebras).* IBM Watson Res.
Center.*RC 9399.*1982.
016713 Brand, D.* Redundancy and don't cares in logic synthesis.* IBM Watson
Res. Center.*RC 9386.*1982.
016714 Burge, W.H.* Combinatorial interpretations of some identities of the
Rogers Ramanujan type.* IBM Watson Res. Center.*RC 9329.*1982.
016715 Carroll, J.M.*The adventure of getting to know a computer: travels in an
exploratory environment.* IBM Watson Res. Center.*RC 9449.*1982.
016716 Carroll, J.M.*The name game: creative and practical names for a
building.* IBM Watson Res. Center.*RC 9450.*1982.
016717 Carroll, J.M.*Structure in visual communication.* IBM Watson Res.
Center.*RC 9451.*1982.
* 016718 Chaitim, G.J.* Godel's theorem and information.* IBM Watson Res.
Center.*RC 9370.*1982.
016719 Chamberlain, S.G. Husain, A.*The need for three-dimensional simulations
for VLSI Mosfet's CCD imagers and CCD SPS memories.* IBM Watson Res.
Center.*RC 9410.*1982.
016720 Chow, W.-M.*An approximation method for nonstationary exponential
queueing networks.* IBM Watson Res. Center.* RC 9372.*1982.
* 016721 Coppersmith, D. Vishkin, U.*Solving NP-hard problems in " almost
trees": vertex cover.* IBM Watson Res. Center.*RC 9404.*1982.
016722 Daniels, D. Selinger, P. Haas, L. Lindsay, B. Mohan, C. Walker, A.
Wilms, P.*An introduction to distributed query compilation in R.* IBM
Watson Res. Center.*RJ 3497.*1982.
016723 Denneau, M.M.*The Yorktown Simulation Engine.* IBM Watson Res. Center.*RC
9347.*1981.
* 016724 Fagin, R. Williams, J.H.*A fair carpool scheduling algorithm.* IBM
Watson Res. Center.*RJ 3535.*1982.
016725 Falkoff, A.D.*Semicolon-bracket notation: a hidden resource in APL.* IBM
Watson Res. Center.*RC 9360.*1982.
016726 Fournier, A. Wesley, M.A.* Bending polyhedral objects.* IBM Watson Res.
Center.*RC 9369.*1982.
016727 Frei, A.H.*Limits of carrier sense multiple access ( CSMA-CD) with
collision detect protocols.* IBM Watson Res. Center.*RZ 1144.*1982.
016728 Gladney, H.M.*An effective approach to information presentation.* IBM
Watson Res. Center.*RJ 3476.*1982.
016729 Gladney, H.M.*An introdution to the concise programming language.* IBM
Watson Res. Center.*RJ 3455.*1982.
016730 Gladney, H.M.*Towards modular programs - a concise overview.* IBM Watson
Res. Center.*RJ 3477.*1982.
* 016731 Gurevich, Y. Stockmeyer, L. Vishkin, U.*Sovling NP-hard problems on
graphs that are almost trees and an application to facility location
problems.* IBM Watson Res. Center.*RC 9348.*1982.
016732 Hailpern, B.*An introduction to PASCAL/VS input/output under CMS.* IBM
Watson Res. Center.*RC 9354.*1982.
016733 Heidelberger, P. Welch, P.D.* Simulation run length control in the
presence of an initial transient.* IBM Watson Res. Center.*RC
9393.*1982.
016734 Hong, S.J. Nair, R.* Wire routing machines - new tools for VLSI physical
design.* IBM Watson Res. Center.*RC 9374.* 1982.
016735 Ibe, O.C.*An approximate analysis of a multi server queueing system with
a fixed order of access.* IBM Watson Res. Center.*RC 9346.*1982.
016736 Jenny, C.*Methodologies for placing files and processes in systems with
decentralized intelligence.* IBM Watson Res. Center.*RZ 1139.*1982.
016737 Johnson, E.L. Kostreva, M.M. Suhl, U.*Solving 0-1 integer programming
problems arising from large scale planning models.* IBM Watson Res.
Center.*RC 9349.*1982.
016738 Kienzle, M.G. Hadsell, R.W. Milliken, K.R.*The hybrid monitor system.*
IBM Watson Res. Center.*RC 9339.*1982.
016739 Kirkpatrick, S. Gelatt, C.D. Jr. Vecchi, M.P.* Optimization by simulated
annealing.* IBM Watson Res. Center.*RC 9355.*1982.
016740 Kitchens, B.* Linear algebra and subshifts of finite type.* IBM Watson
Res. Center.*RJ 3468.*1982.
016741 Langdon, G.G. Jr. Rissanen, J.J.*An adaptive file compression algorithm.*
IBM Watson Res. Center.*RJ 3460.* 1982.
016742 Lavin, M.A. Lieberman, L.I.* AML/V: an industrial machine vision
programming system.* IBM Watson Res. Center.*RC 9390.*1982.
* 016743 Matula, D.W. Dolev, D.* Path regular graphs.* IBM Watson Res.
Center.*RJ 3486.*1982.
016744 Micchelli, C.A. Sharma, A.*On a problem of Turan: multiple node Gaussian
quadrature.* IBM Watson Res. Center.*RC 9439.*1982.
016745 Miller, L.A.*" Natural language text are not necessarily grammatical and
unambiguous. Or even complete".* IBM Watson Res. Center.*RC 9441.*1982.
016746 Misek-Falkoff, L.D.*The new field of software linguistics: an early-bird
view.* IBM Watson Res. Center.*RC 9421.* 1982.
016747 Misek-Falkoff, L.D.* Software science and natural language: a
unification of Halstead's counting rules for programs and English text,
and a claim space approach to extensions.* IBM Watson Res. Center.*RC
9420.*1982.
016748 Matick, R.E.* Hybrid memory: application of VLSI to virtual memory
design. Part II: Systems considerations.* IBM Watson Res. Center.*RC
9437.*1982.
016749 Nikolaou, C.N.* Reliability issues in distributed systems.* IBM Watson
Res. Center.*RC 9335, Ph.D. Thesis. Nikolaov, C.N. (Harvard
University).*1982.
016750 Obermarck, R.L. Treiber R.K.*Practical uses of hashing for main storage
searching.* IBM Watson Res. Center.*RJ 3483.* 1982.
016751 Perl, Y. Vishkin U.* Junction tree structure with application to a
shifting algorithm.* IBM Watson Res. Center.*RC 9405.*1982.
* 016752 Pippenger, N.*Advances in pebbling.* IBM Watson Res. Center.*RJ
3466.*1982.
016753 Rabenhorst, D.A.* APL event/ response programming.* IBM Watson Res.
Center.*RC 9357.*1982.
016754 Rudin, H.*Automated protocol validation: some practical examples.* IBM
Watson Res. Center.*RZ 1150.*1982.
016755 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package
version 2: CMS users guide.* IBM Watson Res. Center.*RA 0139.*1982.
016756 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package
version 2: introduction and examples.* IBM Watson Res. Center.*RA
0138.*1982.
016757 Sauer, C.H. MacNair, E.A. Kurose, J.F.*The Research Queueing Package
version 2: TSO users guide.* IBM Watson Res. Center.*RA 0140.*1982.
016758 Savir, J.*A new empirical test for the goodness of random integer
generators.* IBM Watson Res. Center.*RC 9446.* 1982.
016759 Stockmeyer, L. Vishkin, U.* Simulation of parallel random access machines
by circuits.* IBM Watson Res. Center.*RC 9362.*1982.
016760 Tang, D.T. Woo, L.S.*Exhaustive test pattern generation with constant
weight vectors.* IBM Watson Res. Center.*RC 9442.*1982.
016761 Taylor, R.H. Summers, P.D. Meyer, J.M.* AML: a manufacturing language.*
IBM Watson Res. Center.*RC 9389.* 1982.
016762 Tcha, D.-W. Maruyama, K.*On the selection of primary paths for a
communication network.* IBM Watson Res. Center.*RC 9418.*1982.
016763 Traiger, I.L.* Virtual memory management for database systems.* IBM
Watson Res. Center.*RJ 3489.*1982.
016764 Tsai, R.Y.*Multiframe image point matching and 3-D surface
reconstruction.* IBM Watson Res. Center.*RC 9398.*1982.
016765 Tucci, S. MacNair, E.A.*Implementation of mean value analysis for open,
closed and mixed queueing networks.* IBM Watson Res. Center.*RC
9392.*1982.
016766 Tucci, S. Sauer, C.H.*The tree MVA algorithm.* IBM Watson Res. Center.*RC
9338.*1982.
016767 Walker, A.*Automatic generation of explanations of results from knowledge
bases.* IBM Watson Res. Center.*RJ 3481.* 1982.
016768 Wegman, M.*Summarizing graphs by regular expressions.* IBM Watson Res.
Center.*RC 9364.*1982.
016769 Gueting, R.H. Wood, D.*Finding rectangle intersections by
divide-and-conquer.* McMaster U. Comp.Sci. Unit.* Comp.Sci. Tech.Rpt.
No. 82-CS-04.*1982.
016770 Gueting, R.H.* Stabbing C-oriented polygons.* McMaster U. Comp.Sci.
Unit.*Comp.Sci. Tech.Rpt. No. 82-CS-06.*1982.
016771 Lange, K.-J. Welzl, E.* Recurrent words and simultaneous growth in TOL
systems.* McMaster U. Comp.Sci. Unit.* Comp.Sci. Tech.Rpt. No.
82-CS-05.*1982.
016772 Dien, N. van.* Classifications in CR organizations.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 454.*1981.
016773 Dien, N. van.*Some remarks on CR organizations.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 452.*1981.
016774 Imielinski, T. Lipski, W. Jr.*A systematic approach to relational
database theory.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 457.*1982.
016775 Imielinski, T. Lipski, W. Jr.*A technique for translating states between
database schemata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 458.*1982.
016776 Marczynski, R.W. Milewski, J.*A microprogrammed processor for a data flow
computer.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt.
No. 463.*1982.
016777 Marczynski, R. Bakowski, P. Michalski, A. Pulczyn, W.* PINLAN: language
for digital integrated circuit description.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS Rpt. No. 453.*1981.
016778 Orlowska, E. Pawlak, Z.*Representation of nondeterministic information.*
Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
450.*1981.
016779 Pawlak, Z.*About conflicts.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 451.*1981.
016780 Marczynski, R.W.*Some extension of the Flynn taxonomy of computers.*
Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
460.*1982.
016781 Castrigiano, D.P.L. Mutze, M.*A covariant description of particle
position.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8209.*1982.
016782 Elhardt, K.*Das Datenbank-Cache: Entwurfsprinzipien, Algorithmen,
Eigenschaften.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8208.*1982.
016783 Hayes, S.* Maximal simultaneous continuations in complex analysis.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8207.*1982.
016784 Hilgert, J.*Foundations of K-theory for C*-algebras.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8208.*1982.
016785 Hilgert, J.*The Mayer vietoris and the Puppe sequence in K-theory for
C*-algebras.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8206.*1982.
016786 Lasser, R.* Bochner theorems for hypergroups and their applications to
orthogonal polynomial expansions.* Technische Universitaet Muenchen.
Institut fuer Mathematik.*TUM-M8204.*1982.
016787 Schrott, G. Tempelmeier, T.*Messungen in einem Prozessrechnersystem mit
einem eigenen Messrechner.* Technische Universitaet Muenchen. Institut
fuer Informatik.*TUM-I8002.*1982.
016788 Stratila, S.* Injective factors (an exposition).* Technische Universitaet
Muenchen. Institut fuer Mathematik.*TUM-M8205.*1982.
016789 Franke, C.*Analyse der Last in einem Vielbenutzersystem.* Hamburg U.
Fachbereich Informatik.*Bericht nr. 85.*1982.
016790 Olnhoff, Th.*Funktionale Semantikbeschreibung von Anfrageoperationen in
einem drei-schichtigen relationalen Datenbanksystem.* Hamburg U.
Fachbereich Informatik.* Bericht nr. 84.*1982.
016791 Schoett, O.*Ein Modulkonzept in der Theorie Abstrakter Datentypen.*
Hamburg U. Fachbereich Informatik.*Bericht nr. 81.*1981.
016792 Abrahamson, K.*The complexity of regular expressions with GOTO and
BOOLEAN variables.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt.
82-03.*1982.
016793 Ascher, U. Weiss, R.* Collocation for singular perturbation problems II:
linear first order systems without turning points.* British Columbia U.
Comp.Sci.Dept.*Tech.Rpt. 82-04.*1982.
016794 Chanson, S.T. Sinha, P.S.*Optimal macro scheduling.* British Columbia U.
Comp.Sci.Dept.*Tech.Rpt. 81-11.*1981.
016795 Chanson, S.T. Law, B.*Strategy-independent program restructuring on
bounded locality intervals.* British Columbia U.
Comp.Sci.Dept.*Tech.Rpt. 81-09.*1981.
016796 Edelsbrunner, H. Kirkpatrick, D.G. Seidel, R.*On the shape of the plane.*
British Columbia U. Comp.Sci.Dept.* Tech.Rpt. 81-15.*1981.
016797 Gilmore, P.C.*Solvable cases of the travelling salesman problem.* British
Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-08.*1981.
016798 Kirkpatrick, D.G. Hell, P.*On the complexity of general graph factor
problems.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-07.*1981.
016799 Kirkpatrick, D.* Optimal search in planar subdivisions.* British Columbia
U. Comp.Sci.Dept.*Tech.Rpt. 81-13.*1981.
016800 Kirkpatrick, D. Reisch, S.*Upper bounds for sorting integers on random
access machines.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt.
81-12.*1981.
016801 Mercer, R.E. Reiter, R.*The representation of presuppositions using
defaults.* British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-01.*1982.
016802 Rosenberg, R.S.*The computer and the state.* British Columbia U.
Comp.Sci.Dept.*Tech.Rpt. 81-06.*1981.
016803 Seidel, R.*A convex hull algorithm for point sets in even dimensions.*
British Columbia U. Comp.Sci.Dept.*Tech.Rpt. 81-14.*1981.
016804 Varah, J.M.*On fitting exponentials by nonlinear least squares.* British
Columbia U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982.
016805 Varah, J.M.*Pitfalls in the numerical solution of linear ill posed
problems.* British Columbia U. Comp.Sci.Dept.* Tech.Rpt. 81-10.*1981.
016806 Chen, P.-Y.* Multiprocessor systems: interconnection networks, memory
hierarchy, modeling and simulations.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1083, Ph.D. Thesis. Chen, P.-Y.*1982.
016807 Gear, C.W. Petzold, L.R.*Differential/algebraic systems and matrix
pencils.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1086.*1982.
016808 McNabb, D.A. Beshers, G.M. Campbell, R.H.* Tcode: an intermediate code
for the path PASCAL compiler.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1060.*1982.
016809 Anderson, T. Lee, P.A.* Fault tolerance terminology proposals.* Newcastle
Upon Tyne U. Computing Lab.*No. 174.*1982.
016810 Panzieri, F. Shrivastava, S.K.* Reliable remote calls for distributed
UNIX: an implementation study.* Newcastle upon Tyne U. Computing
Lab.*No. 177.*1982.
* 016811 Treleaven, P.C. Gouveia Lima, I.*Japan's fifth generation computer
systems.* Newcastle upon Tyne U. Computing Lab.* No. 176.*1982.
016812 Han, S.-P. Mangasarian, O.L.*Characterization of positive definite and
semidefinite matrices via quadratic programming duality.* Wisconsin U.
Comp.Sci.Dept.* Tech.Rpt. 473.*1982.
016813 Han, S.-P. Mangasarian, O.L.*A conjugate decomposition of the Euclidean
space.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 480.*1982.
016814 Katz, R.H. Lehman, T.J.*Storage structures for versions and
alternatives.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 479.*1982.
016815 Klug, A.*On conjunctive queries containing inequalities.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 477.*1982.
016816 Leland, W.E.*Density and reliability of interconnection topologies for
multicomputers.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 478, Ph.D.
Thesis. Leland, W.E.* 1982.
016817 Qi, L.*Some simple estimates for singular values of a real matrix.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 472.* 1982.
016818 Uhr, L. Schmitt, L.*The several steps from ICON to SYMBOL, using
structured cone/pyramids.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt.
481.*1982.
016819 Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.* Grapevine: an
exercise in distributed computing.* Xerox. Palo Alto Res.
Center.*CSL-82-04.*1982.
* 016820 Guttag, J. Horning, J. Wing, J.*Some notes on putting formal
specifications to productive use.* Xerox. Palo Alto Res.
Center.*CSL-82-03.*1982.
016821 McDaniel, G.*An analysis of a Mesa instruction set.* Xerox. Palo Alto
Res. Center.*CSL-82-02.*1982.
016822 Black, J.B. Wilkes-Gibbs, D. Gibbs, R.W. Jr.*What writers need to know
that they don't know they need to know.* Yale U. Cognitive Science
Program.*Tech.Rpt. 08.*1981.
016823 Schank, R.C.*Representing meaning: an artificial intelligence
perspective.* Yale U. Cognitive Science Program.*Tech.Rpt. 11.*1981.
016824 Shwartz, S.P.*The search for pronominal referents.* Yale U. Cognitive
Science Program.*Tech.Rpt. 10.*1981.
016825 Shwartz, S.P.*Three-dimensional mental rotation revisited: picture plane
rotation is really faster than depth rotation.* Yale U. Cognitive
Science Program.*Tech.Rpt. 09.*1981.
016826 Johnson, P.N. Robertson, S.P.* MAGPIE: a goal based model of
conversation.* Yale U. Comp.Sci.Dept.*Res.Rpt. 206.* 1981.
016827 Lehnert, W.G.* Affect units and narrative summarization.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 179.*1980.
016828 Lehnert, W. Dyer, M.G. Johnson, P.N. Yang, C.J. Harley, S.* BORIS: an
experiment in in-depth understanding of narratives.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 188.*1981.
016829 Schank, R.C. Collins, G.C. Davis, E. Johnson, P.N. Lytinen, S. Reiser,
B.J.*What's the point?* Yale U. Comp.Sci.Dept.*Res.Rpt. 205.*1981.
016830 Shapiro, E.Y.* Alternation and the computational complexity of logic
programs.* Yale U. Comp.Sci.Dept.*Res.Rpt. 239.* 1982.
* 016831 Borodin, A. von zur Gathen, J. Hopcroft, J.*Fast parallel matrix and
GCD computations.* Toronto U. Comp.Sci.Dept.* Tech.Rpt. 156.*1982.
* 099024 Computer science research review: 1980/1981. An annual report published
by the Department of Computer Science, Carnegie-Mellon University.
016832 Duncan, R.P.*A Runge Kutta method using variable stepsizes for Volterra
integral equations of the 2nd kind.* Toronto U. Comp.Sci.Dept.*Tech.Rpt.
157.*1982.
016833 Huff, K.E. Lesser, V.R.* Knowledge based command understanding: an
example for the software development environment.* Massachusetts U.
Comp. & Info.Sci.Dept.* COINS Tech.Rpt. 82-06.*1982.
016834 Lesser, V. Corkill, D. Pavlin, J. Lefkowitz, L. Hudlicka, E. Brooks, R.
Reed, S.*A high-level simulation testbed for cooperative distributed
problem solving.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS
Tech.Rpt. 81-16.*1981.
016835 Lindberg, B.* Pointwise error estimation for finite element
discretizations, II.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.*TRITA-NA-8208.*1982.
016836 Mandai, T.*A necessary and sufficient condition of the well posedness of
some weakly hyperbolic Cauchy problems.* Kyoto U.
Res.Inst.Math.Sci.*RIMS-404.*1982.
016837 Miyake, N.*Constructive interaction.* Cal. U. San Diego. Human
Info.Proces. Center.*CHIP 113.*1982.
016838 Price, W.L.*A fifth annotated bibliography of recent publications on data
security & cryptography.* U.K. National Physical Lab. Info. Technology
& Comp.Div.*DITC 04/82.*1982.
016839 Wald, J.A. Colbourn, C.J.* Steiner trees in probabilistic networks.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 82-07.*1982.
016840 Wald, J.A. Colbourn, C.J.* Steiner trees, partial 2-trees, and minimum
IFI networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 82-06.*1982.
016841 Watson, G.S.*Large sample theory of the Fisher Von Mises distribution.*
Princeton U. Stat.Dept.*Series 2. Tech.Rpt. 203.*1981.
016842 Wichmann, B.A.*Latest results from the procedure calling test,
Ackermann's function.* U.K. National Physical Lab. Info. Technology &
Comp.Div.*DITC 03/82.*1982.
016843 Ying-Sheng, H.*Estimation of the Lebesgue constant for polynomial
interpolation on an approximately equidistant grid.* Royal Inst. of
Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8207.*1982.
VOL. 4, NO. 12 11/15/82
016844 Dannenberg, R.B.* AMPL: design, implementation, and evaluation of a
multiprocessing language.* Carnegie Mellon U. Comp.Sci.Dept.*1981.
016845 Medina-Mora, R.* Syntax directed editing: towards integrated programming
environments.* Carnegie Mellon U. Comp.Sci.Dept.* Ph.D. Thesis.
Medina-Mora, R.*1982.
016846 Robinson, J.T.*Design of concurrency controls for transaction processing
systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-114, Ph.D.
Thesis. Robinson, J.T.*1982.
016847 Rychener, M.D.*Approaches to knowledge acquisition: the instructable
production system project.* Carnegie Mellon U. Comp.Sci.Dept.*1981.
016848 Corson, Y.*Aspects psychologiques lies a l'interrogation d'une base de
donnees.* INRIA.*Rapport de Recherche 126.* 1982.
016849 Gayolle, G. Flajolet, P. Hofri, M.*On a functional equation arising in
the analysis of a protocol for a multi access broadcast channel.*
INRIA.*Rapport de Recherche 131.* 1982.
016850 Madelaine, E.*Le systeme perluette et les preuves de representation de
types abstraits.* INRIA.*Rapport de Recherche 133.*1982.
016851 Michard, A.*A new database query language for non-professional users:
design principles and ergonomic evaluation.* INRIA.*Rapport de Recherche
127.*1982.
016852 Jomier, G.*An overview of systems modelling and evaluation tendencies.*
INRIA.*Rapport de Recherche 134.*1982.
016853 Senach, B.*Aide a la resolution de probleme par presentation graphique
des informations.* INRIA.*Rapport de Recherche 013.*1982.
016854 Jurkiewicz, E.* Stability of compromise solution in multicriteria
decision making problem.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS rpt. no. 455.*1981.
016855 Konikowska, B.* Information systems: on queries containing k-ary
descriptors.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS
rpt. no. 466.*1982.
016856 Orlowska, E.*Logic of vague concepts: applications of rough sets.* Polish
Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 474.*1982.
016857 Orlowska, E.*Semantics of vague concepts: application of rough sets.*
Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no.
469.*1982.
016858 Pawlak, Z.* Rough functions.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS rpt. no. 467.*1981.
016859 Pawlak, Z.* Rough sets: power set hierarchy.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS rpt. no. 470.*1982.
016860 Pawlak, Z.*Some remarks about rough sets.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS rpt. no. 456.* 1982.
016861 Subieta, K.* Navigational facilities for relational data base.* Polish
Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 468.*1982.
016862 Winkowski, J.*An algebraic description of system behaviours.* Polish
Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 471.*1982.
016863 Adams, W.S.*Plain programming in NIAL.* Queen's U. Computing &
Info.Sci.Dept.*Tech.Rpt. 82-138.*1982.
* 016864 Akl, S.G.* Cryptographic solution to a multilevel security problem.*
Queen's U. Computing & Info.Sci.Dept.* Tech.Rpt. 82-142.*1982.
016865 Crawford, R.G. Soong, L.P.*Survey of relational implementations prior to
1977.* Queen's U. Computing & Info.Sci.Dept.*Tech.Rpt. 82-140.*1982.
016866 Seppola, J.E.*The ISOTOL package.* Queen's U. Computing &
Info.Sci.Dept.*Tech.Rpt. 82-139.*1982.
016867 Seppola, J.E.*Systems operations in Nial.* Queen's U. Computing &
Info.Sci.Dept.*Tech.Rpt. 82-141.*1982.
016868 Keller, R.M.*A survey of research in strategy acquisition.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-115.*1982.
016869 Vichnevetsky, R.* Group velocity and reflection phenomena in numerical
approximations of hyperbolic equations: a survey.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-116.*1982.
* 016870 Paige, R.* Transformational programming--applications to algorithms and
systems: summary paper.* Rutgers U. Comp.Sci.Dept.*DCS-TR-118.*1982.
016871 Ryder, B.G.* Incremental data flow analysis based on a unified model of
elimination algorithms.* Rutgers U. Comp.Sci.Dept.*DCS-TR-117, Ph.D.
Thesis. Ryder, B.G.* 1982.
016872 Steiger, W.L. Beuss, P.M.*Fast minimal distance enumeration of small
combinations.* Rutgers U. Comp.Sci.Dept.* DCS-TR-119.*1982.
016873 Kelly, V.E. Steinberg, L.I.*The Critter system: analyzing digital
circuits by propagating behaviors and specifications.* Rutgers U.
Comp.Sci.Res.Lab.* LCSR-TR-030.*1982.
016874 Minsky, N.H.* Localization of power in software systems.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-029.*1982.
016875 Lafue, G.M.E. Mitchell, T.M.* Data base management systems and expert
systems for CAD.* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-028.*1982.
016876 Sridharan, N.S.*A flexible structure for knowledge: examples of legal
concepts.* Rutgers U. Comp.Sci.Res.Lab.* LRP-TR-014.*1982.
016877 Venkataraman, K.N.* Decidability of the purely existential fragment of
the theory of term algebras.* Rutgers U. Comp.Sci.Res.Lab.*CTA-TR-004,
Ph.D. Thesis. Venkataraman, K.N.*1981.
024931 Aikins, J.S. Kunz, J.C. Shortliffe, E.H. Fallat, R.J.* PUFF: an expert
system for interpretation of pulmonary function data.* Stanford U.
Comp.Sci.Dept.* STAN-CS-82-931; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-013.*1982. 21p.
024924 Berger, M.J.* Adaptive mesh refinement for hyperbolic partial
differential equations.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-924,
Ph.D. Thesis. Berger, M.J.* 1982. 118p.
024926 Buchanan, B.G. Duda, R.O.*Principles of rule based expert systems.*
Stanford U. Comp.Sci.Dept.*STAN-CS-82-926; Stanford U. Comp.Sci.Dept.
Heuristic Programming Project.* HPP-82-014.*1982. 55p.
024939 Cohen, P.R.* Planning and problem solving.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-939; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-021.*1982. 61p.
024913 Dietterich, T.G. London, B. Clarkson, K. Dromey, G.* Learning and
inductive inference (a section of the Handbook of Artificial
Intelligence, edited by Paul R. Cohen and Edward A. Feigenbaum).*
Stanford U. Comp.Sci.Dept.*STAN-CS-82-913; Stanford U. Comp.Sci.Dept.
Heuristic Programming Project.*HPP-82-010.*1982. 215p.
024938 Kanade, T.* Vision. By Takeo Kanade. Assistant Editor: Steven A. Shafer.
Contributors: David A. Bourne, Rodney Brooks, Nancy H. Cornelius, James
L. Crowley, Hiromichi Fujisawa, Martin Herman, Fuminobu Komura, Bruce D.
Lucas, Steven A. Shafer, David R. Smith, Steven L. Tanimoto, Charles E.
Thorpe.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-938; Stanford U.
Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-020.*1982. 220p.
024933 Klein, S.T. Shamir, E.*An algorithmic method for studying percolation
clusters.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-933.*1982. 12p.
024928 Kuhn, I.M. Wiederhold, G. Rodnick, J.E. Ramsey-Klee, D.M. Benett, S.
Beck, D.D.*Automated ambulatory medical record systems in the U.S.*
Stanford U. Comp.Sci.Dept.* STAN-CS-82-928.*1982. 66p.
024929 Maier, D. Ullman, J.D.* Fragments of relations.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-929.*1982. 11p.
024941 Martin, P.A.*Integrating local information to understand dialog.*
Stanford U. Comp.Sci.Dept.*STAN-CS-82-941; Stanford U. Comp.Sci.Dept.
A.I. Lab.*AIM-348, Ph.D. Thesis. Martin, P.A.*1982. 125p.
024917 Mujtaba, M.S.* Motion sequencing of manipulators.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-917, Ph.D. Thesis. Mujtaba, M.S. (Department
of Industrial Engineering and Engineering Management).*1982. 291p.
024911 Roberts, B.J. Marashian, I.* Bibliography of Stanford computer science
reports, 1963-1982.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-911.*1982.
59p.
024921 Salisbury, J.K. Jr.* Kinematic and force analysis of articulated hands.*
Stanford U. Comp.Sci.Dept.* STAN-CS-82-921, Ph.D. Thesis. Salisbury,
J.K. (Department of Mechanical Engineering).*1982. 97p.
024932 Shortliffe, E.H. Fagan, L.M.* Expert systems research: modeling the
medical decision meking process.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-932; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-003.* 1982. 23p.
024922 Suwa, M. Scott, A.C. Shortliffe, E.H.*An approach to verifying
completeness and consistency in a rule based expert system.* Stanford U.
Comp.Sci.Dept.* STAN-CS-82-922.*1982. 19p.
024927 Ullman, J.D.*Combining state machines and regular expressions for
automatic synthesis of VLSI circuits.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-927.*1982. 14p.
024919 Wall, D.W.*Mechanisms for broadcast and selective broadcast.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-919; Stanford U. SEL. Comp. Systems
Lab.*Tech.rpt. 190, Ph.D. Thesis. Wall, D.W.*1980. 112p.
024923 Wallis, J.W. Shortliffe, E.H.* Explanatory power for medical expert
systems: studies in the representation of causal relationships for
clinical consultation.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-923.*1982.
37p.
024925 Wolper, P.L.*Synthesis of communicating processes from temporal logic
specifications.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-925, Ph.D.
Thesis. Wolper, P.L.* 1982. 111p.
038208 Dong, H. McCluskey, E.J.* Concurrent testing of programmable logic
arrays.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 208; Stanford
U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-11.*
1982. 20p.
038203 Hassan, S.Z.*Algebraic analysis of parallel signature analyzers.*
Stanford U. SEL. Comp. Systems Lab.*Tech. note 203; Stanford U. SEL.
Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-05.*1982.
22p.
038206 Hassan, S.Z.* Testing PLAs using multiple parallel signature analyzers.*
Stanford U. SEL. Comp. Systems Lab.*Tech. note 206; Stanford U. SEL.
Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-09.*1982.
21p.
038210 Hirose, F. Singh, V.* McDDP, a program for partitioning verfication
testing matrices.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 210;
Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-13.* 1982. 25p.
038201 Hughes, J.L.A.*A high-level representation for implementing control flow
structures in dataflow programs.* Stanford U. SEL. Comp. Systems
Lab.*Tech. note 201; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.* Rpt. 82-04.*1982 22p.
038205 Ichikawa, M.* Constant weight code generators.* Stanford U. SEL. Comp.
Systems Lab.*Tech. note 205; Stanford U. SEL. Comp. Systems Lab. Center
for Reliable Computing.* Rpt. 82-07.*1982. 57p.
038202 Johnson, J.D.* DEL formats for recursive languages.* Stanford U. SEL.
Comp. Systems Lab.*Tech. note 202.*1982. 12p.
* 038196 Kanuma, A.*A high level language construct to avoid global loop
bottleneck.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 196.*1982.
36p.
038207 Khakbaz, J. McCluskey, E.J.*Self-testing embedded parity checkers --
exhaustive XOR gate testing.* Stanford U. SEL. Comp. Systems Lab.*Tech.
note 207; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Rpt. 82-10.*1982. 31p.
038211 McCluskey, E.J.*Built-in verification test.* Stanford U. SEL. Comp.
Systems Lab.*Tech. note 211; Stanford U. SEL. Comp. Systems Lab. Center
for Reliable Computing.*Rpt. 82-12.*1982. 8p.
038198 McCluskey, E.J.*A discussion of multiple valued logic circuits.* Stanford
U. SEL. Comp. Systems Lab.*Tech. note 198; Stanford U. SEL. Comp.
Systems Lab. Center for Reliable Computing.*Rpt. 82-02.*1982. 7p.
038199 McCluskey, E.J.* Fault tolerant systems.* Stanford U. SEL. Comp. Systems
Lab.*Tech. note 199; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Rpt. 82-01. 23p.
038197 McCluskey, E.J.* Verification testing.* Stanford U. SEL. Comp. Systems
Lab.*Tech. note 197; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Rpt. 82-07.* 1982. 6p.
038204 Namjoo, M.*Design of concurrently testable microprogrammed control
units.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 204; Stanford U.
SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-06.*1982. 30p.
038213 Namjoo, M.*Design of concurrently testable microprogrammed control
units.* Stanford U. SEL. Comp. Systems Lab.* Tech. note 213; Stanford U.
SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-14.*1982. 8p. Preprint of a paper to be published in the
Proceedings of the MICRO-15 Workshop, Palo Alto, California, October
4-7, 1982.
038212 Namjoo, M.*Techniques for concurrent testing of VLSI processor
operation.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 212; Stanford
U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-13.*1982. 8p.
038209 Rossetti, D.J. Iyer, R.K.* Software related failures on the IBM 3081: a
relationship with system utilization.* Stanford U. SEL. Comp. Systems
Lab.*Tech. note 209; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Rpt. 82-08.*1982. 46p.
038200 Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*1982
International Symposium on Fault Tolerant Computing ( FTCS-12)
Preprints.* Stanford U. SEL. Comp. Systems Lab.*Tech. note 200;
Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-03.* 1982. 32p. Contents: McCluskey, E.J.*Test question, keynote
address; Dong, H.*Modified Berger codes for detection of unidirectional
errors; Iyer, R.K. Rossetti, D.J.*A statistical load dependency model
for CPU errors at SLAC; Khakbaz, J.*Self-testing embedded parity trees;
Namjoo, M. McCluskey, E.J.*Watchdog processors and capability checking;
Wang, L.-T.*Autonomous linear feedback shift register with on-line
fault-detection capability.
* 025229 Bechtolsheim, A. Baskett, F. Pratt, V.*The SUN workstation
architecture.* Stanford U. SEL. Comp. Systems Lab.* Tech.rpt. 229.*1982.
15p.
025230 Gonsalves, T.A.* Packet voice communication on an ethernet local computer
network: an experimental study.* Stanford U. SEL. Comp. Systems
Lab.*Tech.rpt. 230.*1982. 19p.
016878 Agar, E.M. Brewster, J. Friedlander, C.* Speech producing communication
enhancement device user's manual.* Wayne State U.
Comp.Sci.Dept.*CSC-82-014.*1982.
016879 Barlow, R.E. Hsiung, J.H.*Expected information from a life test
experiment.* Cal U., Berkeley. O.R. Center.*ORC 82-05.*1982.
016880 Chang, D.Y.-C. Lawrie, D.*Performance of multiprocessor systems with
space and access contention.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1085.*1982.
016881 Corneil, D. Goldberg, M.*A non-factorial algorithm for canonical
numbering of a graph.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 160.*1982.
* 016882 Culik, K.*On formal and informal proofs for program correctness.* Wayne
State U. Comp.Sci.Dept.*CSC-82-013.* 1982.
* 016883 DeWitt, D.J. Friedland, D.B. Hsiao, D.K. Menon, J.*A taxonomy of
parallel sorting algorithms.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt
482.*1982.
016884 Eklundh, J.-O.* Knowledge based image analysis: some aspects of images
using other types of information.* Royal Inst. of Tech., Stockholm.
Num.Anal. & Computing Sci.Dept.*TRITA-NA-8206.*1982.
016885 Fairweather, G. Keast, P.* ROWCOL - a package for solving almost block
diagonal linear systems arising in H (superscript -1) Galerkin and
collocation H (superscript -1)-Galerkin methods.* Toronto U.
Comp.Sci.Dept.* Tech.rpt. 158.*1982.
016887 Hammarling, S.J.*Some notes on the use of orthogonal similarity
transformations in control.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 08/82.*1982.
016888 Hardie, P.A.* Process migration for resource allocation in distributed
operating systems.* Saskatchewan U. Computational Sci.Dept.*Rpt.
82-09.*1982.
016889 Haynes, C.T.*A theory of data type representation independence.* Iowa U.
Comp.Sci.Dept.*Tech.rpt. 82-04, Ph.D. Thesis. Haynes, C.T.*1982.
* 016890 Israel, D.J.*On interpreting semantic network formalisms.* Bolt,
Beranek and Newman, Inc.*BBN rpt. 5117.*1982.
016891 Katz, R.H. Moran, J. Ramschandran, U. Schuh, D.*Experiences in porting
and extending CAD software.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt.
484.*1982.
016892 Langmyhr, D.F.*A general assembler for microprocessors.* Oslo U.
Informatics Inst.*Res.rpt. 069.*1982.
016893 Lansner, A.* Information processing in a network of model neurons: a
computer simulation study.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8211.*1982.
016894 Lytle, R.J.* Site characterization using knowledge engineering -- an
approach for improving future performance.* Cal U. Lawrence Livermore
Lab.*UCID-19560.* 1982.
016895 Maluszynski, J.* Two level grammars - an equational approach.* Hamburg U.
Institut fuer Informatik.*Bericht nr. 086.*1982.
016896 McLean, J.*A formal foundation for the trace method of software
specification.* U.S. Naval Res.Lab.*NRL Memo.Rpt. 4874.*1982.
016897 Ross, S.M. Schiechner, Z.*Some reliability applications of the
variability ordering.* Cal U., Berkeley. O.R. Center.*ORC 82-06.*1982.
016898 Schiel, U.*The temporal hierarchic data model ( THM).* Stuttgart.
Universitaet. Institut fuer Informatik.* Bericht 10/82.*1982.
016899 Schmidt, J.W. Lamersdorf, W.* Relational data model: a definition and its
formalization.* Hamburg U. Institut fuer Informatik.*Bericht nr.
088.*1982.
016900 Sidner, C.L.* Protocols of users manipulating visually presented
information with natural language.* Bolt, Beranek and Newman, Inc.*BBN
rpt. 5128.*1982.
016902 U.K. National Physical Lab. Protocol Standards Group. Rayner, D.*A
system for testing protocol implementations, by the NPL Protocol
Standards Group. Edited by D. Rayner.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 09/82.*1982.
016903 Wand, A.*Coroutine sequencing in SIMULA. Part I: What is wrong with the
QPS definition? Part II: Some alternatives for redefinition of QPS. Part
III: Proofs from part II.* Oslo U. Informatics Inst.*Res.rpt. 070.*1982.
3 volumes.
016904 Yesha, Y.* Time space tradeoffs for matrix multiplication and the
discrete Fourier transform on any general sequential random-access
computer.* Toronto U. Comp.Sci.Dept.*Tech.rpt. 159.*1982.
016905 Zahar, R.V.M.*The computation of subdominant solutions of linear
difference systems.* Auckland U. Comp.Sci.Dept.* Rpt. 027.*1982.
016906 Zu-fan, M.* Partitioning a stiff ordinary differential system by a
scaling technique.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.*TRITA-NA-8211.* 1982.
VOL. 4, NO. 13 01/15/83
016907 Carbonell, J.G.* Learning by analogy: formulating and generalizing plans
from past experience.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-126.*1982.
016908 Carbonell, J.G.* Meta-language utterances in purposive discourse.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-125.*1982.
016909 Ericson, L.W.* DPL-82: a language for distributed processing.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-129.*1982.
016910 Leverett, B.W.*Topics in code generation and register allocation.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-130.*1982.
016911 Schwanke, R.W.* Execution environments in programming languages and
operating systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-124.
Ph.D. Thesis. Schwanke, R.W.*1982.
016912 Tomita, M.* Learning of construction of finite automata from examples
using hill climbing. RR: regular set recognizer.* Carnegie Mellon U.
Comp.Sci.Dept.* CMU-CS-82-127.*1982.
016913 Archer, J.E. Jr.*The design and implementation of a cooperative program
development environment.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-468,
Ph.D. Thesis. Archer, J.E. Jr.*1982.
016914 Archer, J. Jr.* Display condensation of program test.* Cornell U.
Comp.Sci.Dept.*Tech.rpt. 81-463.*1981.
016915 Borodin, A. Hopcroft, J.E.* Merging on parallel models of computation.*
Cornell U. Comp.Sci.Dept.*Tech.rpt. 80-472.*1981.
016916 Constable, R.L. Zlatin, D.R.*The type theory of PL/CV3.* Cornell U.
Comp.Sci.Dept.*Tech.rpt. 81-464.*1981.
016917 Helle, O.*On the use of abstract data types to specify the modules of a
system.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-469.*1981.
016918 Kadin, J.*A note on the complexity of Goedel numberings and
isomorphisms.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-466.*1981.
016919 Krafft, D.B.* AVID: a system for the interactive development of
verifiably correct programs.* Cornell U. Comp.Sci.Dept.*Tech.rpt.
81-467.*1981.
016920 Luk, F.T.*On the Minres method of factor analysis.* Cornell U.
Comp.Sci.Dept.*Tech.rpt. 81-465.*1981.
016921 Luk, F.T.* Orthodonal rotation to a partially specified target.* Cornell
U. Comp.Sci.Dept.*Tech.rpt. 81-470.* 1981.
016922 Pevsner, C.D.* Rendezvous primitives for operating system design.*
Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-471.* 1982.
016923 Pritchard, P.*Fast compact prime number sieves (among others).* Cornell
U. Comp.Sci.Dept.*Tech.rpt. 81-473.* 1981.
016924 Barnes, E.R.*An algorithm for separating patterns by ellipsoids.* IBM
Watson Res. Center.*RC 9500.*1982.
016925 Blum, A. MacNair, E.A. Sauer, C.H.*The research queueing Package:
graphics developments.* IBM Watson Res. Center.* RC 9513.*1982.
016926 Burstein, M. Hong, S.J. Nair, R.*Spatial distribution of wires in master
slice VLSI.* IBM Watson Res. Center.*RC 9477.*1982.
016927 Bux, W. Truong, H.L.* Mean delay qpproximation for cyclic service
queueing systems.* IBM Watson Res. Center.*RZ 1162.*1982.
016928 Carroll, J.M. Mack, R.L.*Actively learning to use a word processor.* IBM
Watson Res. Center.*RC 9482.*1982.
016929 Carroll, J.M. Mack, R.L.* Learning to use a word processor: by doing, by
thinking, and by knowing.* IBM Watson Res. Center.*RC 9481.*1982.
016930 Carroll, J.M.*Learning, using, and designing filenames and command
paradigms.* IBM Watson Res. Center.*RC 9488.* 1982.
016931 Engbersen, A.P.J.* TOPPSY: a time overlapped parallel processing system.*
IBM Watson Res. Center.*RZ 1164.* 1982.
016932 Fagin, R. Vardi, M.Y.* Armstrong databases for functional and inclusion
dependencies.* IBM Watson Res. Center.*RJ 3500.*1982.
016933 Gladney, H.M.*A note on enumerations.* IBM Watson Res. Center.*RJ
3573.*1982.
016934 Goodman, T.N.T. Micchelli, C.A.*Limits of spline functions with period
knots.* IBM Watson Res. Center.*RC 9478.* 1982.
016935 Guido, A.A. Mainey, D.T. Penney, B.H.* Centralized computer operations.*
IBM Watson Res. Center.*RC 9485.*1982.
016936 Kirkpatrick, D.G. Klawe, M.M.* Alphabetic minimax trees.* IBM Watson Res.
Center.*RJ 3543.*1982.
016937 Klawe, M.*Limitations on explicit constructions of expanding graphs.* IBM
Watson Res. Center.*RJ 3544.*1982.
016938 Koenig, W. Etienne, R.* Hierarchical decomposition and parameterization
in a VLSI layout editor.* IBM Watson Res. Center.*RJ 3549.*1982.
016939 Ladner, R.E. Lipton, R.J. Stockmeyer, L.J.* Alternating pushdown and
stack automata.* IBM Watson Res. Center.*RC 9415.*1982.
016940 Lew, J.S. Quarles, D.A. Jr.* Nonnegative solutions of a nonlinear
recurrence.* IBM Watson Res. Center.*RC 9427.* 1982.
016941 Lewis, C. Mack, R.*The role of abduction in learning to use a computer
system.* IBM Watson Res. Center.*RC 9433.* 1982.
016942 Liniger, W. Odeh, F.*Accurate multistep methods for`smooth stiff
problems.* IBM Watson Res. Center.*RC 9473.*1982.
016943 Liu, C.N. Fatemi, M. Waag, R.C.*Digital processing for improvement of
ultrasonic abdominal images.* IBM Watson Res. Center.*RC 9499.*1982.
016944 Malhotra, A. Markowitz, H.M. Pazel, D.P.*The EAS-E programming language.*
IBM Watson Res. Center.*RC 8935.* 1981, revised.
016945 Morgan, S.P.* Formal specification of static semantics with an affix
grammar translator generator.* IBM Watson Res. Center.*RC 9456.*1982.
016946 Roth, J.P. Levy, L.S.*Equivalence of hardware and software.* IBM Watson
Res. Center.*RC 9464.*1982.
016947 Roth, J.P.* VLSI verification and correction: 16th IBM Computer Science
Symposium, Tokyo, October 1-4, 1982.* IBM Watson Res. Center.*RC
9525.*1982.
016948 Savir, J.*Good controllability and observability do not guarantee good
testability.* IBM Watson Res. Center.*RC 9432.*1982.
016949 Stone, H.S.*Data base applications of the FETCH-AND-ADD instruction.* IBM
Watson Res. Center.*RC 9467.*1982.
016950 Tcha, D.-W. Lee, B.-I.*A branch and bound algorithm for the multi-level
uncapacitated facility location problem.* IBM Watson Res. Center.*RC
9533.*1982.
016951 Tsai, R.Y. Huang, T.S.*Analysis of 3-D time varying scene.* IBM Watson
Res. Center.*RC 9479.*1982.
016952 Weller, D.L.* Device independence using dynamic generic operator
selection.* IBM Watson Res. Center.*RJ 3518.* 1982.
016953 Weller, D.L.*A relational representation of an abstract type system.* IBM
Watson Res. Center.*RJ 3503.*1982.
016954 Wolfe, P.*Checking the calculation of gradients.* IBM Watson Res.
Center.*RC 9459.*1982.
016955 Ziv, A. Toupin, R.A.*An iterative method for the computation of
eigenvalues of a matrix.* IBM Watson Res. Center.*RC 9491.*1982.
016956 Bernadou, M. Ciarlet, P.G. Hu, J.*On the convergence of incremental
methods in finite elasticity.* INRIA.*Rapport de Recherche 135.*1982.
016957 Chavent, G.*Local stability of the output least square: parameter
estimation technique.* INRIA.*Rapport de Recherche 136.*1982.
016958 Darondeau, P.*An enlarged definition and complete axiomatization of
observational congruence of finite processes.* INRIA.*Rapport de
Recherche 140.*1982.
016959 Glowinski, R. Keller, H. Reinhart, L.* Continuation conjugate gradient
methods for the least square solution of nonlinear boundary value
problems.* INRIA.*Rapport de Recherche 141.*1982.
016960 Magazine, M.*An approximation to the optimum checkpoint interval using
integer programming.* INRIA.*Rapport de Recherche 139.*1982.
016961 Melese, B.* Metal, un langage de specification pour le systeme mentor.*
INRIA.*Rapport de Recherche 142.*1982.
016962 Barber, G. Hewitt, C.*Foundations for office semantics.* M.I.T. Lab. for
Comp.Sci.*TM-225.*1982.
016963 Barber, G.*Supporting organizational problem solving with a workstation.*
M.I.T. Lab. for Comp.Sci.*TM-224.*1982.
016964 Bergstra, J. Chmielinska, A. Tiuryn, J.*" Hoare's logic is not complete
when it could be".* M.I.T. Lab. for Comp.Sci.*TM-226.*1982.
016965 Chu, T.-A.* Circuit analysis of self timed elements for NMOS VLSI
systems.* M.I.T. Lab. for Comp.Sci.*TM-220.* 1982.
016966 Cosmadakis, S.S.*The complexity of evaluation relational queries.* M.I.T.
Lab. for Comp.Sci.*TM-229.*1982.
016967 diSessa, A.A.*A principled design for an integrated computational
environment.* M.I.T. Lab. for Comp.Sci.* TM-223.*1982.
016968 Jouannaud, J.-P. Lescanne, P. Reinig, F.* Recursive decomposition
ordering and multiset orderings.* M.I.T. Lab. for
Comp.Sci.*TM-219.*1982.
016969 Kleitman, D. Leighton, F.T. Lepley, M. Miller, G.L.*An asymptotically
optimal layout for the shuffle exchange graph.* M.I.T. Lab. for
Comp.Sci.*TM-231.*1982.
016970 Leighton, F.T. Lepley, M. Miller, G.L.* Layouts for the shuffle exchange
graph based on the complex plane diagram.* M.I.T. Lab. for
Comp.Sci.*TM-221.*1982.
016971 Leighton, F.T.*New lower bound techniques for VLSI.* M.I.T. Lab. for
Comp.Sci.*TM-227.*1982.
016972 Papadimitriou, C.H. Zachos, S.K.*Two remarks on the power of counting.*
M.I.T. Lab. for Comp.Sci.*TM-228.*1982.
016973 Shamir, A.*Embedding cryptographic trapdoors in arbitrary knapsack
systems.* M.I.T. Lab. for Comp.Sci.*TM-230.* 1982.
016974 Sieker, F.M. zu*A telex gateway for the internet.* M.I.T. Lab. for
Comp.Sci.*TM-222.*1982.
020279 Anderson, T.L.*The design of a multiprocessor development system.* M.I.T.
Lab for Comp.Sci.*TR-279.*1982.
020277 Johnson, M.G.*Efficient modeling for short channel MOS circuit
simulation.* M.I.T. Lab for Comp.Sci.*TR-277.* 1982.
020275 Kunin, J.S.*Analysis and specification of office procedures.* M.I.T. Lab
for Comp.Sci.*TR-275, Ph.D. Thesis. Kunin, J.S. (This report is a minor
revision of a thesis of the same title submitted to the Department of
Electrical Engineering and Computer Science in January 1982).*1982.
020274 Leighton, F.T.* Layouts for the shuffle exchange graph and lower bound
techniques for VLSI.* M.I.T. Lab for Comp.Sci.*TR-274, Ph.D. Thesis.
Leighton, F.T.*1982.
020278 Rosenstein, L.S.* Display management in an integrated office
workstation.* M.I.T. Lab for Comp.Sci.*TR-278.* 1982.
020276 Srivas, M.K.*Automatic synthesis of implementations for abstract data
types from algebraic specifications.* M.I.T. Lab for Comp.Sci.*TR-276,
Ph.D. Thesis. Srivas, M.K. (This report is a minor revision of a thesis
of the same title submitted to the Department of Electrical Engineering
and Computer Science in December 1981).*1982.
016975 Hemker, P.W.*Numerical aspects of singular perturbation problems.*
Mathematisch Centrum.*NW 133/82.*1982.
016976 Houwen, P.J. van der Sommeijer, B.P.*Improved absolute stability of
predictor corrector methods for retarded differential equations.*
Mathematisch Centrum.*NW 135/82.* 1982.
016977 Houwen, P.J. van der Te Riele, H.J.J.* Linear multistep methods for
Volterra integral equations of the second kind.* Mathematisch
Centrum.*NW 134/82.*1982.
016978 Vries, H.B. de*The two-level algorithm in the solution of the initial
value problem for partial differential equations.* Mathematisch
Centrum.*NW 136/82.*1982.
016979 Hemker, P.W. Zeeuw, P.M. de* Defect correction for the solution of a
singular perturbation problem.* Mathematisch Centrum.*NW 132/82.*1982.
016980 Bakker, J.W. de Zucker, J.I.* Processes and the denotational semantics of
concurrency.* Mathematisch Centrum.*IW 209/82.*1982.
016981 Bergstra, J.A. Klop, J.W.* Fixed point semantics in process algebras.*
Mathematisch Centrum.*IW 206/82.*1982.
016982 Bergstra, J.A. Tucker, J.V.* Hoare's logic for programming languages with
two data types.* Mathematisch Centrum.*IW 207/82.*1982.
016983 Rosenthal, D.S.H.*Managing graphical resources.* Mathematisch Centrum.*IW
205/82.*1982.
016984 Rosenthal, D.S.H. Ten Hagen, P.J.W.* GKS in C.* Mathematisch Centrum.*IW
204/82.*1982.
024937 Ballantyne, M. Bledsoe, W.W. Doyle, J. Moore, R.C. Pattis, R.
Rosenschein, S.J.* Automatic deduction (Chapter XII of Volume III of the
Handbook of Artificial Intelligence, edited by Paul R. Cohen and Edward
A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-937; Stanford U.
Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-019.* 1982. 64p.
024934 Barr, A. Cohen, P.R. Fagan, L.*Understanding spoken language (Chapter V
of Volume I of the Handbook of Artificial Intelligence, edited by Avron
Barr and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*
STAN-CS-82-934; Stanford U. Comp.Sci.Dept. Heuristic Programming
Project.*HPP-82-016.*1982. 52p.
024936 Cohen, P.R.*Models of cognition (Chapter XI of Volume III of the Handbook
of Artificial Intelligence, edited by Paul R. Cohen and Edward A.
Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-936; Stanford U.
Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-018.*1982. 87p.
024935 Tappel, S. Westfold, S. Barr, A.* Programming languages for AI research
(Chapter VI of Volume II of the Handbook of Artificial Intelligence,
edited by Avron Barr and Edward A. Feigenbaum).* Stanford U.
Comp.Sci.Dept.* STAN-CS-82-935; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.*HPP-82-017.*1982. 90p.
024943 Woods, D.R.*Drawing planar graphs.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-943, Ph.D. Thesis. Woods, D.R.* 1981.
016985 Kautz, H.A.*A first-order dynamic logic for planning.* Toronto U. Comp.
Systems Res. Group.*CSRG-144.*1982.
016986 Lengauer, C.*A methodology for programming with concurrency.* Toronto U.
Comp. Systems Res. Group.* CSRG-142, Ph.D. Thesis. Lengauer, C.*1982.
016987 Lochovsky, F.H.* Alpha beta, edited by F.H. Lochovsky.* Toronto U. Comp.
Systems Res. Group.*CSRG-143.*1982. Contents: (1) Lochovsky, F.H.
Tsichritzis, D.C.* Interactive query language for external data bases;
(2) Mendelzon, A.O.*A database editor; (3) Lee, D.L.*A voice response
system for an office information system; (4) Gibbs, S.J.* Office
information models and the representation of 'office objects'; (5)
Martin, P.* Tsichritzis, D.C.*A message management model; (6)
Nierstrasz, O.*Tsichritzis, D.C.* Message flow modeling; (7)
Tsichritzis, D.C. Christodoulakis, S. Faloutsos, C.* Design
considerations for a message file server.
016988 Chen, T.Y.*On the fixpoints of nondeterministic recursive definitions.*
Hong Kong U. Comp. Studies and Appl. Centre.*TR-C4-82.*1982.
016989 Culik, K. Natour, I.A.* Ambiguity types of formal grammars.* Wayne State
U. Comp.Sci.Dept.*CSC-82-014.*1982.
016990 Dellarosa, D. Bourne, L.E. Jr.*Text-based decisions: changes in the
availability of facts due to instructions and the passage of time.*
Colorado U. Cognitive Sci.Inst.* Tech.rpt. 115-ONR.*1982.
016991 Gallopoulos, E. McEwan, S. Visek, D.* MPP simulator manual.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1075.*1982.
016992 Gevarter, W.B.*An overview of computer vision.* U.S. National Bureau of
Standards.*NBSIR 82-2582.*1982.
016993 Gustafson, S.-A.* Complementarity and weak duality in semi infinite
programming.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8217.*1982.
016994 Hu, Y.-S.* Lebesque's constant for natural cubic splines.* Royal Inst. of
Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8201.*1982.
016995 Imielinski, T. Lipski, W. Jr.*A systematic approach to relational
database theory.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS rpt. no. 457.*1982.
016996 Imielinski, T. Lipski, W. Jr.*A technique for translating states between
database schemata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS rpt. no. 458.*1982.
016997 Lotstedt, P.*Numerical simulation of time dependent contact and friction
problems in rigid body mechanics.* Royal Inst. of Tech., Stockholm.
Num.Anal. & Computing Sci.Dept.*TRITA-NA-8214.*1982.
016998 Marczynski, R.W. Milewski, J.*A microprogrammed processor for a data flow
computer.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt.
no. 463.*1982.
016999 Munro, A. Cody, J.A. Towne, D.M.*Instruction mode and instruction
intrusiveness in dynamic skill training.* Southern Cal U. Psych.Dept.
Behavioral Tech.Labs.* Tech.rpt. ONR-099.*1982.
017000 Nelson, R.* Channel access protocols for multi hop broadcast packet radio
networks.* Cal U., L.A. Eng. & Appl.Sci.Sch.
Comp.Sci.Dept.*UCLA-ENG-8259; Cal U., L.A. Comp.Sci.Dept.*CSD-820731,
Ph.D. Thesis. Nelson, R.*1982.
017001 Siefkes, K.D.* Automatic synthesis of MOS networks with cell complexity
constraints.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1087.*1982.
017002 Tiago de Oliveira, J.* Statistical choice of univariate extreme models.
Computer continuation.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8216.*1982.
017003 Tse, T.H. Pong, L.*A review of system development systems.* Hong Kong U.
Comp. Studies and Appl. Centre.*TR-84-82.* 1982.
VOL. 5, NO. 1 02/01/83
017004 Archer, J.E. Jr. Conway, R. Schneider, F.B.*User recovery and reversal in
interactive systems.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-476.*1981.
017005 Babaoglu, O. Joy, W.*Converting a SWAP based system to do paging in an
architecture lacking page-referenced bits.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 81-474.*1981.
017006 Babaoglu, O. Efficient generation of memory reference strings based on
the LRU stack model of program behaviour.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 81-475.* 1981.
017007 Boehm, H.-J.*A logic for expressions with side-effects.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 81-478.*1981.
017008 Borodin, A. Hopcroft, J.E.* Routing in networks.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 80-477.*1981.
017009 Hartmanis, J.*On Goedel speed-up and succinctness of language
representation.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-485.*1982.
017010 Hartmanis, J.*On the structure of feasible computations.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 82-484.*1982.
017011 Hopcroft, J.E. Joseph, D.A. Whitesides, S.H.*On the movement of robot
arms in 2-dimensional bounded regions.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 82-486.*1982.
017012 Luk, F.T.* Oblique procrustes rotations in factor analysis.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 82-481.*1982.
017013 Schlichting, R.D.* Axiomatic verification to enhance software
reliability.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-480.*1982.
017014 Schlichting, R.D. Schneider, F.B.* Fail stop processors: an approach to
designing fault tolerant computing systems.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 81-479.*1981.
017015 Skeen, D.*A quorum based commit protocol.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 82-483.*1982.
041666 Brady, M. Grimson, W.E.L.*The perception of subjective surfaces.* M.I.T.
A.I. Lab.*Memo 666.*1981.
041674 Brooks, R.A.*Solving the find path problem by representing free space as
generalized cones.* M.I.T. A.I. Lab.*Memo 674.*1982.
041665 Davis, R.* Expert systems: Where are we? And where do we go from here?*
M.I.T. A.I. Lab.*Memo 665.*1982.
041664 Forbus, K.D.* Qualitative process theory.* M.I.T. A.I. Lab.*Memo
664.*1982.
041663 Grimson, W.E.L.*The implicit constraints of the primal sketch.* M.I.T.
A.I. Lab.*Memo 663.*1981.
041661 Hollerbach, J.M.*Workshop on the design and control of dexterous hands
(held at the MIT Artificial Intelligence Laboratory on November 5-6,
1981).* M.I.T. A.I. Lab.*Memo 661.*1982.
041657 Poggio, T. Koch, C.*Nonlinear interactions in a dendritic tree:
localization, timing, and role in information processing.* M.I.T. A.I.
Lab.*Memo 657.*1981.
041677 Katz, B. Winston, P.H.* Parsing and generating English using commutative
transformations.* M.I.T. A.I. Lab.* Memo 677.*1982.
041652 Lawler, R.*Some powerful ideas.* M.I.T. A.I. Lab.*Memo 652.*1981.
041656 Lieberman, H.*Seeing what your programs are doing.* M.I.T. A.I.
Lab.*Memo 656.*1982.
041667 McAllester, D.A.* Reasoning utility package. User's manual. Version
one.* M.I.T. A.I. Lab.*Memo 667.*1982.
041675 Poggio, T. Nishihara, H.K. Nielsen, K.R.K.* Zero crossings and
spatiotemporal interpolation in vision: aliasing and electrical coupling
between sensors.* M.I.T. A.I. Lab.* Memo 675.*1982.
041643 Stallman, R.M.*A local front end for remote editing.* M.I.T. A.I.
Lab.*Memo 643.*1982.
041671 Terzopoulos, D.*Multi-level reconstruction of visual surfaces:
variational principles and finite element representations.* M.I.T. A.I.
Lab.*Memo 671.*1982.
041672 Theriault, D.*A primer for the Act-1 language.* M.I.T. A.I. Lab.*Memo
672.*1982.
041678 Winston, P.H.* Learning by augmenting rules and accumulating censors.*
M.I.T. A.I. Lab.*Memo 678.*1982.
017032 Elrad, T. Francez, N.*A weakest precondition semantics for communicating
processes.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt.
244.*1982.
017033 Even, S.*A protocol for signing contracts.* Technion - Israel Inst. of
Tech. Comp.Sci.Dept.*Tech.Rpt. 231.*1982.
017034 Even, S. Goldreich, O. Lempel, A.*A randomized protocol for signing
contracts.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt.
233.*1982.
017035 Dershowitz, N. Zaks, S.*The cycle lemma and some applications.* Technion
- Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 238.*1982.
017036 Goldreich, O.*A protocol for sending certified mail.* Technion - Israel
Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 239.*1982.
017037 Hofri, M.*Analysis of interleaved storage via a constant service queueing
system with "Markon chain driven" input.* Technion - Israel Inst. of
Tech. Comp.Sci.Dept.* Tech.Rpt. 247.*1980.
017038 Hofri, M.*BIN packing: an analysis of the next fit algorithm.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 242.*1982.
017039 Itai, A. Makowsky, J.*On the complexity of Herbrand's theorem.* Technion
- Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 243.*1982.
017040 Mahr, B. Makowsky, J.A.*Characterizing specification languages which
admit initial semantics.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 232.*1982.
017041 Makowsky, J.A. Tiomkin, M.L.*An array assignment for propositional
dynamic logic.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 234.*1982.
017042 Moran, S.*On the densest packing of circles in convex figures.* Technion
- Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 241.*1982.
017043 Tomer, A. Yoeli, M.*On the application of extended Petri nets to the
verification of protocols.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 248.*1982.
017044 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent
programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982.
017045 Budd, T.A.*An APL compiler for a vector processor.* Arizona U.
Comp.Sci.Dept.*TR 82-06.*1982.
017046 Budd, T.A. Levin, G.M.*A UNIX bibliographic database facility.* Arizona
U. Comp.Sci.Dept.*TR 82-01.*1982.
017047 Fraser, C.W.*A generalization of two code ordering optimizations.*
Arizona U. Comp.Sci.Dept.*TR 82-11.*1982.
017048 Fraser, C.W. Hanson, D.R.*The machine independent linker link.* Arizona
U. Comp.Sci.Dept.*TR 82-10.*1982.
017049 Griswold, R.E. Novak, M.* Programmer defined control operations in Icon.*
Arizona U. Comp.Sci.Dept.*TR 82-08.* 1982.
017050 Levin, G.M.*The hoarding banker.* Arizona U. Comp.Sci.Dept.*TR
82-02.*1982.
017051 Myers, E.W.* AVL dags.* Arizona U. Comp.Sci.Dept.*TR 82-09.* 1982.
017052 Myers, E.W.*An O(ElogE+I) expected time algorithm for the planar segment
intersection problem.* Arizona U. Comp.Sci.Dept.*TR 82-03.*1982.
017053 Schlichting, R.D. Schneider, F.B.*Using message passing for distributed
programming: proof rules and disciplines.* Arizona U. Comp.Sci.Dept.*TR
82-05.*1982.
017054 Treat, J.M. Budd, T.A.*Extensions to grid selector composition and
compilation in APL.* Arizona U. Comp.Sci.Dept.*TR 82-07.*1982.
017055 Afshari, P.V. Bruell, S.C. Kain, R.Y.*The computation of the effective
service time of a mixed, multiple class, load dependent station in a
BCMP network.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-19.*1982.
017056 Afshari, P.V. Bruell, S.C. Kain, R.Y.* Mean value analysis of mixed,
multiple class BCMP networks with load dependent service stations.*
Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-18.*1982.
017057 Afshari, P.V. Bruell, S.C. Kain, R.Y.*On a multiple class, multiple
queue, multiple server system.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-13.*1982.
017058 Balbo, G. Bruell, S.C.*Computational aspects of aggregation in multiple
class queueing networks.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-01.*1982.
017059 Barker, J.E. Franta, W.R. Kain, R.Y.*A dual estimator approach to
determining simulation stability, point estimate accuracy and stopping
point.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-08.*1982.
017060 Boley, D. Golub, G.H.*A modified method for reconstructing periodic
Jacobi matrices.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-21.*1982.
017061 Cohoon, J. Sahni, S.*Exact algorithms for special cases of the board
permutation problem.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-15.*1982.
017062 Cohoon, J. Sahni, S.* Heuristics for the board permutation problem.*
Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-16.* 1982.
017063 Du, H.C. Sobolewski, J.S.* Disk allocation for Cartesian product files on
multiple disk systems.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-04.*1982.
017064 Du, H.C.*A heuristic disk allocation method for binary Cartesian product
files.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-14.*1982.
017065 Du, H.C. Baer, J.L.*On the performance of interleaved memories with
non-uniform access probabilities.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-06.*1982.
017066 Franta, W.R. Heath, J.R.*Performance of HYPERchannel networks:
parameters, measurements, models and analysis.* Minnesota U.
Comp.Sci.Dept.*Tech.Rpt. 82-03.*1982.
017067 Franta, W.R. Heath, J.R.*A simple model of the HYPERchannel local network
channel selection procedure in multi channel networks.* Minnesota U.
Comp.Sci.Dept.*Tech.Rpt. 82-20.*1982.
017068 Gold, Y.I. Franta, W.R.*An efficient collision free protocol for
prioritized access control of cable or radio channels with arbitrary
spatial node-configurations. Part III: Protocol for network with
"hidden" nodes.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-02.*1982.
017069 Hoyme, K.P. Bruell, S.C. Afshari, P.V. Kain, R.Y.*A tree structured MVA
algorithm.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-17.*1982.
017070 Ibarra, O.H. Rosier, L.E.*Some comments concerning the analysis of simple
programs over different sets of primitives.* Minnesota U.
Comp.Sci.Dept.*Tech.Rpt. 82-10.*1982.
017071 Kalantari, B. Rosen, J.B.*Construction of global minimum quadratic test
problems.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-07.*1982.
017072 Lai, T.-H. Sahni, S.* Nearly on line scheduling of multiprocessor systems
with memories.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt. 82-11.*1982.
017073 Lai, T.-H. Sahni, S.* Preemptive scheduling of uniform processors with
memory.* Minnesota U. Comp.Sci.Dept.* Tech.Rpt. 82-05.*1982.
017074 McCall, E.H.* Large scale mixed integer programming experiments with
Sperry Univac's series 1100 FMPS.* Minnesota U. Comp.Sci.Dept.*Tech.Rpt.
82-09.*1982.
017075 Zhang, X.S. Rosen, J.B.* Global concave minimization.* Minnesota U.
Comp.Sci.Dept.*Tech.Rpt. 82-12.*1982.
017076 Boyer, R.S. Moore, J.S.* MJRTY - a fast majority vote algorithm.* Texas
U. Computing Sci.Inst.*TR-032.*1981.
017077 Boyer, R.S. Moore, J.S.*A mechanical proof of the unsolvability of the
halting problem.* Texas U. Computing Sci. and Comp.Appl.Inst.
Certifiable Minicomputer Project.*ICSCA-CMP-28.*1982.
017078 Boyer, R.S. Moore, J.S.* Proof checking the RSA public key encryption
algorithm.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable
Minicomputer Project.* ICSCA-CMP-33.*1982.
017079 Boyer, R.S. Green, M.W. Moore, J.S.*The use of a formal simulator to
verify a simple real time control program.* Texas U. Computing Sci. and
Comp.Appl.Inst. Certifiable Minicomputer Project.*ICSCA-CMP-29.*1982.
017080 DiVito, B.L.*Integrated methods for protocol specification and
verification.* Texas U. Computing Sci.Inst.*TR-024.* 1982.
017081 DiVito, B.L.* Verification of communications protocols and abstract
process models.* Texas U. Computing Sci.Inst.* TR-025,* Ph.D. Thesis.
DiVito, B.L.*1982.
017082 DiVito, B.L.* Verification of TCP-like data transport functions.* Texas
U. Computing Sci.Inst.*TR-027.*1982.
017083 DiVito, B.L.* Verification of the Stenning protocol.* Texas U. Computing
Sci.Inst.*TR-026.*1982.
017084 Good, D.I.*The proof of a distributed system in GYPSY.* Texas U.
Computing Sci.Inst.*TR-030.*1982.
017085 Good, D.I.* Reusable problem domain theories.* Texas U. Computing
Sci.Inst.*TR-031.*1982.
017086 Cytron, R.G.*Improved compilation methods for multiprocessors.* Illinois
U. Comp.Sci.Dept.* UIUCDCS-R-82-1088.*1982.
017087 Gentner, D.R. Grudin, J. Larochelle, S. Norman, D.A. Rumelhart,
D.E.*Studies of typing from the LNR Typing Research Group: the role of
context, differences in skill level, errors, hand movements, and a
computer simulation.* Cal U., San Diego. Human Info.Proces. Center.*CHIP
111.* 1982.
017088 Kampfner, R.R. Conrad, M.*Sequential behavior and stability properties of
enzymatic neuron networks.* Wayne State U.
Comp.Sci.Dept.*CSC-82-011.*1982.
017089 Katz, R.H. Weiss, S.* CHIP assemblers: concepts and capabilities.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 486.* 1982.
017090 Katz, R.H. Weiss, S.*A standard design frame for VLSI circuit
prototyping.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 485.*1982.
017091 Lilienkamp, J.E.* Single stage networks in a multiprocessor environment.*
Illinois U. Comp.Sci.Dept.*UIUCDCS-R-1092.* 1982.
017092 Lofgren, M. Magnusson, B.*Evaluation of implementation of access
mechanisms in block structured languages.* Lund U. Comp.Sci.Dept.*1982.
017093 Mann, W.C.*The anatomy of a systemic choice.* Southern Cal U.
Info.Sci.Inst.*ISI/RR-82-104.*1982.
017094 Mann, W.C. Matthiessen, C.M.I.M.*Two discourse generators, by William C.
Mann; A grammar and a lexicon for a text production system, by Christian
M.I.M. Matthiessen.* Southern Cal U. Info.Sci.Inst.*ISI/RR-82-102.*1982.
017095 Nissen, J.C.D. Wichmann, B.A.* ADA Europe guidelines for ADA compiler
specification and selection, by J.C.D. Nissen, B.A. Wichmann, and
others.* U.K. National Physical Lab. Info. Technology and Computing
Div.*DITC 10/82.*1982.
017096 Parkin, G.I.*Enhancement of the CCITT teletex recommendations to
incorporate encipherment and signatures.* U.K. National Physical Lab.
Info. Technology and Computing Div.*DITC 11/82.*1982.
017097 Slotnick, D.L.* Time constrained computation.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1090.*1982.
017098 Wile, D.S.*Program developments: formal explanations of implementation.*
Southern Cal U. Info.Sci.Inst.* ISI/RR-82-099.*1982.
VOL. 5, NO. 2 03/01/83
017099 Azrou, F.*Confidentialite et autorisation d'acces dans les systemes de
bases de donnees.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. no. 318.* 1982
017100 Baille, G. Courtois, B. Laurent, J.*Analyse de defaillances de VLSI par
microscopie electronique.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. no.304.*1982.
017101 Burlet, M. Fonlupt, J.*Polynomial algorithm to recognize a Meyniel
graph.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. no.
303.*1982.
017102 Courtois, B.*Debugging VLSI using SEM.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. no. 310.*1982.
017103 Courtois, B.*Ordering the procedures of a periodic test.* Grenoble.
Universite Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. no. 312.*1982.
017104 Decitre, P. Khider, A. Sergeant, G. Vandome, G. Vatton, I.* Un protocole
de diffusion fiable sur le reseau local "DANUBE".* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. no. 314.*1982.
017105 Maupetit, G.*Conception descendante d'un circuit: etude de cas
(extracteur de racine carree).* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. no.302.* 1982.
017106 Postigo, C. Courtois, B.*Mutual and internal consistency of multiple
copies taking into account a detection latency.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. no. 311.*1982.
017107 Quint, V.*TITUS: un systeme pour l'edition interactive des formules
mathematiques.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. no. 306.* 1982.
017108 Ahues, M. Chatelin, F.*The use of defect correction to refine the
eigenelements of compact integral operators.* IBM Watson Res. Center.*RC
9620.*1982.
017109 Bohlender, G. Bohm, H. Gruner, K. Kaucher, E. Klatte, R. Kramer, W.
Kulisch, U.W. Miranker, W.L. Rump, S.M. Ullrich, Ch. Wolff v.
Gudenberg, J.* Matrix PASCAL.* IBM Watson Res. Center.*RC 9577.*1982.
017110 Cavaretta, A.S. Jr. Goodman, T.N.T. Micchelli, C.A. Sharma, A.*
Multivariate interpolation and the Radon transform. Part III: Lagrange
representation.* IBM Watson Res. Center.*RC 9600.*1982.
017111 Chandra, A.K.* Constant depth reducibility.* IBM Watson Res. Center.*RC
9548.*1982.
017112 Chatelin, F. Miranker, W.L.* Aggregation/disaggregation for eigenvalue
problems.* IBM Watson Res. Center.*RC 9574.* 1982.
017113 Coppersmith, D. Gopal, I. Wong, C.K.*Distribution of the minimum channel
width in VLSI wiring.* IBM Watson Res. Center.*RC 9622.*1982.
017114 Cullum, J. Willoughby, R.A.*Computing the small singular values of large
matrices.* IBM Watson Res. Center.*RC 9550.*1982.
017115 Dahmen, W. Micchelli, C.A.* Multivariate splines - a new constructive
approach.* IBM Watson Res. Center.*RC 9567.* 1982.
017116 Dolev, D.*Bounds on information exchange for byzantine agreement.* IBM
Watson Res. Center.*RJ 3587.*1982.
017117 Dolev, D. Strong, R.*Requirements for agreement in a distributed system.*
IBM Watson Res. Center.*RJ 3418.* 1982.
017118 Dongarra, J.J. Gustavson, F.G. Karp, A.*Implementing linear algebra
algorithms for dense matrices on a vector pipeline machine.* IBM Watson
Res. Center.*RC 9560.*1982.
017119 Durbeck, R.C.* Optical storage.* IBM Watson Res. Center.*RJ 3607.*1982.
017120 Gavish, B. Hantler, S.L.*An algorithm for optimal route selection in SNA
networks.* IBM Watson Res. Center.*RC 9549.*1982.
017121 Gopal, I.S. Coppersmith, D. Wong, C.K.*Optimal wiring of movable
terminals.* IBM Watson Res. Center.*RC 9627.* 1982.
017122 Gupta, S. Lucas, B.*High quality text for multi level displays.* IBM
Watson Res. Center.*RC 9514.*1982.
017123 Hagouel, J.* Source routing and a distributed algorithm to implement it.*
IBM Watson Res. Center.*RC 9553.*1982.
017124 Hailpern, B.* Concurrent processing.* IBM Watson Res. Center.*RC
9582.*1982.
017125 Hauser, R.F.*Localization of information on finite random functions.* IBM
Watson Res. Center.*RZ 1170.*1982.
017126 Lucas, P. Risch, T.*Representation of factual information by equations
and their evaluation.* IBM Watson Res. Center.*RJ 3362.*1982.
017127 Maruyama, K.*Dynamic route selection algorithms for session based
communication networks.* IBM Watson Res. Center.*RC 9552.*1982.
017128 Meyr, H. Popken, L. Keller, H. Muller, H.R.* Synchronization failures in
a chain of repeaters.* IBM Watson Res. Center.*RZ 1176.*1982.
017129 Nadas, A.*A decision theoretic formulation of a training problem in
speech recognition and a comparison of training by unconditional versus
conditional maximum likelihood.* IBM Watson Res. Center.*RC 9617.*1982.
017130 Ng, P.* Distributed compilation and recompilation of database queries.*
IBM Watson Res. Center.*RJ 3375.*1982.
017131 Parr, F.N. Strom, R.E.* NIL: a programming language for software
architecture.* IBM Watson Res. Center.*RC 9227.* 1982.
017132 Paul, G.* VECTRAN and the proposed vector/ array extensions to ANSI
FORTRAN for scientific and engineering computation.* IBM Watson Res.
Center.*RC 9223.*1982.
017133 Reiser, M.* Queueing and delay analysis of a buffer pool with resume
level.* IBM Watson Res. Center.*RZ 1182.* 1982.
017134 Risch, T.*An interpreter for functional rules.* IBM Watson Res.
Center.*RJ 3360.*1982.
017135 Roth, J.P.* Dynamic partitioning.* IBM Watson Res. Center.* RC
9518.*1982.
017136 Rudin, H.*An introduction to automated protocol validation.* IBM Watson
Res. Center.*RZ 1174.*1982.
017137 Ruehli, A.E. Ditlow, G.S.* Circuit analysis, logic simulation and design
verification for VLSI.* IBM Watson Res. Center.*RC 9540.*1982.
017138 Sheridan, P.B.*A note on independent fireability in petri nets.* IBM
Watson Res. Center.*RC 9569.*1982.
017139 Tcha, D.-w. Ibe, O.C.*An algorithm for mapping logical routes into
physical routes in communication networks.* IBM Watson Res. Center.*RC
9602.*1982.
017140 Vecchi, M.P. Kirkpatrick, S.*Global wiring by simulated annealing.* IBM
Watson Res. Center.*RC 9555.*1982.
017141 Vishkin, U.*A parallel design space distributed implementation space (
PDDI) general purpose computer.* IBM Watson Res. Center.*RC 9541.*1982.
017142 Agrawal, S.C. Buzen, J.P.*The aggregate server method for analyzing
serialization delays in computer systems.* Purdue U. Comp.Sci.Dept.*CSD
TR 384.*n.d.
017143 Arthur, J.D. Comer, D.* RESTRUCT: a specification driven file
transformation tool.* Purdue U. Comp.Sci.Dept.*CSD TR 386.*n.d.
017144 Berman, F. Leighton, F.T. Snyder, L.*Optimal tile salvage.* Purdue U.
Comp.Sci.Dept.*n.d.
017145 Brumfield, J.A. Denning, P.J.* Error analysis of homogeneous mean queue
and response time estimators.* Purdue U. Comp.Sci.Dept.*CSD TR
393.*1982.
017146 Buzen, J.P. Bondi, A.B.*The response times of priority classes under
preemptive resume in M/M/m queues.* Purdue U. Comp.Sci.Dept.*CSD TR
387.*n.d.
017147 Dittert, E. O'Donnell, M.J.*Some results on perfect, static-key hashing.*
Purdue U. Comp.Sci.Dept.*CSD TR 390.* n.d.
017148 O'Donnell, M.J. Smith, C.H.*A combinatorial problem concerning processor
interconnection networks.* Purdue U. Comp.Sci.Dept.*CSD TR 352.*n.d.
017149 Paris, J.-F. Ferrari, D.*An analytical study of strategy-oriented
restructuring algorithms.* Purdue U. Comp.Sci.Dept.*CSD TR 395 (also
Report 82.1, PROGRES Group, Electronics Research Laboratory, University
of California at Berkeley).*1982.
017150 Paris, J.-F.*Improving virtual memory performance by off-line page
clustering.* Purdue U. Comp.Sci.Dept.*CSD TR 399.*n.d.
017151 Reed, D.A. Schwetman, H.D.*Cost-performance bounds for multi
microcomputer networks.* Purdue U. Comp.Sci.Dept.* CSD TR 382.*1981.
017152 Rice, J.R.* Array facilities in programming languages.* Purdue U.
Comp.Sci.Dept.*CSD TR 380.*1981.
017154 Rice, J.R.*Machine and compiler effects on the performance of elliptic
PDE software.* Purdue U. Comp.Sci.Dept.*CSD TR 359.*1981.
017155 Snyder, L.* Theft and conspiracy in the take grant protection model.*
Purdue U. Comp.Sci.Dept.*CSD TR 361.* n.d.
017156 Tichy, W.F.*Design, implementation, and evaluation of a revision control
system.* Purdue U. Comp.Sci.Dept.*CSD TR 397.*1982.
017157 Denning, P.J. Kowalk, W.* Error analysis of the mean busy period of
queue.* Purdue U. Comp.Sci.Dept.*CSD TR 398.* 1982.
017158 Tichy, W.F.*A model for representing families of programmed systems.*
Purdue U. Comp.Sci.Dept.*CSD TR 356.*n.d.
017159 Cottle, R.W. Duvall, S.G.*A Lagrangean relaxation algorithm for the
constrained matrix problem.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 82-10.*1982.
017160 Dantzig, G.B.* Mathematical programming and decision making in a
technological society.* Stanford U. O.R. Dept. Systems Optimization
Lab.*SOL 82-11.*1982.
017161 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Procedures for
optimization problems with a mixture of bounds and general linear
constraints.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
82-06.*1982.
017162 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for
SOL/QPSOL: a Fortran package for quadratic programming.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 82-07.*1982.
017163 Hillier, F.S.* Heuristics: a gambler's roll.* Stanford U. O.R. Dept.
Systems Optimization Lab.*SOL 82-12.*1982.
017164 Hoffman, A.J. McCormick S.T.*A fast algorithm that makes matrices
optimally sparset.* Stanford U. O.R. Dept. Systems Optimization
Lab.*SOL 82-13.*1982.
017165 Schittkowski, K.*On the convergence of a sequential quadratic programming
method with an augmented Lagrangian line search functions.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 82-14.*1982.
017166 Thapa, M.N.* Optimization of unconstrained functions with sparse Hessian
matrices-- Newton type methods.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 82-08.*1982.
017167 Abdallah, M.A.N.* Data types as algorithms.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-10.*1982.
017168 Brzozowski, J.A. Fich, F.E.*On generalized locally testable languages.*
Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-05.*1982.
017169 Culik, K. Salomaa, A.* Ambiguity and decision problems concerning number
systems.* Waterloo U. Comp.Sci.Dept.* 1982.
017170 Culik, K. II Pachl, J.*Folding and unrolling systolic arrays.* Waterloo
U. Comp.Sci.Dept.*Res.Rpt. CS-82-11.* 1982.
017171 Culik, K. II Gruska, J. Salomaa, A.* Systolic automata for VLSI on
balanced trees.* Waterloo U. Comp.Sci.Dept.* Res.Rpt. CS-82-01.*1982.
017172 Culik, K. II Gruska, J. Salomaa, A.* Systolic trellis automata:
stability, decidability and complexity.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-04.*1982.
017173 Gentleman, W.M.*Implementing nested dissection.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-03.*1982.
017174 Gonnet, G.H. Munro, J.I.*The analysis of linear probing sort by the use
of a new mathematical transform.* Waterloo U. Comp.Sci.Dept.*Res.Rpt.
CS-82-06.*1982.
017175 Gonnet, G.H.* Balancing binary trees by internal path reduction.*
Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-07.*1982.
017176 Gonnet, G.H.* Unstructured data bases.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-09.*1982.
017177 Mavaddat, F.* WATSON/I: WATerloo's SONically guided robot.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-16.*1982.
017178 Nait-Abdallah, A.*Faisceaux et Semantique des Programmes.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-08, Ph.D. Thesis. Nait-Abdallah, A.*1982.
017179 Pachl, J.K.* Reachability problems for communicating finite state
machines.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-12.*1982.
017180 Taylor, D.J. Black, J.P.*A tool for investigating empirical data
structure robustness.* Waterloo U. Comp.Sci.Dept.* Res.Rpt.
CS-82-02.*1982.
017181 Ziviani, N.*The fringe analysis of search trees.* Waterloo U.
Comp.Sci.Dept.*Res.Rpt. CS-82-15, Ph.D. Thesis. Ziviani, N.*1982.
017182 Agrawal, A. Satyanarayana, A.*On O(/E/) time algorithm for computing the
reliability of a class of directed networks.* Cal. U., Berkeley. O.R.
Center.*ORC 82-07.* 1982.
024930 Baker, H.H.* Depth from edge and intensity based stereo.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-930; Stanford U. Comp.Sci.Dept. A.I.
Lab.*AIM-347, Ph.D. Thesis. Baker, H.H. (Report based on a Ph.D. thesis
submitted to the University of Illinois at Urbana-Champaign in September
of 1981).*1982. 90p.
017184 Barlow, R.E.*System reliability analysis: foundations.* Cal. U.,
Berkeley. O.R. Center.*ORC 82-08.*1982.
017185 Barton, R.R.*Simulation of file migration.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-1096.*1982.
017186 Bokhari, S.H.*Finding maximum on an array processor with a global bus.*
Institute for Comp.Appl. in Sci. and Eng. ( ICASE), NASA Langeley Res.
Center, Hampton, VA.*Rpt. 82-27.*1982.
024949 Broder, A.Z.*The r-Stirling numbers.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-949.*1982. 22p.
017187 Dahlquist, G.*On matrix majorants and minorants, with applications to
differential equations.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8212.*1982.
017188 Dreschler, L.*Ermittlung markanter Punkte auf den Bildern bewegter
Opjekte und Berechnung einer 3D-Beschreibung auf dieser Grundlage.*
Hamburg U. Fachbereich Informatik.* Bericht Nr. 83.*1981.
017189 Grosky, W.I.*Towards a data model for integrated pictorial databases.*
Wayne State U. Comp.Sci.Dept.*CSC-82-012.* 1982.
017190 Hammarling, S.S.* Newton's method for solving the algebraic Riccati
equation.* U.K. National Physical Lab. Info. Technology &
Comp.Div.*DITC 12/82.*1982.
017191 Jantzen, M.* Semi Thue systems and generalized Church Rosser properties.*
Hamburg U. Fachbereich Informatik.* Bericht Nr. 92.*1982.
017192 Jobmann, M.*ILMAOS - Eine Sprache zur Formulierung von
Rechensystemmodellen.* Hamburg U. Fachbereich Informatik.* Bericht Nr.
91.*1982.
017193 Leachman, R.C. Boysen, J.* Aggregate network model of ship overhaul.*
Cal. U., Berkeley. O.R. Center.*ORC 82-02.* 1982.
017194 Radig, B.*Symbolische Beschreibung von Bildfolgen I: Relationengebilde
und Morphismen.* Hamburg U. Fachbereich Informatik.*Bericht Nr.
90.*1982.
017195 Schachter, R.D.*An incentive approach to eliciting probabilities.* Cal.
U., Berkeley. O.R. Center.*ORC 82-09.*1982.
017196 Tsai, W.-C.*Distributed deadlock detection in distributed database
systems.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1089, Ph.D. Thesis.
Tsai, W.-C.*1982.
VOL. 5, NO. 3 04/01/83
017197 Firdman, H.E.*Toward a theory of cognizing systems: the search for an
integrated theory of AI.* Hewlett Packard Co. Comp.Sci.Lab.*CSL-82-007;
Hewlett Packard Co. Comp.Res. Center.*CRC-TR-82-002.*1982.
017198 Gawron, J.M. King, J.J. Lamping, J. Loebner, J.J. Paulson, E.A. Pullum,
G.K. Sag, I.A. Wasow, T.A.*Processing English with a generalized phrase
structure grammar.* Hewlett Packard Co. Comp.Sci.Lab.*CSL-82-005.*1982.
017199 King, J.J.* Artificial intelligence techniques for device
troubleshooting.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-009; Hewlett
Packard Co. Comp.Res. Center.* CRC-TR-82-004.*1982.
017200 King, J.J.*An investigation of expert systems technology for automated
troubleshooting of scientific instrumentation.* Hewlett Packard Co.
Comp.Sci.Lab.* CSL-82-012; Hewlett Packard Co. Comp.Res. Center.*
CRC-TR-82-002.*1982.
017201 Lamping, J. King, J.J.* IZZI--a translator from Interlisp to Zetalisp.*
Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-010; Hewlett Packard Co.
Comp.Res. Center.* CRC-TR-82-005.*1982.
017202 Lamping, J. King, J.J.* LM/GPSG--a prototype workstation for linguists.*
Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-011; Hewlett Packard Co.
Comp.Res. Center.* CRC-Tr-82-006.*1982.
017203 Bonuccelli, M.A. Maruyama, K.*An algorithm to enforce treeness in a set
of optimal paths.* IBM Watson Res. Center.*RC 8998.*1981.
017204 Chow, W.-M.* Approximations for large scale closed queueing networks.*
IBM Watson Res. Center.*RC 8995.*1981.
017205 Dolev, D. Reischuk, R. Strong, H.R.*'Eventual' is earlier than
'immediate'.* IBM Watson Res. Center.*RJ 3632.*1982.
017206 Haas, L.M. Selinger, P.G. Bertino, E. Daniels, D. Lindsay, B. Lohman, G.
Masunaga, Y. Mogan, C. Ng, P. Wilms, P. Yost, R.* R*: a research
project on distributed relational DBMS.* IBM Watson Res. Center.*RJ
3653.*1982.
017207 Lee, C.W.* Triangulating the d-cube.* IBM Watson Res. Center.*RC
3963.*1981.
017208 Lee, C.W.*Two combinatorial properties of a class of simplicial
polytopes.* IBM Watson Res. Center.*RC 8957.* 1981.
017209 Rivlin, T.J.*The optimal recovery of functions.* IBM Watson Res.
Center.*RC 8977.*1981.
017210 Baccelli, F. Coffman, E.G. Jr.*Analysis of replication in distributed
data bases.* INRIA.*Rapport de Recherche 150.*1982.
017211 Baccelli, F. Fayolle, G.*Definition and analysis of a two dimensional
diffusion process with boundary and jumps.* INRIA.*Rapport de Recherche
160.*1982.
017212 Banatre, J.-P. Frison, P. Quinton, P.*Un algorithme systolique pour la
reconnaissance de mots connectes.* INRIA.*Rapport de Recherche
148.*1982.
017213 Bancilhon, F. Richard, P.* TQL, a textual query language.* INRIA.*Rapport
de Recherche 145.*1982.
017214 Bernadou, M. Boisserie, J.-M.* Free vibration of a thin shell application
to an arch dam.* INRIA.*Rapport de Recherche 161.*1982.
017215 Camion, P.*Improving an algorithm for factorizing polynomials over a
finite field and constructing large irreductible polynomials.*
INRIA.*Rapport de Recherche 152.*1982.
017216 Despeyroux-Savonitto, J.*Une semantique formelle du P-code basee sur les
types abstraits algebriques.* INRIA.* Rapport de Recherche 158.*1982.
017217 Eyries, F.*Synthese d'images de scenes composees de spheres.*
INRIA.*Rapport de Recherche 163.*1982.
017218 Flajolet, P.*On approximate counting.* INRIA.*Rapport de Recherche
153.*1982.
017219 Flajolet, P. Saheb, N.*The complexity of generating an exponentially
distributed variate.* INRIA.*Rapport de Recherche 159.*1982.
017220 Glowinske, R. Periaux, J. Dinh, Q.V.* Domain decomposition methods for
nonlinear problems in fluid dynamics.* INRIA.*Rapport de Recherche
147.*1982.
017221 Gonzalez, R. Rofman, E.*On deterministic control problem: an
approximation procedure for the optimal cost.* INRIA.* Rapport de
Recherche 151.*1982.
017222 Katai, O.* Optimal control of discharge from a reservoir based on
Kushner's finite Markov chain approximation of river flow diffusion
process.* INRIA.*Rapport de Recherche 156.*1982.
017223 Kott, L.*Unfold/fold program transformation.* INRIA.* Rapport de
Recherche 155.*1982.
017224 Rannou, R.*Tris pour machines synchrones.* INRIA.*Rapport de Recherche
154.*1982.
017225 Apte, C.* Expert knowledge management for multi-level modelling.* Rutgers
U. Comp.Sci.Res.Lab.*LCSR-TR-41.* 1982.
017226 Dowd, M.* Forcing and the P hierarchy.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-35.*1982.
017227 Dowd, M.* Gaussian elimination runs in polynomial time.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TM-03.*1982.
017228 Dowd, M.* Isomorphism of complete sets.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-34.*1982.
017229 Dowd, M.*Some new sequencings of groups.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-33.*1982.
017230 Drastal, G.A. Kulikowski, C.A.* Knowledge based acquisition of rules for
medical diagnosis.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TM-97.*1982.
017231 Kastner, J.K. Weiss, S.M. Kulikowske, C.A.* Treatment selection and
explanation in expert medical consultation: application to a model of
ocular herpes simplex.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-132.*1982.
017232 Lafue, G.M.E.* Semantic integrity management of databases: a survey.*
Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-32.*1982.
017233 Lantz, B.*The AIMDS interactive command parser.* Rutgers U.
Comp.Sci.Res.Lab.*CBM-TM-94.*1982.
017234 Lantz, B.*The AIMDS on-line documentation facility.* Rutgers U.
Comp.Sci.Res.Lab.*CBM-TM-95.*1982.
017235 Mitchell, T.M. Utgoff, P.E. Banerji, R.* Learning by experimentation:
acquiring and modifying problem solving heuristics.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-31.* 1982.
017236 Nudel, B.* Consistent labeling problems and their algorithms: part II.*
Rutgers U. Comp.Sci.Dept.* DCS-TR-113.*1982.
017237 Politakis, P.G.*Using empirical analysis to refine expert system
knowledge bases.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-130, Ph.D.
Thesis. Politakis, P.G.*1982.
017238 Ryder, B.G.*Incremental data flow analysis.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-120.*1982.
017239 Smith, D.E.* FOCUSER: a strategic interaction paradigm for language
acquisition.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-36, Ph.D. Thesis.
Smith, D.E.*1982.
017240 Srinivasan, C.V.*Notes on object centered associative memory
organization.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-19.*1981.
017241 Utgoff, P.E.*Acquisition of appropriate bias for inductive concept
learning.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TM-02.*1982.
017242 Weiss, S. Kulikowske, C. Apte, C. Uschold, M.*Building expert systems for
controlling complex programs.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-40.*1982.
017243 Yuchuan, Y. Kulikowske, C.A.*Multiple strategies of reasoning for expert
systems.* Rutgers U. Comp.Sci.Res.Lab.*CBM-TR-131.*1982.
017244 Stanford U. Comp.Sci.Dept.* Computer Science at Stanford: 1981-1982.
Prepared for the President's Advisory Committee on Computer Science, by
Paul Armer and Jonathan Abbis.*Nov. 1, 1982.
024956 Barr, A.* Artificial intelligence: cognition as computation.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-956; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.* HPP-82-29.*1982. 28p.
048301 Chan, T.F.* Stability analysis of finite difference schemes for the
advection diffusion equation.* Stanford U. Comp.Sci.Dept. Numerical
Analysis Project.*Manuscript NA-83-01.*1983. 18p.
024955 Goldman, R.*Design of an interactive manipulator programming
environment.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-955; Stanford U.
Comp.Sci.Dept. A.I. Lab.* AIM-350, Ph.D. Thesis. Goldman, R.*1982.
145p.
024954 Manna, Z. Pneuli, A.*How to cook a temporal proof system for your pet
language.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-954.*1982. 14p.
024957 Navathe, S. Ceri, S. Wiederhold, G. Dou, J.* Vertical partitioning for
physical and distribution design of databases.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-957 (STAN-CS-82-957).*1983. 32p.
024951 Pratt, V.*Five paradigm shifts in programming language design and their
realization in Viron, a dataflow programming environment.* Stanford U.
Comp.Sci.Dept.* STAN-CS-82-951.*1982. 9p.
024953 Buchanan, B.G.*Partial bibliography of work on expert systems.* Stanford
U. Comp.Sci.Dept.*STAN-CS-82-953; Stanford U. Comp.Sci.Dept. Heuristic
Programming Project.* HPP-82-30.*1982. 13p.
017245 Amit, Y.*Review of conceptual dependency theory.* Edinburgh U. A.I.
Dept.*Occasional Paper 008.*1977.
017246 Bowen, D.L. (ed.)* DECsystem-10 Prolog user's manual.* Edinburgh U. A.I.
Dept.*Occasional Paper 027.*1982.
017247 Bundy, A. Howe, J. Boulay, B. du Ross, P.* AI1 exam question booklet.*
Edinburgh U. A.I. Dept.*Occasional Paper 013.*1980.
017248 Bundy, A. Welham, B.*Utility procedures in Prolog.* Edinburgh U. A.I.
Dept.*Occasional Paper 009.*1977.
017249 Byrd, L. (ed.)*User's guide to EMAS Prolog.* Edinburgh U. A.I.
Dept.*Occasional Paper 026.*1981.
017250 Luger, G.F.*Some artificial intelligence techniques for describing
problem solving behaviour.* Edinburgh U. A.I. Dept.*Occasional Paper
007.*1977.
017251 Ross, P.M.* TERAK LOGO user's manual (for version 1 - 0).* Edinburgh U.
A.I. Dept.*Occasional Paper 021.*1980.
017252 Ambler, A.P. Popplestone, R.J. Kempf, K.G.*An experiment in the offline
programming of robots.* Edinburgh U. A.I. Dept.*Res. Paper 170.*1982.
017253 Ambler, A.P.* RAPT: an object level robot programming language.*
Edinburgh U. A.I. Dept.*Res. Paper 172.*1982.
017254 Beattie, R.J.* Edge detection for semantically based early visual
processing.* Edinburgh U. A.I. Dept.*Res. Paper 174.*1982.
017255 Boulay, J.B.H. du Howe, J.A.M. Johnson, K.*Making programs vs running
programs: microcomputers in the mathematical education of teachers.*
Edinburgh U. A.I. Dept.*Res. Paper 167.*1982.
017256 Bundy, A. Silver, B.*A critical survey of rule learning programs.*
Edinburgh U. A.I. Dept.*Res. Paper 169.*1982.
017257 Featherstone, R.* Position and velocity transformations between robot end
effector coordinates and joint angles.* Edinburgh U. A.I. Dept.*Res.
Paper 176.*1982.
017258 Fisher, R.B.*A structured pattern matching approach to intermediate level
vision.* Edinburgh U. A.I. Dept.*Res. Paper 177.*1982.
017259 Howe, J.*The microelectronics revolution: a challenge to education.*
Edinburgh U. A.I. Dept.*Res. Paper 173.*1982.
017260 Howe, J. Boulay, B. du Johnston, K.*Re-learning mathematics through
LOGO.* Edinburgh U. A.I. Dept.*Res. Paper 178.* 1982.
017261 Silver, B.*The application of homogenization to simultaneous equations.*
Edinburgh U. A.I. Dept.*Res. Paper 166.*1982.
017262 Sterling, L. Bundy, A.* Meta level inference and program verification.*
Edinburgh U. A.I. Dept.*Res. Paper 168.* 1982.
017263 Sterling, L. Bundy, A. Byrd, L. O'Keefe, R. Silver, B.* Solving symbolic
equations with PRESS.* Edinburgh U. A.I. Dept.*Res. Paper 171.*1982.
017264 Thompson, H.*Handling metarules in a parser for GPSG. Edinburgh U. A.I.
Dept.*Res. Paper 175.*1982.
017265 Athukorala, A.*Some hardware for computer vision.* Edinburgh U. A.I.
Dept.*Working Paper 102.*1981.
017266 Cameron, S.* Body models for every body.* Edinburgh U. A.I.
Dept.*Working Paper 107.*1982.
017267 Koutsou, A.*A survey of model bases robot programming languages.*
Edinburgh U. A.I. Dept.*Working Paper 108.* 1981.
017268 Popplestone, R.J.*Discussion document on body modelling for robot
languages.* Edinburgh U. A.I. Dept.*Working Paper 110.*1982.
017269 Yin, B.*A proposal for studying how to use vision within a robot language
which reasons about spatial relationships.* Edinburgh U. A.I.
Dept.*Working Paper 109.*1982.
017270 Braga, L.P.V.* Mapping techniques using universal kriging.* Montreal U.
Dept. d'Info. et de Recherche Operationnelle.*Publ. 453.*1982.
017271 Brassard, G. Monet, S.*L'indecidabilite sans larmes (ni diagonalisation).
Undecidability without tears (nor diagonalization).* Montreal U. Dept.
d'Info. et de Recherche Operationnelle.*Publ. 445.*1982.
017272 Brassard, G.*Indecidable...bien sur!* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 444.*1982.
017273 Gecsei, J.*Towards distributed processing in videotex.* Montreal U. Dept.
d'Info. et de Recherche Operationnelle.* Publ. 447.*1982.
017274 Horspool, R.N. Bochmann, G.v. Saunders, G.E.* Memory structures for
videotex systems.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 454.*1982.
017275 Lachapelle, P. Magnenat-Thalmann, N. Thalmann, D.* GRAFEDIT 3.0 un
editeur interactif a deux dimensions.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 370A.* 1982.
017276 Maculan, N.*Flot maximum: l'algorithme de Dinic-Karzanov.* Montreal U.
Dept. d'Info. et de Recherche Operationnelle.* Publ. 455.*1982.
017277 Thalmann, N. Bergeron, P. Thalmann, D.* Dream flight: a fictional film
produced by 3D computer animation.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.* Publ. 456.*1982.
017278 Magnenet-Thalman, N. Choquette, A. Thalmann, D.*A macro-program for a
micro-machine.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 458.*1982.
017279 Magnenat-Thalmann, N. Thalmann, D.*Le langage graphique MIRA-2D.*
Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
335.*1981.
017280 Magnenat-Thalmann, N. Thalmann, D.*Le langage graphique MIRA-3D.*
Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
380.*1982.
017281 Demopoulos, W. Friedman, M.*The concept of structure in early twentieth
century philosophy of science.* Western Ontario U. Cognitive Science
Centre.*COGMEM 09.*1982.
017282 Demopoulos, W.*The rejection of truth conditional semantics by Putnam and
Dummett.* Western Ontario U. Cognitive Science Centre.*COGMEM 06.*1982.
017283 Denny, J.P.* Whorf's Algonquian: old evidence and new ideas concerning
linguistic relativity.* Western Ontario U. Cognitive Science
Centre.*COGMEM 11.*1982.
017284 Mather, J.A.* Saccadic eye movements to seen and unseen targets:
preprogramming and sensory input in motor control.* Western Ontario U.
Cognitive Science Centre.* COGMEM 10.*1982.
017285 Stabler, E.P. Jr.* Database and theorem prover designs for question
answering systems.* Western Ontario U. Cognitive Science Centre.*COGMEM
12.*1982.
017286 Stabler, E.P. Jr.*In defense of naturalized epistemology: a response to
Rorty and Putnam.* Western Ontario U. Cognitive Science Centre.*COGMEM
08.*1982.
017287 Stabler, E.P. Jr.* Programs, rule governed behavior and grammars in
theories of language acquisition and use.* Western Ontario U. Cognitive
Science Centre.*COGMEM 07.* 1982.
017288 Anderson, J.R. Farrell, R. Sauers, R.* Learning to plan in LISP.*
Carnegie Mellon U. Psych.Dept.*1982.
017289 Boyer, R.S. Moore, J.S.* Proof checking the RSA public key encryption
algorithm.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable
Minicomputer Project.* ICSCA-CMP-033.*1982.
017290 Bratley, P., Fox, B.L. Schrage, L.E.*A guide to simulation.*1982, draft
of a book.
017291 Culik, K.*Computer programming as constructive mathematical proving.*
Wayne State U. Comp.Sci.Dept.*CSC-82-015.*1982.
017292 Friesen, A.W. Tremblay, J.P. Sorenson, P.G.*A metasystem to generate
computer aided systems analysis and design packages for applications on
small computer systems.* Saskatchewan U. Computational Sci.Dept.*Rpt.
82-10.*1982.
017293 Gentner, D.R.*The development of typewriting skill.* Cal U., San Diego.
Human Info.Proces. Center.*CHIP 114.*1982.
017294 Good, D.I.* Reusable problem domain theories.* Texas U. Computing
Sci.Inst.*TR-031.*1982.
017295 Hagino, T. Honda, M. Koga, A. Makajima, R. Shibayama, E. Yuasa, T.* IOTA
on DECsystem 20-- KWIC example.* Kyoto U.
Res.Inst.Math.Sci.*RIMS-419.*1982.
017296 LeBlanc, T.J.*The design and performance of high level language
primitives for distributed programming.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 492, Ph.D. Thesis. LeBlanc, T.J.*1982.
017297 Lee, T.-Y.P.*Experimental design of a generative model based on working
set size characterizations.* Cal U., Berkeley. Electronic Res.Lab.*Memo.
no. UCB/ERL-M82/56; Cal U., Berkeley. E.E. & Comp.Sci.Dept.
Comp.Sci.Div.* PROGRES rpt. 82.07.*1982.
017298 Lilienkamp, J.E. Lawrie, D.H. Yew, P.-C.*A fault tolerant interconnection
network using error correcting codes.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1094.*1982.
017299 Manber, U.* Concurrent maintenance of a dynamic search structure.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 488.* 1982.
017300 Mangasarian, O.L.*A condition number for differentiable convex
inequalities.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 491.*1982.
017301 Marcal, M.* Magnetic and drift surfaces in toroidal plasma equilibria.*
New York U. Inst. of Math. Sci.* DOE/ER/3077-178.*1982.
017302 Ni, L.M.*A dynamic job migrating strategy for homogeneous local computer
networks.* Michigan State U. Comp.Sci.Dept.* 82-025.*1982.
017303 Ni, L.M.* Load balancing design considerations for distributed systems.*
Michigan State U. Comp.Sci.Dept.* 82-024.*1982.
017304 Olken, F.*Efficient methods for calculating the success function of fixed
space replacement policies.* Cal U. Lawrence Berkeley Lab.*LBL-12370;
Cal U., Berkeley. E.E. & Comp.Sci.Dept. Comp.Sci.Div.*PROGRES rpt.
82.11.*1982.
017305 Porcar, J.M.* File migration in distributed computer systems.* Cal U.
Lawrence Berkeley Lab.*LBL-14763; Cal U., Berkeley. E.E. &
Comp.Sci.Dept. Comp.Sci.Div.*PROGRES rpt. 82.06, Ph.D. Thesis. Porcar,
J.M.*1982.
017306 Wald, J.A. Colbourn, C.J.*Algorithm prototype for partial 2 trees.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 83-01.*1982.
017307 Wells, D.R.* Multirate linear multistep methods for the solution for
systems of ordinary differential equations.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1093.*1982.
017308 Yamagami, S.* Modular cohomology class of foliation and Yakesaki's
duality.* Kyoto U. Res.Inst.Math.Sci.* RIMS-417.*1982.
017309 Yuen, C.K.*The programmer as navigator: a discourse on program
structure.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-21-82.*1982.
017310 Yuen, C.K.*Some practical fast Walsh transform algorithms.* Hong Kong U.
Comp. Studies and Appl. Centre.*TR-11-82.* 1982.
017311 Yuen, C.K.*On the Walsh transform of a shifted vector.* Hong Kong U.
Comp. Studies and Appl Centre.*TR-10-82.* 1982.
VOL. 5, NO. 4 04/22/83
017312 Apt, K.R. Plotkin, G.D.*A cook's tour of countable nondeterminism.*
Aarhus U. Comp.Sci.Dept.*DAIMI PB-133.* 1981.
017313 Harel, D. Kozen, D.C.*A programming language for the inductive sets, and
applications.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-143.*1982.
017314 Jones, N.D. Christiansen, H.* Control flow treatment in a simple
semantics directed compiler generator.* Aarhus U. Comp.Sci.Dept.*DAIMI
PB-137.*1981.
017315 Kornerup, P. Matula, D.W.*An integrated rational arithmetic unit.* Aarhus
U. Comp.Sci.Dept.*DAIMI PB-134.*1981.
017316 Kozen, D.C.*Results on the propositional mu-calculus.* Aarhus U.
Comp.Sci.Dept.*DAIMI PB-146.*1982.
017317 Moller-Nielsen, P. Staunstrup, J.*Early experience from a multiprocessor
project.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-142.*1982.
017318 Mosses, P.* Abstract semantic algebras!* Aarhus U. Comp.Sci.Dept.*DAIMI
PB-145.*1982.
017319 Mosses, P.*A semantic algebra for binding constructs.* Aarhus U.
Comp.Sci.Dept.*DAIMI PB-132.*1981.
017320 Naur, T.* Integer factorization.* Aarhus U. Comp.Sci.Dept.* DAIMI
PB-144.*1982.
017321 Nielson, F.*A denotational framework for data flow analysis.* Aarhus U.
Comp.Sci.Dept.*DAIMI PB-135.*1981.
017322 Nielson, F.* Program transformations in a denotational setting.* Aarhus
U. Comp.Sci.Dept.*DAIMI PB-140.*1981.
017323 Nielson, H.R.* Computation sequences: a way to characterize subclasses of
attribute grammars.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-138.*1981.
017324 Nielson, H.R.*Using computation sequences to define evaluators for
attribute grammars.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-139.*1981.
017325 Sorensen, I.H.* Specification and design of distributed systems.* Aarhus
U. Comp.Sci.Dept.*DAIMI PB-141, Ph.D. Thesis. Sorensen, I.H.
(University of Oxford).*1981.
017326 Cohen, H. Lenstra, H.W. Jr.* Primality testing and Jacobi sums.*
Amsterdam U. Math.Dept.*Rpt. 82-18.*1982.
017327 Cuppen, J.J.M.*The singular value decomposition in product form.*
Amsterdam U. Math.Dept.*Rpt. 81-06.*1981.
017328 Dekker, T.J.* Program correctness and machine arithmetic.* Amsterdam U.
Math.Dept.*Rpt. 81-07.*1981.
017329 Emde Boas, P. van*Another NP-complete partition problem and the
complexity of computing short vectors in a lattice.* Amsterdam U.
Math.Dept.*Rpt. 81-04.*1981.
017330 Emde Boas, P. van* Dominoes are forever.* Amsterdam U. Math.Dept.*Rpt.
83-04.*1983.
017331 Jager, E.M. de Wilders, P.*The Korteweg de Vries equation as a singular
perturbation problem.* Amsterdam U. Math.Dept.*Rpt. 82-07.*1982.
017332 Lenstra, A.K. Lenstra, H.W. Jr. Lovasz, L.* Factoring polynomials with
rational coefficients.* Amsterdam U. Math.Dept.*Rpt. 82-05.*1982.
017333 Mak, R.H.* Simultaneous inverse iteration for real symmetric
bandmatrices.* Amsterdam U. Math.Dept.*Rpt. 82-20.*1982.
017334 Zeinstra, R.* Spanning sets of complex exponentials on curves.* Amsterdam
U. Math.Dept.*Rpt. 82-09.*1982.
017335 Gay, D.M.*On convergence testing in model/trust-region algorithms for
unconstrained optimization.* Bell Labs.* Comp.Sci. Tech.Rpt. 104.*1982.
017336 Kaufman, L.*A package of subroutines for solving systems of linear
equations.* Bell Labs.*Comp.Sci. Tech.Rpt. 106.* 1981.
017337 Kaufman, L.*Usage of the sparse matrix programs in the PORT library.*
Bell Labs.*Comp.Sci. Tech.Rpt. 105.*n.d.
017338 Bertero, M.*Problemi lineari non ben posti e metodi di regolarizzazione.*
Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi
Globale e Applicazioni.* Serie "Problemi non ben pasti ed inversi" No.
04.*1982.
017339 Campi, S.*On the reconstruction of a star shaped body from its
"half-volumes".* Consiglio Nazionale delle Ricerche, Pavia, Italy.
Istituto di Analisi Globale e Applicazioni.* Serie "Problemi non ben
pasti ed inversi" No. 02.*1982.
017340 Frosali, G.P. Pucci, C.*A not well posed problem for the wave equation.*
Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi
Globale e Applicazioni.* Serie "Problemi non ben pasti ed inversi" No.
01.*1982.
017341 Pagani, C.D.*Determining a coefficient of a parabolic equation.*
Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi
Globale e Applicazioni.*Serie "Problemi non ben pasti ed inversi" No.
03.*1982.
017342 Pagani, C.D.* Stability of a surface determined from measures of
potential.* Consiglio Nazionale delle Ricerche, Pavia, Italy. Istituto
di Analisi Globale e Applicazioni.*Serie "Problemi non ben pasti ed
inversi" No. 05.*1982.
017343 Pucci, C.*Problemi non ben posti per l'equazione delle onde.* Consiglio
Nazionale delle Ricerche, Pavia, Italy. Istituto di Analisi Globale e
Applicazioni.*Serie "Problemi non ben pasti ed inversi" No. 06.*1982.
017344 Bakker, J.W. de Bergstra, J.A. Klop, J.W. Meyer, J.-J.CH.* Linear time
and branching time semantics for recursion with merge.* Mathematisch
Centrum.*IW 211/82.*1982.
017345 Bakker, J.W. de Zucker, J.I.*Processes and a fair semantics for the ADA
rendez-vous.* Mathematisch Centrum.*IW 212/82.*1982.
017346 Dekker, K.*On the iteration error in algebraically stable Runge Kutta
methods.* Mathematisch Centrum.*NW 138/82.* 1982.
017347 Geurts, L.J.M.*An overview of the B programming language or B without
tears.* Mathematisch Centrum.*IW 208/82.*1982.
017348 Hemker, P.W.*The use of defect correction for the solution of a
singularly perturbed O.D.E.* Mathematisch Centrum.* NW 139/82.*1982.
017349 Houwen, P.J. van der Sommeijer, B.P.* Predictor corrector methods with
improved absolute stability regions.* Mathematisch Centrum.*NW
137/82.*1982.
017350 Lenstra, A.K.* Factoring polynomials over algebraic number fields.*
Mathematisch Centrum.*IW 213/82.*1982.
017351 Meertens, L.G.L.T.*Incremental polymorphic type checking in B.*
Mathematisch Centrum.*IW 214/82.*1982.
017352 Te Riele, H.J.J.*On generating new amicable pairs from given amicable
pairs.* Mathematisch Centrum.*NW 140/82.* 1982.
017353 Ten Hagen, P.J.W.*The review of GKS version 7.0, the finishing touch.*
Mathematisch Centrum.*IW 210/82.*1982.
017354 Vries, H.B. de*A survey of one-step splitting methods for semi-discrete
first order hyperbolic partial differential equations.* Mathematisch
Centrum.*NW 141/82.*1982.
017355 Castilho, J.M.V. Casanova, M.A. Furtado, A.L.*A temporal framework for
database specifications.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
04/82.*1982.
017356 Furtado, A.L. Furtado, A.A.B. Messeder, F.A.*Instructional graphics
packages to be used with a line printer.* Pontificia U., Rio de Janeiro.
Info.Dept.*No. 06/82.* 1982.
017357 Moura, C.M.O. Casanova, M.A.* Design by example (preliminary report).*
Pontificia U., Rio de Janeiro. Info.Dept.*No. 05/82.*1982.
017358 Nakanishi, T. Menasce, D.A.* Correctness and performance valuation of a
two-phase commit based protocol for DDBs.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 10/81.* 1981.
017359 Brass, B. Erhard, F. Horsch, A. Riethmayer, H.-O. Steinbruggen, R.*
CIP-S: an instrument for program transformation and rule generation.*
Technische Universitat Munchen. Institut fuer Informatik.*TUM I8211.*
1982.
017360 Friede, D.*On partitioned van Wijngaarden grammars (a first attempt).*
Technische Universitat Munchen. Institut fuer Informatik.*TUM
I8207.*1982.
017361 Moller, B.*Unendliche objekte und geflechte.* Technische Universitat
Munchen. Institut fuer Informatik.*TUM I8213.* 1982.
017362 Reiser, A.*Korrektheitsnachweis eines Synchronisations-Protokolls fur
verteilte Datenbandsysteme.* Technische Universitat Munchen. Institut
fuer Informatik.*TUM I8210.*1982.
017363 Castrigiano, D.P.L. Submann, G.* Galilean inertial structure.* Technische
Universitat Munchen. Institut fuer Informatik.*TUM M8211.*1982.
017364 Castrigiano, D.P.L. Submann, G.* Inertial structure.* Technische
Universitat Munchen. Institut fuer Informatik.* TUM M8210.*1982.
017365 Castrigiano, D.P.L.* Metrical geometry of Galilean inertial structure.*
Technische Universitat Munchen. Institut fuer Informatik.*TUM
M8212.*1982.
017366 Holodniok, M. Kubicek, M.* Stable and unstable periodic solutions in the
Lorenz model.* Technische Universitat Munchen. Institut fuer
Informatik.*TUM M8217.*1982.
017367 Lasser, R.* Lacunarity with respect to orthogonal polynomial sequences.*
Technische Universitat Munchen. Institut fuer Informatik.*TUM
M8218.*1982.
017368 Groger, D. Kroll, H.-J. Sorensen, K.* Beitrage zur geometrie und algebra,
Nr. 8.* Technische Universitat Munchen. Institut fuer Informatik.*TUM
M8213.*1982.
017369 Maier, M.R.*Numerische losung singular gestorter Randwertprobleme mit
anwendung auf halbleitermodelle.* Technische Universitat Munchen.
Institut fuer Informatik.* TUM M8216.*1982.
017370 Seydel, R.*Neue methoden zur numerischen berechnung abzweigender losungen
bei randwertproblemen gewohnlicher differentialgleichungen.* Technische
Universitat Munchen. Institut fuer Informatik.*TUM M8215.*1982.
017371 Lindinger, H.*Der full-information-maximum-likelihood-Schatzwert des
linearen okonometrischen modells.* Technische Universitat Munchen.
Institut fuer Informatik.*TUM ISU8202.*1982.
017372 Black, J.B. Galambos, J.A. Reiser, B.J.*Coordinating discovery and
verification research.* Yale U. Cognitive Science Program.*Tech.Rpt.
013.*1982.
017373 Black, J.B. Seifert, C.M.*The psychological study of story
understanding.* Yale U. Cognitive Science Program.* Tech.Rpt. 018.*1982.
017374 Black, J.B. Galambos, J.A. Read, S.* Story comprehension.* Yale U.
Cognitive Science Program.*Tech.Rpt. 017.*1982.
017375 Galambos, J.A.*Normative studies of six characteristics of our knowledge
of common activities.* Yale U. Cognitive Science Program.*Tech.Rpt.
014.*1982.
017376 Reiser, B.J. Black, J.B. Lehnert, W.G.* Thematic knowledge structures in
the understanding and generation of narratives.* Yale U. Cognitive
Science Program.* Tech.Rpt. 016.*1982.
017377 Seifert, C.M. Robertson, S.P.*On-line processing of pragmatic
inferences.* Yale U. Cognitive Science Program.*Tech.Rpt. 015.*1982.
017378 Bonar, J. Soloway, E.*Uncovering principles of novice programming.* Yale
U. Comp.Sci.Dept.*Res.Rpt. 240.*1982.
017379 Dyer, M.G.*In-depth understanding: a computer model of integrated
processing for narrative comprehension.* Yale U. Comp.Sci.Dept.*Res.Rpt.
219, Ph.D. Thesis. Dyer, M.G.* 1982.
017380 Ehrlich, K. Soloway, E.*An empirical investigation of the tacit plan
knowledge in programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 236.*1982.
017381 Lytinen, S.L. Schank, R.C.* Representation and translation.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 234.*1982.
017382 Schank, R.C. Burstein, M.*Modeling memory for language understanding.*
Yale U. Comp.Sci.Dept.*Res.Rpt. 220.* 1982.
017383 Soloway, E. Bonar, J. Ehrlich, K.* Cognitive strategies and looping
constructs: an empirical study.* Yale U. Comp.Sci.Dept.*Res.Rpt.
242.*1982.
017384 Soloway, E. Ehrlich, K. Bonar, J. Greenspan, J.*What do novices know
about programming?* Yale U. Comp.Sci.Dept.* Res.Rpt. 218.*1982.
017385 Carey, M.J. Thompson, C.D.*An efficient implementation of search trees on
0(log N) processors.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
82/101.*1982.
017386 Carey, M.J. Hansen, P.M. Thompson, C.D.* RESST: a VLSI implementation of
a record sorting stack.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
82/102.*1982.
017387 Despain, A. Sequin, C. Thompson, C. Wold, E. Lioupis, D.* VLSI
implementation of digital Fourier transforms.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 82/111.* 1982.
017388 Ferrari, D.*On the foundations of artificial workload design.* California
U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/110.*1982.
017389 Ferrari, D.* Working set size string.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 82/109.*1982.
017390 Karmarker, N. Karp, R.M.*The differencing method of set partitioning.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 82/113.*1982.
017391 Karp, R.M. Luby, M.G.*A new Monte Carlo method for estimating the failure
probability of an n-component system.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/117.*1983.
017392 Lee, T.P.*The properties and limiting behavior of working set size
strings and`flat faults.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
82/108.*1982.
017393 Ousterhout, J.K.* Corner stitching: a data structuring technique for VLSI
layout tools.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
82/114.*1982.
017394 Ousterhout, J.K.* Crystal: a timing analyzer for nMOS VLSI circuits.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/115.*1983.
017395 Paz, A.*A simplified version of H.W. Lenstra's integer programming
algorithm and some applications.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/116.*1983.
017396 Sequin, C.H. Patterson, D.A.*Design and implementation of RISC I.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/106.*1982.
017397 Sequin, C.H. Fujimoto, R.M.* X-tree and Y-components.* California U.,
Berkeley. Comp.Sci.Div.*UCB/CSD 82/107.* 1982.
017398 Thompson, C.D.* Fourier transforms in VLSI.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 82/105.*1982.
017399 Tong, P. Lawler, E.L. Vazirani, V.V.*Solving the weighted parity problem
for gammoids by reduction to graphic matching.* California U., Berkeley.
Comp.Sci.Div.* UCB/CSD 82/103.*1982.
017400 Wilensky, R.*Talking to UNIX in English: an overview of an on-line
consultant.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
82/104.*1982.
017401 Barth, J.S.*An extensible disk operating system for 8080/ Z80
microcomputers. Volume I: Project report.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1097.*1982.
017402 Barth, J.S.*An extensible disk operating system for 8080/ Z80
microcomputers. Volume II: User's manual.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1098.*1982.
017403 Beame, P.* Random routing in constant degree networks.* Toronto U.
Comp.Sci.Dept.*Tech.Rpt. 161.*1982.
017404 Bianchini, R. Bianchini, R. Jr.* Wireability of an ultracomputer.* New
York U. Courant Math. & Computing Lab.*DOE/ER/03077-177.*1982.
017405 Bilgory, A.* Compilation of register transfer language descriptions.*
Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1091,*Ph.D. Thesis. Bilgory,
A.*1982.
017406 Chakravarty, I.*The use of characteristic views as a basis for
recognition of three-dimensional objects.* Rensselaer Polytechnic Inst.
Image Processing Lab.* IPL-TR-034.*1982.
017407 Concepcion, A.I. Zeigler, B.P.* Distributed simulation of distributed
system models.* Wayne State U. Comp.Sci.Dept.*CSC-82-016.*1982.
017408 Digital Equipment Corp. Intel Corp. Xerox Corp.*The Ethernet: a local
area network. Data link layer and physical layer specifications. Version
2.0.*Nov. 1982.
017409 Eklundh, J.O. Kjelldahl, L. Lansner, A. Ronberger, S. Sundblad, Y.*
Integrated Text, Image and Graphics Laboratory. Proposal for a research
laboratory at the Department for Numerical Analysis and Computing
Science (NADA) at the Royal Institute of Technology (RIT) in Stockholm
within the STV Programme for Knowledge Development in Information
Processing.* Royal Inst. of Tech., Stockholm Num.Anal. & Computing
Sci.Dept.* TRITA-NA-8204; Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept. Integral Project.*INTEGRAL-001.* 1982.
017410 Haikala, I.J. Kutvonen, P.H.*Design and implementation of the Mopo
minicomputer system.* Helsinki U. Comp.Sci.Dept.* Rpt. A-1982-05.*1982.
017411 Harms, J.J. Colbourn, C.J.*An optimal algorithm for directing triple
systems using Eulerian circuits.* Saskatchewan U. Computational
Sci.Dept.*Rpt. 83-02.*1983.
017412 Harten, A.*On a class of high resolution total-variation-stable finite
difference schemes.* New York U. Courant Math. & Computing
Lab.*DOE/ER/03077-176.* 1982.
017413 Lacos, C.A. McDermott, T.S.*Interfacing with the user of a syntax
directed editor.* Tasmania U. Info.Sci.Dept.*No. R82-03.*1982.
017414 Lax, P.D. Levermore, C.D.*The small dispersion limit of the Korteweg
deVries equations.* New York U. Courant Math. & Computing
Lab.*DOE/ER/02077-172.*1982.
099077 Rochester U. Comp.Sci.Dept.*1982-83 Computer Science and computer
engineering research review, Computer Science Department, The University
of Rochester.
017415 Ross, S.M.*A model in which component failure rates depend on the working
set.* Cal. U., Berkeley. O.R. Center.*ORC 82-11.*1982.
017416 Sand, J.*On contractive one leg methods.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8218.*n.d.
017417 Sand, J.* Stability and boundedness results for variable step variable
formula methods.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8219.* 1982.
017418 Sethi, I.K. Jain, R.*Determining three dimensional structure of rotating
objects.* Wayne State U. Comp.Sci.Dept.*CSC-83-001.*1983.
017419 Symm, G.T. Wichmann, B. Kok, J. Winter, D.T.*Guidelines for the design of
large modular scientific libraries in Ada* - interim report.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
14/82.*1982.
017420 Tarhio, J.* Attribute evaluation during LR parsing.* Helsinki U.
Comp.Sci.Dept.*Rpt. A-1982-04.*1982.
017421 Wood, R.K.* Polygon to chain reductions and extensions for reliability
evaluation of undirected networks.* Cal U., Berkeley. O.R. Center.*ORC
82-12.*1982.
VOL. 5, NO. 5 05/09/83
017422 Findler, N.V. Cromp, R.F.*An artificial intelligence technique to
generate self-optimizing experimental designs.* Arizona State U.
Comp.Sci.Dept.*TR-83-001.* 1983.
017423 Findler, N.V.*An expert subsystem based on generalized production rules.*
Arizona State U. Comp.Sci.Dept.* TR-82-003.*1982.
017424 Findler, N.V. Lo, R.*A note on the functional estimation of values of
hidden variables--an extended module for expert systems.* Arizona State
U. Comp.Sci.Dept.*TR-82-004.* 1982.
017425 Olsen, D.R. Jr. Badler, N.*An expression model for graphical command
languages.* Arizona State U. Comp.Sci.Dept.*TR-82-001.*1982.
017426 Ozkarahan, E.A. Can, F.*Integration of fact document retrieval systems
within a database machine.* Arizona State U.
Comp.Sci.Dept.*TR-82-002.*1982.
017427 Bisiani, R. Foster, M.J. Kung, H.T. Oflazer, K.* MISE: Machine for
In-System Evaluation of custom VLSI chips.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-132.*1982.
017428 Chansler, R.J. Jr.* Coupling in systems with many processors.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-131, Ph.D. Thesis. Chansler, R.J.
Jr.*1982.
017429 Mohan, J.*A study in parallel computation--the traveling salesman
problem.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-136.*1982.
017430 Schwarz, P.M. Spector, A.Z.* Synchronizing shared abstract types.*
Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-128.* 1982.
017431 Van Wyk, C.J. Bentley, J.L. Weinberger, P.J.* Efficiency considerations
for C programs.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-134.*1982.
017432 Barzilai, Z. Carter, J.L. Chandra, A.K. Rosen, B.K.* Diagnosis based on
signature testing.* IBM Watson Res. Center.*RC 9682.*1982.
017433 Barzilai, Z. Silberman, G. Tang, D. Woo, L.*Simulating pass transistor
circuits using logic simulation machines.* IBM Watson Res. Center.*RC
9693.*1982.
017434 Brand, D.*PLAs versus random logic.* IBM Watson Res. Center.*RC
9505.*1982.
017435 Brantley, W.C. Weiss, J.* FOM: a Fortran optimized machine - a high
performance, high level language machine.* IBM Watson Res. Center.*RC
9640.*1982.
017436 Brantley, W.C. Weiss, J.*Organization and architecture trade-offs in
FOM.* IBM Watson Res. Center.*RC 9700.* 1982.
017437 Burger, W.F.* MLD: a language and data base for modeling.* IBM Watson
Res. Center.*RC 9639.*1982.
017438 Burstein, M. Pelavin, R.* Hierarchical channel router.* IBM Watson Res.
Center.*RC 9715.*1982.
017439 Carroll, J.M. Mack, R.L.* Metaphor, computing systems, and active
learning.* IBM Watson Res. Center.*RC 9636.*1982.
017440 Cesar, C.L. Chu, K.-C. Flurry, G.A. Hailpern, B.T. Jensen, E.P. King,
R.P. Korth, H.F. Martin, M.A. Reich, D.L. Reubenstein, H.B. Rosenfeld,
J.L. Shedletsky, J.J. Theimer, M.M. Willner, B.E. Wolf, P.P.*An
integrated office system.* IBM Watson Res. Center.*RC 9659.*1982.
017441 Dahmen, W. Micchelli, C.A.* Translates of multivariate splines.* IBM
Watson Res. Center.*RC 9618.*1982.
017442 Ferrante, J. Ottenstein, K.J.*A program form based on data dependency in
predicate regions.* IBM Watson Res. Center.*RC 9685.*1982.
017443 Georgiou, C.J. Wood, R.C.*Single chip multiprocessor interconnection
architecture.* IBM Watson Res. Center.* RC 9635.*1982.
017444 Ghosh, S.P.*Some advances in data base access techniques.* IBM Watson
Res. Center.*RJ 3665.*1982.
017445 Gopal, I.S. Jaffe, J.M.* Point to multipoint link control protocols for
satellites.* IBM Watson Res. Center.*RC 9671.*1982.
017446 Gopal, I. Bonucelli, M. Wong, C.K.* Scheduling in multibeam satellites
with interfering zones.* IBM Watson Res. Center.*RC 9663.*1982.
017447 Grumberg, O. Francez, N.*A complete proof rule for (weak) equifair
termination.* IBM Watson Res. Center.*RC 9634.* 1982.
017448 Haerder, T.*Observations on optimistic concurrency control schemes.* IBM
Watson Res. Center.*RJ 3645.*1982.
017449 Hailpern, B.T. Korth, H.F.*An experimental distributed database system.*
IBM Watson Res. Center.*RC 9678.*1982.
017450 Halim, N. Pershing J.*A new language for writing portable and secure
systems.* IBM Watson Res. Center.*RC 9650.* 1982.
017451 Hou, J.C.*A fully associative cache memory controller.* IBM Watson Res.
Center.*RC 9684.*1982.
017452 Jensen, K. Heidorn, G.E.*The fitted parse: 100% parsing capability in a
syntactic grammar of English.* IBM Watson Res. Center.*RC 9729.*1982.
017453 Kerner, D.V.*Generating requirements from enterprise analysis.* IBM
Watson Res. Center.*RC 9694.*1982.
017454 King, R.P. Korth, H.F. Willner, B.E.*Design of a document filing and
retrieval service.* IBM Watson Res. Center.* RC 9696.*1982.
017455 Leavenworth, B.* ADAPT: a tool for the design of reusable software.* IBM
Watson Res. Center.*RC 9728.*1982.
017456 Lomet, D.B.*A high performance, universal, key associative access
method.* IBM Watson Res. Center.*RC 9638.*1982.
017457 Lucas, B.D.*Drawing lines and curves on raster devices using strokes: two
examples.* IBM Watson Res. Center.*RC 9648.*1982.
017458 Mack, R. Lewis, C. Carroll, J.* Learning to use word processors: problem
and prospects.* IBM Watson Res. Center.*RC 9712.*1982.
017459 Malhotra, A. Markowitz, H.M. Pazel, D.P.* Consistent copy: a new
database facility.* IBM Watson Res. Center.*RC 9630.*1982.
017460 Micchelli, C.A.* Orthogonal projections are optimal algorithms.* IBM
Watson Res. Center.*RC 9641.*1982.
017461 Miller, L.A.*How to write: a barely annotated bibliography.* IBM Watson
Res. Center.*RC 9687.*1982.
017462 Nackman, L.R.*Two-dimensional critical point configuration graphs.* IBM
Watson Res. Center.*RC 9642.*1982.
017463 Nadas, A.*A decision theoretic formulation of a training problem in
speech recognition and a comparison of training by uncondition versus
conditional maximum likelihood.* IBM Watson Res. Center.*RC 9617.*1982.
017464 O'Hara, R.P.*An interactive display environment of knitting sheep's
clothing for a wolf.* IBM Watson Res. Center.*RC 9691.*1982.
017465 Porat, S. Francez, N. Moran, S. Zaks, S.* Fair derivations in context
free grammars.* IBM Watson Res. Center.*RC 9664.*1982.
017466 Robinson, J.T.*Experiments with transaction processing on a
multi-microprocessor.* IBM Watson Res. Center.*RC 9725.* 1982.
017467 Sauer, C.H. MacNair, E.A. Kurose, J.F.* Queueing network simulations of
computer communication.* IBM Watson Res. Center.*RC 9727.*1982.
017468 Savir, J. Ditlow, G. Bardell, P.H.* Random pattern testability.* IBM
Watson Res. Center.*RC 9643.*1982.
017469 Sholtz, P.N.*Making high-quality colored images on raster displays.* IBM
Watson Res. Center.*RC 9632.*1982.
017470 Stone, H.S.* Parallel memory allocation using the FETCH-AND-ADD
instruction.* IBM Watson Res. Center.*RC 9674.*1982.
017471 Tang, D.T. Chen, C.L.* Logic test pattern generation using linear codes.*
IBM Watson Res. Center.*RC 9722.*1982.
041681 Barber, G.*Supporting organizational problem solving with a workstation.*
M.I.T. A.I. Lab.*Memo 681.*1982.
041692 Barter, C.J.* Policy protocol interaction in composite processes.* M.I.T.
A.I. Lab.*Memo 692.*1982.
041684 Brooks, R.A. Lozano-Perez, T.*A subdivision algorithm in configuration
space for findpath with rotation.* M.I.T. A.I. Lab.*Memo 684.*1982.
041685 Brooks, R.A.*Symbolic error analysis and robot planning.* M.I.T. A.I.
Lab.*Memo 685.*1982.
041691 Hewitt, C. Jong, P. de* Open systems.* M.I.T. A.I. Lab.* Memo 691.*1982.
041699 Hildreth, E.C. Ullman, S.*The measurement of visual motion.* M.I.T. A.I.
Lab.*Memo 699.*1982.
041686 Hollerbach, J.M.*Computers, brains, and the control of movement.* M.I.T.
A.I. Lab.*Memo 686.*1982.
041700 Hollerbach, J.M.*Dynamic scaling of manipulator trajectories.* M.I.T.
A.I. Lab.*Memo 700.*1982.
041698 Lozano-Perez, T.* Robot programming.* M.I.T. A.I. Lab.*Memo 698.*1982.
041683 Poggio, T.* Visual algorithms.* M.I.T. A.I. Lab.*Memo 683.* 1982.
041668 Richards, W. Nishihara, H.K. Dawson, B.* CARTOON: a biologically
motivated edge detection algorithm.* M.I.T. A.I. Lab.*Memo 668.*1982.
041676 Stevens, K.A.*Implementation of a theory for inferring surface shape from
contours.* M.I.T. A.I. Lab.*Memo 676.* 1982.
041680 Waters, R.C.* LetS: an expressional loop notation.* M.I.T. A.I.
Lab.*Memo 680a.*1983.
041679 Winston, P.H. Binford, T.O. Katz, B. Lowry, M.* Learning physical
descriptions from functional definitions, examples, and precedents.*
M.I.T. A.I. Lab.*Memo 679.* 1982.
040690 Mason, M.T.* Manipulator grasping and pushing operations.* M.I.T. A.I.
Lab.*TR-690, Ph.D. Thesis. Mason, M.T.*1982.
040688 Sjoberg, R.W.* Atmospheric effects in satellite imaging of mountainous
terrain.* M.I.T. A.I. Lab.*TR-688.*1982.
017472 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent
programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982.
017473 Andrews, G.R.* Distributed programming languages.* Arizona U.
Comp.Sci.Dept.*TR 82-13.*1982.
017474 Bruno, J.L.*Probabilistic bounds on the performance of list scheduling.*
Arizona U. Comp.Sci.Dept.*TR 82-19.*1982.
017475 Budd, T.A. Miller, W.C.*Detecting typographical errors in numerical
programs.* Arizona U. Comp.Sci.Dept.*TR 82-14.* 1982.
017476 Downey, P.J. Griswold, R.E.*On a family of nested recurrences.* Arizona
U. Comp.Sci.Dept.*TR 82-18.*1982.
017477 Downey, P.J.*Stochastic analysis of concurrency.* Arizona U.
Comp.Sci.Dept.*TR 82-15.*1982.
017478 Griswold, R.E.*The control of searching and backtracking in string
pattern matching.* Arizona U. Comp.Sci.Dept.*TR 82-20.*1982.
017479 Hanson, D.R.*Low-cost, high-yield code optimization.* Arizona U.
Comp.Sci.Dept.*TR 82-17.*1982.
017480 Novak, M. Griswold, R.E.* Programmer defined evaluation regimes.* Arizona
U. Comp.Sci.Dept.*TR 82-16.*1982.
017481 Agrawal, R. Carey, M. DeWitt, D.* Deadlock detection is cheap.* Cal. U.,
Berkeley. Electronics Res.Lab.*Memo No. UCB/ERL M83/05.*1983.
Comp.Sci.Dept.*TR M83/05.*1983.
017482 Allman, E. Stonebraker, M.*Observations on the evolution of a software
system.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL
M82/59.*1982.
017483 Carey, M.J.*An abstract model of database concurrency control
algorithms.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL
M83/06.*1983.
017484 Carey, M.J.* Granularity hierarchies in concurrency control.* Cal. U.,
Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/01.*1983.
017485 Stonebraker, M. Rubenstein, B. Guttman, A.*Application of abstract data
types and abstract indices to CAD data bases.* Cal. U., Berkeley.
Electronics Res.Lab.*Memo. No. UCB/ERL M83/03.*1983.
017486 Stonebraker, M. Rowe, L.A.* Database portals: a new application program
interface.* Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL
M82/80.*1982.
017487 Stonebraker, M. Woodfill, J. Ranstrom, J. Murphy, M. Kalash, J. Carey,
M. Arnold, K.* Performance analysis of distributed data base systems.*
Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M82/85.*1982.
017488 Woodfill, J. Stonebraker, M.*An implementation of hypothetical relation.*
Cal. U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/02.*1983.
017489 Byrd, R.H. Shultz, G.A.*A practical class of globally convergent active
set strategies for linearly constrained optimization.* Colorado U.
Comp.Sci.Dept.*CU-CS-238-82.* 1982.
017490 Clinkenbeard, D.J.*A quite general text analysis method.* Colorado U.
Comp.Sci.Dept.*CU-CS-237-82.*1982.
017491 Ehrenfeucht, A. Rozenberg, G. Haussler, D.*Conditions enforcing
regularity of context free languages.* Colorado U.
Comp.Sci.Dept.*CU-CS-223-82.*1982.
017492 Ehrenfeucht, A. Rozenberg, G.* Strong iterative pairs and the regularity
of context free languages.* Colorado U.
Comp.Sci.Dept.*CU-CS-208-81.*1981.
017493 Ehrenfeucht, A. Rozenberg, G. Karhumaki, J.*The (generalized) post
correspondence problem with lists consisting of two words is decidable.*
Colorado U. Comp.Sci.Dept.*CU-CS-204-81.*1981.
017494 Gabow, H.N.*An almost-linear algorithm for two processor scheduling.*
Colorado U. Comp.Sci.Dept.*CU-CS-212-81.* 1981, (revised).
017495 Gabow, H.N. Tarjan, R.E.*Efficient algorithms for a family of matroid
intersection problems.* Colorado U. Comp.Sci.Dept.*CU-CS-214-82.*1982.
017496 Gabow, H.N.*Exact and approximate algorithms for scheduling UET systems
on two uniform processors.* Colorado U.
Comp.Sci.Dept.*CU-CS-225-82.*1982.
017497 Gabow, H.N.*Priming the pump for lower bounds on Chomsky form.* Colorado
U. Comp.Sci.Dept.*CU-CS-239-82.*1982.
017498 Haussler, D.*Some results on symmetric DGSMS and DGSM equivalence.*
Colorado U. Comp.Sci.Dept.*CU-CS-199-79.* 1979.
017499 Osterweil, L.J.*The toolpack mathematical software development
environment.* Colorado U. Comp.Sci.Dept.* CU-CS-226-82.*1982.
017500 Rozenberg, G.*On subwords of formal languages.* Colorado U.
Comp.Sci.Dept.*CU-CS-205-81.*1981.
017501 Schnabel, R.B.* Conic methods for unconstrained minimization and tensor
methods for nonlinear equations.* Colorado U.
Comp.Sci.Dept.*CU-CS-227-82.*1982.
017502 Shultz, G.A. Schnabel, R.B. Byrd, R.H.*A family of trust region based
algorithms for unconstrained minimization with strong global convergence
properties.* Colorado U. Comp.Sci.Dept.*CU-CS-216-82.*1982.
017503 Warmuth, M.K. Haussler, D.*On the complexity of iterated shuffle.*
Colorado U. Comp.Sci.Dept.*CU-CS-201-81.*1981.
017504 Wilson, C. Osterweil, L.J.* Omega--a data flow analysis tool for the C
programming language.* Colorado U. Comp.Sci.Dept.*CU-CS-217-82.*1982.
017505 Alterman, R.E.*A system of seven coherence relations for hierarchically
organizing event concepts in text.* Texas U.
Comp.Sci.Dept.*TR-209.*1982.
017506 Bitner, J.R.*An exact calculation of the capacity of hyperboxes.* Texas
U. Comp.Sci.Dept.*TR-194.*1982.
017507 Bitner, J.R.*On the efficiency of algorithm SELECT by Floyd and Rivest.*
Texas U. Comp.Sci.Dept.*TR-183.*1981.
017508 Bitner, J.R.*Storing matrices on disk for efficient row and column
retrieval.* Texas U. Comp.Sci.Dept.*TR-195.*1982.
017509 Bitner, J.R.*Two results on self organizing data structures.* Texas U.
Comp.Sci.Dept.*TR-189.*1982.
017510 Boney, J.F.*Analysis of the M6809 instruction set.* Texas U.
Comp.Sci.Dept.*TR-206.*1981.
017511 Burger, W.F.*A modeling system for mathematical programming.* Texas U.
Comp.Sci.Dept.*TR-177, Ph.D. Thesis. Burger, W.F.*1981.
017512 Emerson, E.A. Clarke, E.M.*Using branching time temporal logic to
synthesize synchronization skeletons.* Texas U.
Comp.Sci.Dept.*TR-208.*1982.
017513 Gouda, M.G. Chu, W.*A finite state model for protocol processes and
services.* Texas U. Comp.Sci.Dept.*TR-198.* 1982.
017514 Gouda, M.G.* Closed covers: to verify progress for communicating finite
state machines.* Texas U. Comp.Sci.Dept.*TR-191.*1982.
017515 Gouda, M.G.*Proving termination for distributed computations on DAGs.*
Texas U. Comp.Sci.Dept.*TR-197.* 1982.
017516 Peterson, J.L.* Webster's seventh new collegiate dictionary: a
computer-readable file format.* Texas U. Comp.Sci.Dept.*TR-196.*1982.
017517 Gouda, M.G.*Systems of communicating machines without deadlocks.* Texas
U. Comp.Sci.Dept.*TR-199.*1982.
017518 Kapur, R.N.*On the synthesis and analysis of reconfigurable computer
programs.* Texas U. Comp.Sci.Dept.*TR-205.* 1982.
017519 Lam, S.S. Shankar, A.U.* Protocol verification via projections.* Texas U.
Comp.Sci.Dept.*TR-207.*1982.
017520 Maekawa, M. Sakamura, K. Ishikawa, C.* Firmware structure and
architectural support for monitors, vertical migration and user
microprogramming.* Texas U. Comp.Sci.Dept.*TR-203.*1982.
017521 Ramakrishnan, I.V. Fussell, D.S. Silberschatz, A.*A linear array matrix
multiplication algorithm.* Texas U. Comp.Sci.Dept.*TR-210.*1982.
017522 Ramakrishnan, I.V. Fussell, D.S. Silberschatz, A.*Towards a
characterization of programs for a model of VLSI array processors.*
Texas U. Comp.Sci.Dept.*TR-202.*1982.
017523 Sejnowski, M.C.* Packet support in the Texas reconfigurable array
computer.* Texas U. Comp.Sci.Dept.*TR-204.*1981.
017524 Springen, N.L.*A source to source translator from Pascal to C.* Texas U.
Comp.Sci.Dept.*TR-190.*1982.
017525 Usui, T.*An experimental grammar for translating English to Japanese.*
Texas U. Comp.Sci.Dept.*TR-201.*1982.
017526 Yu, Y.-T. Gouda, M.G.* Deadlock detection for a class of communicating
finite state machines.* Texas U. Comp.Sci.Dept.*TR-193.*1982.
017527 Enomoto, H. Usami, Y.*Minimum number of edges in graphs with given
diameter and connectivity, I.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
82-02.*1982.
017528 Hagiya, M.*A proof description language and its reduction system.* Tokyo
U. Info.Sci.Dept.*Tech.Rpt. 82-03.*1982.
017529 Kanasaki, K. Yamaguchi, K. Kunii, T.L.*A software development system
supported by a database of structures and operations.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 82-15.*1982.
017530 Goto, E. Soma, T. Inada, N. Ida, T. Idesawa, M. Hiraki, K. Suzuki, M.
Shimizu, K. Philipov, B.*Design of a Lisp machine - FLATS.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 82-09.*1982.
017531 Saito, A. Kano, M.*Some results on factors.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 82-10.*1982.
017532 Kawai, S.* Topology quasi-preservation by local parallel operations.*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-13.* 1982.
017533 Sakamura, K. Ishikawa, C.* High level machine design by dynamic tuning.*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-07.*1982.
017534 Sakamura, K. Ishikawa, C.*The impact of VLSI technology on computer
architecture (VLSI...). (in Japanese).* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 82-08.*1982.
017535 Sato, M.*Algebraic structure of symbolic expressions.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 82-05.*1982.
017536 Yamada-Hisao.*Certain problems associated with the design of input
keyboards for Japanese writing.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
82-14.*1982.
017537 Yamada-Hisao. Imori, M.*One step transformation of periodic sequences by
cellular automata.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 82-06.*1982.
VOL. 5, NO. 6 05/25/83
017538 Aghili, H. Kim, W. McPherson, J. Schkolnick, M. Strong, R.* A highly
available database system.* IBM Watson Res. Center.*RJ 3725.*1982.
017539 Barzilai, Z. Rosen, B.K.*Software support for VLSI testing methods.* IBM
Watson Res. Center.*RC 9781.*1983.
017540 Bharath-Kumar, K. Kermani, P.* Performance evaluation tool ( PET): an
analysis tool for computer communication networks.* IBM Watson Res.
Center.*RC 9766.*1982.
017541 Burger, W.F. Halim, N. Pershing, J.A. Parr, F.N. Strom, R.E. Yemini,
S.*Draft NIL reference manual.* IBM Watson Res. Center.*RC 9732.*1982.
017542 Bux, W. Truong, H.L.* Token ring performance: mean delay approximation.*
IBM Watson Res. Center.*RZ 1199.*1982.
017543 Dahmen, W. Micchelli, C.A.*On the approximation order from certain
multivariate spline spaces.* IBM Watson Res. Center.*RC 9796.*1983.
017544 Das, S.K.*Some dimensionality reduction studies in continuous speech
recognition.* IBM Watson Res. Center.* RC 9797.*1983.
017545 Elrad, T. Francez, N.* Decomposition of distributed programs into
communication closed layers.* IBM Watson Res. Center.*RC 9760.*1982.
017546 Elrad, T. Francez, N.*A weakest precondition semantics for communicating
processes.* IBM Watson Res. Center.*RC 9773.*1982.
017547 Fich, F.E.*Two problems in concrete complexity: cycle detection and
parallel prefix computation.* IBM Watson Res. Center.*RJ 3651, Ph.D.
Thesis. Fich, F.E. (University of California at Berkeley).*1982.
017548 Galil, Z. Paul, W. Reischuk, R.*On tapes versus pushdowns.* IBM Watson
Res. Center.*RJ 3703.*1982.
017549 Gopal, I. Wong, C.K.*Minimizing the number of switchings in an SS/TDMA
system.* IBM Watson Res. Center.*RC 9738.* 1982.
017550 Gopal, I.S. Kermani, P.*The performance of stop and wait protocols over
high delay links.* IBM Watson Res. Center.* RC 9741.*1982.
017551 Greene, B.R. Fujisake, T.*A probabilistic approach for dealing with
ambiguous syntactic structures.* IBM Watson Res. Center.*RC 9764.*1982.
017552 Hoffman, A.J. Wolfe, P.* Minimizing a univodal function of two integer
variables.* IBM Watson Res. Center.*RC 9755.* 1982.
017553 Jaffe, A.B. Mills, R.N.* Color hard copy for computer systems.* IBM
Watson Res. Center.*RJ 3690.*1982.
017554 Klawe, M. Yao, A.*Equal justice for unequal shares of the cake.* IBM
Watson Res. Center.*RJ 3688.*1982.
017555 Krzesinski, A.* Multiclass queueing networks with state dependent
routing.* IBM Watson Res. Center.*RC 9761.* 1982.
017556 Krzesinski, A.* Subnetwork aggregation using mean value analysis.* IBM
Watson Res. Center.*RC 9791.*1983.
017557 Lewis, C.* Composition of productions.* IBM Watson Res. Center.*RC
9730.*1982.
017558 Lorie, R. Plouffe, W.* Complex objects and their use in design
transactions.* IBM Watson Res. Center.*RJ 3706.* 1982.
017559 MacNair, E.A. Sauer, C.H.*The research queueing package: a primer.* IBM
Watson Res. Center.*RC 9784.*1983.
017560 Miranker, W.L. Winkler, A.*Spacetime representations of systolic
computational structures.* IBM Watson Res. Center.*RC 9775.*1982.
017561 Newman, D.J. Rivlin, T.J.*Optimal universally stable interpolation.* IBM
Watson Res. Center.*RC 9751.*1982.
017562 Nicholl, T.M. Lee, D.T. Liao, Y.Z. Wong, C.K.*Constructing the X-Y convex
hull of a set of X-Y polygons.* IBM Watson Res. Center.*RC 9737.*1982.
017563 Parr, F.N. Strom, R.E.* NIL: a high level language for distributed
systems programming.* IBM Watson Res. Center.*RC 9750.*1982.
017564 Reischuk, R.*A solution for the Byzantine generals problem.* IBM Watson
Res. Center.*RJ 3673.*1982.
017565 Reisner, P.* Formal grammar as a tool for analyzing ease of use: some
fundamental concepts.* IBM Watson Res. Center.* RJ 3726.*1982.
017566 Sacca, D.* Closure of database hypergraphs.* IBM Watson Res. Center.*RJ
3723.*1982.
017567 Schiag, M. Liao, Y.Z. Wong, C.K.*An algorithm for optimal two-dimensional
compaction of VLSI layouts.* IBM Watson Res. Center.*RC 9739.*1982.
017568 Seroussi, G. Ma, F.*On the arithmetic complexity of matrix Kronexker
powers.* IBM Watson Res. Center.*RC 9778.*1982.
017569 Siegel, P.H.* Witt spaces: a geometric cycle theory for ko-homology at
odd primes.* IBM Watson Res. Center.*RJ 3729.*1982.
017570 Simons, B.B.*Minimizing maximum lateness for unit length jobs with
release times and deadlines.* IBM Watson Res. Center.*RJ 3237.*1982.
017571 Stockmeyer, L.J.*Optimal orientations of cells in slicing floorplan
designs.* IBM Watson Res. Center.*RJ 3731.* 1982.
017572 Strom, R.E.*Mechanisms for compile time enforcement of security.* IBM
Watson Res. Center.*RC 9749.*1982.
017573 Strong, H.R. Dolev, D.* Byzantine agreement.* IBM Watson Res. Center.*RJ
3714.*1982.
017574 Svobodova, L.* File servers for network based distributed systems.* IBM
Watson Res. Center.*RZ 1186.*1982.
017575 Trivedi, K.S. Yu, P.* Reliability and performance analysis of a ringnet.*
IBM Watson Res. Center.*RC 9792.*1983.
017576 Tsai, R.Y.*Estimating 3-D motion parameters and object surface structures
from the image motion of conic arcs, I: theoretical basis.* IBM Watson
Res. Center.*RC 9787.* 1983.
017577 Unger, S.H. Tan, C.J.* Clocking schemes for high speed digital systems.*
IBM Watson Res. Center.*RC 9754.*1982. (revised).
017578 Yao, A.C.*On optimal arrangements of keys with double hashing.* IBM
Watson Res. Center.*RJ 3730.*1982.
017579 Zilles, S.N.* Types, algebras and modeling.* IBM Watson Res. Center.*RJ
3022.*1980. (revised, 1982).
017580 Bossi, A. Ghezzi, C.*Using FP as a query language for relational
data-bases.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di
Calcolatori.*Rapporto Interno N. 82-11.*1982.
017581 Bracchi, G. Pernici, B.*Modelling control structures in office systems.*
Milan. Politecnico. Dipartimento di Elettronica. Lab. di
Calcolatori.*Rapporto Interno N. 82-19.*1982.
017582 Bussolati, U. Fugini, M. Martella, G.* ACTEN: an action entity model for
conceptual modeling of security information.* Milan. Politecnico.
Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto Interno N.
82-21.*1982.
017583 Ceri, S. Negri, M. Pelagatti, G.*Problems in horizontal data
partitioning.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di
Calcolatori.*Rapporto Interno N. 82-05.*1982.
017584 Ceri, S. Negri, M. Oldano, G. Paolini, P. Pelagatti, G.*The run time
control machine of the Hermes/1 distributed database system.* Milan.
Politecnico. Dipartimento di Elettronica. Lab. di Calcolatori.*Rapporto
Interno N. 82-06.*1982.
017585 Negri, M. Zicari, R.*A storage structure definition language for CODASYL
data bases.* Milan. Politecnico. Dipartimento di Elettronica. Lab. di
Calcolatori.* Rapporto Interno N. 82-20.*1982.
017586 Dahlquist, G.*On one leg multistep methods.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8301.*1983.
017587 Kjelldahl, L. Romberger, S.*Requirements for interactive editing of
diagrams.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8303.*1983.
017588 Persson, M.*Tools and methods for describing and evaluating firmware and
hardware architecture.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8307.*1983.
017589 Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*The
INTEGRAL project: Progress report, 1982.*
017590 Tiden, E.*The Algan simulation system.* Royal Inst. of Tech., Stockholm.
Num.Anal. & Computing Sci.Dept.* TRITA-NA-8306.*1983.
017591 Abadir, M.S. Reghbati, H.K.*Functional testing of semiconductor random
access memories.* Simon Fraser U. Computing Sci.Dept.*TR 82-10.*1982.
017592 Abadir, M.S. Reghbati, H.K.* Testability consideration in hardware
description techniques.* Simon Fraser U. Computing Sci.Dept.*TR
82-09.*1982.
017593 Graham, R.L. Hell, P.*On the history of the minimum spanning tree
problem.* Simon Fraser U. Computing Sci.Dept.*TR 82-05.*1982.
017594 Liestman, A.L. Richards, D.*Toward optimal gossiping schemes with
conference calls.* Simon Fraser U. Computing Sci.Dept.*TR 82-07.*1982.
017595 Luk, W.S.*Performing set intersections and/or unions in a broadcast
network.* Simon Fraser U. Computing Sci.Dept.* TR 82-08.*1982.
017596 Ibaraki, T. Kameda, T.*On the optimal nesting order for computing
N-relational joins.* Simon Fraser U. Computing Sci.Dept.*TR 82-15.*1982.
017597 Cooke, M.P.*A speech controlled information retrieval system.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
15/83.*1983.
017598 Curtis, P.E.M. Cox, M.G.*Reliable computation of the aberration function
representing and interference pattern of a lens.* U.K. National Physical
Lab. Info. Technology and Computing Div.*DITC 07/82.*1982.
017599 Davies, D.W. Clayden, D.O.*A message authenticator algorithm suitable for
a main frame computer.* U.K. National Physical Lab. Info. Technology
and Computing Div.*DITC 17/83.*1983.
017600 Ferriss, D.H. Hammarling, S.J. Martin, D.W. Warham, A.G.P.* Numerical
solution of equations describing electromagnetic propagation in
dielectric tube waveguides.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 16/83.*1983.
017601 Scowen, R.S.*An introduction and handbook for the standard syntactic
metalanguage.* U.K. National Physical Lab. Info. Technology and
Computing Div.*DITC 19/83.*1983.
017602 Wichmann, B.A.*A note on the accuracy of two microprocessors.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
18/83.*1983.
017603 Abu-Sufah, W.*Identifying program localities at the source level.*
Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1108.* 1982.
017604 Campbell, R.H.*A definition of open path expressions.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1102.*1982.
017605 Deckert, J.A.*The UNIX system on the VAX computer.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-83-1117.*1983.
017606 Essick, R.B. IV Kolstad, R.*Notesfile reference manual.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1081.*1982.
017607 Fiduccia, N.S.* Logic design of MOS networks under complexity
restrictions.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1100.*1982.
017608 Gear, C.W.*Efficient stepsize control for output and discontinuities.*
Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1111.*1982.
017609 Gear, C.W. Petzold, L.R.*ODE methods for the solution of
differential/algebraic systems.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1103.*1982.
017610 Gear, C.W.* Root finding in simulation and ODE solution.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1116.*1982.
017611 Gear, C.W. Petzold, L.R.* Singular implicit ordinary differential
equations and constraints.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1110.*1982.
017612 Gear, C.W.* Stiff software: what do we have and what do we need?*
Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1109.* 1982.
017613 Lee, R.L.*The paging behavior of numerical programs.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1101.*1982.
017614 Purtilo, J.*A general purpose PDP 11 interface processor.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1107.*1982.
017615 Robertson, J.E.*Conditions for the distributivity of multiplication with
respect to set addition and their effect on the design of array
multipliers.* Illinois U. Comp.Sci.Dept.*UIUCDCS-R-82-1115.*1982.
017616 Agrawal, R. DeWitt, D.J.*Integrated concurrency control and recovery
mechanisms: design and performance evaluation.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 497.*1983.
017617 Hanrahan, P.*Procedures for parallel array processing on a pipelined
display terminal.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 490.*1982.
017618 Kamesam, P.V. Meyer, R.R.* Multipoint methods for nonlinear networks.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 468.* 1982.
017619 Katz, R.H. Weiss, S.* Transaction management for design databases.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 496.* 1983.
017620 Mangasarian, O.L.* Normal solutions of linear programs.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 498.*1983.
017621 Stacchetti, E.*Analysis of a dynamic, decentralized economic model.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 494, Ph.D. Thesis. Stacchetti,
E.*1983.
017622 Bobrow, D.G. Stefik, M.*The LOOPS manual (preliminary version).* Xerox.
Palo Alto Res. Center.*Memo KB-VLSI-81-13.*1981, (working paper).
017623 Conway, L.*The MPC adventures: experiences with the generation of VLSI
design and implementation methodologies.* Xerox. Palo Alto Res.
Center.*VLSI-81-02.* 1981.
017624 Hon, R.W. Sequin, C.H.*A guide to LSI implementation (second edition).*
Xerox. Palo Alto Res. Center.*SSL-79-07.*1980.
017625 Lyon, R.F.*The optical mouse, and an architectural methodology for smart
digital sensors.* Xerox. Palo Alto Res. Center.*VLSI-81-01.*1981.
017626 Maxwell, J.T. III Ornstein, S.M.* Mockingbird: a composer's amanuensis.*
Xerox. Palo Alto Res. Center.*CSL-83-02.* 1983.
017627 Schmidt, E.E.*Controlling large software development in a distributed
environment.* Xerox. Palo Alto Res. Center.*CSL-82-07, Ph.D. Thesis.
Schmidt, E.E. (University of California at Berkeley).*1982.
017628 Stamos, J.W.*A large object oriented virtual memory: grouping
strategies, measurements, and performance.* Xerox. Palo Alto Res.
Center.*SCG-82-02.*1982.
017629 Stefik, M. Aikins, J. Balzer, R. Benoit, J. Birnbaum, L. Hayes-Roth, F.
Sacerdoti, E.*The organization of expert systems: a prescriptive
tutorial.* Xerox. Palo Alto Res. Center.*VLSI-82-01.*1982.
017630 Stefik, M. Bobrow, D. Bell, A. Brown, H. Conway, L. Tong, C.*The
partitioning of concerns in digital system design.* Xerox. Palo Alto
Res. Center.*VLSI-81-03.*1981.
017631 Stefik, M. Bell, A.G. Bobrow, D.G.* Rule oriented programming in LOOPS.*
Xerox. Palo Alto Res. Center.*Memo KB-VLSI-82-22.*1982. (working paper).
017632 Weyer, S.A.* Searching for information in a dynamic book.* Xerox. Palo
Alto Res. Center.*SCG-82-01, Ph.D. Thesis. Weyer, S.A. (Stanford
University).*1982.
017633 Best, E.* Relational semantics of concurrent programs (with some
applications).* Newcastle Upon Tyne U. Computing Lab.*No. 180.*1982.
017634 Bunt, R.B. Murphy, J.M.*The measurement of locality and the behaviour of
programs.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-03.*1983.
017635 Shrivastava, S.K.*A dependency, commitment and rocovery model for atomic
actions.* Newcastle Upon Tyne U. Computing Lab.*No. 178.*1982.
017636 Carstensen, H.*FairneB bei Petrinetzen mit unendlichem Verhalten.*
Hamburg U. Fachbereich Informatik.*Bericht Nr. 93.*1982.
017637 Conrad, M.* Microscopic macroscopic interface in biological information
processing.* Wayne State U. Comp.Sci.Dept.* CSC-83-003.*1983.
017638 Cram, D.L. Freytag, J.C. Hampton, I. Mall, M. Schmidt, J.W.
Schwinghammer, T.*The evaluation of acoustics survey data from the first
BIOMASS experiment report on an interdisciplinary data management
project.* Hamburg U. Fachbereich Informatik.*Bericht Nr. 87.*1982.
017639 Culik, K. Rizki, M.M.* Mathematical constructive proofs as computer
programs.* Wayne State U. Comp.Sci.Dept.* CSC-83-004.*1983.
017640 Ericsson, K.A. Chase, W.G.* Exceptional memory.* Carnegie Mellon U.
Psych.Dept.*Tech.Rpt. 08.*1982.
017641 Frederiksen, J.R. Weaver, P.A. Warren, B.M. Gilotte, H.P. Rosebery, A.S.
Freeman, B. Goodman, L.*A componential approach to training reading
skills (final report).* Bolt, Beranek and Newman, Inc.*BBN rpt.
5295.*1983.
017642 Galler, B.I.* Concurrency control performance issues.* Toronto U. Comp.
Systems Res. Group.*CSRG-147.*1982.
017643 Gyllstrom, P.G.* Fault tolerant synchronization in distributed computer
systems.* Iowa U. Comp.Sci.Dept.* Tech.Rpt. 82-05, Ph.D. Thesis.
Gyllstrom, P.G.*1982.
017644 Hagino, T.* Verification of communicating sequential processes - a
transformation approach.* Kyoto U. Res.Inst.Math.Sci.*RIMS-431.*1983.
017645 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a
special case).* Kyoto U. Res.Inst.Math.Sci.* RIMS-432.*1983.
017646 Iwasaki, N.* Cauchy problems for effectively hyperbolic equations (a
standard type).* Kyoto U. Res.Inst.Math.Sci.* RIMS-433.*1983.
017647 Liu, C.-C.*A generalized network flow model with applications to power
supply-demand problems.* Cal. U., Berkeley. O.R. Center.*ORC
82-10.*1982.
017648 M.I.T. Lab. for Comp.Sci. Female Graduate Students and Staff. M.I.T. A.I.
Lab. Female Graduate Students and Staff.*Barriers to equality in
academia: Women in computer science at MIT. Prepared by female graduate
students and research staff in the Laboratory for Computer Science and
the Artificial Intelligence Laboratory at MIT.* Feb. 1983.
017649 Molle, M.L.* Asynchronous multiple access tree algorithms.* Toronto U.
Comp. Systems Res. Group.*CSRG-145.*1982.
017650 Montuno, D. Fournier, A.*Detecting intersection among star polygons.*
Toronto U. Comp. Systems Res. Group.* CSRG-146.*1982.
017651 Parlett, B.N. Taylor, D.*A look ahead Lanczos algorithm for unsymmetric
matrices.* Cal. U., Berkeley. Pure & Appl.Math. Center.*1981.
017652 Perlman, G.* Natural artificial languages: low-level processes.* Cal. U.,
San Diego. Human Info. Proces. Center.*Rpt. 8208.*1982.
017653 Ramalhoto, M.F.* Identifiability and estimation in random translations of
marked point processes.* Cal. U., Berkeley. O.R. Center.*ORC
82-13.*1982.
017654 Reiser, B.J. Black, J.B.*Processing and structural models of
comprehension.* Yale U. Cognitive Science Program.* Tech.Rpt. 012.*1982.
017655 Schecher, H. Anlauff, H. Fehn, J.*Entwurf einer Mikrokontrolleinheit mit
dreistufiger Pipeline.* Technische Universitat Munchen. Institut fuer
Mathematik.* TUM-I8209.*1982.
017656 Sethi, I.K. Jain, R.*Determining three dimensional structure of rotating
objects.* Wayne State U. Comp.Sci.Dept.*CSC-83-001.*1983.
017657 Sidner, C.L. Bates, M.*Requirements for natural language understanding in
a system with graphic displays.* Bolt, Beranek and Newman, Inc.*BBN rpt.
5242.*1983.
017658 Srihari, S.N.* Pyramid representations for solids.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 200.*1983.
017659 Wald, J.A. Sorenson, P.G.*Resolving the query inference problem using
Steiner trees.* Saskatchewan U. Computational
Sci.Dept.*Rpt.83-04.*1983.
017660 Woods, W.A. Bates, M. Bobrow, R.J. Goodman, B. Israel, D. Schmolze, J.
Schudy, R. Sidner, C.L. Vilain, M.*Research in knowledge representation
for natural language understanding. Annual report: 1 September 1981 to
31 August 1982.* Bolt, Beranek and Newman, Inc.*BBN rpt. 5188.*1982.
017661 Yau, M.-M.*Generating quadtrees of cross-sections from octrees.* SUNY,
Buffalo. Comp.Sci.Dept.*Tech.Rpt. 199.* 1982.
VOL. 5, NO. 7 06/08/83
017662 Byrant, R.E. Dennis, J.B.* Concurrent programming.* California Inst. of
Tech. Comp.Sci.Dept.*No. 5027:TM:82.* 1982.
017663 Bryant, R.E.*A switch level model and simulator for MOS digital systems.*
California Inst. of Tech. Comp.Sci.Dept.*No. 5065:TR:83.*1983.
017664 Bryant, R.E.* Switch level modeling of MOS digital circuits.* California
Inst. of Tech. Comp.Sci.Dept.*No. 5012:TM:82.*1982.
017665 Carroll, C.R.* Hybrid processing.* California Inst. of Tech.
Comp.Sci.Dept.*No. 5034:TR:82, Ph.D. Thesis. Carroll, C.R.*1982.
017666 Chan, W.S.*A new channel routing algorithm.* California Inst. of Tech.
Comp.Sci.Dept.*No. 5038:TM:82.*1982.
017667 Chen, M.C. Mead, C.A.* Formal specification of concurrent systems.*
California Inst. of Tech. Comp.Sci.Dept.*No. 5042:TR:82.*1982.
Contents: Mead, C.A.* VLSI, signal processing, and formal semantics;
Chen, M.C. Mead, C.A.* Concurrent algorithms as space time recursion
equations.
017668 Chen, M.C. Mead, C.A.*A hierarchical simulator based on formal
semantics.* California Inst. of Tech. Comp.Sci.Dept.*No.
5068:TM:83.*1983.
017669 Choo, Y.-I.* Hierarchical nets: a structured petri net approach to
concurrency.* California Inst. of Tech. Comp.Sci.Dept.*No.
5044:TR:82.*1982.
017670 Johannsen, D.L.* Silicon compilation.* California Inst. of Tech.
Comp.Sci.Dept.*No. 4530:TR:81, Ph.D. Thesis. Johannsen, D.L.*1981.
017671 Kingsley, C.* Earl: an integrated circuit design language.* California
Inst. of Tech. Comp.Sci.Dept.*No. 4710:TM:82.* 1982.
017672 Lang, C.R. Jr.*The extension of object oriented languages to a
homogeneous, concurrent architecture.* California Inst. of Tech.
Comp.Sci.Dept.*No. 5014:TR:82, Ph.D. Thesis. Lang, C.R. Jr.*1982.
017673 Ng, C.H.* FIFO buffering transceiver: a communication chip set for
multiprocessor systems.* California Inst. of Tech. Comp.Sci.Dept.*No.
5055:TR:82.*1982.
017674 Trimberger, S. Kingsley, C.* Chip assembly tools.* California Inst. of
Tech. Comp.Sci.Dept.*No. 5055:TM:82.* 1982.
017675 Trimberger, S.*A comparison of MOS PLAs.* California Inst. of Tech.
Comp.Sci.Dept.*No. 5059:TM:82.*1982.
017676 Whelan, D.S.*A rectangular area filling display system architecture.*
California Inst. of Tech. Comp.Sci.Dept.* No. 4716:TM:82.*1982.
017677 Herman, M. Kanade, T. Kuroe, S.* Incremental acquisition of a
three-dimensional scene model from images.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-139.*1982.
017678 Kaiser, G.E. Kant, E.* Incremental expression parsing for syntax directed
editors.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-141.*1982.
017679 Newell, A.*Intellectual issues in the history of artificial
intelligence.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-142.*1982.
017680 Rudnicky, A.I. Waibel, A.H. Krishnan, N.*Adding a zero crossing count to
spectral information in template based speech recognition.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-140.*1982.
017681 Schwans, K.* Tailoring software for multiple processor systems.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-137, Ph.D. Thesis. Schwans, K.*1982.
017682 Wulf, Wm.A. Nori, K.V.* Delayed binding in PQCC generated compilers.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-138.*1982.
017683 Baker, B.S. Bhatt, S.N. Leighton, F.T.*An approximation algorithm for
Manhattan routing.* M.I.T. Lab. for Comp.Sci.*TM-238.*1983.
017684 Bawden, A. Burke, G.S. Hoffman, C.W.* Maclisp extensions.* M.I.T. Lab.
for Comp.Sci.*TM-203.*1981.
017685 Dolev, D. Leighton, F.T. Trickey, H.* Planar embedding of planar graphs.*
M.I.T. Lab. for Comp.Sci.*TM-237.*1983.
017686 Konopelski, L.J.*Implementing internet remote login on a personal
computer.* M.I.T. Lab. for Comp.Sci.*TM-233.* 1982.
017687 Leighton, F.T. Leiserson, C.E.* Wafer scale integration of systolic
arrays.* M.I.T. Lab. for Comp.Sci.*TM-236.* 1983.
017688 Mitchell, J.C.*The implication problem for functional and inclusion
dependencies.* M.I.T. Lab. for Comp.Sci.* TM-235.*1983.
017689 Rivest, R.L. Sherman, A.T.* Randomized encryption techniques.* M.I.T.
Lab. for Comp.Sci.*TM-234.*1983.
017690 Sutherland, J. Sirbu, M.*Evaluation of an office analysis methodology.*
M.I.T. Lab. for Comp.Sci.*TM-239.*1983.
017691 Yeh, A* PLY: a system of plausibility inference with a probabilistic
basis.* M.I.T. Lab. for Comp.Sci.*TM-232.* 1982.
020287 Bui, T.N.*On bisecting random graphs.* M.I.T. Lab. for
Comp.Sci.*TR-287.*1983.
020284 Cosmadakis, S.S.*Translating updates of relational database views.*
M.I.T. Lab. for Comp.Sci.*TR-284.*1983.
020282 Fischer, M.J. Lynch, N.A. Paterson, M.S.*Impossibility of distributed
consensus with one faulty process.* M.I.T. Lab. for
Comp.Sci.*TR-282.*1982.
020280 Gao, G.R.*An implementation scheme for array operations in static data
flow computers.* M.I.T. Lab. for Comp.Sci.* TR-280.*1982.
020286 Goree, J.A. Jr.* Internal consistency of a distributed transaction system
with orphan detection.* M.I.T. Lab. for Comp.Sci.*TR-286.*1983.
020288 Landau, S.E.*On computing Galois groups and its application to
solvability by radicals.* M.I.T. Lab. for Comp.Sci.* TR-288, Ph.D.
Thesis. Landau, S.E.*1983.
020285 Lynch, N.A.* Concurrency control for resilient nested transactions.*
M.I.T. Lab. for Comp.Sci.*TR-285.*1983.
020281 Lynch, N.A.* Multilivel atomicity - a new correctness criterion for
database concurrency control.* M.I.T. Lab. for Comp.Sci.*TR-281.*1982.
020283 Sherman, H.B.*A comparative study of computer-aided clinical diagnosis of
birth defects.* M.I.T. Lab. for Comp.Sci.*TR-283.*1981.
017692 Bergstra, J.A. Klop, J.W.* Process algebra for communication and mutual
exclusion.* Mathematisch Centrum.*IW 218/83.*1983.
017693 Harmelen, F.A.H. van*On the implementation of an editor for the B
programming language.* Mathematisch Centrum.*IW 220/83.*1983.
017694 Krijnen, T. Meertens, L.G.L.T.*Making B trees work for B.* Mathematisch
Centrum.*IW 219/83.*1983.
017695 Rosenthal, D.S.H.*The GKS input facilities and how to use them.*
Mathematisch Centrum.*IW 217/82.*1982.
017696 Savitch, W.J. Vitanyi, P.M.B.*On the power of real time two-way multihead
finite automata with jumps.* Mathematisch Centrum.*IW 215/82.*1982.
017697 Vitanyi, P.M.B.*An optimal simulation of counter machines.* Mathematisch
Centrum.*IW 216/82.*1982.
017698 Houwen, P.J. van der*Algebraically equivalent linear multistep solution
of Volterra integral equations and certain systems of odes.*
Mathematisch Centrum.*NW 144/82.*1982.
017699 Lune, J. van de Te Riele, H.J.J.*On the zeros on the Riemann Zeta
function in the critical strip, III.* Mathematisch Centrum.*NW
146/83.*1983.
017700 Sommeijer, B.P. Houwen, P.J. van der*Software with low storage
requirements for two-dimensional nonlinear parabolic differential
equations.* Mathematisch Centrum.* NW 145/83.*1983.
017701 Symm, G.T. Wichmann, B.A. Kok, J. Winter, D.T.*Guidelines for the design
of large modular scientific libraries in ADA.* Mathematisch Centrum.*NW
143/82.*1982.
017702 Zeeuw, P.M. de Asselt, E.J. van*The convergence rate of multi level
algorithms applied to the convection diffusion equation.* Mathematisch
Centrum.*NW 142/82.* 1982.
017703 Imielinski, T. Lipski, W. Jr.* Incomplete information in relational data
base.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
475.*1982.
017704 Jurkiewicz, E.*The problem of routing in store and forward packet
switching communication networks.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 477.* 1982.
017705 Oriowska, E.*Languages of approximate information.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 479.*1982.
017706 Oriowska, E.*Representation of temporal information.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 484.*1982.
017707 Pawlak, Z.* Rough sets: algebraic and topological approach.* Polish
Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 482.*1982.
017708 Stoklosa, J.* Linear automata, k-machines, difference equations: a
systematic approach.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 486.*1982.
017709 Tarlecki, A.*Notes on the implementability of formal languages by
concurrent systems.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 481.*1982.
017710 Wysocki, W.*Generalized angles and their measures.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 485.*1982.
017711 Zabludowski, A.*A recursive method for reliability measures evaluation.*
Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
483.*1982.
017712 Zaionc, M.*Automated theorem proving in modal logic.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 478.*1982.
024960 Zabala-Salelles, I.A.*Interacting with graphic objects.* Stanford U.
Comp.Sci.Dept.*STAN-CS-82-960, Ph.D. Thesis. Zabala-Salelles,
I.A.*1982. 139p.
024962 Berg, K.A.* Bibliography of Stanford Computer Science reports,
1963-1983.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-962.*1983. 62p.
024946 Gilbert, E.J.* Algorithm partitioning tools for a high-performance
multiprocessor.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-946, Ph.D.
Thesis. Gilbert, E.J.*1983. 123p.
024963 Halpern, J. Manna, Z. Moszkowski, B.*A hardware semantics based on
temporal intervals.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-963.*1983.
26p.
024959 Karplus, K.* CHISEL: an extension to the programming language C for VLSI
layout.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-959 (STAN-CS-82-959),
Ph.D. Thesis. Karplus,K.* 1983. 132p.
024944 Korth, H.F. Kuper, G.M. Ullman, J.K.* System/U: a database system based
on the universal relation assumption.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-944 (STAN-CS-82-944).*1983. 17p.
024958 Lantz, K.A. Cheriton, D.R. Nowicki, W.I.* Third generation graphics for
distributed systems.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-958
(STAN-CS-82-958), Stanford U. SEL Comp. Systems Lab.*Tech.Rpt.
235.*1983. 36p.
024964 Manna, Z. Pnueli, A.*Proving precedence properties: the temporal way.*
Stanford U. Comp.Sci.Dept.* STAN-CS-83-964.*1983. 38p.
024945 Zwaenepoel, W. Lantz, K.A.* Perseus: retrospective on a portable
operating system.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-945, Stanford
U. Comp. Systems Lab.*Tech.Rpt. 206.*1983. 8p.
038217 Hassan, S.Z.* Signature testing of sequential machines.* Stanford U. SEL.
Comp. Systems Lab. Center for Reliable Computing.*Rpt. 82-18.*1982. 7p.
038216 Khakbaz, J.*A testable PLA design with low overhead and high fault
coverage.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Rpt. 82-17.*1982. 36p.
038214 Lu, D.J.* Testing VHSIC devices.* Stanford U. SEL. Comp. Systems Lab.
Center for Reliable Computing.*Rpt. 82-15.* 1982. 35p.
038218 Namjoo, M.* CERBERUS-16: an architecture for a general purpose watchdog
processor.* Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Rpt. 82-19.* 1982. 29p.
038215 Namjoo, M.* Concurrent testing using path signature analysis.* Stanford
U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Rpt.
82-16.*1982. 32p.
038219 Stanford U. SEL. Comp. Systems Lab. Center for Reliable Computing.*
COMPCON Spring '83 preprints.* Stanford U. SEL. Comp. Systems
Lab.*Tech. note 219; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Rpt. 82-20.*1982. 17p. Contents: Hassan, S.Z. Lu,
D.J. McCluskey, E.J.* Parallel signature analyzers--detection
capability and extensions; Khakbaz, J. McCluskey, E.J.* Self testing
embedded code checkers; Wahner, K.D.*Design for testability in the
Amdahl 580.
035231 Wedig, R.G.*Dynamic detection of concurrency in DEL instruction streams.*
Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 231.*1982. 24p.
035238 Wedig, R.G.*Detection on concurrency in directly executed language
instruction streams.* Stanford U. SEL. Comp. Systems Lab. Tech.Rpt.
238, Ph.D. Thesis. Wedig, R.G.* 1983. 179p.
035237 Wakefield, S.*Studies in execution architectures.* Stanford U. SEL. Comp.
Systems Lab. Tech.Rpt. 237.*1983. 115p.
035234 Tobagi, F.A. Shur, D.H.*Simulation of busy tone multiple access modes in
multihop packet radio networks.* Stanford U. SEL. Comp. Systems Lab.
Tech.Rpt. 234.*1982. 42p.
035228 Hennessy, J. Jouppi, N. Baskett, F. Gross, T. Gill, J. Przybylski, S.*
Hardware/ software tradeoffs for increased performance.* Stanford U.
SEL. Comp. Systems Lab. Tech.Rpt. 228.*1983. 22p.
035233 Davis, T. Clark, J.* YALE user's guide: a SILT based VLSI layout editor.*
Stanford U. SEL. Comp. Systems Lab. Tech.Rpt. 233.*1982. 40p.
035226 Davis, T. Clark, J.* SILT: a VLSI design language.* Stanford U. SEL.
Comp. Systems Lab. Tech.Rpt. 226.*1982. 38p.
035201 Baskett, F. Clark, J. Hennessy, J. Owicki, S. Reid, B.* Research in VLSI
systems design and architecture.* Stanford U. SEL. Comp. Systems Lab.
Tech.Rpt. 201.*1981. 35p.
035232 Alpert, D.*Studies in microprocessor design.* Stanford U. SEL. Comp.
Systems Lab. Tech.Rpt. 232.*1982. 31p.
017713 Barone, P.*On a predictive test for stability of multivariate
autoregressive moving average models.* Montreal U. Dept. d'Info et de
Recherche Operationnelle.* Publ. 457.*1983.
017714 Braga, L.P.V.* Mapping techniques using universal kriging.* Montreal U.
Dept. d'Info et de Recherche Operationnelle.* Publ. 453.*1982.
017715 Campello, R.E. Maculan, N.*A lower bound to the set partitioning
problem.* Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ.
468.*1983.
017716 Chapleau, S. Lapalme, G.* ATHENA: a program for playing championship
level scrabble.* Montreal U. Dept. d'Info et de Recherche
Operationnelle.*Publ. 464.*1983.
017717 Chapleau, S. Lapalme, G.*ATHENA: un programme joueur de scrabble duplat.*
Montreal U. Dept. d'Info et de Recherche Operationnelle.*Publ.
443.*1983. (revised version).
017718 Magnenat-Thalmann, N. Thalmann, D.* CINEMIRA: a 3D computer animation
language based on actor and camera data types.* Montreal U. Dept. d'Info
et de Recherche Operationnelle.* Publ. 473.*1983.
017719 Magnenat-Thalmann, N. Chourot, N. Thalmann, D.* Color gradation, shading
and texture using a limited terminal.* Montreal U. Dept. d'Info et de
Recherche Operationnelle.* Publ. 467.*1983.
017720 Sarikaya, B. Bochemann, G.V.* Synchronization and specification issues in
protocol testing.* Montreal U. Dept. d'Info et de Recherche
Operationnelle.*Publ. 463.* 1982.
017721 Stewart, N.*Moving a robot between general convex objects.* Montreal U.
Dept. d'Info et de Recherche Operationnelle.* Publ. 472.*1983.
017722 Mann, W.C. Matthiessen, C.M.I.M.* Nigel: a systemic grammar for text
generation.* Southern Cal. U. Info.Sci.Inst.* ISI/RR-83-105.*1983.
017723 Mockapetris, P.V.* Communication environments for local networks.*
Southern Cal. U. Info.Sci.Inst.* ISI/RR-82-103, Ph.D. Thesis.
Mockapetris, P.V. (University of California, Irvine).*1982.
099034 Southern California U. Info.Sci.Inst.*1982 annual technical report: July
1981 - June 1982.* Southern Cal. U. Info.Sci.Inst.*ISI/SR-83-23.*1983.
017724 Buckley, G.N. Silberschatz, A.*A complete characterization of a
multiversion database model with effective schedulers.* Texas U.
Comp.Sci.Dept.*TR-217.*1983.
017725 Cline, A.K. Renka, R.J.*A storage-efficient method for construction of a
Thiessen triangulation.* Texas U. Comp.Sci.Dept.*TR-213.*n.d.
017726 Gouda, M.G. Yu, Y.T.* Protocol validation by maximal progress state
exploration.* Texas U. Comp.Sci.Dept.* TR-211.*1982.
017727 Gouda, M.G. Yu, Y.T.*Synthesis of communicating machines with guaranteed
progress.* Texas U. Comp.Sci.Dept.* TR-179.*1981.
017728 Krishnamurthy, R. Dayal, U.*On the correct scheduling of transaction
systems for highly parallel data base machines.* Texas U.
Comp.Sci.Dept.*TR-170.*1981.
017729 Kunii, H.* Graph data language: a high level access path oriented
language.* Texas U. Comp.Sci.Dept.*TR-216, Ph.D. Thesis. Kunii, H.*1983.
017730 Novak, G.S. Jr.* GIRL and GLISP: an efficient representation language.*
Texas U. Comp.Sci.Dept.*TR-172.* 1981.
017731 Novak, G.S. Jr. Araya, A.A.* Physics problem solving using multiple
views.* Texas U. Comp.Sci.Dept.*TR-173.*1981.
017732 Palem, K. Fussell, D.S. Welch, A.J.*High-level optimization in a silicon
compiler.* Texas U. Comp.Sci.Dept.*TR-215.* 1982.
017733 Shankar, A.U. Lam, S.S.*An HDLC protocol specification and its
verification using image protocols.* Texas U.
Comp.Sci.Dept.*TR-212.*1982.
017734 Silberschatz, A. Buckley, G.N.*A family of multi version protocols with
no rollbacks.* Texas U. Comp.Sci.Dept.* TR-218.*1983.
017735 Yu, Y.-T. Gouda, M.G.* Unboundedness detection for a class of
communicating finite state machines.* Texas U.
Comp.Sci.Dept.*TR-181.*1983.
017736 Baer, J.L.*Whither a taxonomy of computer systems.* Washington U.
Comp.Sci.Dept.*Tech.Rpt. 82-10-01.*1982.
017737 Borning, A.H. Ingalls, D.H.H.* Multiple inheritance in smalltalk-80.*
Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-06-02.*1982.
017738 Garner, R.L.*Analysis of queueing networks using decomposition.*
Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-05-01, Ph.D. Thesis. Garner,
R.L.*1982.
017739 Garner, R.L. Zahorjan, J.*Analysis of queueing networks using
decomposition.* Washington U. Comp.Sci.Dept.* Tech.Rpt. 82-05-04.*1982.
017740 Greenberg, A.G.*On the time complexity of broadcast communication
schemes.* Washington U. Comp.Sci.Dept.* Tech.Rpt. 82-04-02.*1982.
017741 Huddleston, C.S.* Robust balancing in B trees.* Washington U.
Comp.Sci.Dept.*Tech.Rpt. 82-08-01, Ph.D. Thesis. Huddleston, C.S.*1981.
017742 Jacobson, P.A. Lazowska, E.D.*A reduction technique for evaluating
queueing networks with serialization delays.* Washington U.
Comp.Sci.Dept.*Tech.Rpt. 82-11-02.*1982.
017743 Jacobson, D.M.* Transactions on objects of arbitrary type.* Washington U.
Comp.Sci.Dept.*Tech.Rpt. 82-05-02.*1982.
017744 Klee, V. Ladner, R. Manber, R.*Signsolvability revisited.* Washington U.
Comp.Sci.Dept.*Tech.Rpt. 82-04-04.*1982.
017745 Rao, R.*A kernel for distributed and shared memory communication.*
Washington U. Comp.Sci.Dept.*Tech.Rpt. 82-06-01, Ph.D. Thesis. Rao,
R.*1982.
017746 Ritchie, R.W.* Northwest VLSI consortium: Semi-annual technical report
no. 1, 1 November 1982. Contract number: MDA903-82-C-0424. Sponsored by
Defense Advance Research Projects Agency (DOD), ARPA order no. 4563.
Principal investigator: R.W. Ritchie.* Washington Comp.Sci.Dept.*
Tech.Rpt. 82-11-01.*1982.
017747 Tanimoto, S.L.* Sorting, histogramming, and other statistical operations
on a pyramid machine.* Washington U. Comp.Sci.Dept.*Tech.Rpt.
82-08-02.*1982.
017748 Zahorjan, J.*The distribution of network states during sojourn times in
product form queueing networks.* Washington U. Comp.Sci.Dept.*Tech.Rpt.
82-05-03.*1982.
VOL. 5, NO. 8 07/25/83
017749 Waibel, A.*Towards very large vocabulary word recognition.* Carnegie
Mellon U. Comp.Sci.Dept.*CMU-CS-82-144.*1982.
017750 Kant, E. Newell, A.* Problem solving techniques for the design of
algorithms.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-145.*1982.
017751 Eppinger, J.L.*An empirical study of insertion and deletion in binary
search trees.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-146.*1982.
017752 Gupta, A. Hon, R.W.*Two papers on circuit extraction.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-147.*1982. Contents: Gupta, A.* ACE: a circuit
extractor; Gupta, A. Hon, R.W.* HEXT: a hierarchical circuit extractor.
017753 Doyle, J.*The foundations of psychology: a logico-computational inquiry
into the concept of mind.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-149.*1982.
017754 Pervin, E. Webb, J.A.* Quaternions in computer vision and robotics.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-150.*1982.
017755 Durham, I. Lamb, D.A. Saxe, J.B.* Spelling correction in user
interfaces.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-151.*1982.
017756 Vegdahl, S.R.* Local code generation and compaction in optimizing
microcode compilers.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-82-153,
Ph.D. Thesis. Vegdahl, S.R.* 1982.
017757 Snodgrass, R.* Monitoring distributed systems: a relational approach.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-154, Ph.D. Thesis.
Snodgrass, R.*1982.
017758 Rosenberg, A.L.*The diogenes approach to testable fault tolerant networks
of processors.* Duke U. Comp.Sci.Dept.* CS-1982-06.1.*1982.
017759 Freeman, R.W.*Automated design specification system.* Duke U.
Comp.Sci.Dept.*CS-1982-10.*1982.
017760 Ballard, B.W.*A "domain class" approach to transportable natural language
processing.* Duke U. Comp.Sci.Dept.* CS-1982-11.*1982.
017761 Leuze, M.R.* Memory access patterns in vector machines with applications
to problems in linear algebra.* Duke U. Comp.Sci.Dept.*CS-1982-12,
Ph.D. Thesis. Leuze, M.R.* 1982.
017762 Wagner, R.A.* DRAW - an assembly level language.* Duke U.
Comp.Sci.Dept.*CS-1982-13.*1982.
017763 Rosenberg, A.L.*On designing fault tolerant arrays of processors.* Duke
U. Comp.Sci.Dept.*CS-1982-14.*1982.
017764 Wagner, R.A.*Towards a method of programming large SIMD arrays of
computing elements.* Duke U. Comp.Sci.Dept.* CS-1982-15.*1982.
017765 Smith, C.U. Dallen, J.A.*Future directions for VLSI and software
engineering.* Duke U. Comp.Sci.Dept.*CS-1982-16.* 1982.
017766 Ballard, B.W. Lusth, J.C.*An English-language processing system which
'learns' about new domains.* Duke U. Comp.Sci.Dept.*CS-1982-18.*1982.
017767 Wagner, R.A.*The Boolean Vector Machine (BVM).* Duke U.
Comp.Sci.Dept.*CS-1982-19.*1982.
017768 Baccelli, F. Trivedi, K.S.*Analysis of M/G/2 - standby redundant system.*
Duke U. Comp.Sci.Dept.*CS-1982-20.* 1982.
017769 Hong, J.W. Mehlhorn, K. Rosenberg, A.L.* Cost tradeoffs in graph
embeddings, with applications.* Duke U.
Comp.Sci.Dept.*CS-1982-21.*1982.
017770 Geist, R. Trivedi, K.* Ultra high reliability prediction for fault
tolerant computer systems.* Duke U. Comp.Sci.Dept.*CS-1982-22.*1982.
017771 Loveland, D.W.*Finding critical sets.* Duke U.
Comp.Sci.Dept.*CS-1982-23.*1982.
017772 Geist, R. Trivedi, K.S.*The integration of user perception in the
heterogeneous M/M/2 queue.* Duke U. Comp.Sci.Dept.* CS-1982-24.*1982.
017773 Wagner, R.A.* Communication bandwidth in the Boolean vector machine.*
Duke U. Comp.Sci.Dept.*CS-1982-26.*1982.
017774 Gould, J.D. Boies, S.J.* Human factors challenges in creating a principal
support office system--the speech filing system approach.* IBM Watson
Res. Center.*RC 9768.* 1982.
017775 Gould, J.D. Boies, S.J.* Speech filing--an office system for principals.*
IBM Watson Res. Center.*RC 9769.*1982.
017776 Miranker, W.L. Winkler, A.*Spacetime representations of systolic
computational structures.* IBM Watson Res. Center.*RC 9775.*1982.
017777 Kaucher, E. Miranker, W.L.* Numerics with guaranteed accuracy for
function space problems.* IBM Watson Res. Center.*RC 9789.*1983.
017778 Rader, K. Ravn, A.P. Yue, P.C.*A reliable page store.* IBM Watson Res.
Center.*RC 9798.*1983.
017779 Pfister, G.F.* Parallel processing, special purpose hardware, and design
automation applications.* IBM Watson Res. Center.*9809.*1983.
017780 Tsai, R.Y.* 3-D inference from the motion parallax of a conic arc and a
point in two perspective views.* IBM Watson Res. Center.*RC 9818.*1983.
017781 Tsai, R.Y.*Estimating 3-D motion parameters and object surface structures
from the image motion of conic arcs.* IBM Watson Res. Center.*RC
9819.*1983.
017782 Ditlow, G. Donath, W. Ruehli, A.* Logic equations for Mosfet circuits.*
IBM Watson Res. Center.*RC 9821.*1983.
017783 Taylor, R.H.*An integrated robot system architecture.* IBM Watson Res.
Center.*RC 9824.*1983.
017784 Gopal, I.S. Stern, T.E.* Optimal call blocking policies in an integrated
services environment.* IBM Watson Res. Center.*RC 9825.*1983.
017785 Kevorkian, A.K. Gustavson, F.G. Hachtel, G.D.*A new theory on permuting
matrices to block triangular form.* IBM Watson Res. Center.*RC
9832.*1983.
017786 Lucassen, J.M.*Discovering phonemic base forms automatically: an
information theoretic approach.* IBM Watson Res. Center.*RC 9833.*1983.
017787 Krzesinski, A.*The normalised convolution algorithm.* IBM Watson Res.
Center.*RC 9834.*1983.
017788 Moussouris, J. Bruss, A.* TDL: a tabular design language for structured
logic (version 1.0).* IBM Watson Res. Center.*RC 9835.*1983.
017789 Mueckstein, E.-M.M.* Parsing for collecting syntactic statistics.* IBM
Watson Res. Center.*RC 9836.*1983.
017790 Mueckstein, E.M.M.* Q-Trans: query translation into English.* IBM Watson
Res. Center.*RC 9841.*1983.
017791 McBride, D.J.* Directed graphs for VLSI high-level synthesis.* IBM Watson
Res. Center.*RC 9842.*1983.
017792 Rivlin, T.J. Shaffer, D.B.* Optimal estimation of the derivative of
bounded analytic functions.* IBM Watson Res. Center.*RC 9843.*1983.
017793 Zug, P. Hachtel, G. Scott, T.R.*A general purpose design optimization
system (version 2.1). User's guide - volume I: nominal design and
modeling.* IBM Watson Res. Center.* RC 9847.*1983.
017794 Gould, F.D. Grischkowsky, N.*Doing the same work with hardcopy and with
cathode ray tube ( CRT) computer terminals, by John D. Gould and Nancy
Grischkowsky. With the technical assistance of Lizette Alfaro and
Jennifer Stolarz.
017795 Beetem, J. Nigam, A.* VLSI design using sheets and types.* IBM Watson
Res. Center.*RC 9854.*1983.
017796 Berstein, M. Pelavin, R.* Hierarchical wire routing.* IBM Watson Res.
Center.*RC 9861.*1983.
017797 Kozen, D.*A probabilistic PDL.* IBM Watson Res. Center.*RC 9874.*1983.
017798 Fagin, R. Ullman, J.D. Verdi, M.Y.*On the semantics of updates in
databases: preliminary report.* IBM Watson Res. Center.*RJ 3700.*1983.
017799 Lindsay, B.G. Haas, L.M. Mohan, C. Wilms, P.F. Yost, R.A.* Computation
and communication in R*: a distributed database manager.* IBM Watson
Res. Center.*RJ 3740.*1983.
017800 Masunaga, Y.*A relational database view update translation mechanism.*
IBM Watson Res. Center.*RJ 3742.*1983.
017801 Nakata, I. Sassa, M.* Programming with streams.* IBM Watson Res.
Center.*RJ 3751.*1983.
017802 Yost, R.A. Lindsay, B.G.*A distributed terminal management facility.* IBM
Watson Res. Center.*RJ 3752.*1983.
017803 Cristian, F.* Correct and robust programs.* IBM Watson Res. Center.*RJ
3753.*1983.
017804 Cristian, F.*A rigorous approach to fault tolerant system development.*
IBM Watson Res. Center.*RJ 3754.*1983.
017805 Aghili, H. Astrahan, M. Finkelstein, S. Kim, W. McPherson, J. Schkolnick,
M. Strong, R.*A prototype for a highly available database system.* IBM
Watson Res. Center.*RJ 3755.*1983.
017806 Goresky, M. Siegel, P.*Linking pairings on singular spaces.* IBM Watson
Res. Center.*RJ 3757.*1983.
017807 Gazis, L.*Calling PASCAL from APL.* IBM Watson Res. Center.* RJ
3758.*1983.
017808 McPherson, J.A. Kime, C.R.* Diagnosis theory for reconfigurable and
distributed systems.* IBM Watson Res. Center.*RJ 3760.*1983.
017809 Haas, L.M. Mohan, C.*A distributed deadlock detection algorithm for a
resource-based system.* IBM Watson Res. Center.*RJ 3765.*1983.
017810 Rissanen, J.* Probability estimation for symbols - observed or not.* IBM
Watson Res. Center.*RJ 3768.*1983.
017811 Walker, A.* PROLOG/EX1: an inference engine which explains both yes and
no answers.* IBM Watson Res. Center.*RJ 3771.*1983.
017812 Meier, A. Lorie, R.*Implicit hierarchical joins for complex objects.* IBM
Watson Res. Center.*RJ 3775.*1983.
017813 Paul, W. Vishkin, U. Wagener, H.* Parallel computation on 2-3 trees.* IBM
Watson Res. Center.*RJ 3786.*1983.
017814 Lohman, G.M. Stoltzfus, J.C. Benson, A.N. Martin, M.D. Cardenas, A.F.*
Remotely sensed geophysical databases: experience and implications for
generalized DBMS.* IBM Watson Res. Center.*RJ 3794.*1983.
017815 Fagin, R.* Acyclic database schemes (of various degrees): a painless
introduction.* IBM Watson Res. Center.*RJ 3800.* 1983.
017816 Reisner, P.*Analytic tools for human factors of software.* IBM Watson
Res. Center.*RJ 3808.*1983.
017817 Borodin, A. Dolev, D. Fich, F.E. Paul, W.* Bounds for width two branching
programs.* IBM Watson Res. Center.*RJ 3812.* 1983.
017818 Hauser, R.F.*Some experiments with stochastic edge detection.* IBM Watson
Res. Center.*RZ 1210.*1983.
017819 Havlicsek, B.L. Meyer, G.G.L.*A new system level approach to
diagnosability.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt.
82/06.*1982.
017820 Meyer, G.L.*Synthesis of optimization algorithms by concatenating
deterministic and autonomous algorithm components.* Johns Hopkins U.
E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/07.*1982.
017821 Meyer, G.G.L. Weinert, H.L.* Parallel algorithms and computational
structures for linear estimation problems.* Johns Hopkins U. E.E. &
Comp.Sci.Dept.*Tech.Rpt. 82/08.* 1982.
017822 O'Rourke, J.*The signature of a curve and its applications to pattern
recognition (preliminary version).* Johns Hopkins U. E.E. &
Comp.Sci.Dept.*Tech.Rpt. 82/09.*1982.
017823 Kouta, M.M. O'Rourke, J.*Fast algorithms for polygon decomposition.*
Johns Hopkins U. E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/10.*1982.
017824 O'Rourke, J.* Galleries need fewer mobile guards: a variation on
Chvatal's theorem.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt.
82/11.*1982.
017825 Meyer, G.G.L.*One-step diagnosis algorithms for the BGM system level
fault model.* Johns Hopkins U. E.E. & Comp.Sci.Dept.*Tech.Rpt.
82/14.*1982.
017826 O'Rourke, J.*An alternate proof of the rectilinear art gallery theorem.*
Johns Hopkins U. E.E. & Comp.Sci.Dept.* Tech.Rpt. 82/15.*1982.
017827 Harbitter, A. Tripathi, S.K.*An analysis of two flow control techniques.*
Maryland U. Comp.Sci. Center.* TR-1141.*1982.
017828 Kumar, V. Kanal, L.N.* Branch and bound formulations for sequential and
parallel And/Or tree search and their applications to pattern analysis
and game playing.* Maryland U. Comp.Sci. Center.*TR-1144.*1982.
017829 Grant, J.* Adequate database transformation.* Maryland U. Comp.Sci.
Center.*TR-1145.*1982.
017830 Abrams, M. Chu, Y.*A comparison of five concurrent programming
languages.* Maryland U. Comp.Sci. Center.* TR-1147.*1982.
017831 Chu, Y. Itano, K. Fukunaga, Y. Abrams, M.* Interactive direct execution
programming and testing.* Maryland U. Comp.Sci. Center.*TR-1149.*1982,
(revised).
017832 Shneiderman, B.*The future of interactive systems and the emergence of
direct manipulation.* Maryland U. Comp.Sci. Center.*TR-1156.*1982.
017833 Rosenfeld, A.*Computer vision.* Maryland U. Comp.Sci.
Center.*TR-1157.*1982.
017834 Israel, B.*Customizing a personal computing environment through object
oriented programming.* Maryland U. Comp.Sci. Center.*TR-1158.*1982.
017835 Stewart, G.W.*Computing the CS decomposition of a partitioned orthonormal
matrix.* Maryland U. Comp.Sci. Center.*TR-1159.*1982.
017836 Shneier, M.* Hierarchical sensory processes for 3-D robot vision.*
Maryland U. Comp.Sci. Center.*TR-1165.*1982.
017837 Allen, E.M.*Acquiring linguistic knowledge for word experts.* Maryland U.
Comp.Sci. Center.*TR-1166.
017838 Yeh, R.T. Schneck, P.B. Freitas, R.A. Jr. Carlson, P.A.* Computer
science: key to a space program renaissance. Final report of the 1981
NASA/ASEE Summer Study on the use of Computer Science and Technology in
NASA. Volume I: Institutional needs, status, plans and recommendations.
Volume II: Appendices.* Maryland U. Comp.Sci. Center.* TR-1168.*1982. 2
volumes.
017839 Nau, D. Kumar, V. Kanal, L.*General branch and bound and its relation to
A* and AO*.* Maryland U. Comp.Sci. Center.*TR-1170.*1982.
017840 Thareja, A.K.* Buffer allocation policies for message switching
networks.* Maryland U. Comp.Sci. Center.* TR-1173, Ph.D. Thesis.
Thareja, A.K.*1982.
017841 Wood, R.J.* Franz flavors: an implementation of abstract data types in an
applicative language.* Maryland U. Comp.Sci. Center.*TR-1174.*1982.
017842 Weiser, M. Israel, B. Stanfill, C. Trigg, R. Wood, R.* Working papers in
knowledge representation and acquisition.* Maryland U. Comp.Sci.
Center.*TR-1175.* 1982. Contents: Israel, B. Weiser, M.*Towards a
perceptual system for monitoring computer behavior; Stanfill, C.*
Geometry to causality: a hierarchy of subdomains for machine world;
Trigg, R.*Acquiring knowledge for an electronic textbook; Wood, R.J.*A
model for interactive program synthesis.
017843 Grant, J. Jacobs, B.E.*On the simulation of view updates recreational
databases.* Maryland U. Comp.Sci. Center.* TR-1182.*1982.
017844 Chu, Y. Abrams, M.* Columbia: a concurrent high level computer system
organization.* Maryland U. Comp.Sci. Center.*TR-1183.*1982.
017845 Minker, J.*On deductive relational databases.* Maryland U. Comp.Sci.
Center.*TR-1184.*1982.
017846 Nau, D.S.* Pathology on game trees revisited, and an alternative to
minimaxing.* Maryland U. Comp.Sci. Center.*TR-1187.*1982.
017847 Rosenfeld, A.*Trends and perspectives in computer vision.* Maryland U.
Comp.Sci. Center.*TR-1194.*1982.
017848 Chen, B.S.*Event based specification and verification of distribute
systems.* Maryland U. Comp.Sci. Center.* TR-1196, Ph.D. Thesis. Chen,
B.-S.*1982.
017849 Krishna, C.M. Shin, K.G.* Performance measures for multiprocessor
controllers.* Michigan U. Computing Res.Lab.*CRL-TR-01-82.*1982.
017850 Shin, K.G. Lee, Y.-H.*Analysis of the impact of error detection on
computer performance.* Michigan U. Computing
Res.Lab.*CRL-TR-02-82.*1982.
017851 Makrucki, B.A. Mudge, T.N.*A stochastic model of parallel and concurrent
program execution on multiprocessors.* Michigan U. Computing
Res.Lab.*CRL-TR-03-82.*1982.
017852 Rajlich, V.* Determinism in parallel systems.* Michigan U. Computing
Res.Lab.*CRL-TR-04-82.*1982.
017853 Chiang, W.P. Teorey, T.J.*A method for database record clustering.*
Michigan U. Computing Res.Lab.* CRL-TR-05-82.*1982.
017854 Lee, Y.-G. Shin, K.G.*Design and evaluation of a fault tolerant
multiprocessor using hardware recovery blocks.* Michigan U. Computing
Res.Lab.*CRL-TR-06-82.*1982.
017855 Wu, L.T.*Models for evaluating the performability of degradable computing
systems.* Michigan U. Computing Res.Lab.*CRL-TR-07-82, Ph.D. Thesis. Wu,
L.T.*1982.
017856 McFarling, S. Turney, J. Mudge, T.* VLSI crossbar design version two.*
Michigan U. Computing Res.Lab.* CRL-TR-08-82.*1982.
017857 Blass, A. Gurevich, Y.* Equivalence relations, invariants, and normal
forms.* Michigan U. Computing Res.Lab.* CRL-TR-09-82.*1982.
017858 Blass, A. Gurevich, Y.*On the unique satisfiability problem.* Michigan U.
Computing Res.Lab.*CRL-TR-01-83.* 1983.
017859 Liu, W.-T.*Techniques for estimation of the area of integrated digital
circuits.* Michigan U. Computing Res.Lab.*CRL-TR-02-83, Ph.D. Thesis.
Liu, W.-T.*1983.
017860 Golson, W.G. Rounds, W.C.*Connections between two theories of concurrency
metric spaces and synchronization trees.* Michigan U. Computing
Res.Lab.*CRL-TR-03-83.*1983.
017861 Chung, C.-W.*A query optimization in distributed database systems.*
Michigan U. Computing Res.Lab.*CRL-TR-04-83.* 1983.
017862 Maletz, M.C.*On enhancing the idealized CPU-I/O and I/O-I/0 overlap
models through the use of Markov processes.* Michigan U. Computing
Res.Lab.*CRL-TR-07-83.*1983.
017863 Krishna, C.M. Shin, K.G.* Queueing analysis of a canonical model of real
time multiprocessors.* Michigan U. Computing
Res.Lab.*CRL-TR-08-83.*1983.
017864 Shin, K.G. Lee, Y.-H.*Analysis of backward error recovery for concurrent
processes with recovery blocks.* Michigan U. Computing
Res.Lab.*CRL-TR-09-83.*1983.
017865 Rutenbar, R.A. Mudge, T.N. Atkins, D.E.*A class of cellular architectures
to support physical design automation.* Michigan U. Computing
Res.Lab.*CRL-TR-10-83.*1983.
017866 Mudge, T.N. Rahman, T.A.*Efficiency of feature dependent algorithms for
the parallel processing of images.* Michigan U. Computing
Res.Lab.*CRL-TR-11-83.*1983.
017867 Maletz, M.C.*Computing system simulation using Markov processes.*
Michigan U. Computing Res.Lab.*CRL-TR-12-83.* 1983.
017868 Rajlich, V.* Stepwise refinement revisited.* Michigan U. Computing
Res.Lab.*CRL-TR-13-83.*1983.
017869 Delp, E.*The CRC plotting package.* Michigan U. Computing
Res.Lab.*CRL-TR-14-83.*1983.
017870 Delp, E.* PDS users' manual: introduction.* Michigan U. Computing
Res.Lab.*CRL-TR-15-83.*1983.
017871 Hadavi, K.*A definitional technique for specification and implementation
of data types.* Michigan U. Computing Res.Lab.*CRL-TR-16-83.*1983.
017872 Qadah, G.Z.*A relational database machine analysis and design.* Michigan
U. Computing Res.Lab.*CRL-TR-17-83.* 1983.
017873 Mudge, T.N. Buzzard, G.D. Verhaeghe, D.J. Hill, J. Winsor, D.C.* Object
based computer architectures.* Michigan U. Computing
Res.Lab.*CRL-TR-18-83.*1983.
017874 Arya, S.* Optimal instruction scheduling for a class of vector
processors: an integer programming approach.* Michigan U. Computing
Res.Lab.*CRL-TR-19-83, Ph.D. Thesis. Arya, S.*1983.
017875 Jenkins, J.M.* Symposium on computer applications to cardiology:
introduction and automated electrocardiography and arrhythmia
monitoring.* Michigan U. Computing Res.Lab.*CRL-TR-20-83.*1983.
017876 Gurevich, Y.* Algebras of feasible functions.* Michigan U. Computing
Res.Lab.*CRL-TR-21-83.*1983.
VOL. 5, NO. 9 08/10/83
017877 Constable, R.L.* Programs as proofs.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 82-532.*1982.
017878 Schneider, F.B.*Comparison of the fail stop processor and state machine
approaches to fault tolerance.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
82-533.*1982.
017879 Demers, A. Donahue, J.*Making variables abstract: an equational theory
for Russell.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-534.*1982.
017880 Coleman, T.F. More, J.J.*Estimation of sparse Hessian matrices and graph
coloring problems.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 82-535.*1982.
017881 Conway, R. Worona, S.* COFE: a prototype memo and mail system for
non-programmers.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 82-536.*1983.
017882 Dwork, C.*Bounds on oblivious, conservative matrix transposition
networks.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 83-537.*1983.
017883 Dwork, C. Skeen, D.*The inherent cost of nonblocking commitment.* Cornell
U. Comp.Sci.Dept.*Tech.Rpt. 82-538.* 1983.
017884 Salton, G. Fox, E.A. Buckley, C. Voorhees, E.* Boolean query formulation
with relevance feedback.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
83-539.*1983.
017885 Murtagh, T.P.*A data abstraction language for concurrent programming.*
Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-540, Ph.D. Thesis. Murtagh,
T.P.*1983.
017886 Brent, R.P. Kung, H.T. Luk, F.T.*Some linear time algorithms for systolic
arrays.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-541.*1983.
017887 Pritchard, P.*Some negative results concerning prime number generators.*
Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-542.* 1983.
017888 Yu, C.T. Buckley, C. Lam, K. Salton, G.*A generalized term dependence
model in information retrieval.* Cornell U. Comp.Sci.Dept.*Tech.Rpt.
83-543.*1983.
017889 Hartmanis, J. Sewelson, V. Immerman, N.* Sparse sets in NP-P: EXOTIME
versus NEXPTIME.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-544.*1983.
017890 Aspvall, B. Gilbert, J.R.* Graph coloring using eigenvalue
decomposition.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-845.*1983.
017891 Toueg, S. Babaoglu, O.*On the optimum checkpoint selection problem.*
Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-546.* 1983.
017892 Wright, D.D. Skeen, D.* Merging partitioned databases.* Cornell U.
Comp.Sci.Dept.*Tech.Rpt. 83-547.*1983.
017893 Hartmanis, J. Yesha, Y.* Computation times of NP sets of different
densities.* Cornell U. Comp.Sci.Dept.* Tech.Rpt. 83-548.*1983.
017894 Constable, R.L.* Partial functions in constructive formal theories.*
Cornell U. Comp.Sci.Dept.*Tech.Rpt. 83-549.* 1983.
017895 Guyot, A. Reis, R. Supriana, I.*FLOPE: un editeur graphique de plan de
masse de circuits integres.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 333.*1983.
017896 Sifakis, J.*A note on deadlocks in CA-systems.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. No. 334.*1982.
017897 Bert, D.* Refinements of generic specifications with algebraic tools.*
Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
335.*1982.
017898 Cosnard, M. Eberhard, A.*Calcul explicite des constantes de
renormalisation pour des classes particulieres de fonctions unimodales.*
Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
337.*1982.
017899 Cosnard, M.*Etude de la classification topologiure des fonctions
unimodales.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
338.*1982.
017900 Sabbatel, G.B.*Nguyen, G.T.*Motivations et principes pour une machine
base de donnees prolog.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 339.* 1982.
017901 Foldes, S.*The tree structure of accounting control systems.* Grenoble.
Universite Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. No. 340.*1982.
017902 Robert, R. Witomski, P.*Sur une equation d'evolution
integro-differentielle singuliere lineaire.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. No. 341.*1982.
017903 Blacher, R.*Influence sur la dependance des coefficient du developpement
en serie de la densite de probabilite.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. No. 343.*1982.
017904 Robach, C.* CATA: a computer aided test analysis system; 1. System
partition and modeling, 2.Description and software procedures.*
Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
344.*1983.
017905 Blacher, R.*Quelques proprietes des congruences lineaires considerees
comme generateurs de nombres pseudo-aleatoires.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. No. 345.*1983.
017906 Anceau, F.*CAPRI: a design methodology and a silicon compiler for VLSI
circuits specified by algorithms.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 346.*1983.
017907 Decitre, P. Khider, A. Vandome, G.*Protocole de diffusion fiable pour
reseaux locaux.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 347.* 1983.
017908 Graf, S.*On Lanport's comparison between linear and branching time
logic.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
348.*1983.
017909 Adiba, M. Burnier, M. Delobel, C. Rialge, D.*Bases de donnees et
nouvelles applications.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 349.* 1983.
017910 Goles, E. Tchuente, M.* Dynamic behaviour of one-dimensional threshold
automata.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
350.* 1983.
017911 Baras, P.*Non-unicite des solutions d'une equation d'evolution
non-lineaire.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 351.* 1983.
017912 Reyss-Brion, J.F.*Architecture de circuits specialises de traitement du
signal.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
352.*1983.
017913 Nicolaidis, M. Courtois, B.*Design of self checking systems based on
analytical fault hypotheses.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 353.*1983.
017914 Borrione, D. Humbert, M. Le Faou, C.*Mecanismes de simulation mixte
hierarchisee.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 354.* 1983.
017915 Nachawati, H.A.*Classification et selection des parametres a l'aide de
l'analyse de la variance a deux facteurs.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. No. 355.*1983.
017916 Marine, S. Anceau, F. Jahidi, K.*IRENE: un langage de description de
circuits integres logiques.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 356.*1983.
017917 Davenport, J.H.*VLSI et calcul formel.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. No. 357.*1983.
017918 Davenport, J.H. Robert, Y.*PGCD et VLSI.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de Mathematiques
Appliquees de Grenoble.*R.R. No. 358.*1983.
017919 Boulle, P.*Une nouvelle approche des problemes lies a la description de
scenes tridimensionnelles.* Grenoble. Universite Scientifique et
Medicale. Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. No. 359.*1983.
017920 Fargier, P.H. Fonlupt, J.*Affectation de trafic selon le principe de
wardrop dans des reseaux avec capacites.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. No. 360.*1983.
017921 Marchal, P.*Test analytique de la partie operative du microprocesseur MC
68000.* Grenoble. Universite Scientifique et Medicale. Laboratoire
d'Informatique et de Mathematiques Appliquees de Grenoble.*R.R. No.
361.* 1983.
017922 Madelaine, J.*Evaluation d'algorithmes de controle de concurrence.*
INRIA. Rapport de Recherche 164.*1982.
017923 Merlet, J.-P.*Etude bidimensionnelle de l'insertion d'une cheville souple
dans un ensemble rigide.* INRIA. Rapport de Recherche 166.*1982.
017925 Plateau, D.*Une structure compacte pour indexer un fichier ordonne et son
evaluation.* INRIA. Rapport de Recherche 169.*1982.
017926 Hanatani, Y.*Graphtheoretical classification and generation of JD's by
means of bases for MVD-structures.* INRIA. Rapport de Recherche
170.*1982.
017927 Plateau, D.*Compiling relational queries for a finite state automaton
hardware filter.* INRIA. Rapport de Recherche 171.*1982.
017928 Le Coz, A. Le Goff, H. Ollivier, M.*Algorithme assurant l'insertion
dynamique d'un processeur autour d'un reseau a diffusion et garantissant
la coherence d'un systeme de numerotation des paquets global et
reparti.* INRIA. Rapport de Recherche 173.*1982.
017929 Fernandez Cara, E.*A nonlinear diffusion problem arising in semiconductor
process modelling with a singularity.* INRIA. Rapport de Recherche
174.*1982.
017930 Rolin, P.*Rapport sur la campagne de mesure de performance du prototype
sirius-delta.* INRIA. Rapport de Recherche 175.*1982.
017931 Fernandez Cara, E.* Singular perturbations and finite elements for the
numerical simulation of some problems in V.L.S.I.* INRIA. Rapport de
Recherche 176.*1982.
017932 Laine, C. Reinhart, L.*Further numerical methods for the Falkner Skan
equations: shooting and continuation techniques.* INRIA. Rapport de
Recherche 177.*1983.
017933 Hanatani, Y.*Eliminating cycles in data base schemas.* INRIA. Rapport de
Recherche 178.*1982.
017934 Lemarechal, C.*Basic theory in nondifferentiable optimization: a tutorial
and algorithmic oriented approach.* INRIA. Rapport de Recherche
181.*1982.
017935 Samson, C.*Commande non lineaire robuste des robots manipulateurs.*
INRIA. Rapport de Recherche 182.*1983.
017936 Vuillemin, J.*A very fast multiplication algorithm for VLSI
implementation.* INRIA. Rapport de Recherche 183.*1983.
017937 Sermange, M. Temam, R.*Some mathematical questions related to the MHD
equations.* INRIA. Rapport de Recherche 185.* 1983.
017938 Austry, D. Boudol, G.*Algebre de processus et synchronisation.* INRIA.
Rapport de Recherche 187.*1983.
017939 Erhel, J.*Parallelisation d'un algorithme de gradient conjugue
preconditionne.* INRIA. Rapport de Recherche 189.*1983.
017940 Nain, P.* Workload analysis of a two queue system by formulating a
boundary value problem.* INRIA. Rapport de Recherche 190.*1983.
017941 Cohen, G. Dubois, D. Quadrat, J.-P. Viot, M.*Analyse du comportement
periodique de systemes de production par la theorie des dioides.* INRIA.
Rapport de Recherche 191.* 1983.
017942 Lucrece, L. Maurice, P. Vercoustre, A.-M.* MINERVE: manuel de reference.*
INRIA. Rapports Techniques 017.*1982.
017943 Lozi, R.* Bifurcation and nonlinear eigenvalue problems: a tentative
bibliography.* INRIA. Rapports Techniques 018.* 1982.
017944 Falzon, P.*Les communications verbales en situation de travail: analyse
des restrictions du langage naturel.* INRIA. Rapports Techniques
019.*1982.
017945 Veloso, P.A.S. Maibaum, T.S.E.*Specifying abstract data types via series
of rewriting systems.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
07/82.*1982.
017946 Ruas, V.*On the solvability of asymmetric quasilinear finite element
approximate problems in nonlinear incompressible elasticity.* Pontificia
U., Rio de Janeiro. Info.Dept.*No. 08/82.*1982.
017947 Furtado, A.L.*A W-grammar approach to data bases.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 09/82.* 1982.
017948 Ruas, V.* Quasilinear finite elements for the stokes problem in IR
superscript 3.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
10/82.*1982.
017949 Veloso, P.A.S.*Outlines of a mathematical theory of problems.* Pontificia
U., Rio de Janeiro. Info.Dept.*No. 14/82.*1982.
017950 Veloso, P.A.S.* Problem solving via divide and conquer and abstract data
types.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 01/83.*1983.
017951 Veloso, P.A.S. Furtado, A.L.*On multi-step methods for stepwise
construction of algebraic specifications for data base applications.*
Pontificia U., Rio de Janeiro. Info.Dept.*No. 02/83.*1983.
017952 Veloso, P.A.S.*A methodology for the sound and complete specification of
abstract data types.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
03/83.*1983.
017953 Lucena, C.J. Martins, R.C.B. Veloso, P.A.S. Cowan, D.D.*The data
transform propgramming method and file processing problems.* Pontificia
U., Rio de Janeiro. Info.Dept.*No. 05/83.*1983.
017954 Ruas, V.*A convergent finite element method for solving dynamic problems
with consistent diagonalized mass matrix.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 06/83.*1983.
017955 Staa, A. von Rocha, A.R.C. da*Towards a model for evaluating
specifications.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
07/83.*1983.
017956 Veloso, P.A.S. Furtado, A.L.*On some view constructs for the
specification and design of external schemas.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 08/83.* 1983.
017957 Lindberg, B. Estimation of the parameters of a model with one nonlinear
parameter.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8213.* 1982.
017958 Sjostrand-Eriksson, G.*Numerical evaluation of a concentration dependent
diffusion coefficient.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.*TRITA-NA-8220.*1982.
017959 Eklundh, J.-O. Kjelldahl, L. Sundblad, Y.* Image analysis, computer
graphics and text processing in USA. Report from a tour in April 1982.*
Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8221; Royal Inst. of Tech., Stodkholm. Num.Anal. &
Computing Sci.Dept. INTEGRAL Project.*INTEGRAL-4.*1982.
017960 Lansner, A. Ekeberg, O.*A program package implementing a system of
interacting adaptive associate networks.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8302; Royal Inst. of
Tech., Stockholm. Num.Anal. & Computing Sci.Dept. INTEGRAL Project.*
INTEGRAL-6.*1983.
017961 Calmet, J. Cohen, I.*Synthesizing recurrence relations: I - Analysis of
the problem.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8305.* 1983.
017962 Brannigan, M. Gustafson, S.-A.* H-sets, convex programming and
constrained approximation.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.*TRITA-NA-8308.* 1983.
017963 Nudel, B.* Consistent labeling problems and their algorithms: Part II.
Expected complexities and theory base heuristics.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-113.* 1983 (revised).
017964 Bercker, R.I. Peri, Y.*Finding the two core of a tree.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-121.*1982.
017965 Peri, Y. Snir, M.* Circuit partitioning with size and connection
constraints.* Rutgers U. Comp.Sci.Dept.* DCS-TR-122.*1982.
017966 Peri, Y.*The bitonic and odd even networks are more than merging.*
Rutgers U. Comp.Sci.Dept.*DCS-TR-123.*1983.
017967 Peri, Y. Vishkin, U.*Efficient implementation of shifting algorithm.*
Rutgers U. Comp.Sci.Dept.*DCS-TR-124.*1983.
017968 Peri, Y.*Optimum split trees.* Rutgers U. Comp.Sci.Dept.*
DCS-TR-125.*1983.
017969 Minsky, N. Lockman, A.*Principles for database authorization.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-42.* 1982.
017970 Feather, M. London, P.*Implementing specification freedoms.* Southern Cal
U. Info.Sci.Inst.*ISI/RR-83-100.*1983.
017971 Merritt, I.H.*Providing telephone line access to a packet voice network.*
Southern Cal U. Info.Sci.Inst.* ISI/RR-83-107.*1983.
017972 Kini, V. Martin, D.F. Stoughton, A.*Tools for testing denotational
semantic definitions of programming languages.* Southern Cal U.
Info.Sci.Inst.* ISI/RR-83-112.*1983.
017973 Mann, W.C.*An overview of the Penman text generation system.* Southern
Cal U. Info.Sci.Inst.*ISI/RR-83-114.* 1983.
017975 Gill, P.E. Gould, N.I.M. Murray, W. Saunders, M.A. Wright, M.H.*A range
space method for quadratic programming problems with bounds and general
constraints.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
82-15.*1982.
017974 Gill, P.E. Gould, N.I.M. Murray, W. Saunders, M.A. Wright, M.H.* Range
space methods for convex quadratic programming.* Stanford U. O.R. Dept.
Systems Optimization Lab.*SOL 82-14.*1982.
017976 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Sparse matrix methods
optimization.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
82-17.*1982.
017977 Mathiesen, L.*Computational experience in solving equilibrium models by a
sequence of linear complementarity problems.* Stanford U. O.R. Dept.
Systems Optimization Lab.*SOL 83-01.*1983.
017978 Wittrock, R.J.*Advances in a nested decomposition algorithm for solving
staircase linear programs.* Stanford U. O.R. Dept. Systems Optimization
Lab.*SOL 83-02, Ph.D. Thesis. Wittrock, R.J.*1983.
017979 Streit, R.L.*Solution of systems of complex linear equations in the L
subscript infinity norm with constraints on the unknowns.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 83-03.*1983.
017980 Jones, H.M.*Non-linear data fitting for analysis of friction stress and
recovery in metal alloys.* U.K. National Physical Lab. Info. Technology
and Computing Div.*DITC 13/82.*1982.
017981 Schofield, D. Manning, D.R.*A theoretical model for the speech input
device SID3. 1. Filters.* U.K. National Physical Lab. Info. Technology
and Computing Div.*DITC 20/83.*1983.
017982 Schofield, D. Manning, D.R.*A theoretical model for the speech input
device SID3. 2. Correlators.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 21/83.*1983.
017983 Rengger, R.E. Manning, D.R.*A hardware preprocessor for use in speech
recognition: speech input device SID3.* U.K. National Physical Lab.
Info. Technology and Computing Div.*DITC 22/83.*1983.
017984 Singer, M.A. Hammerling, S.J.*The algebraic Riccati equation: a summary
review of some available results.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 23/83.*1983.
017985 Bundy, A.* Mental machines rule OK.* * Edinburgh U. A.I.
Dept.*Occasional Paper 25.*1981.
017986 Bundy, A. Byrd, L. Mellish, C.*Special purpose, but domain independent,
inference mechanisms.* Edinburgh U. A.I. Dept.*Research Paper
179.*1982.
017987 O'Keefe, R.A.* Prolog compared with LISP?* Edinburgh U. A.I.
Dept.*Research Paper 180.*1982.
017988 Featherstone, R.*The calculation of robot dynamics using articulated body
inertias.* Edinburgh U. A.I. Dept.* Research Paper 181.*1982.
017989 O'Keefe, R.*A smooth applicative merge sort.* Edinburgh U. A.I.
Dept.*Research Paper 182.*1982.
017990 Thompson, H. Ritchie, G.*Techniques for parsing natural language: two
examples.* Edinburgh U. A.I. Dept.*Research Paper 183.*1983.
017991 Silver, B.* Learning equation solving methods from examples.* Edinburgh
U. A.I. Dept.*Research Paper 184.* 1983.
017992 Wallen, L.*Using proof plans to control deduction.* Edinburgh U. A.I.
Dept.*Research Paper 185.*1983.
017993 Featherstone, R.* High speed velocity and force transformation for robots
with three intersecting revolute joint axes at the wrist.* Edinburgh U.
A.I. Dept.*Working Paper 115.*1982.
017994 Featherstone, R.*A program for simulating robot dynamics.* Edinburgh U.
A.I. Dept.*Working Paper 116.*1982.
017995 Jenkins, L.E.*Compiling high(ish)-level chip discription into an
intermediate representation.* Edinburgh U. A.I. Dept.*Working Paper
117.*1982.
017996 Howe, J. Ross, P. Johnson, K. Plane, F. Inglis, R.* Learning mathematics
throgh LOGO programming: the transition from laboratory to classroom.*
Edinburgh U. A.I. Dept.*Working Paper 118(b).*1982.
017997 Sterling, L.* IMPRESS - meta level concepts in theorem proving.*
Edinburgh U. A.I. Dept.*Working Paper 119.* 1982.
017998 Burns, K.* Problem solving and LOGO.* Edinburgh U. A.I. Dept.*Working
Paper 120.*1982.
017999 Feagans, F.A. Jr.* Organization of a robot society.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-81-1067.*1981.
018000 Suwa, I.*Topological design of segmented folded PLAs.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1095.*1982.
018001 Kuck, S.M.*A design methodology for a universal relation scheme
implementation via codasyl.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1106, Ph.D. Thesis. Kuck, S.M.*1982.
018002 Hsiang, J.*Topics in automated theorem proving and program generation.*
Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1113, Ph.D. Thesis. Hsiang,
J.*1982.
018003 Chen, H.-H. Kuck, S.M. Peterson, J. Sagiv, Y.*A user's manual for
aurical: a universal relation implementation via CODASYL.* Illinois U.
Comp.Sci.Dept.* UIUCDCS-R-82-1114.*1982.
018004 Clark, T.S.* S-K reduction engine for an applicative language.* Illinois
U. Comp.Sci.Dept.*UIUCDCS-R-82-1119.* 1982.
018005 Purtilo, J.*Computing Runge Kutta starters symbolically.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-83-1120.*1983.
018006 Akl, S.G.* Digital signatures: a survey.* Queen's U. Computing &
Info.Sci.Dept.*Tech.rpt. 82-145.*1982.
018007 Alanko, T.O.*Empirical studies of program behaviour in virtual memory.*
Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-03.*1983.
018008 Boley, H.* Artificial intelligence languages and machines.* Hamburg U.
Fachbereich Informatik.*Bericht nr. 94.*1982.
018009 Borodin, A. Cook, S. Pippenger, N.* Parallel computation for well endowed
rings and space bounded probabilistic machines.* Toronto U.
Comp.Sci.Dept.*Tech.rpt. 162.*1983.
018010 Bunt, R.B. Murphy, J.M. Majumdar, S.*Applications of a measure of program
locality.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-06.*1983.
018011 Cantone, R.R. Pipitone, F.J. Lander, W.B. Marrone, M.P.* Model based
probabilistic reasoning for electronics troubleshooting.*No issuing
agency indicated (authors' address: Navy Center for Applied Research in
Artificial Intelligence/ U.S. Naval Research Laboratory - Code 7510/
Washington, DC 20375).*1983.
018012 Cattell, R.G.G.*Design and implementation of a relationship entity datum
data model.* Xerox. Palo Alto Res. Center.* CSL-83-04.*1983.
018013 Cook, R. Finkel, R. DeWitt, D. Landweber, L. Vergilio, T.* The crystal
nugget: Part I of the first report on the Crystal project.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 499.*1983.
018014 Cook, R. Finkel, R. Gerber, B. DeWitt, D. Landweber, L.*The Crystal
nuggetmaster: Part II of the first report on the Crystal project.*
Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 500.*1983.
018015 Denbaum, C.A.P.*A demand driven, coroutine based implementation of a
nonprocedural language.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 83-01, Ph.D.
Thesis. Denbaum, C.A.P.*1983.
018016 Engquist, B. Gustafsson,B.* Steady state computations for wave
propagation problems.* Uppsala U. Comp.Sci.Dept.* Rpt. 92.*1983.
018017 Finkel, R. Cook, R. DeWitt, D. Hall, N. Landweber, L.* Wisconsin Modula:
Part III of the first report on the Crystal project.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 501.*1983.
018018 Fleck, A.C.*A proposal for comparison of types in Pascal and associated
semantic models.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-02.*1983.
018019 Grosky, W.I. Jain, R.* Region matching in pyramids by dynamic scene
analysis.* Wayne State U. Comp.Sci.Dept.* CSC-83-002.*1983.
018020 Ho, S.W.*Optimising conjunctive queries on a relational interface to
CODASYL DBMS.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-A1-83.*1983.
018021 Hussmann, M. Schefe, P.*The design of SWYSS, a dialogue system for scene
analysis.* Hamburg U. Fachbereich Informatik.*Bericht nr. 95.*1983.
018022 Jantzen, M. Kudlek, M.* Homomorphic images of sentential form languages
defined by semi Thue systems.* Hamburg U. Fachbereich
Informatik.*Bericht nr. 89.*1983.
018023 Jardine, D.A.* Use and mention.* Queen's U. Computing &
Info.Sci.Dept.*Tech.rpt. 82-143.*1982.
018024 Kampfner, R.R. Conrad, M.*Computational modeling of evolutionary learning
processes in the brain.* Wayne State U. Comp.Sci.Dept.*CSC-82-008.*1982.
018025 Keil, J.M.* Decomposing polygons into simpler components.* Toronto U.
Comp.Sci.Dept.*Tech.rpt. 163, Ph.D. Thesis. Keil, J.M.*1983.
018026 Magnusson, B.* SIMSALABIM: A package for dynamic memory management in
Pascal.* Lund U. Comp.Sci.Dept.*1983.
018027 Mozer, M.C.* Letter migration in word perception.* Cal U., San Diego.
Human Info.Proces. Center.*Rpt. 8301.*1983.
018028 Raiha, K.-J. Saarinen, M. Sarjakoski, M. Sippu, S. Soisalon-Soininen, E.
Tienari, M.*Revised report on the compiler writing system HLP78.*
Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-01.*1983.
018029 Reif, J.H. Scherlis, W.L.*Deriving efficient graph algorithms.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-155.*1982.
018030 Rumelhart, D.E. Norman, D.A.* Representation in memory.* Cal U., San
Diego. Human Info.Proces. Center.*CHIP 116.* 1983.
018031 Tennent, R.D.* Denotational semantics of Hoare classes.* Queen's U.
Computing & Info.Sci.Dept.*Tech.rpt. 82-144.* 1982.
018032 Tranchell, L.M.*A SNePS implementation of KL-ONE.* SUNY, Buffalo.
Comp.Sci.Dept.*Tech.Rpt. 198.*1982.
018033 Tse, T.H.*An input design for communication systems for non-vocal
physically disabled users.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-A2-83.*1983.
018034 Wald, J.A. Sorenson, P.G.* Productivity tools for a database management
system.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-05.*1983.
018036 Yau, M.-M.J.*Hierarchical representation of three dimensional digital
objects.* SUNY, Buffalo. Comp.Sci.Dept.*Tech.rpt. 201, Ph.D. Thesis.
Yau, M.-M.J.* 1983.
018037 Yuen, C.K.*Some hardware implementations of the tree sort.* Hong Kong U.
Comp. Studies and Appl. Centre.*TR-B1-83.* 1983.
018038 Yuen, C.K.*A stack based method for sorting.* Hong Kong U. Comp. Studies
and Appl. Centre.*TR-A3-83.*1983.
018039 Zellweger, P.T.*An interactive high level debugger for control flow
optimized programs.* Xerox. Palo Alto Res. Center.*CSL-83-01.*1983.
VOL. 5, NO. 10 08/22/83
018040 Chansler, R.J. Jr.* Coupling in systems with many processors.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-82-131, Ph.D. Thesis. Chansler, R.J.
Jr.*1982.
018041 Tsai, M.Y.* Pass transistor networks in MOS technology: Synthesis,
performance, and testing.* IBM Watson Res. Center.*RC 9837.*1983.
018042 Francez, N.* Product properties and their direct verification.* IBM
Watson Res. Center.*RC 9848.*1983.
018043 Kelley, J.F.*A human factors perspective on designing an integrated
graphic I/O workstation.* IBM Watson Res. Center.*RC 9857.*1983.
018044 Rogowitz, B.E.*The human visual system: A guide for the display
technologist.* IBM Watson Res. Center.*RC 9881.* 1983.
018045 King, R.P. Korth, H.F. Willner, B.E.*An optimal scheme for the
distribution of a large database among small computers.* IBM Watson Res.
Center.*RC 9884.*1983.
018046 Coppersmith, D. Seroussi, G.*On the minimum distance of some quadratic
residue codes.* IBM Watson Res. Center.*RC 9894.*1983.
018047 Schlag, M. Luccio, F. Maestrini, P. Lee, D.T. Wong, C.K.*A visibility
problem in VLSI layout compaction.* IBM Watson Res. Center.*RC
9896.*1983.
018048 Hagouel, J. Schwartz, M.* Hierarchical routing in computer networks.* IBM
Watson Res. Center.*RC 9898.*1983.
018049 Leavenworth, B. Power, L.R.* Data modelling with data abstractions.* IBM
Watson Res. Center.*RC 9899.*1983.
018050 Sasao, T.*A fast complementation algorithm for sum of products
expressions of multiple valued input binary functions.* IBM Watson Res.
Center.*RC 9903.*1983.
018051 Markowitz, H.M. Malhotra, A. Pazel, D.P.*The EAS-E application
development system: Principles and language summary.* IBM Watson Res.
Center.*RC 9910.*1983.
018052 Rivlin, T.J.*The best strong uniqueness constant for a multivariate
Chebyshev polynomial.* IBM Watson Res. Center.*RC 9920.*1983.
018053 Huang, S.-H.S. Wong, C.K.*Optimal binary split trees.* IBM Watson Res.
Center.*RC 9921.*1982.
018054 Liao, Y.Z. Wong, C.K.*An algorithm to compact a VLSI symbolic layout with
mixed constraints.* IBM Watson Res. Center.*RC 9922.*1982.
018055 Francez, N.*Extended naming conventions for communicating processes.* IBM
Watson Res. Center.*RC 9926.*1983.
018056 Krishnamurthy, R. Morgan, S.P. Zloof, M.M.*Query by example: Operations
on piecewise continuous data.* IBM Watson Res. Center.*RC 9928.*1983.
018057 Segall, A. Jaffe, J.M.*A reliable distributed route set-up procedure.*
IBM Watson Res. Center.*RC 9929.*1983.
018058 Francez, N.* Program transformations eliminating the distributed
terminations convention of CSP.* IBM Watson Res. Center.*RC 9935.*1983.
018059 Nackman, L.R. Taylor, R.H.*An hierarchical exception handler binding
mechanism.* IBM Watson Res. Center.*RC 9937.*1983.
018060 Towsley, D.*An application of the reflection principle to the transient
analysis of the M/M/1 queue.* IBM Watson Res. Center.*RC 9940.*1983.
018061 Hagouel, J.*Issues in routing for large and dynamic networks.* IBM Watson
Res. Center.*RC 9942, Ph.D. Thesis. Hagouel, J. (Columbia
University).*1983.
018062 Chandra, A.K. Fortune, S. Lipton, R.* Unbounded fan-in circuits and
associative functions.* IBM Watson Res. Center.*RC 9943.*1982.
018063 Chandra, A.K. Fortune, S. Lipton, R.*Lower bounds for constant depth
circuits for prefix problems.* IBM Watson Res. Center.*RC 9944.*1982.
018064 Strom, R.E. Yemini, S.* NIL: An integrated language and system for
distributed programming.* IBM Watson Res. Center.*RC 9949.*1983.
018065 Goyal, A.* Lookahead network.* IBM Watson Res. Center.*RC 9952.*1983.
018066 Landauer, R.*Fundamental physical limitations of the computational
process.* IBM Watson Res. Center.*RC 9962.* 1983.
018067 Terry, D. Andler, S.*Experience with measuring performance of local
network communications.* IBM Watson Res. Center.* RJ 3743.*1983.
018068 Traiger, I.L.*Trends in systems aspects of database management.* IBM
Watson Res. Center.*RJ 3845.*1983.
018069 Iglehart, D.L. Shedler, G.S.* Simulation of nonMarkovian systems.* IBM
Watson Res. Center.*RJ 3850.*1983.
018070 Bertino, E. Haas, L.M. Lindsay, B.G.* View management in distributed data
base systems.* IBM Watson Res. Center.* RJ 3851.*1983.
018071 Kim, W.*Highly available database and database application systems.* IBM
Watson Res. Center.*RJ 3852.*1983.
018072 Olumi, M. Wiederhold, G. Hauser, C. Lucas, P. Mehl, J.* Software project
databases.* IBM Watson Res. Center.*RJ 3862.*1983.
018073 Etienne, R. Hallmark, G.*A VLSI layout editor based on a relational
database system.* IBM Watson Res. Center.*RJ 3863.*1983.
018074 Walker, A.*Data bases, expert systems, and Prolog.* IBM Watson Res.
Center.*RJ 3870.*1983.
018075 Janson, P. Svobodova, L. Maehle, E.* Filing and printing services on a
local area network.* IBM Watson Res. Center.*RZ 1220.*1983.
018076 International Standards Organization.* Information Processing - Graphical
Kernel System (GKS) - Functional description.* International Standards
Organization.* ISO/TC 97/SC 5 N 728.*1982 (12-27-82).
041612 Horn, B.K.P.*The curve of least energy.* M.I.T. A.I. Lab.* Memo
612.*1981.
041660 Richards, W.*How to play twenty questions with nature and win.* M.I.T.
A.I. Lab.*Memo 660.*1982.
041697 Grimson, W.E.L.* Binocular shading and visual surface reconstruction.*
M.I.T. A.I. Lab.*Memo 697.*1982.
041701 Batali, J.* Computational introspection.* M.I.T. A.I. Lab.* Memo
701.*1983.
041705 Gaston, P.C. Lozano-Perez, T.* Tactile recognition and localization using
object models: The case of polyhedra on a plane.* M.I.T. A.I. Lab.*Memo
705.*1983.
041717 Hollerbach, J.M. Sahar, G.* Wrist partitioned inverse kinematic
accelerations and manipulator dynamics.* M.I.T. A.I. Lab.*Memo
717.*1983.
040703 Roylance, G.*A simple model of circuit design.* M.I.T. A.I.
Lab.*Tech.Rpt. 703.*1983.
040715 Barton, G.E. Jr.*A multiple context equality based reasoning system.*
M.I.T. A.I. Lab.*Tech.Rpt. 715.*1983.
018077 Lenstra, A.K.* Factoring multivariate polynomials over finite fields.*
Mathematisch Centrum.*IW 221/83.*1983.
018078 Bergstra, J.A. Klop, J.W.*A process algebra for the operational semantics
of static data flow networks.* Mathematisch Centrum.*IW 222/83.*1983.
018079 Bergstra, J.A. Tiuryn, J.* RC-compactness, a necessary condition for the
existence of sound and complete logics of partial correctness.*
Mathematisch Centrum.*IW 223/83.*1983.
018080 Bergstra, J.A. Cmielienska, A. Tiuryn, J.*Another incompleteness theorem
for Hoare's logic.* Mathematisch Centrum.*IW 224/83.*1983.
018081 Vitanyi, P.M.B.*An optimal simulation of counter machines: The ACM
case.* Mathematisch Centrum.*IW 225/83.*1983.
018082 Axelsson, A.O.H. Verwer, J.G.* Boundary value techniques for initial
value problems in ordinary differential equations.* Mathematisch
Centrum.*NW 147/83.*1983.
018083 Vries, H.B. de* The multi grid method in the solution of time dependent
nonlinear partial differential equations.* Mathematisch Centrum.*NW
148/83.*1983.
018084 Houwen, P.J. van der* Stability results for discrete Volterra equations.*
Mathematisch Centrum.*NW 149/83.* 1983.
018085 Verwer, J.G. Vries, H.B. de* Global extrapolation of a first order
splitting method.* Mathematisch Centrum.*NW 150/83.*1983.
018086 Houwen, P.J. van der Riele, H.J.J. te* Linear multistep methods for
Volterra integral and integro differential equations.* Mathematisch
Centrum.*NW 151/83.*1983.
018087 Dembinski, P.* Microprogram transformations.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS Rpt. No. 488.*1982.
018088 Novotny, M.* Sequences of information systems.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 489.*1982.
018089 Bakowski, P.*A language for negative control design.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 490.*1982.
018090 Miadowicz, Z.B.* Time varying automata: A survey.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 491.*1982.
018091 Baczko, A.* Simulation controlled data transmission network.* Polish
Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No. 493.*1982.
018092 Jankowski, A. Rauszer, C.*On logical foundation approach to users' domain
restriction in data bases. I.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 494.*1983.
018093 Lipski, W.*An NP-complete geometric problem related to three layer
channel routing.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 495.*1983.
018094 Pawlak, Z.* Rough probability and partial observability.* Polish Academy
of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 496.*1983.
018095 Hendrix, G.G.* KLAUS: a system for managing information and computational
resources.* SRI International. A.I. Center.*Tech. Note 230.*1980.
018096 Konolige, K.*A first-order formalization of knowledge and action for a
multiagent planning system.* SRI International. A.I. Center.*Tech. Note
232.*1980.
018097 Fischler, M.A.* Computational structures for machine perception.* SRI
International. A.I. Center.*Tech. Note 233.*1981.
018098 Bolles, R.C.* Three dimensional locating of industrial parts.* SRI
International. A.I. Center.*Tech. Note 234.* 1981.
018099 Hendrix, G.G. Sacerdoti, E.D.* Natural language processing Part One: The
field in perspective.* SRI International. A.I. Center.*Tech. Note
237.*1981.
018100 Moore, R.C.* Automatic deduction for commonsense reasoning: An
overview.* SRI International. A.I. Center.*Tech. Note 239.*1981.
018101 Moore, R.C.* Problems in logical form.* SRI International. A.I.
Center.*Tech. Note 241.*1981.
018102 Bolles, R.C.*An overview of applications of image understanding to
industrial automation.* SRI International. A.I. Center.*Tech. Note
242.*1981.
018103 Reboh, R.* Knowledge engineering techniques and tools in the prospector
environment.* SRI International. A.I. Center.*Tech. Note 243, Ph.D.
Thesis. Reboh, R. (Linkoeping University).*1981.
018104 Smith, G.B.*Detection of rivers in low resolution aerial imager.* SRI
International. A.I. Center.*Tech. Note 244.* 1981.
018105 Wilkins, D.E. Robinson, A.E.*An interactive planning system.* SRI
International. A.I. Center.*Tech. Note 245.* 1981.
018106 Manna, Z. Waldinger, R.* Deductive synthesis of the unification
algorithm.* SRI International. A.I. Center.* Tech. Note 246.*1981.
018107 Wilkins, D.E. Robinson, A.E.*An interactive planning system.* SRI and
meaning representation via PRUF.* SRI International. A.I. Center.*Tech.
Note 247.*1981.
018108 Nilsson, N.J.* Artificial intelligence: Engineering, science, or slogan?*
SRI International. A.I. Center.* Tech. Note 248.*1981.
018109 Bolles, R.C. Kremers, J.H. Cain, R.A.*A simple sensor to gather three
dimensional data.* SRI International. A.I. Center.*Tech. Note
249.*1981.
018110 Moore, R.C.*Practical natural language processing by computer.* SRI
International. A.I. Center.*Tech. Note 251.*1981.
018111 Haas, N. Hendrix, G.G.* Machine learning for information management.* SRI
International. A.I. Center.*Tech. Note 252.*1981.
018112 Walker, D.E.*Computational strategies for analyzing the organization and
use of information.* SRI International. A.I. Center.*Tech. Note
253.*1981.
018113 Archbold, A.A. Grosz, B. Sagalowicz, D.*A team user's guide.* SRI
International. A.I. Center.*Tech. Note 254.* 1981.
018114 Konolige, K.*The database as model: A metatheoretic approach.* SRI
International. A.I. Center.*Tech. Note 255.*1981.
018115 Farley, A.M.*A probabilistic model for uncertain problem solving.* SRI
International. A.I. Center.*Tech. Note 256.* 1981.
018116 Grosz, B.J. (Ed.) Amsler, R. Appelt, D. Archbold, A. Grosz, B. Haas, N.
Hoobs, J. Konolige, K. Martin, P. Moore, R. Robinson, J. Rosenschein,
S. Sagalowica, D. Shieber, S. Stickel, M. Walker, D. Warren,
D.*Research on natural language processing at SRI.* SRI International.
A.I. Center.*Tech. Note 257.*1981.
018117 Wilkins, D.E.* Parallelism in planning and problem solving: reasoning
about resources.* SRI International. A.I. Center.*Tech. Note 258.*1982.
018118 Appelt, D.E.* Planning natural language utterances to satisfy multiple
goals.* SRI International. A.I. Center.* Tech. Note 259, Ph.D. Thesis.
Appelt, D.E. (Stanford University).*1982.
018119 Manna, Z. Waldinger, R.*Special relations in program synthetic
deduction.* SRI International. A.I. Center.* Tech. Note 260.*1982.
018120 Barnard, S.T. Fischler, M.A.*Computational stereo.* SRI International.
A.I. Center.*Tech. Note 261.*1982.
018121 Grosz, B.* TEAM: A transportable natural language interface system.* SRI
International. A.I. Center.*Tech. Note 263R.* 1982.
018122 Moore, R.C.*The role of logic in knowledge representation and commonsense
reasoning.* SRI International. A.I. Center.*Tech. Note 264.*1982.
018123 Warren, D.H.D.*A view of the fifth generation and its impact.* SRI
International. A.I. Center.*Tech. Note 265.* 1982.
018124 Wilkins, D.* Domain independent planning representation and plan
generation.* SRI International. A.I. Center.*Tech. Note 266R.*1983.
018125 Fischler, M.A. Barnard, S.T. Bolles, R.C. Lowry, M. Wuam, L. Smith, G.
Witkin, A.*Modeling and using physical constraints in scene analysis.*
SRI International. A.I. Center.*Tech. Note 267.*1982.
018126 Stickel, M.E.*A nonclausal connection graph resolution theorem proving
program.* SRI International. A.I. Center.* Tech. Note 268.*1982.
018127 Peterson, G.E. Stickel, M.E.* Complete systems of reductions using
associative an/or commutative unification.* SRI International. A.I.
Center.*Tech. Note 269.*1982.
018128 Grosz, B. Haas, N. Hendrix, G. Hobbs, J. Martin, P. Moore, R. Robinson,
J. Rosenschein, S.* DIALOGIC: A core natural language processing
system.* SRI International. A.I. Center.*Tech. Note 270.*1982.
018129 Barnard, S.T.*Interpreting perspective images.* SRI International. A.I.
Center.*Tech. Note 271.*1982.
018130 Pentland, A.P.* Local shading analysis.* SRI International. A.I.
Center.*Tech. Note 272.*1982.
018131 Smith, G.B.*From image irradiance to surface orientation.* SRI
International. A.I. Center.*Tech. Note 273.*1982.
024940 Ullman, J.D. Vardi, M.Y. Maier, D.*The equivalence of universal relation
definitions.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-940.*1982. 27p.
024947 Rowe, N.C.*Modelling degrees of item interest for a general database
query system.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-947.*1982. 34p.
024948 Rowe, N.C.*Three papers on rule based estimation of statistics on
databases.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-948.*1982. Contents:
Rowe, N.C.* Rule based statistical calculations on a "database
abstract"; Rowe, N.C.*Inheritance of statistical properties; Rowe, N.C.*
Diophantine compromise of a statistical database. 35p.
024950 Winston, P.H. Binford, T.O. Katz, B. Lowry, M.* Learning physical
description from functional definitions, examples and precedents.*
Stanford U. Comp.Sci.Dept.* STAN-CS-82-950.*1982. 22p.
024961 Arnold, R.D.*Automated stereo perception.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-961, Stanford U. Comp.Sci.Dept. A.I.
Lab.*AIM-351.*1983. 123p.
024965 Ghosh, P.K.*An approach to type design and text composition in Indian
scripts.83-965.*1983. 144p.
024966 Ghosh, P.K. Bigelow, C.A.*A formal approach to lettershape description
for type design.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-966.*1983.
49p.
024967 Manna, Z. Pnueli, A.* Verification of concurrent programs: A temporal
proof system.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-967.*1983. 92p.
024968 Whang, K.-Y.*A physical database design methodology using the property of
separability.* Stanford U. Comp.Sci.Dept.*STAN-CS-83-968, Ph.D. Thesis.
Whang, K.-Y.* 1983. 258p.
024971 Ruggles, L.* Letterform design systems.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-971.*1983. 24p.
018132 Kariv, O. Jeger, M.*Algorithms for P-center in a weighted tree.* TECHNION
- Israel Inst. of Tech. Comp.Sci.Dept.* Tech.Rpt. 249.*1982.
018133 Itai, A. Zehavi, A.*Bounds on path connectivity.* TECHNION - Israel Inst.
of Tech. Comp.Sci.Dept.*Tech.Rpt. 251.* 1982.
018134 Itai, A. Rodeh, M.*The Lord of the Ring or probabilistic methods for
breaking symmetry in distributive networks.* TECHNION - Israel Inst. of
Tech. Comp.Sci.Dept.*Tech.Rpt. 253.*1982.
018135 Lev, G. Valiant, L.G.*Size bounds for superconcentrators.* Edinburgh U.
Comp.Sci.Dept.*CSR-95-81.*1981.
018136 Habasinski, Z. Karpinski, M.*On the Blum Sakoda 7 pebble searching
algorithm.* Edinburgh U. Comp.Sci.Dept.* CSR-96-81.*1981.
018137 Skyum, S. Valiant, L.G.*A complexity theory based on boolean algebra.*
Edinburgh U. Comp.Sci.Dept.*CSR-97-82.* 1982.
018138 Apt, K.R. Plotkin, G.D.* Countable nondeterminism and random assignment.*
Edinburgh U. Comp.Sci.Dept.* CSR-98-82.*1982.
018139 Li, W.*An operational semantics of tasking and exception handling in
Ada.* Edinburgh U. Comp.Sci.Dept.*CSR-99-82.* 1982.
018140 Burstall, R.M. Goguen, J.A.* Algebras, theories and freeness: An
introduction for computer scientists.* Edinburgh U.
Comp.Sci.Dept.*CSR-101-82.*1982.
018141 Smyth, M.B. Plotkin, G.D.*The category theoretic solution of recursive
domain equations.* Edinburgh U. Comp.Sci.Dept.*CSR-102-82.*1982.
018142 Milner, R.* Calculi for synchrony and asynchrony.* Edinburgh U.
Comp.Sci.Dept.*CSR-104-82.*1982.
018143 Atkinson, M.P. Chisholm, K.J. Cockshott, W.P.* CMS - a chunk management
system.* Edinburgh U. Comp.Sci.Dept.* CSR-110-82.*1982.
018144 Milner, R.*A complete inference system for a class of regular
behaviours.* Edinburgh U. Comp.Sci.Dept.* CSR-111-82.*1982.
018145 Schmidt, D.A.* Syntactic type checking using Scott retraction maps.*
Edinburgh U. Comp.Sci.Dept.*CSR-112-82.* 1982.
018146 Plotkin, G.D.*An operational semantics for CSP.* Edinburgh U.
Comp.Sci.Dept.*CSR-114-82.*1982.
018147 Cardelli, L.* Two dimensional syntax for functional languages.* Edinburgh
U. Comp.Sci.Dept.*CSR-115-82.*1982.
018148 Milner, R.*A finite delay operator in synchronous CCS.* Edinburgh U.
Comp.Sci.Dept.*CSR-116-82.*1982.
018149 Constable, R.L.* Intensional analysis of functions and types.* Edinburgh
U. Comp.Sci.Dept.*CSR-118-82.*1982.
018150 Shields, M.W.* Concurrency, correctness, proof and undecidability in SDL
like systems.* Edinburgh U. Comp.Sci.Dept.*CSR-119-82.*1982.
018151 Shields, M.W.* Non sequential behaviour: 1.* Edinburgh U.
Comp.Sci.Dept.*CSR-120-82.*1982.
018152 Jerrum, M. Skyum, S.*Families of fixed degree graphs for processor
interconnection.* Edinburgh U. Comp.Sci.Dept.* CSR-121-82.*1982.
018153 Milne, G.J.* CIRCAL: A calculus for circuit description.* Edinburgh U.
Comp.Sci.Dept.*CSR-122-82.*1982.
018154 Hennessy, M.*Axiomatising finite delay operators.* Edinburgh U.
Comp.Sci.Dept.*CSR-124-82.*1982.
018155 Brownbridge, D.R. Marshall, L.F. Randell, B.*The Newcastle connection or
UNIXes of the world unite!* Newcastle Upon Tyne U. Computing Lab.*No.
175.*1982.
018156 Randell, B.*The structuring of distributed computing systems.* Newcastle
Upon Tyne U. Computing Lab.*No. 181.* 1982.
018157 Cristian, F.* Correct and robust programs.* Newcastle Upon Tyne U.
Computing Lab.*No. 183.*1983.
018158 Feldman, J.A.*Four frames suffice: A provisionary model of vision and
space.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 99.*1982.
018159 Ellis, C.S. Feldman, J.A. Heliotis, J.E.* Language constructs and support
systems for distributed computing.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 102.*1982.
018160 Frisch, A.M. Allen, J.F.* Knowledge representation and retrieval for
natural language processing.* Rochester U. Comp.Sci.Dept.*Tech.Rpt.
104.*1982.
018161 Brown, C.M.*Bias and noise in the Hough transform I: theory.* Rochester
U. Comp.Sci.Dept.*Tech.Rpt. 105.*1982.
018162 Brown, C.M.* Color vision and computer vision.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 108.*1982.
018163 Small, S.L. Shastri, L. Brucks, M.L. Kaufman, S.G. Cottrell, G.W.
Addanki, S.* ISCON: A network construction aid and simulator for
connectionist models.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 109.*1983.
018164 Ellis, C.S.* Extendible hashing for concurrent operations and distributed
data.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 110.*1982.
018165 Peterson, G.L. Ying, Y.-H.*Trade-offs in VLSI for bus communication
networks.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 111.*1982.
018166 Brown, C.M. Curtiss, M.B. Sher, D.B.*Advanced Hough transform
implementations.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 113.*1983.
018167 Brown, C.M. Sher, D.B.* Hough transformation into cache accumulators:
Considerations and simulations.* Rochester U. Comp.Sci.Dept.*Tech.Rpt.
114.*1982.
018168 Loui, R.P.* Optimal paths in graphs with stochastic or multidimensional
weights.* Rochester U. Comp.Sci.Dept.* Tech.Rpt. 115.*1982.
018169 Stuth, B.H.* Local computation of motion.* Rochester U.
Comp.Sci.Dept.*Tech.Rpt. 116.*1982.
018170 Kedem G. Watanabe, H.*Optimization techniques for IC layout and
compaction.* Rochester U. Comp.Sci.Dept.*Tech.Rpt. 117.*1982.
018171 Montuno, D.Y. Fournier, A.*Finding x-y convex hull a set of x-y
polygons.* Toronto U. Comp. Systems Res. Group.* CSRG-148.*1982.
018172 Tsichritzis, D.* Beta Gamma, edited by D. Tsichritzis.* Toronto U. Comp.
Systems Res. Group.*CSRG-150.*1983.
VOL. 5, NO. 11 10/22/83
018173 Spector, A.Z. Schwarz, P.M.* Transactions: a construct for reliable
distributed computing.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-82-143.*1983.
018174 Shaw, M.(ed.)*Working papers on an undergraduate computer science
curriculum.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-101.*1983.
018175 Hayes, P.J. Szekely, P.A.*Graceful interaction through the COUSIN command
interface.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-102.*1983.
018176 Kung, H.T. Ruane, L.M. Yen, D.W.L.*A two-level pipelined systolic array
multi dimensional convolution.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-103.*1983.
018177 Specker, P.*A post-processing algorithm for time domain pitch trackers.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-104.*1983.
018178 Doyle, J.*What is rational psychology? Toward a modern mental
philosophy.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-106.*1983.
018179 Satyanarayanan, M.*A methodology for modelling storage systems.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-83-109, Ph.D. Thesis. Satyanarayanan,
M.*1983.
018180 Carbonell, J.G. Minton, S.* Metaphor and common sense reasoning.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-110.*1983.
018181 Brookes, S.D.*On the relationship of CCS and CSP.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-111.*1983.
018182 Brookes, S.D. Rounds, W.C.*Behavioral equivalence relations induces by
programming logics.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-112.*1983.
018183 Thorpe, C.E. Shafer, S.* Topological correspondence in line drawings of
multiple views of objects.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-113.*1983.
018184 Doyle, J.*Methodological simplicity in expert system construction: The
case of judgements and reasoned assumptions.* Carnegie Mellon U.
Comp.Sci.Dept.* CMU-CS-83-114.*1983.
018185 Ackley, D.G. Berliner, H.J.*The QBKG system: Knowledge representation for
producing and explaining judgements.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-116.*1983.
018186 Driscoll, J.R. Furst, M.L.*On the diameter of permutation groups.*
Carnegie Mellon U.*Comp.Sci.Dept.*n.d.
018187 Wolfenstetter, St.* Weakly almost periodic functions on hypergroups.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8301.*1983.
018188 Roesler, F.*Die riemannsche vermutung als eigenwert-problem.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8302.*1983.
018189 Castrigiano, D.P.L. Kokiantonis, N.* Classical paths for a quadratic
action with memory and exact evaluation of the path integral.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8303.*1983.
018190 Rentrop, P.*Partitionierte Runge-Kutta verfahren zur numerischen losung
von Bichtsteifen un Steifen Anfangswertaufgaben.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8304.*1983.
018191 Gnatz, R.*Certification by program construction from specifications.
(Problems of certification of graphics software).* Technische
Universitaet Munchen. Institut fuer Informatik.*TUM-I8106.*1981.
018192 Steinbrueggen, R.* Program development using transformational
expressions.* Technische Universitaet Munchen. Institut fuer
Informatik.*TUM-I8206.*1982.
018193 Eichholz, S. Schneider, H.*BS subscript 0: Modellierung eines
Betriebssystems mot Hilfe von ITS.* Technische Universitaet Munchen.
Institut fuer Informatik.* TUM-I8301.*1983.
018194 Kiebling, W. Landherr, G.*A quantitative comparison of Locke protocols
for centralized databases.* Technische Universitaet Munchen. Institut
fuer Informatik.* TUM-I8302.*1983.
018195 Wirsing, M. Pepper, P. Partsch, H. Dosch, W. Broy, M.*On hierarchies of
abstract data types.* Technische Universitaet Munchen. Institut fuer
Informatik.* TUM-I8303.*1983.
018196 Geisberger, J. Reiser, A.*Sperrprotokolle fuer transaktionen mit
prioritaeten.* Technische Universitaet Munchen. Institut fuer
Informatik.*TUM-I8304.*1983.
018197 Griswold, R.E.*An overview of the Icon programming language.* Arizona U.
Comp.Sci.Dept.*TR 83-03a.*1983.
018198 Anderson, A.J. Griswold, R.E.*Unifying list and string processing in
Icon.* Arizona U. Comp.Sci.Dept.*TR 83-04.* 1983.
018199 Nielsen, T.* Throughput for communications networks with mobile users*
Arizona U.. Comp.Sci.Dept.*TR 83-07.*1983.
018200 Myers, E.W.*An applicative random access stack.* Arizona U.
Comp.Sci.Dept.*TR 83-09.*1983.
018201 Aviles, P.* Prescribing conformal complete metrics with given positive
Gaussian curvature in two dimensional Euclidean space.* California U.,
Berkeley. Math. Sciences Res.Inst.*MSRI 049-83.*1983.
018202 Rao, J.N.K. Wu, C.F.J.* Inference from stratified samples: second order
analysis of three methods for nonlinear statistics.* California U.,
Berkeley. Math. Sciences Res.Inst.*MSRI 050-83.*1983.
018203 Alexander, K.* Probability inequalities for empirical processes and a law
of the iterated logarithm.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 051-83.*1983.
018205 Melrose, R.* Forward well posedness from hypoellipticity and
approximability.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 052-83.*1983.
018206 Mulase, M.* Complete integrability of the Kadomtsev Petviashvili
equation.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI
053-83.*1983.
018207 Marvizi, S.* Fanning curve of Lagrangian manifolds and geodesic flow.*
California U., Berkeley. Math. Sciences Res.Inst.*MSRI 054-83.*1983.
018208 Lalley, S.P.* Limit theorems for first passage times in linear and
nonlinear renewal theory.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 055-83.*1983.
018209 Sylvester, J.*Some conditions equivalent to strong hyperbolicity for
first order systems with constant coefficients.* California U.,
Berkeley. Math. Sciences Res.Inst.*MSRI 056-83.*1983.
018210 Sylvester, J.*On the dimension of spaces of linear transformation
satisfying rank conditions.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 057-83.*1983.
018211 Gardner, R.B. Shadwick, W.F.*A simple characterization of the contact
system on J superscript k (E) superscript *.* California U., Berkeley.
Math. Sciences Res.Inst.*MSRI 058-83.*1983.
018212 Reilly, R.C.* Affine geometry and the form of the equation of a
hypersurface.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI
059-83.*1983.
018213 Kuiper, N.H.* Taut sets in three space are very special.* California U.,
Berkeley. Math. Sciences Res.Inst.*MSRI 060-83.*1983.
018214 Soloman, B.*On the Gauss map of an area minimizing hypersurface.*
California U., Berkeley. Math. Sciences Res.Inst.*MSRI 061-83.*1983.
018215 Gasqui, J. Goldschmidt, H.* Infinitesimal rigidity of S superscript 1 x
real projective n space.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 062-83.*1983.
018216 Johnstone, I.* Admissibility, difference equations and recurrence in
estimating a Poisson mean.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 063-83.*1983.
018217 Kung-Ching, C.*Applications of homology theory to some problems in
differential equations.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 064-83.*1983.
018218 Estabrook, F.B.* Invariant differential systems and intrinsic
coordinates.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI
065-83.*1983.
018219 Treibergs, A.* Existence and convexity for hyperspheres of prescribed
mean curvature.* California U., Berkeley. Math. Sciences Res.Inst.*MSRI
066-83.*1983.
018220 Freedman, D.A. Peters, S.C.* Bootstrapping an econometric model: Some
empirical results.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 067-83.*1983.
018221 Freedman, D.A. Peters, S.C.* Bootstrapping a regression equation: Some
empirical results.* California U., Berkeley. Math. Sciences
Res.Inst.*MSRI 068-83.*1983.
018222 Jewell, W.S.*A general framework for learning curve reliability growth
models.* California U., Berkeley. O.R. Center.*ORC 79-11.*1979 (revised
April, 1983).
018223 Jewell, W.S.* Enriched multinormal priors revisited.* California U.,
Berkeley. O.R. Center.*ORC 82-14.*1982.
018224 Ross, S.M. Schechner, Z.*Using simulation to estimate first passage
distributions.* California U., Berkeley. O.R. Center.*ORC 83-01.*1983.
018225 Agrawal, A. Satyanarayana, A.* Source to K terminal reliability analysis
of rooted communication networks.* California U., Berkeley. O.R.
Center.*ORC 83-02.*1983.
018226 Derman, C. Lieberman, G.J. Ross, S.M.*On the use of replacements to
extend system life.* California U., Berkeley. O.R. Center.*ORC
83-03.*1983.
018227 Wong, F.L.*Interactive cell editor: A symbolic editor for NMOS gate
cells.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-82-1104.*1982.
018228 Huson, C.A.*An in-line subroutine expander for Parafrase.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-82-1118.*1982.
018229 Michalski, R.S.*A theory and methodology of inductive learning.* Illinois
U. Comp.Sci.Dept.*UIUCDCS-R-83-1122.* 1983.
018230 Gajski, D. Kuck, D. Lawrie, D. Sameh, A.*Construction of a large scale
multiprocessor.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1123.*1983.
018231 Gallopoulos, E.* Numerical experiments with the massively parallel
processor.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1124.*1983.
018232 Cheng, R. Liu, J.W.S.* Reliable synchronization in computer networks.*
Illinois U. Comp.Sci.Dept.*UIUCDCS-R-83-1126.* 1983.
018233 Healey, S.T.* IBL - a language for abstract and geometric VLSI layout.*
Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1127.*1983.
018234 Eisenbarth, B. Ziviani, N. Gonnet, G.H. Mehlhorn, K. Wood, D.*The theory
of fringe analysis and its application to 2-3 trees and B trees.*
Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-17.*1982.
018235 Gonnet, G.H. Ziviani, N.*Expected behaviour analysis of AVL trees.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-18.* 1982.
018236 Nait Abdallah, M.A.* Sort theory.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-19.*1982.
018237 Pachl, J.K.*Finding pseudoperipheral nodes in graphs.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-82-20.*1982.
018238 Munro, J.I. Poblete, P.V.*Lower bound for determining the median.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-21.* 1982.
018239 Poblete, P.V. Munro, J.I.*The analysis of a fringe heuristic for binary
search trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-22.*1982.
018240 Poblete, P.V.*An alternative approach to the analysis of late binding
trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-23.*1982.
018241 Culik, K., II Juergensen, H.* Programmable finite automata for VLSI.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-24.* 1982.
018242 Edelsbrunner, H. Overmars, M.H. Wood, D.* Graphics in flatland: A case
study.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-25.*1982.
018243 Soisalon-Soininen, E. Wood, D.*Optimal algorithms to compute the closure
of a set of iso rectangles.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-26.*1982.
018244 Gonnet, G.H. Munro, J.I. Wood, D.* Direct dynamic structures for some
line segment problems.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-27.*1982.
018245 Albert, J. Wood, D.* Checking sets, test sets, rich languages and
commutatively closed languages.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-28.*1982.
018246 Gonnet, G.H. Olivie, H.F. Wood, D.* Height ratio balances trees.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-29.* 1982.
018247 Culik, K., II Wood, D.*A note on some trees similarity measures.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-30.* 1982.
018248 Maurer, H.A. Salomaa, A. Welzl, E. Wood, D.* Dense intervals of
linguistic families.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-31.*1982.
018249 Corless, R.M.*A feasibility study of the use of COLSYS in the solution of
systems of partial differential equations.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-82-32.* 1982.
018250 Ottmann, T. Widmayer, P. Wood, D.*A worst-case effecient algorithm for
hidden line elimination.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-33.*1982.
018251 Mavaddat, F. Cheng, S.K.S.* Speech recognition using linear prediction
residue and a reduced feature space.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-82-34.*1982.
018252 Nait Abdallah, M.A.*The necessity of double bundle structure in sort
theory.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-36.*1982.
018253 Ottmann, T. Widmayer, P. Wood, D.*A fast algorithm for boolean mask
operations.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-37.*1982.
018254 Gonnet, G.H. Larson, P.-A.*External hashing with limited internal
storage.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-38.*1982.
018255 George, A. Ng, E.*Solution of sparse underdetermined systems of linear
equations.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-39.*1982.
018256 Geddes, K.O. Gonnet, G.H. Char, B.W.* MAPLE user's manual, second
edition.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-40.*1982.
018257 Singh, B. Beatty, J.C. Booth, K.S. Ryman, R.*A graphics editor for Benesh
movement notation.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-82-41.*1982.
018258 Kochanek, D.H.U. Bartels, R. Booth, K.S.*A computer system for smooth
keyframe animation.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-42.*1982.
018259 Breslin, P.H. Beatty, J.C.*A powerful interface to a high-performance
Raster graphics system.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-45.*1982.
018260 Plebon, D.A. Booth, K.S.* Interactive picture creation systems.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-82-46.* 1982.
018261 Barsky, B.A. Beatty, J.C.*Varying the betas in beta splines.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-82-49.* 1982.
018262 Vuong, S.T. Cowan, D.D.* UNISPEX - A unified model for protocol
specification and verification.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-52.*1982.
018263 Ottmann, T. Parker, D.S. Rosenberg, A.L. Six, H.W. Wood, D.* Minimal cost
brother trees.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-82-54.*1982.
018264 Ottmann, T. Wood, D.* Dynamical sets of points.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-82-56.*1982.
018265 Ashcroft, E.A. Wadge, W.W.*A summary of Lucid for programmers.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-82-57.*1982.
018266 Varah, J.M.*A computational approach to parameter estimation in ordinary
differential equations.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-82-58.*1982.
018267 Ng, E.G.-Y.* Row elimination in sparse matrices using rotations.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-01, Ph.D. Thesis. Ng,
E.G.-Y.*1983.
018268 Gueting, R.H. Wood, D.*Finding rectangle intersections by divide and
conquer.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-03.*1983.
018269 Larson, P.-A. Kajla, A.* File organization: Implementation of a method
guaranteeing retrieval in one access.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-04.*1983.
018270 Conn, A.R. O'Neill, P.F.* Nondifferentiable optimization and worse.*
Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-05.* 1983.
018271 Ottmann, T. Soisalon-Soininen, E. Wood, D.*On the definition and
computation of rectilinear convex hulls.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-07.*1983.
018272 Dymond, P.W. Tompa, M.* Speedup of deterministic machines by synchronous
parallel machines.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-08.*1983.
018273 Watt, S.*Arrays and tables in Maple: Supplement to the Maple user's
manual.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-10.*1983.
018274 Ottmann, T. Schrapp, M. Wood, D.*On 1-pass top-down update algorithms for
stratified search trees.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-83-11.*1983.
018275 Bartels, R.H. Mahdavi-AmiriN.* On generating test probles for nonlinear
programming algorithms.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-83-12.*1983.
018276 George, A. Liu, J. Ng, E.* Row ordering schemes for sparse givens
transformations. I. Bipartite graph model.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-13.*1983.
018277 George, A. Ng, E.*A partial pivoting implementation of Gaussian
elimination for sparse systems.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-83-15.*1983.
018278 Char, B.W. Geddes, K.O. Gonnet, G.H.*An introduction to Maple: Sample
interactive session.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-83-16.*1983.
018279 Edelsbrunner, H. Leeuwen, J. van Ottmann, T. Wood, D.* Computing the
connected components of simple rectilinear geometrical objects in
D-space.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-83-17.*1983.
018280 Larson, P.-A.*Further analysis of external hashing with fixed length
separators.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-83-18.*1983.
018281 Ottmann, T. Soisalon-Soininen, E. Wood, D.* Rectilinear convex hull
partitioning of sets of rectilinear polygons.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-19.*1983.
018282 Wood, D.*The contour problem for rectilinear polygons.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-20.*1983.
018283 Conn, A.R. Gould, N.I.M.*On the location of direction of infinite descent
for non-linear programming algorithms.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-21.*1983.
018284 Korach, E. Rotem, D. Santoro, N.* Distributed ranking.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-22.*1983.
018285 Malcolm, M.A. Rogers, L.D. Spracklen, J.E.*An acknowledging contention
algorithm suitable for local radio networks.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-23.*1983.
018286 Boral, H. DeWitt, D.J.* Database machines: An idea whose time has passed?
A critique of the future of database machines.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 504.* 1983.
018287 Qi, L.* Base set strategy for solving linearly constrained convex
programs.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 505.*1983.
018288 Shiau, T.-H.* Iterative linear programming for linear complementarity and
related problems.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 507, Ph.D.
Thesis. Shiau, T.-H.* 1983.
018289 Smith, J.E. Pleszkun, A.R. Katz, R.H. Goodman, J.R.* PIPE: A high
performance VLSI architecture.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt.
512.*1983.
018290 Schoof, R.* Elliptic curves over finite fields and the computation of
square roots mod p.* Amsterdam U. Math Dept.*Rpt. 83-09.*1983.
018291 Torenvliet, L. Emde Boas, P. van*The reconstruction and optimization of
Trie Hashing functions.* Amsterdam U. Math Dept.*Rpt. 83-19.*1983.
018292 Sinha, P.S.* Optimization techniques in computer system design and load
control.* British Columbia U. Comp.Sci.Dept.*Tech.rpt. 81-16.*1981.
018293 Alagar, V.S.* Range response: An output modification technique and an
analysis of its effectiveness for security of statistical databases.*
Concordia U. Comp.Sci.Dept.*1983.
018294 Nicola, R. de Hennessy, M.C.B.*Testing equivalences for processes.*
Edinburgh U. Comp.Sci.Dept.*CSR-123-82.*1983, revised.
018295 Feldman, J.S. Beech, D.*The integrated data model: A database
perspective.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-83-013; Hewlett
Packard Co. Comp.Res. Center.* CRC-TR-83-003.*1983.
018296 Beech, D.*A reference model for command and response languages.* Hewlett
Packard Co. Comp.Sci.Lab.*CSL-83-014; Hewlett Packard Co. Comp.Res.
Center.*CRC-TR-83-004.* 1983.
018297 Beech, D.*Introducing the integrate data model.*Hewlett Packard Co.Co.
Comp.Sci.Lab.*CSL-83-015, Hewlett Packard Co. Comp.Res.
Center.*CRC-TR-83-005.*1983.
018298 Yang, S.*A string pattern matching algorithm for pattern equation systems
with reversal.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-03.*1983.
018299 Bhat, K.V.S.*An optimum reliable network architecture.* Iowa U.
Comp.Sci.Dept.*Tech.rpt. 83-006.*1983.
018300 Chan, M.Y.* Query complexity for statistical database security.* Hong
Kong U. Comp. Studies and Appl. Centre.* TR-A5-83.*1983.
018301 Yuen, C.K.* Dual stroke method for Chinese character input.* Hong Kong U.
Comp. Studies and Appl. Centre.*TR-A6-83.* 1983.
018302 Bokhari, S.H. Raza, A.D.*Reducing the diameters of arrays.* Lahore.
University of Engineering & Technology. E.E. Dept.
Comp.Eng.Div.*Res.rpt. EECE-83-01.*1983.
018303 Igbal, M.A. Bokhari, S.H.*New heuristics for the mapping problem.*
Lahore. University of Engineering & Technology. E.E. Dept.
Comp.Eng.Div.*Res.rpt. EECE-83-02.*1983.
018304 Magnusson, B.* Code objects: A support for incremental compilation.* Lund
U. Comp.Sci.Dept.*1983.
018305 Lee, C.S.G. Lee, B.H.* Resolved motion adaptive control for techanical
manipulators.* Michigan U. Computing Res.Lab.* CRL-TR-22-83.*1983.
018306 Shin, K.G. Krishna, C.M. Lee, Y.H.*A unified method for evaluating real
time computer controllers: A case study.* Michigan U. Computing
Res.Lab.*CRL-TR-23-83.*1983.
018307 Rounds, W.C.*On the relationships between Scott domains, synchronization
trees, and metric spaces.* Michigan U. Computing
Res.Lab.*CRL-TR-25-83.*1983.
018308 Panzieri, F.*Software and hardware of high integrity systems project:
Final report.* Newcastle upon Tyne U. Computing Lab.*No. 179.*1982.
018309 Cristian, F.*A rigorous approach to fault tolerant system development.*
Newcastle upon Tyne U. Computing Lab.*No. 184.*1983.
018310 Le Chenadec, P.*Formes canoniques dans les algebres finiment prosentees
(and annexe).* Paris-Sud. Universite. Centre d'Orsay.*No. d'ordre 3472,
Ph.D. Thesis. Le Chenadec, P.*1983. 2 volumes.
018322 Le Tallec, P. Ruas, V.*On the convergence of the bilinear velocity
constant pressure finite element method in viscous flow.* Pontificia U.,
Rio de Janeiro. Info.Dept.* No. 04/83.*1983.
018323 Tucherman, L. Furtado, A.L. Casanova, M.A.*A pragmatical approach to
structured database design.* Pontificia U., Rio de Janeiro.
Info.Dept.*No. 11/83.*1983.
018324 Albrecht, P.*Numerical treatment of ordinary differential equations: The
theory of A-methods.* Pontificia U., Rio de Janeiro. Info.Dept.*No.
12/83.*1983.
018325 Allen, J.F.* ARGOT: A system overview.* Rochester U.
Comp.Sci.Dept.*Tech.rpt. 101.*1982.
018326 Neufeld, E.M. Colbourn, C.J.*The most reliable series parallel networks.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 83-07.*1983.
018327 Collier, P.*The virtuous nature of variables.* Tasmania U.
Info.Sci.Dept.*1983.
018328 Konstantas, D.* Virtual time CSMA: A study.* Toronto U. Comp. Systems
Res. Group.*CSRG-149.*1983.
018329 Dawes, R.* Constructions of minimally K connected graphs.* Toronto U.
Comp.Sci.Dept.*Tech.rpt. 165/83, Ph.D. Thesis. Dawes, R.*1983.
018330 Aleliunas, R.* Probabilistic parallel communication.* Toronto U.
Comp.Sci.Dept.*Tech.rpt. 166/83, Ph.D. Thesis. Aleliunas, R.*1983.
018331 Symm, G.T. Wichmann, B. Kok, J. Winter, D.T.*Guidelines for the design of
large modular scientific libraries in Ada* - Second interim report.*
U.K. National Physical Lab. Info. Technology and Computing Div.*DITC
28/83.*1983.
018332 Lawrance, A.J. Lewis, P.A.W.*Simple dependent pairs of exponential and
uniform random variables.* U.S. Naval Postgraduate
Sch.*NPS55-82-011.*1982.
018333 Lewis, P.A.W. Lawrance, A.J.*Stationary exponential time series: Further
model development and a residual analysis.* U.S. Naval Postgraduate
Sch.*NPS55-83-008.* 1983.
018334 Johnson, R.W.*Algorithms for single signal and multisignal minimum cross
entropy spectrum analysis.* U.S. Naval Res.Lab.*NRL rpt. 8667.*1983.
018335 Johnson, R. Shore, J.E.*Which is the better entropy expression for speech
processing: -S log S or log S?* U.S. Naval Res.Lab.*NRL rpt. 8704.*1983.
018336 Shore, J.E.*On a relation between maximum likelihood classification and
minimum cross entropy classification.* U.S. Naval Res.Lab.*NRL rpt.
8707.*1983.
018337 Johnson, R.W. Shore, J.* Multisignal minimum cross entropy spectrum
analysis with weighted priors.* U.S. Naval Res.Lab.*NRL rpt. 8731.*1983.
018338 Nierergelt, J.* Errors in dialog design and how to avoid them.*No issuing
agency indicated (author's address: Institut fuer
Informatik/ETH/CH-8092 Zurich/Switzerland).* 1982.
VOL. 5, NO. 12 11/15/83
018339 Doran, R.W.*Variations on the high speed adder.* Auckland U.
Comp.Sci.Dept.*Rpt. 29.*1983.
018340 Burrage, K. Chipman, F.H.*The stability properties of singly implicit
general linear methods.* Auckland U. Comp.Sci.Dept.*Rpt. 30.*1983.
018341 Hackman, S.T. Shephard, R.W.* Production networks: a dynamic model of
production.* California U., Berkeley. O.R. Center.*ORC 83-04.*1983.
018342 Agrawal, A. Barlow, R.E.*A survey of network reliability.* California U.,
Berkeley. O.R. Center.*ORC 83-05.*1983.
018343 Oliver, R.M.* Forcasting seasonal demand.* California U., Berkeley. O.R.
Center.*ORC 83-06.*1983.
018344 Demange, G. Gale, D.*A strategy proof allocation mechanism for two-sided
matching markets.* California U., Berkeley. O.R. Center.*ORC
83-08.*1983.
018345 Jantzen, M. Kudlek, M.* Homomorphic images of sentential form languages
defined by semi thue systems.* Hamburg U. Fachbereich
Informatik.*Bericht Nr. 89.*1983.
018346 Marnitz, J.*Behandlung von Wartenetzen mit mehreren Subketten nach dem
Verfahren der operationalen analyse.* Hamburg U. Fachbereich
Informatik.*Bericht Nr. 96.*1983.
018347 Kozen, D. Parikh, R.*A decision procedure for the propositional
mu-calculus.* IBM Watson Res. Center.*RC 09987.*1983.
018348 Walker, A.* SYLLOG: An approach to Prolog for nonprogrammers.* IBM Watson
Res. Center.*RJ 3950.*1983.
018349 Hauser, C. Reitman, R.*Proving fairness of concurrent programs.* IBM
Watson Res. Center.*RJ 3931.*1983.
018350 Bux, W. Closs, F. Kuemmerle, K. Keller, H. Mueller, H.R.* Architecture
and design of a reliable token ring network.* IBM Watson Res. Center.*RZ
1224.*1983.
018251 Chang, C.L.*An experience of building an expert system with Prolog.* IBM
Watson Res. Center.*RJ 3925.*1983.
018352 Tantawi, A.N. Ruschitzka, M.* Performance analysis of checkpointing
strategies.* IBM Watson Res. Center.*RC 09999.*1983.
018353 Halpern, J. Manna, Z. Moszkowski, B.*A hardware semantics based on
temporal intervals.* IBM Watson Res. Center.*RJ 3877.*1983.
018354 Kim, W. Lorie, R. McNabb, D. Plouffe, W.* Nested transactions for
engineering design databases.* IBM Watson Res. Center.*RJ 3934.*1983.
018355 Bullen, C.V. Bennett, J.L.* Office workstation use by administrative
managers and professionals.* IBM Watson Res. Center.*RJ 3890.*1983.
018356 Blum, A.M. Jaffe, E. MacNair, E.A. Kurose, J.F. Sauer, C.H.* The research
queueing package: An introduction and update.* IBM Watson Res.
Center.*RC 10016.*1983.
018357 Baratz, A.E. Segall, A.* Reliable link initialization procedures.* IBM
Watson Res. Center.*RC 10032.*1983.
018358 Chandra, A.K. Vardi, M.Y.*The implication problem for functional and
inclusion dependencies is undecidable.* IBM Watson Res. Center.*RC
09980.*1983.
018359 Strom, R. Halim, N.*A new programming methodology for long lived software
systems.* IBM Watson Res. Center.*RC 09979.*1983.
018360 Gopal, I.S. Jaffe, J.M.*The auctioneer's problem.* IBM Watson Res.
Center.*RC 09974.*1983.
018361 Towsley, D.*An approximate analysis of multiprocessor systems.* IBM
Watson Res. Center.*RC 10020.*1983.
018362 Walker, A. Porto, A.* KBO1, a knowledge based garden store assistant.*
IBM Watson Res. Center.*RJ 3928.*1983.
018363 Lomet, D.B.*Making pointers safe in system programming languages.* IBM
Watson Res. Center.*RC 10030.*1983.
018364 Dolev, D. Reischuk, R. Strong, H.R.*Early stopping in Byzantine
agreement.* IBM Watson Res. Center.*RJ 3915.* 1983.
018365 Lorie, R. Plouffe, W.* Relational databases for engineering data.* IBM
Watson Res. Center.*RJ 3847.*1983.
018366 Wilms, P.F. Lindsay, B.G. Selinger, P.G.*"I wish I were over there":
Distributed execution protocols for data definition in R*.* IBM Watson
Res. Center.*RJ 3892.*1983.
018367 Coppersmith, D. Klawe, M.M. Pippenger, N.J.* Alphabetic minimax trees of
degree at most t.* IBM Watson Res. Center.*RJ 3878.*1983.
018368 Goyal, A. Agerwala, T.*Design considerations in some shared memory
systems.* IBM Watson Res. Center.*RC 10028.*1983.
018369 Bonanni, P.G.* High speed deadbeat control of a nonlinear hydraulic
robot.* IBM Watson Res. Center.*RC 10023.*1983.
018370 Tsai, R.Y. Hauang, T.S.* Uniqueness and estimation of 3-D motion
parameters and surface structures of rigid objects.* IBM Watson Res.
Center.*RC 09986.*1983.
018371 Yemini, S. Berry, D.M.*A modular verifiable exception handling
mechanism.* IBM Watson Res. Center.*RC 09993.* 1983.
018372 Sasao, T.* Input variable assignment and output phase optimization of
PLA's.* IBM Watson Res. Center.*RC 10003.* 1983.
018373 Dahmen, W. Micchelli, C.A.*Recent progress in multivariate splines.* IBM
Watson Res. Center.*RC 09969.*1983.
018374 Ditlow, G. Brown, A.*The Delta-I simultaneous switching problem.* IBM
Watson Res. Center.*RC 10015.*1983.
018375 Selinger, R.D.*The design and evaluation of single and multiple processor
office workstations.* IBM Watson Res. Center.*RJ 3895 & RJ 3896 (part
2: Appendixes), Ph.D. Thesis. Selinger, R.D. (University of California
at Berkeley).*1983. 2 volumes.
018376 May, C.* LARQ: A study in the design and evaluation of a memory
management algorithm.* IBM Watson Res. Center.*RC 10048, Ph.D. Thesis.
May, C.(Yale University).*1983.
018377 Rissanen, J.*A universal data compression system.* IBM Watson Res.
Center.*RJ 3936.*1983.
018378 Pickover, C.A. Dixon, N.R.* Spectrographic representation for speech
synthesizer control functions.* IBM Watson Res. Center.*RC 10049.*1983.
018379 Keller, H. Mueller, H.R. Meyr, H.* Transmission design criteria for a
synchronous token ring.* IBM Watson Res. Center.*RZ 1226.*1983.
018380 Fagin, R.* Armstrong databases.* IBM Watson Res. Center.*RJ 3440.*1982.
018381 Wahl, F. So, S. Wong, K.* Hybrid high precision surface inspection.* IBM
Watson Res. Center.*RJ 3498.*1982.
018382 Koenig, W. Lorie, R.A.*Storage of VLSI physical designs in a relational
database.* IBM Watson Res. Center.*RJ 3548.* 1982.
018383 Dolev, D. Warmuth, M.K.* Profile scheduling of opposing forests and level
orders.* IBM Watson Res. Center.*RJ 3553.*1982.
018384 Jenny, C.J.* Placing files and processes in distributed systems: A
general method considering resources with limited capacity.* IBM Watson
Res. Center.*RZ 1157.*1982.
018385 Boudol, G.* Computational semantics of terms rewriting systems.*
Inria.*Rapports de Recherche 192.*1983.
018386 Besnard, P. Quiniou, R. Quinton, P. Saint-Dizier, P. Siroux, J.
Trilling, L.*Dialogue et representation des informations dans un systeme
de messagerie intelligent.* Inria.*Rapports de Recherche 193.*1983.
018387 Chailloux, J. Hullot, J.-M. Levy, J.-J. Vuillemin, J.*Le systeme lucifer
d'aide a la conception de circuits integres.* Inria.*Rapports de
Recherche 196.*1983.
018388 Berry, G. Curien, P.L. Levy, J.-J.* Full abstraction for sequential
languages: The state of the art.* Inria.* Rapports de Recherche
197.*1983.
018389 Labit, C.*Estimation de mouvement dans une sequence d'images de
television en vue d'un codage avec compensation de mouvement.*
Inria.*Rapports de Recherche 198.*1983.
018390 Abiteboul, S.* Algebraic analogues to fundamental notions of query and
dependency theory.* Inria.*Rapports de Recherche 201.*1983.
018391 Richard, J.F.*Logique du fonctionnement et logique de l'utilisation.*
Inria.*Rapports de Recherche 202.*1983.
018392 Gardarin, G. Valduriez, P. Viemont, Y.*Les arbres de predicats.*
Inria.*Rapports de Recherche 203.*1983.
018393 Marie, R. Pellaumail, J.*Regime stationnaire pour une file M/H/1 avec
impatience.* Inria.*Rapports de Recherche 205.* 1983.
018394 Parthasarathy, S.*On the representation of petri nets as state difference
equations.* Inria.*Rapports de Recherche 208.*1983.
018395 Despeyroux, J.*An algebraic specification of a Pascal compiler.*
Inria.*Rapports de Recherche 209.*1983.
018396 Hullot, J.-M.* CEYX, a multiformalism programming environment.*
Inria.*Rapports de Recherche 210.*1983.
018397 Melese, B.*Mentor rapport: Manipulation de textes structures sous
mentor.* Inria.*Rapports Techniques 023.* 1983.
018398 Kirkerud, B.* Completeness of Hoare calculi revisited.* Oslo U.
Informatics Inst.*Res.Rpt. 71.*1982.
018399 Koch, P.E.* Jackson theorems for generalized polynomials with special
applications to trigonometric and hyperbole functions.* Oslo U.
Informatics Inst.*Res.Rpt. 72.*1982.
018400 Krogdahl, S.* Protection in Simula: A new proposal.* Oslo U. Informatics
Inst.*Res.Rpt. 73.*1982.
018401 Kirkerud, B.* Undefinedness in assertion languages.* Oslo U. Informatics
Inst.*Res.Rpt. 74.*1982.
018402 Koch, P.E.* Collocation by L splines at transformed Gaussian points.*
Oslo U. Informatics Inst.*Res.Rpt. 75.* 1983.
018403 Nossum, R.*A proof technique based on simplication.* Oslo U. Informatics
Inst.*Res.Rpt. 76.*1983.
018404 Ronen, D. Perl, Y.* Heuristics for finding a maximum number of disjoint
bounded paths.* Rutgers U. Comp.Sci.Dept.* DCS-TR-126.*1983.
018405 Dowd, M. Saks, M. Rudolph, L.*The balanced sorting network.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-127.*1983.
018406 Nudel, B.*Solving the general consistent labeling (or constraint
satisfaction) problem: Two algorithms and their expected complexities.*
Rutgers U. Comp.Sci.Dept.* DCS-TR-128.*1983.
018407 Paull, M.C. Ryder, B.G.* Incremental data flow analysis algorithms.*
Rutgers U. Comp.Sci.Dept.*DCS-TR-131.*1983.
018408 Vichnevetsky, R. Pariser, E.C.*High order numerical Sommerfeld boundary
conditions: Theory and experiments.* Rutgers U.
Comp.Sci.Dept.*DCS-TR-132.*1983.
018409 Sridharan, N.S. Bresina, J.L. Schmidt, C.F.*Evolution of a plan
generation system.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-128.*1983.
018410 Sridharan, N.S. Bresina, J.L.* Knowledge structures for modular planning
system.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-133.*1983.
018411 Sridharan, N.S. Bresina, J.L.*A mechanism for the management of partial
and indefinite descriptions.* Rutgers U.
Comp.Sci.Res.Lab.*CBM-TR-134.*1983.
018412 Keller, R.M.* Learning by reexpressing concepts for efficient
recognition.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-44.*1983.
018413 Mitchell, T.M.* Learning and problem solving (1983 Computers and Thought
Award lecture).* Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-45.*1983.
018414 Nagel, D.* Concept learning by building and applying transformations
between object descriptions.* Rutgers U.
Comp.Sci.Res.Lab.*LRP-TR-15.*1983.
018415 Judd, J.S. Letilley, C.J.* Memory and communication tradeoffs during
screen editor sessions.* Saskatchewan U. Computational Sci.Dept.*Rpt.
83-08.*1983.
018416 Goforth, D.* LEPUS: An object oriented extension of turtle geometry.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 83-09.*1983.
018417 Peachey, D.R.*An architecture for plan based computer assisted
instruction.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-11.*1983.
018418 Carbonell, J.G.*The role of user modelling in natural language interface
design.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-115.*1983.
018419 Citrini, C. Crespi-Reghizzi, S. Mandrioli, D.*Chains of deterministic
push down transducers.* Milan. Politecnico. Dipartimento di
Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-13.*1983.
018420 Marlin, C.*A methodical approach to the design of programming languages
and its application to the design of a corouting language.* Iowa U.
Comp.Sci.Dept.* Tech.rpt. 83-05.*1983.
018421 Nissen, J.C.D. Wallis, P. Wichmann, B.A.* Ada Europe guidelines for the
protability of Ada programs.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 27/83.*1983.
018422 Olken, F.* HOPT: A myopic version of the STOCHOPT automatic file
migration policy.* California U., Berkeley. Lawrence Berkeley
Lab.*LBL-15554; California U., Berkeley. Electronics Res.Lab. PROGRES
Group.*Rpt. 83.03.*1983.
018423 Pier, K.A.*A retrospective on the Dorado, a high-performance personal
computer.* Xerox. Palo Alto Res. Center.*ISL-83-01.*1983.
018424 Takagi. H.*Analysis of throughput and delay for single and multi hop
packet radio networks.* California U., L.A. Eng. &
Appl.Sci.Sch.*UCLA-ENG-8326; California U., L.A.
Comp.Sci.Dept.*CSD-830523, Ph.D. Thesis. Takagi, H.*1983.
********************************************************************** * * *
NUMERICAL ANALYSIS * * *
**********************************************************************
018425 Brent, R.P. Kung, H.T. Luk, F.T.*Some linear time algorithms for systolic
arrays.* Australian National U. Comp.Sci.Dept.*TR-CS-82-15.*1982.
018426 Brent, R.P. Luk, F.T.*A systolic array for the linear time solution of
Toeplitz systems of equations.* Australian National U.
Comp.Sci.Dept.*TR-CS-83-02.*1983.
018427 Aspvall, B. Gilbert, J.R.* Graph coloring using eigenvalue
decomposition.* Cornell U. Comp.Sci.Dept.*Tech rpt. 83-545.*1983.
018428 Brent, R.P. Luk, F.T. van Loan, V.*Computation of the generalized
singular value decomposition using mesh connected processors.* Cornell
U. Comp.Sci.Dept.*Tech rpt. 83-563.*1983.
018429 Fletcher, R.* Semi definite matrix constraints in optimization.* Dundee
U. Math.Dept.*Rpt. NA/061.*1982.
018430 Mitchell, A.R.* Curved elements.* Dundee U. Math.Dept.*Rpt.
NA/062.*1983.
018431 Brannigan, M.* Splines and the Galerkin method for solving integral
equations in scattering theory.* Georgia U. Stat. and
Comp.Sci.Dept.*Tech.rpt. 138.*1982.
018432 Brannigan, M.*A geometric characterization of H-sets.* Georgia U. Stat.
and Comp.Sci.Dept.*Tech.rpt. 139.*1983.
018433 Brannigan, M.* Consistency in best restricted discrete Chebyshev
approximation.* Georgia U. Stat. and Comp.Sci.Dept.*Tech.rpt. 140.*1983.
018434 Brannigan, M.*Criteria for adaptive approximation.* Georgia U. Stat. and
Comp.Sci.Dept.*Tech.rpt. 145.*1983.
018435 Brannigan, M.* H-sets, convex programming and constrained approximation.*
Georgia U. Stat. and Comp.Sci.Dept.* Tech.rpt. 146.*1983.
018436 Cosnard, M. Eberhard, A.*Etude d'un operateur de renormalisation.
Premiere partie: Construction de points fixes.* Grenoble. Universite
Scientifique et Medicale. Laboratoire d'Informatique et de
Mathematiques Appliquees de Grenoble.*R.R. no. 305.*1982.
018437 Cosnard, M. Eberhard, A.*Etude d'un operateur de renormalisation.
Deuxieme partie: Comportement iteratif des solutions de l'equation de
renormalisation.* Grenoble. Universite Scientifique et Medicale.
Laboratoire d'Informatique et de Mathematiques Appliquees de
Grenoble.*R.R. no. 329.*1982.
018438 Zang, T.A. Wong, Y.S. Hussaini, M.Y.* Spectral multigrid methods for
elliptic equations II.* Institute for Comp.Appl. in Sci. and Eng.
(ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt. 83-12.*1983.
018439 Tadmor, E.*The large time behavior of the scalar, genuinely nonlinear Lax
Friedrichs scheme.* Institute for Comp.Appl. in Sci. and Eng. (ICASE),
NASA Langley Res. Center, Hampton, Va.*Rpt. 83-15.*1983.
018440 Tadmor, E.* Entropy functions for symmetric systems of conservation
laws.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley
Res. Center, Hampton, Va.*Rpt. 83-16.*1983.
018441 Banks, H.T. Majda, G.*Modelling of flexible surfaces: A preliminary
study.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley
Res. Center, Hampton, Va.*Rpt. 83-19.*1983.
018442 Tadmor, E.*Numerical viscosity and the entropy condition for conservative
difference schemes.* Institute for Comp.Appl. in Sci. and Eng. (ICASE),
NASA Langley Res. Center, Hampton, Va.*Rpt. 83-20.*1983.
018443 Adams, L.*An M-step preconditioned conjugate gradient method for parallel
computation.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA
Langley Res. Center, Hampton, Va.*Rpt. 83-23.*1983.
018444 Banks, H.T. Daniel, P.L. Armstrong, E.S.*A spline based parameter and
state estimation technique for static models of elastic surfaces.*
Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res.
Center, Hampton, Va.*Rpt. 83-25.*1983.
018445 Phillips, T.N.*A preconditioned formulation of the Caucy Riemann
equations.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA
Langley Res. Center, Hampton, Va.*Rpt. 83-27.*1983.
018446 Tadmor, E.*The unconditional instability of inflow dependent boundary
conditions in difference approximations to hyperbolic systems.*
Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res.
Center, Hampton, Va.*Rpt. 82-33.*1982.
018447 Harten, A.*On a large time step high resolution scheme.* Institute for
Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton,
Va.*Rpt. 82-34.*1982.
018448 Gannon, D. van Rosendale, J.*Highly parallel multigrid solvers for
elliptic PDEs: An experimental analysis.* Institute for Comp.Appl. in
Sci. and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt.
82-36.*1982.
018449 Friedland, S. Tadmor, E.* Optimality of the Lax Wendroff condition.*
Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res.
Center, Hampton, Va.*Rpt. 82-37.*1982.
018450 van Leer, B.*Computational methods for ideal compressible flow.*
Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res.
Center, Hampton, Va.*Rpt. 83-38.*1983.
018451 Daniel, P.L.*An approximation technique for estimating discontinuous
coefficients in distributed systems.* Institute for Comp.Appl. in Sci.
and Eng. (ICASE), NASA Langley Res. Center, Hampton, Va.*Rpt.
83-40.*1983.
018452 Geer, J.F. Strikwerda, J.C.* Vertical slender jets with surface
tensions.* Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA
Langley Res. Center, Hampton, Va.*Rpt. 82-41.*1982.
018453 Tadmor, E.* Skew Selfadjoint form for systems of conservation laws.*
Institute for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res.
Center, Hampton, Va.*Rpt. 82-42.*1982.
018454 Goldberg, M. Tadmor, E.*Convenient stability criteria for difference
approximations of hyperbolic initial boundary value problems.* Institute
for Comp.Appl. in Sci. and Eng. (ICASE), NASA Langley Res. Center,
Hampton, Va.*Rpt. 83-50.*1983.
018455 Loetstedt, P.*Solving the minimal least squares problem subject to bounds
on the variables.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8215.*1982.
018456 Betsis, D.* Explicit construction of contractivity matrices.* Royal Inst.
of Tech., Stockholm. Num.Anal. 8309.*1983.
018457 Gustafson, S.-A.* Stability of functionals determined by moment
conditions.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8310.*1983.
018458 Scott, D.S.*The complexity of interpolating given data in three space
with a convex function of two variables.* Texas U.
Comp.Sci.Dept.*TR-83-018.*1983.
018459 Kagstroem, B.* Bounds and perturbation bounds for the matrix
exponential.* Umea University Info. Processing Dept.*Rpt.
UMINF-55.76.*1976.
018460 Kagstroem, B.*Numerical computation of matrix functions.* Umea University
Info. Processing Dept.*Rpt. UMINF-58.77.* 1977.
018461 Sun, J.* Semi linear difference schemes for singular perturbation
problems in one dimension.* Yale U. Comp.Sci.Dept.*Res.rpt. 216.*1982.
018462 Eisenstat, S.C.*A note on the generalized conjugate gradient method.*
Yale U. Comp.Sci.Dept.*Res.rpt. 228.* 1982.
018463 Eisenstat, S.C.*Some observations on the generalized conjugate gradient
method.* Yale U. Comp.Sci.Dept.* Res.rpt. 244.*1982.
018464 Douglas, C.C.* Multi grid algorithms with applications to elliptic
boundary value problems.* Yale U. Comp.Sci.Dept.* Res.rpt. 247.*1983.
018465 Saad, T.* Chebyshev acceleration techniques for solving nonsymmetric
eigenvalue problems.* Yale U. Comp.Sci.Dept.* Res.rpt. 255.*1982.
018466 Bank, R.E. Douglas, C.C.*Sharp estimates for multigrid rates of
convergence with general smoothing and acceleration.* Yale U.
Comp.Sci.Dept.*Res.rpt. 277.*n.d.
018467 Ascher, U. Weiss, R.* Collocation for singular perturbation problems III:
Nonlinear problems without turning points.* British Columbia U.
Comp.Sci.Dept.*Tech.rpt. 82-09.*1982.
018468 Bhatia, R. Davis, C.*A bound for the spectral variation of a unitary
operator.*No issuing agency indicated (authors' addresses: Rajendra
Bhatia - University of Bombay and University of Toronto; Chandler Davis
- University of Toronto).*n.d.
018469 Bjoerck, A. Hammarling, S.*A Schur method for the square root of a
matrix.* Linkoeping U. Math.Dept.*Rpt. LiTH-MAT-R-82-25.*1982.
018470 Delahaye, J.-P.*Theorie des transformations de suites en analyse
numerique. Applications.* Lille. Universite des sciences et techniques.*
Ph.D. Thesis. Delahaye, J.-P.* 1982.
018471 Duff, I.S. Reid, J.K.* MA27 - A set of Fortran subroutines for solving
sparse symmetric sets of linear equations.* U.K. Atomic Energy Res.
Establishment.*AERE-R 10533.* 1982.
018472 Erisman, A. Reid, J.* Partitioning, matrix modification and tearing.*n.d.
(Section 5B of an unidentified book).
018473 Gay, D.M.*A trust region approach to linear constrained optimization.*No
issuing agency indicated (author's address: Bell Laboratories/Murray
Hill, New Jersey 07974).*1983.
018474 George, A. Heath, M.T. Ng, E.*Solution of sparse underdetermined systems
of linear equations.* Oak Ridge National Lab.
Comp.Sci.Div.*ORNL/CSD-121.*1983.
018475 Grigoriadis, M.D. Hsu, T.*Numerical methods for basic solutions of
generalized flow networks.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-043.*1983.
018476 Hyman, J.M. Manteuffel, T.A.* Dynamic acceleration of nonlinear
iterations.* Los Alamos National Lab.* LA-UR-83-1201.*1983.
018477 Johnson, C. Naevert, U. Pickaeranta, J.* Finite element methods for
linear hyperbolic problems.* Chalmers U. of Tech. Math.Dept.*No.
1983-04; Goeteborg U. Math.Dept.*No. 1983-04.*1983.
018478 Kaellstroem, C.*Computing exp(A) and the integral of exp(As) ds.* Lund
Inst. of Tech. Automatic Control Div.* Rpt. 7309.*1973.
018479 Kaneko, I. Plemmons, R.J.* Minimum norm solutions to linear elastic
analysis problems.*No issuing agency indicated (authors' addresses: I.
Kaneko- Department of Industrial Engineering/University of
Wisconsin-Madison, WI 53706; R.J. Plemmons - Department of Mathematics
and Computer Science/North Carolina State University/Raleigh, N.C.
27650).*1982.
018480 Martensson, K.*New approaches to the numerical solution of optimal
control problems.* Lund Inst. of Tech. Automatic Control Div.*Rpt. 7206,
Ph.D. Thesis. Martensson, K.* 1972.
018481 More, J.J.*Recent developments in algorithms and software for trust
region methods.* Argonne Nat.Lab. Mathematics and
Comp.Sci.Div.*ANL/MCS-TM-002.*1982.
018482 Niethammer, W. de Pillis, J. Varga, R.S. Block iterative methods applied
to sparse least squares problems.*No issuing agency indicated (authors'
addresses: W. Niethammer - Institut fuer Praktische
Mathematik/Universitaet Karlsruhe/D-7500 Karlsruhe/W. Germany; J. de
Pillis - Department of Mathematics/University of California/Riverside,
CA 92321; R.S. Varga - Institute for Computational Mathematics/Kent
State University/Kent, Ohio 44242).*n.d.
018483 Nocedal, J. Overton, M.L.*Numerical methods for solving inverse
eigenvalue problems.*No issuing agency indicated (authors' address:
Courant Institute of Mathematical Sciences/New York University/New York,
N.Y. 10012).*n.d.
018484 Pham Dinh Tao* Iterative methods for computing the bound norms of
matrices.*No issuing agency indicated (author's address: Universite
Scientifique et Medicale/Laboratoire IMAG/B.P. 53 X/38041 Grenoble
cedex/France).*n.d.
018485 Plohr, B. Glimm, J. McBryan, O.*Application of tracking to
two-dimentional gas dynamics calculations.*No issuing agency indicated
(authors' address: Cournat Institute of Mathematical Sciences/ New York
University/ New York, N.Y. 10012).*n.d.
018486 Rall, L.B.*Numerical inversion of Green's matrices.* Wisconsin U.
Math.Res. Center.*MRC Tech.Sum.Rpt. 1149.* 1971.
018487 Reid, J.K.*Advances in the exploitation of sparsity.* U.K. Atomic Energy
Res. Extablishment, Harwell. Comp.Sci. and Systems Div.*CSS 138.*1983.
018488 Samejima, F.*Final report: Efficient methods of estimating the operating
characteristics of item response categories and challenge to a new model
for the multiple choice item.* Tennessee U. Psych.Dept.*1981.
018489 Samejima, F. Livingston, P.* Method of moments as the least squares
solution for fitting a polynomial.* Tennessee U. Psych.Dept.*Res.rpt.
79-02.*1979.
018490 Samejima, F. Livingston, P.S.* Method of moments as the least squares
solution for fitting polynomials.*No issuing agency indicated (authors'
addresses: Fumiko Samejima - University of Tennessee; Philip S.
Livingston - Systems & Applied Science Corporation).*n.d.
018491 Weinberger, H.F.* Optimal numerical approximation of a linear operator.*
Minnesota U. Inst. for Math. and its Applications.*IMA preprint series
no. 008.*1983.
VOL. 5, NO. 13 12/22/83
018492 van der Houwen, P.J. Sommeijer, B.P.* Stability in linear multistep
methods for pure delay equations.* Mathematisch Centrum.*NW
152/83.*1983.
018493 Riele, H.J.J.te*New very large amicable pairs.* Mathematisch Centrum.*NW
153/83.*1983.
018494 Hemker, P.W. Wesseling, P. de Zeeuw, P.M.*A portable vector code for
autonomous multigrid modules.* Mathematisch Centrum.*NW 154/83.*1983.
018495 Riele, H.J.J. te Schroevers, Ph.*A comparative survey of numerical
methods for the linear generalized Abel integration equation.*
Mathematisch Centrum.*NW 155/83.* 1983.
018496 de Vries, H.B.*A comparitive study of ADI splitting methods for parabolic
equations in two space dimensions.* Mathematisch Centrum.*NW
156/83.*1983.
018497 Vitanyi, P.M.B.*On the simulation of many storage heads by a single one.*
Mathematisch Centrum.*IW 226/83.*1983.
018498 Bergstra, J.A. Klop, J.W.*A proof rule for restoring logic circuits.*
Mathematisch Centrum.*IW 227/83.*1983.
018499 Vitanyi, P.M.B.*On the simulation of many storage heads by one.*
Mathematisch Centrum.*IW 228/83.*1983.
018500 Lenstra, A.K.* Factoring multivariate integral polynomials.* Mathematisch
Centrum.*IW 229/83.*1983.
018501 Lenstra, A.K.* Factoring multivariate integral polynomials, II.*
Mathematisch Centrum.*IW 230/83.*1983.
018502 Loetstedt, P.* Perturbation bounds for the linear least squares problem
subject to linear inequality constraints.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8205.*1982.
018503 Eriksson, G.* Nonlinear inverse problems.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8209.*1982.
018504 Schreiber, R.*On the systolic arrays of Brent, Luk, and van Loan for the
symmetric eigenvalue and singular value problems.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8311.*1983.
018505 Schreiber, R. Tang, W.-P.*On systolic arrays for updating the Cholesky
factorization.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8313.* 1983.
018506 Tiden, E. Lisper, B. Schreiber, R.* Systolic arrays.* Royal Inst. of
Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8315.*1983.
050001 Zick, A.A. Homsy, G.M.* Numerical simulation of complex non Newtonian
flows using Oldroyd type constitutive equations. Part 1: Flow through
periodically constricted tubes.* Stanford U. Center for Large Scale
Scientific Computation. CLaSSiC Project.*Manuscript ClaSSiC-83-01.*
1983.
050002 Zick, A.A. Homsy, G.M.* Numerical simulation of complex non Newtonian
flows using Oldroyd type constitutive equations. Part 2: Flow through a
sudden concentration.* Stanford U. Center for Large Scale Scientific
Computation. CLaSSiC Project.*Manuscript ClaSSiC-83-02.* 1983.
050003 Celoni, J.R., S.J. Hennessy, J.L.* Streams in a single assignment
language.* Stanford U. Center for Large Scale Scientific Computation.
CLaSSiC Project.*Manuscript ClaSSiC-83-03.*1983.
051001 Celoni, J.R., S.J. Hennessy, J.L.* SAL: A single assignment language for
parallel algorithms.* Stanford U. Center for Large Scale Scientific
Computation. CLaSSiC Project.* Rpt. ClaSSiC-83-01.*1983.
024969 Maszkowski, B. Manna, Z.* Reasoning in interval temporal logic.* Stanford
U. Comp.Sci.Dept.*STAN-CS-83-969.*1983. 18p.
024970 Maszkowski, B.C.* Reasoning about digital computers.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-970, Ph.D. Thesis. Moszkowski, B.C.*1983.
135p.
024972 Karlin, A.R. Trickey, H.W. Ullman, J.D.*Experience with a regular
expression compiler.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-972.*1983.
23p.
024973 Cheriton, D.R. Zwaenepoel, W.*The distributed V kernel and its
performance for diskless workstations.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-973.*1983. 12p.
024974 Hobby, J. Guoan, G.*A chinese Meta-font.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-974.*1983. 22p.
024975 Rowe, N.C.* Rule based statistical calculations on a database abstract.*
Stanford U. Comp.Sci.Dept.* STAN-CS-83-975, Ph.D. Thesis. Rowe,
N.C.*1983. 151p.
024976 Beeri, C. Vardi, M.*On acyclic database decompositions.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-976.*1983. 9p.
024977 Liang, F.M.*Word hy-phen-a-tion by com-put-er.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-977, Ph.D. Thesis. Liang, F.M.* 1983. 85p.
024978 Knuth, D.E.*Lessons learned from METAFONT.* Stanford U.
Comp.Sci.Dept.*STAN-CS-83-978.*1983. 22p.
024979 Graham, M.H. Mendelzon, A.O. Vardi, M.Y.*Notions of dependence
satisfaction.* Stanford U. Comp.Sci.Dept.* STAN-CS-83-979.*1983. 35p.
018507 Abrahamson, P.G.*A nested decomposition approach for solving staircase
linear programs.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
83-04, Ph.D. Thesis. Abrahamson, P.G.*1983. 89p.
018508 McCormick, S.T.*A combinatorial approach to some sparse matrix problems.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-05, Ph.D.
Thesis. McCormick, S.T.*1983. 69p.
018509 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.* Documentation for
FDCALC and FDCORE.* Stanford U. O.R. Dept. Systems Optimization
Lab.*SOL 83-06.*1983. 21p.
018510 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for
SOL/QPSOL: A Fortran package for quadratec programming.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 83-07.*1983. 36p.
018511 Broadie, M.N.*Computational experience with the octahedral algorithm and
related results.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
83-08.*1983. 28p.
018512 Braodie, M.N.* Octasolv user's guide.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 83-09.*1983. 26p.
018513 Rosenberg, A.N.*Numerical solution of systems of simultaneous polynomial
equations.* Stanford U. O.R. Dept. Systems Optimization Lab.*SOL
83-10.*1983. 37p.
018514 Eaves, B.C.* Subdivisions from primal and dual cones and polytopes.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-11.*1983. 14p.
018515 Gill, P.E. Murray, W. Saunders, M.A. Wright, M.H.*User's guide for
SOL/NPSOL: A Fortran package for nonlinear programming.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 83-12.*1983. 35p.
018516 Broadie, M.N. Cottle, R.W.*A note on triangulating the 5-cube.* Stanford
U. O.R. Dept. Systems Optimization Lab.*SOL 83-13.*1983. 12p.
018517 Broadie, M.N.* Subdivisions and antiprisms for PL homotopy algorithms.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-14, Ph.D.
Thesis. Broadie, M.N.*1983. 123p.
018519 Anstreicher, K.M.*Generation of feasible descent directions in continuous
time linear programming.* Stanford U. O.R. Dept. Systems Optimization
Lab.*SOL 83-18, Ph.D. Thesis. Anstreicher, K.M.*1983. 101p.
018520 Arnold, M. Cmelik, B. Fitzpatrick, D. Foderaro, J. Homachi, G. Mayo, R.
Ousterhout, J. Scott, W.S. Terman, C.*1983 VLSI tools: selected works by
the original artists. Robert N. Mayo, John K. Ousterhout, and Walter S.
Scott, editors.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/115.*1983. Contents: Caesar, by John Ousterhout; Cifplot, by Dan
Fitzpatrick; Crystal, by John Ousterhout; Egntott, by Bob Cmelik; Esim,
by Chris Terman (MIT); Lyra, by Michael Arnaol; Mextra, by Dan
Fitzpatrick, Peg, by Gordan Hamachi; Quilt, by Robert Mayo; Slang, by
John Foderaro; Tpack, by Robert Mayo; Tpla, by Robert Mayo; and others.
018521 Paz, A.*A simplified version of H.W. Lenstra's integer programming
algorithm and some applications.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/116.*1983.
018522 Karp, R.M. Luby, M.G.*A new Monte Carlo method for estimating the failure
probability of an n-component system.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/117.*1983.
018523 Barsky, B.A.*A study of the parametric uniform B spline curve and surface
representations.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/118.*1983.
018524 Ousterhout, J.K.* Crystal: A timing analyzer for nMOS VLSI circuits.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/119.*1983.
018525 Smith, A.J.* Disk cache - Miss ratio analysis and design considerations.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/120.*1983.
018526 Lee, J.K.F. Smith, A.J.*Analysis of branch prediction strategies and
branch target buffer design.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/121.*1983.
018527 Ponder, C.*"...but will RISC run LISP??" (a feasibility study).*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/122.*1983.
018526 Larus, J.R.*On the performance of courier remote procedure calls under
4.1c BSD.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/123.*1983.
018529 Hagmann, R.B.* Performance analysis of several backend database
architectures.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/124,
Ph.D. Thesis. Hagmann, R.B.* 1983.
018530 Blau, R.* Paging on an object oriented personal computer for smalltalk.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/125.*1983.
018531 Demmel, J.W. Krueckeberg, F.*An interval algorithm for solving systems of
linear equations to prespecified accuracy.* California U., Berkeley.
Comp.Sci.Div.* UCB/CSD 83/126.*1983.
018532 Demmel, J.W.*The condition number of similarities that diagonalize
matrices.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/127.*1983.
018533 Demmel, J.W.*Effects of underflow on solving linear systems.* California
U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/128.*1983.
018534 Wilhelm, R.* Inverse currying transformation on attribute grammars.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/129.*1983.
018535 Fitzpatrick, D.T.*Exploiting structure in the analysis of integrated
circuit artwork.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/130.*1983.
018536 Ousterhout, J.K.*The user interface and implementation of Caesar.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/131.*1983.
018537 Powell, M.L. Miller, B.P.* Process migration in DEMOS/MP.* California U.,
Berkeley. Comp.Sci.Div.*UCB/CSD 83/132.* 1983.
018538 Powell, M.L. Presotto, D.L.* PUBLISHING: A reliable broadcast
communication mechanism.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/133.*1983.
018539 Powell, M.L. Linton, M.A.* Database support for programming
environments.* California U., Berkeley. Comp.Sci.Div.* UCB/CSD
83/134.*1983.
018540 Peek, J.B.*The VLSI circuitry of RISC I.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/135.*1983.
018541 Resende, M.G.C.*A computer program for reliability evaluation of
large-scale polygog to chain reductions.* California U., Berkeley. O.R.
Center.*ORC 83-10.*1983.
018542 Gale, D. Sotomayor, M.*Some remarks on the stable matching problem.*
California U., Berkeley. O.R. Center.*ORC 83-12.*1983.
018543 Barlow, R.E.*A Bayesian explanation of an apparent failure rate paradox.*
California U., Berkeley. O.R. Center.*ORC 83-13.*1983.
018544 Feo, T.A.*Program for the analysis of fault trees.* California U.,
Berkeley. O.R. Center.*ORC 83-14.*1983.
018545 Ramakrishnan, I.V.*On mapping cube graphs onto linear systolic arrays.*
Texas, U. Comp.Sci.Dept.*TR-219.*1983.
018546 Varman, P.J. Ramakrishnan, I.V.* Robust systolic algorithms for
relational database operations.* Texas, U. Comp.Sci.Dept.*TR-220.*1983.
018547 Varman, P.J. Ramakrishnan, I.V. Fussell, D.* Robust matrix multiplication
algorithms for VLSI.* Texas, U. Comp.Sci.Dept.*TR-221.*1983.
018548 Silberschatz, A.*On the synchronization mechanism of the ADA language.*
Texas, U. Comp.Sci.Dept.*TR-222.*1983.
018549 Gouda, M.G.*An example for constructing communicating machines by
stepwise refinement.* Texas, U. Comp.Sci.Dept.*TR-223.*1983.
018550 Silberschatz, A.*A robust distributed concurrency control scheme.* Texas,
U. Comp.Sci.Dept.*TR-224.*1983.
018551 Scott, D.S.*Computing a few eigenvalues and eigenvectors of a symmetric
band matrix.* Texas, U. Comp.Sci.Dept.* TR-225.*1983.
018552 Buckley, G.N. Silberschatz, A.*Extending graph based locking protocols
with edge locks.* Texas, U. Comp.Sci.Dept.*TR-226.*1983.
018553 Gouda, M.G. Shen, H.S.*Specification, programming and verification of CSP
by channel observation sequences.* Texas, U.
Comp.Sci.Dept.*TR-227.*1983.
018554 Ahuja, M.A.* Consistency management in distributed data bases: A
selective analysis.* Texas, U. Comp.Sci.Dept.* TR-231.*1983.
018555 Ibarra, O.H. Rosier, L.E.*On simple programs with primitive conditional
statements.* Texas, U. Comp.Sci.Dept.*TR-232.* 1983.
018556 Bartels, R.H. Beatty, J.C. Barsky, B.A.*An introduction to the use of
splines in computer graphics.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-83-09.*1983.
018557 Mavaddat, F.* High level approaches to VLSI design.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-25.*1983.
018558 Choffrut, C. Culik, K. II*On extendibility of unavoidable sets.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-83-26.* 1983.
018559 Bartels, R.H.* Splines in interactive computer graphics.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-83-27.*1983.
018560 Mavaddat, F. Cutcliffe, N. Ellis, R.* Graphics in spritesland.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-83-30.*1983.
018561 Craig, G.L. Goodman, J.R. Katz, R.H. Pleszkun, A.R. Ramachandran, K.
Sayah, J. Smith, J.E.* PIPE: A high performance VLSI processor
implementation.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 513.*1983.
018562 Bent, S.W.*A note on enumerating t-ary trees.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 514.*1983.
018563 Desautels, E.J.* Access problems with computer based services.* Wisconsin
U. Comp.Sci.Dept.*Tech.rpt. 516.* 1983.
018564 Carey, M.J.* Multiple versions and the performance of optimistic
concurrency control.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 517.*1983.
018565 Uhr, L.*Feasible multi computer architectures, given 3-dimensional
stacked wafers.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 518.*1983.
018566 Savage, J.E.*Bounds on the performance on multilective VLSI algorithms.*
Brown U. Comp.Sci.Dept.*Tech.rpt. CS-82-10.* 1982.
018570 Ostler, F.L.*An SMD disk dontroller for the LILITH computer.*
Eidgenoessische Technische Hochschule Zurich. Institut fuer
Informatik.*Bericht 52.*1983.
018571 Zehnder, C.A. (Ed.)* Database techniques for professional workstations.*
Eidgenoessische Technische Hochschule Zurich. Institut fuer
Informatik.*Bericht 55.*1983.
018572 Kim, W.* Auditor: A framework for high availability of DB/DC systems.*
IBM Watson Res. Center.*RJ 3512.*1982.
018573 Hu, T.C. Shing, M.T.*A decomposition algorithm for multi terminal network
flows.* California U., Santa Barbara. Comp.Sci.Dept.*TRCS83-01.*1983.
018574 Narayanan, A.*Ascribing mental predicated to computers.* Exeter U.
Comp.Sci.Dept.*Res.rpt. R-102.*1981.
018575 Campbell, J.A. Green, H.S.* GO as a subject for game playing in
artificial intelligence, by J.A. Campbell; Go and artificial
intelligence, by H.S. Green.* Exeter U. Comp.Sci.Dept.*Res.rpt.
R-108.*1982.
018576 Ford, R. Miller, K.*An abstract data type development and implementation
methodology.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 83-07.*1983.
018577 Culik, K.*On metapaths in metagraphs.* Wayne State U.
Comp.Sci.Dept.*CSC-83-005.*1983.
018578 Sethi, I.K.*A general scheme for discontinuity detection.* Wayne State U.
Comp.Sci.Dept.*CSC-83-006.*1983.
VOL. 6, NO. 1 02/01/84
018579 McKeown, D.M. Jr.* Concept maps.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-117.*1983.
018580 Appel, A.W.*An efficient program for many body simulations (or, Cray
performance from a VAX).* Carnegie Mellon U. CS Dept.
*CMU-CS-83-118.*1983.
018591 Cornelius, N. Kanade, T.*Adapting optical flow to measure object moon in
reflectance and x-ray image sequences.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-119.*1983.
018592 Carbonell, J.G. Larkin, J.H. Reif, F.*Towards a general scientific
reasoning engine.* Carnegie Mellon U. CS Dept. *CMU-CS-83-120.*1983.
018593 Bentley, J.L. McGeoch, C.C.* Worst case analyses of self organizing
sequential search heuristics.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-121.*1983.
018594 Berliner, H. Campbell, M.*Using chunking to solve chess pawn endgames.*
Carnegie Mellon U. CS Dept. * CMU-CS-83-122.*1983.
018595 Daniels, D. Spector, A.Z.*An algorithm for replicated directories.*
Carnegie Mellon U. CS Dept. * CMU-CS-83-123.*1983.
018596 Doyle, J.*Admissible state semantics for representational systems.*
Carnegie Mellon U. CS Dept. * CMU-CS-83-124.*1983.
018597 Doyle, J.*Some theories of reasoned assumptions: An essay in rational
psychology.* Carnegie Mellon U. CS Dept. *CMU-CS-83-125.*1983.
018598 Doyle, J.*The ins and outs of reason maintenance.* Carnegie Mellon U. CS
Dept. *CMU-CS-83-126.*1983.
018599 Doyle, J.*A society of mind: Multiple perspectives, reasoned assumptions,
and virtual copies.* Carnegie Mellon U. CS Dept. *CMU-CS-83-127.*1983.
018600 York, G. Siewiorek, D. Segall, Z.* Software voting in asynchronous NMR
computer structures.* Carnegie Mellon U. CS Dept. *CMU-CS-83-128.*1983.
018601 Tsao, M.M.*Trend analysis and fault prediction.* Carnegie Mellon U. CS
Dept. *CMU-CS-83-130, Ph.D. Thesis. Tsao, M.M.*1983.
018602 Shafer, S.A.* Shadow geometry and occluding contours of generalized
cylinders.* Carnegie Mellon U. CS Dept. *CMU-CS-83-131, Ph.D. Thesis.
Shafer, S.A.* 1983.
018603 Gosling, J.* Algebraic constraints.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-132, Ph.D. Thesis. Gosling, J.* 1983.
018604 Walker, H.*The control store and register file design of the programmable
systolic chip.* Carnegie Mellon U. CS Dept. *CMU-CS-83-133.*1983.
018605 Brookes, S.D.*A semantics and proof system for communicating processes.*
Carnegie Mellon U. CS Dept. *CMU-CS-83-134.*1983.
018606 Carbonell, J.G. Michalski, R.S. Mitchell, T.M.* Machine learning Part I:
A historical and methodological analysis.* Carnegie Mellon U. CS Dept.
* CMU-CS-83-135.*1983.
018607 McKeown, D.M. Jr.* MAPS: The organization of a spatial database system
using imagery, terrain, and map data.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-136.*1983.
018608 Bruegge, B.*The CMU computer system qualifier 1976-1982.* Carnegie Mellon
U. CS Dept. *CMU-CS-83-137.*1983.
018609 Kannan, R.*Solving systems of linear equations over polynomials.*
Carnegie Mellon U. CS Dept. * CMU-CS-83-165.*1983.
018610 Kannan, R. Lipton, R.J.* Polynomial time algorithm for the orbit
problem.* Carnegie Mellon U. CS Dept. * CMU-CS-83-168.*1983.
018611 Di Pillo, G. Grippo, L. Lampariello, F.*A Newton type computing technique
for optimal control problems.* Consiglio Nazionale delle Ricerche.
Istituto di Analisi dei Sistemi ed Informatica.*R. 33.*1982.
018612 Bertolazzi, P. Pirozzi, M.* Parallel algorithms for different classes of
dynamic programming problems.* Consiglio Nazionale delle Ricerche.
Istituto di Analisi dei Sistemi ed Informatica.*R. 38.*1982.
018613 Balsamini, A. Rafanelli, M. Ricci, F.L.* GRASS: A logical model for
statistical databases.* Consiglio Nazionale delle Ricerche. Istituto di
Analisi dei Sistemi ed Informatica.*R. 39.*1982.
018614 Blazewicz, J. Ecker, K.*A linear time algorithm for restricted bin
packing and scheduling problems.* Consiglio Nazionale delle Ricerche.
Istituto di Analisi dei Sistemi ed Informatica.*R. 40.*1982.
018615 Ausiello, G. D'Atra, A. Moscarini, M.* Minimal coverings of acyclic
database schemata.* Consiglio Nazionale delle Ricerche. Istituto di
Analisi dei Sistemi ed Informatica.* R. 41.*1982.
018616 De Leone, R. Gaudioso, M. Grippo, L.* Line search methods without
derivatives.* Consiglio Nazionale delle Ricerche. Istituto di Analisi
dei Sistemi ed Informatica.*R. 46.* 1982.
018617 Lucidi, S.*A Newton type algorithm for a class of distributed parameter
optimal control problems.* Consiglio Nazionale delle Ricerche. Istituto
di Analisi dei Sistemi ed Informatica.*R. 47.*1982.
018618 Di Pillo, G. Grippo, L.*A continuously differentiable exact penalty
function for nonlinear programming problems with inequality
constraints.* Consiglio Nazionale delle Ricerche. Istituto di Analisi
dei Sistemi ed Informatica.* R. 48.*1982.
018619 Miola, A.*A unified view of approximate rational arithmetics and rational
interpolation.* Consiglio Nazionale delle Ricerche. Istituto di Analisi
dei Sistemi ed Informatica.*R. 49.*1982.
018620 Blazewicz, J. Bovet, D.P. Gambosi, G.* Deadlock resistant flow control
procedures for store-and-forward networks.* Consiglio Nazionale delle
Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R. 50.*1982.
018621 Cioni, G. Kreczmar, A.*Programmed deallocation without dangling
reference.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei
Sistemi ed Informatica.*R. 51.* 1982.
018622 Labella, A. Pettorossi, A.*Towards a categorical understanding of
parallelism.* Consiglio Nazionale delle Ricerche. Istituto di Analisi
dei Sistemi ed Informatica.* R. 54.*1983.
018623 Atzeni, P. Carboni, E.* INCOD (a system for interactive conceptual
design) revisited after the implementation of a prototype.* Consiglio
Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed
Informatica.*R. 55.* 1983.
018624 Miola, A.* Algebraic approach to p-adic conversion of rational numbers.*
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed
Informatica.*R. 56.* 1983.
018625 Lucertini, M. Paletta, G.*A class of network design problems with
multiple demand: Model formulation and an algorithmic approach.*
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed
Informatica.* R. 57.*1983.
018626 Di Pillo, G. Grippo, L. Lampariello, F.*A class of structured quasi
Newton algorithms for optimal control problems.* Consiglio Nazionale
delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R.
60.*1983.
018627 Germani, A. Piccioni, M.* Finite dimensional approximations of stochastic
bilinear differential equations in Hilbert spaces.* Consiglio Nazionale
delle Ricerche. Istituto di Analisi dei Sistemi ed Informatica.*R.
61.*1983.
018628 Rafanelli, M. Ricci, F.L.*A data definition language for a statistical
data base.* Consiglio Nazionale delle Ricerche. Istituto di Analisi dei
Sistemi ed Informatica.* R. 62.*1983.
018629 Mascari, G. Miola, A.*Computations on numerical and symbolic expressions:
A semantic analysis.* Consiglio Nazionale delle Ricerche. Istituto di
Analisi dei Sistemi ed Informatica.*R. 65.*1983.
018630 Miola, A.*Design specifications for manipulation of sums and series.*
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed
Informatica.*R. 66.*1983.
018631 Labella, A. Pettorossi, A.*Categories for handshaking communications.*
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed
Informatica.*R. 67.* 1983.
018632 Ceri, S. Crespi-Reghizzi, S.* Relational data bases in the design of
program construction systems.* Milan. Politecnico. Dipartimento di
Elettronica. Lab. di Calcolatori.*Rapporto interno n. 83-08.*1983.
018633 Ceri, S. Gottlob, G. Pelagatti. G.* Joining fragmented relations in
distributed databases.* Milan. Politecnico. Dipartimento di
Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-09.*1983.
018634 Citrini, C. Crespi-Reghizzi, S. Mandrioli, D.* Chains of deterministic
push down transducers.* Milan. Politecnico. Dipartimento di
Elettronica. Lab. di Calcolatori.* Rapporto interno n. 83-13.*1983.
018635 Dembinski, P.* Microprogram transformations.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS Rpt. No. 488.*1982.
018636 Novotny, M.* Sequences of information systems.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 489.*1982.
018637 Bakowski, P.*A language for negative control design.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 490.*1982.
018638 Miadowicz, Z.B.* Time varying automata: A survey.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 491.*1982.
018639 Baczko, A.* Simulation controlled data transmission network.* Polish
Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No. 493.*1983.
018640 Jankowski. A. Rauszer, C.*On logical foundation approach to users' domain
restriction in data bases. I.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 494.*1983.
018641 Lipski. W.*An NP-complete geometric problem related to three layer
channel routing.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS Rpt. No. 495.*1983.
018642 Pawlak, Z.* Rough probability and partial observability.* Polish Academy
of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 496.*1983.
018643 Chmiel, K.* Cycles in the SC image of a nondeterministic finite
automata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt.
No. 498.*1983.
018644 Blikle, A. Tarlecki, A.* Naive denotational semantics.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 500.*1983.
018645 Subieta, K.* High-level navigational facilities for network and
relational databases.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 501.*1983.
018646 Orlowska, E.* Representation of vague information.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 503.*1983.
018647 Marek, W.*On the semantics of the relational model of data base. I.*
Polish Academy of Sciences. Inst. of Comp.Sci.* ICS PAS Rpt. No.
505.*1983.
018648 Pawlak, Z.* Rough classification.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS Rpt. No. 506.*1983.
018649 Francis, A.*Experimental implementation of partitioned statistical data
bases.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
507.*1983.
024980 Knuth, D.E.*The WEB system of structured documentation.* Stanford U. CS
Dept. *STAN-CS-83-980.*1983 (version 2.3, September 1983). 206p.
024981 Knuth, D.E.* Literate programming.* Stanford U. CS Dept.
*STAN-CS-83-981. 15p.
024982 Greene, D.H.* Labelled formal languages and their uses.* Stanford U. CS
Dept. *STAN-CS-83-982, Ph.D. Thesis. Greene, D.H.*1983. 148p.
024983 Ullman, J.D.*A communication-time tradeoff.* Stanford U. CS Dept.
*STAN-CS-83-983.*1983. 11p.
024984 Brown, H. Tong, C. Foyster, G.* Palladio: An exploratory environment for
circuit design.* Stanford U. CS Dept. *STAN-CS-83-984, Stanford U. CS
Dept. Heuristic Programming Project.*HPP-83-031.*1983. 47p.
024985 Samuel, A.L.* First grade TEX: A beginner's TEX manual.* Stanford U. CS
Dept. *STAN-CS-83-985.*1983. 34p.
024986 Cohen, P.R.* Heuristic reasoning about uncertainty: An artificial
intelligence approach.* Stanford U. CS Dept. *STAN-CS-83-986, Ph.D.
Thesis. Cohen, P.R.* 1983. 190p.
024988 Mairson, H.G.*The program complexity of searching a table.* Stanford U.
CS Dept. *STAN-CS-83-988, Ph.D. Thesis. Mairson, H.G.*1983. 75p.
018650 Carey, M.J.* Granularity hierarchies in concurrency control.* California
U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL M83/01.*1983.
018651 Woodfill, J. Stonebraker, M.*An implementation of hypothetical
relations.* California U., Berkeley. Electronics Res.Lab.*Memo No.
UCB/ERL M83/02.*1983.
018652 Stonebraker, M. Rubenstein, B. Guttman, A.*Application of abstract data
types and abstract indices to CAD data bases.* California U., Berkeley.
Electronics Res.Lab.* Memo No. UCB/ERL M83/03.*1983.
018653 Agrawal, R. Carey, M. DeWitt, D.* Deadlock detection is cheap.*
California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL
M83/05.*1983.
018654 Carey, M.J.*An abstract model of database concurrency control
algorithms.* California U., Berkeley. Electronics Res.Lab.*Memo No.
UCB/ERL M83/06.*1983.
018655 Youssefi, K.A.*A physical design tool for relational databases.*
California U., Berkeley. Electronics Res.Lab.* Memo No. UCB/ERL
M83/09.*1983.
018656 Carey, M.J.*Modeling and evaluation of database concurrency control
algorithms.* California U., Berkeley. Electronics Res.Lab.*Memo No.
UCB/ERL M83/56.*1983.
018657 Guttman, A. Stonebraker, M.*R-trees: A dynamic index structure for
spatial searching.* California U., Berkeley. Electronics Res.Lab.*Memo
No. UCB/ERL M83/64.* 1983.
018658 Lewandowski, J.L.* SS/TDMA time slot assignment with generalized
switching modes.* Illinois U. CS Dept. * UIUCDCS-R-83-1112, Ph.D.
Thesis. Lewandowski, J.L.*1983.
018659 Gallivan, K.A.*An algorithm for the detection and integration of highly
oscillatory ordinary differential equations using a generalized unified
modified divided difference representation.* Illinois U. CS Dept. *
UIUCDCS-R-83-1121, Ph.D. Thesis. Gallivan, K.A.*1983.
018660 Lee, K.Y.* Interconnection networks and compiler algorithms for
multiprocessors.* Illinois U. CS Dept. * UIUCDCS-R-83-1125, Ph.D.
Thesis. Lee, K.Y.*1983.
018661 Vu, T.V.*Numerical methods for smooth solutions of ordinary differential
equations.* Illinois U. CS Dept. * UIUCDCS-R-83-1130, Ph.D. Thesis. Vu,
T.V.*1983.
018662 Shilling, J.*A comparison of the Nordsieck and modifies divided
difference storage methods in the computer solution of odes.* Illinois
U. CS Dept. * UIUCDCS-R-83-1131.*1983.
018663 Boulanger, A.G.*The expert system PLANT/cd: A case study in applying the
general purpose inference system ADVISE to predicting black cutworm
damage in corn.* Illinois U. CS Dept. *UIUCDCS-R-83-1134.*1983.
018664 Esakov, J.*Multi-level design automation supervisor.* Illinois U. CS
Dept. *UIUCDCS-R-83-1137.*1983.
018665 Beckman-Davies, C.S.*Improving parallelism in Linpack.* Illinois U. CS
Dept. *UIUCDCS-R-83-1138.*1983.
018666 Furchtgott, D.G. Meyer, J.F.* Performability evaluation of computing
systems using reward models.* Michigan U. Computing
Res.Lab.*CRL-TR-27-83.*1983.
018667 Makrucki, B.A. Mudge, T.N.*A queueing model of delta networks.* Michigan
U. Computing Res.Lab.*CRL-TR-26-83.* 1983.
018668 Meyer, J.F.* Performability modeling of distributed real time systems.*
Michigan U. Computing Res.Lab.* CRL-TR-28-83.*1983.
018669 Buzzard, G.D. Mudge, T.N.* Object based computer systems and the ADA
programming language.* Michigan U. Computing
Res.Lab.*CRL-TR-29-83.*1983.
018670 Diamond, M.D.*The graph labeling model and its application to the problem
of edge linking.* Michigan U. Computing Res.Lab.*CRL-TR-30-83.*1983.
018671 Aref, M.*Automated concept discovery in data structure applications.*
Saskatchewan U. Computational Sci.Dept.* Rpt. 83-10.*1983.
018672 Grassman, W.K.*Solving queueing equations using probability theory.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 83-12.*1983.
018673 Harms, D.D. Colbourn, C.J.*On bounds for the reliability of a network.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 83-13.*1983.
018674 Colbourn, C.J. Proskurowski, A.* Concurrent transmissions in broadcast
networks.* Saskatchewan U. Computational Sci.Dept.*Rpt. 83-14.*1983.
018675 Kwan, C.Y.K. Sorenson, P.G.*A high level user interface prototype for
office information systems.* Saskatchewan U. Computational
Sci.Dept.*Rpt. 83-15.*1983.
018676 Mackay, S.A. Booth, K.S.*Techniques for frame buffer animation.* Waterloo
U. CS Dept. *CS-82-43.*1982.
018677 Ottmann, T. Soisalon-Soininen,E. Wood, D.*On the definition and
computation of rectilinear convex hulls.* Waterloo U. CS Dept.
*CS-83-07.*1983 (revised).
018678 Wood, D.*the contour problem for rectilinear polygons.* Waterloo U. CS
Dept. *CS-83-20.*1983.
018679 Johnson, J.H.*Formal models for string similarity.* Waterloo U. CS Dept.
*CS-83-32, Ph.D. Thesis. Johnson, J.H.*1983.
018680 van Emden, M.H. Lloyd, J.W.*A logical reconstruction of Prolog II.*
Waterloo U. CS Dept. *CS-83-35.*1983.
018681 Andreae, J.H.* Man machine studies: progress report UC-DSE/22 (1983) to
the Defense Scientific Establishment. Editor: J.H. Andreae.* Canterbury
U., Christchurch, N.Z. Electrical and Electronic Eng.Dept.*1983.
018682 Dantzig, G.B. Hoffman, A.J. Hu, T.C.*Triangulations (Tillings) and
certain block triangular matrices.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 83-17.*1983. 24p.
018683 Gevarter, W.B.*An overview of artificial intelligence and robotics.
Volume 1 - Artificial intelligence, Part A - The core ingredients.*
N.A.S.A.*NASA Tech.Memo. 85836.* 1983.
018684 Gevarter, W.B.*An overview of artificial intelligence and robotics.
Volume II: Robotics.* U.S. National Bureau of
Standards.*PB82-204439.*1982.
018685 Johnson, R.W.*Axiomatic characterization of a family of information
measures that contains the directed divergences.* U.S. Naval
Res.Lab.*NRL Memo.Rpt. 3646.* 1977.
018686 Knuth, D.E.*A test file for TEX.* Stanford U.*1983 (Version 0.999, July
1983). 139p.
018687 Knuth, D.E.* TEX82.* Stanford U.*1983 (Version 0.999, July 1983). 513p.
018688 Knuth, D.E.* TEXWARE.* Stanford U.*1983 (Version 2, July 1983). 144p.
018689 Symm, G.T. Wichmann, B.A. Kok, J. Winter, D.T.*Guidelines for the design
of large modular scientific libaries in ADA.* Mathematisch Centrum.*NN
31/83.*1983.
VOL. 6, NO. 2 03/01/84
018690 Hinrichs, K. Nievergelt, J.*The grid file: A data structure designed to
support proximity queries on spatial objects.* Eidgenoessische
Technische Hochschule Zuerich. Institut fuer Informatik.*Bericht
54.*1983.
018691 Gutknecht, J.* System programming in Modula-2: Mouse and bitmap display.*
Eidgenoessische Technische Hochschule Zuerich. Institut fuer
Informatik.*Bericht 56.*1983.
018692 Zehnder, C.A. (Ed.)* Database techniques for professional workstations.*
Eidgenoessische Technische Hochschule Zuerich. Institut fuer
Informatik.*Bericht 55.*1983.
018693 Carter, W.C.* Architectural considerations for detecting run time errors
in programs.* IBM Watson Res. Center.*RC 09976.*1983.
018694 Tang, D.T. Chen, C.L.*Efficient exhaustive pattern generation for logic
testing.* IBM Watson Res. Center.*RC 10064.*1983.
018695 Liniger, W.*A fast direct Poisson solver for general regions.* IBM Watson
Res. Center.*RC 10067.*1983.
018696 Goldberg, M.K. Burstein, M.* Heuristic improvement technique for
bisection of VLSI networks.* IBM Watson Res. Center.*RC 10069.*1983.
018697 Pickover, C.A.*The use of a vector graphics system in the presentation of
alternate representations of synthetic speech data.* IBM Watson Res.
Center.*RC 10084.*1983.
018698 Bloom, S.L. Wagner, E.G.* Many sorted theories and their algebras with
some applications to data types.* IBM Watson Res. Center.*RC
10089.*1983.
018699 Francez, N. Kozen, D.* Generalized fair termination.* IBM Watson Res.
Center.*RC 10092.*1983.
018700 Dahmen, W. Micchelli, C.A.*Some results on box splines.* IBM Watson Res.
Center.*RC 10094.*1983.
018701 Buerger, W.F.*A front end development tool for the PC.* IBM Watson Res.
Center.*RC 10098.*1983.
018702 Carroll, J.M. Carrithers, C.*Blocking user error states in a training
system.* IBM Watson Res. Center.*RC 10100.* 1983.
018703 Nadas, A.* Parametric empirical Bayes estimation of probabilities in a
Markovian linguistic component of the IBM speech recognition system.*
IBM Watson Res. Center.* RC 10102.*1983.
018704 Tolaba, J.H.* On line surveys of user and employee satisfaction.* IBM
Watson Res. Center.*RC 10106.*1983.
018705 Pickover, C.A.* Synthetic singing voices: A speech synthesizer generates
an excerpt from Handel's Messiah.* IBM Watson Res. Center.*RC
10118.*1983.
018706 Marazas, G.A. Blum, A.M. MacNair, E.A.*A research queueing package (
RESQ) model of a transaction processing system with DASD cache.* IBM
Watson Res. Center.*RC 10123.*1983.
018707 Kelley, J.F.*Validating an empirical methodology for writing user
friendly natural language computer applications.* IBM Watson Res.
Center.*RC 10127.*1983.
018708 Sheridan, P.B. Haibt, L.M. Nelson, R.A.*Casting Boolean Logic arrays into
petri nets.* IBM Watson Res. Center.*RC 10130.*1983.
018709 Shasha, D.E. Pnueli, A. Ewald, W.* Temporal verification of carrier sense
local area network protocols.* IBM Watson Res. Center.*RC 10132.*1983.
018710 de Souza e Silva, E. Lavenberg, S.S. Muntz, R.R.*A perspective on
iterative methods for the approximate analysis of closed queueing
networks.* IBM Watson Res. Center.*RC 10141.*1983.
018711 Mohan, C. Lindsay, B.*Efficient commit protocols for the tree of
processes model of distributed transactions.* IBM Watson Res. Center.*RJ
3881.*1983.
018712 Mohan, C. Fussell, D. Kedem, Z.* Lock conversion in non two phase locking
protocols.* IBM Watson Res. Center.*RJ 3947.*1983.
018713 Mohan, C. Fussell, D.* Compatibility and commutativity of lock modes.*
IBM Watson Res. Center.*RJ 3948.*1983.
018714 Halpern, J.Y.* Deterministic process logic is elementary.* IBM Watson
Res. Center.*RJ 3968.*1983.
018715 Karnin, E.D.*A parallel algorithm for the knapsack problem.* IBM Watson
Res. Center.*RJ 3980.*1983.
018716 Chung, F.R.K. Tarjan, R.E. Paul, W.J.* Coding strings by pairs of
strings.* IBM Watson Res. Center.*RJ 3989.*1983.
018717 Backus, J.*The coming revolution in computing.* IBM Watson Res.
Center.*RJ 3994.*1983.
018718 Bux, W. Meister, B. Wong, J.W.* Bridges for interconnection of ring
networks - a simulation study.* IBM Watson Res. Center.*RZ 1241.*1983.
018719 Bonnans, J.F.*Analysis and control of a non linear parabolic unstable
system.* Inria.*Rapports de Recherche 220.*1983.
018720 Le Boudec, J.-Y.*Etude generale d'un reseau constitue de deux stations
hyperexponentielles.* Inria.*Rapports de Recherche 221.*1983.
018721 Cochet, Y.*Langage de dyck et groupe symetrique.* Inria.* Rapports de
Recherche 222.*1983.
018722 Bosc, P. Courant, M. Robin, S. Trilling, L.*Havane: Un systeme de mise en
relation automatique de petites annonces.* Inria.*Rapports de Recherche
223.*1983.
018723 Gardarin, G. Bernadat, P. Temmerman, N. Valduriez, P. Viemont,
Y.*Conception d'un systeme de bases de donnees relationnnel
multiprocesseur.* Inria.*Rapports de Recherche 224.*1983.
018724 Berry, G. Curien, P.-L.*Theory and practice of sequential algorithms: The
kernel of the applicative language CDS.* Inria.*Rapports de Recherche
225.*1983.
018725 Schroeder, A.* Integrated program measurement and documentation tools.*
Inria.*Rapports de Recherche 227.* 1983.
018726 Vercoustre, A.-M.* Minerve: Un meta-editeur syntaxique.* Inria.*Rapports
de Recherche 229.*1983.
018727 Marie, R.A. Stewart, W.J.*On exact and approximate iterative methods for
general queueing networks.* Inria.* Rapports de Recherche 230.*1983.
018728 Wollman, S.* Existence and uniqueness theory of the Vlasov equation.* New
York U. Inst. of Math.Sci.* DOE/ER/03077-181.*1982.
018729 Kerner, W. Weitzner, H.*Axisymmetric, non-ideal MHD states with steady
flow.* New York U. Inst. of Math.Sci.* DOE/ER/03077-201.*1983.
018730 Berger, M.J. Jameson, A.*Automatic adaptive grid refinement for the Euler
equations.* New York U. Inst. of Math.Sci.* DOE/ER/03077-202.*1983.
018731 Goodman, J.B. LeVeque, R.J.*On the accuracy of stable schemes for 2D
scalar conservation laws.* New York U. Inst. of
Math.Sci.*DOE/ER/03077-203.*1983.
018732 Lax, P.D.*Problems solved and unsolved concerning linear and nonlinear
partial differential equations.* New York U. Inst. of
Math.Sci.*DOE/ER/03077-204.*1983.
018733 Gottlieb, A.*Comparing the NYU ultracomputer with other large-scale
parallel processors.* New York U. Inst. of
Math.Sci.*DOE/ER/03077-205.*1983.
018734 Davidon, W.C. Nocedal, J.*Evaluation of step directions in optimization
algorithms.* New York U. Inst. of Math.Sci.* DOE/ER/03077-206.*1983.
018735 Bevan, N.W.S. Watson, R.S.*The design and evaluation of the microtext
authoring system for computer based training.* U.K. National Physical
Lab. Info. Technology and Computing Div.*DITC 25/83.*1983.
018736 Warham, A.G.P.*The spatial variation of the electromagnetic field in a
dielectric tube waveguide used as a standard field generator.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
26/83.*1983.
018737 Curtis, A.R.*Numerical methods for solving stiff systems of ordinary
differential equation of Is there life after gear?* U.K. National
Physical Lab. Info. Technology and Computing Div.*DITC 29/83.*1983.
018738 Cox, M.G.* Topic libraries for mathematical computation.* U.K. National
Physical Lab. Info. Technology and Computing Div.*DITC 30/83.*1983.
018739 Manning, D.R. Pay, B.E. Rengger, R.E. Schofield, D.* Research on
automatic speech recognition at the National Physical Laboratory.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
31/83.*1983.
018740 Oliver, P. (Ed.)*Implementation assessment of a network service: The test
responder specification.* U.K. National Physical Lab. Info. Technology
and Computing Div.*DITC 32/83.*1983.
018741 Hammarling, S.J. Long, E.M.R. Martin, D.W.*A generalized linear least
squares algorithm for correlated observations, with special reference to
degenerate data.* U.K. National Physical Lab. Info. Technology and
Computing Div.*DITC 33/83.*1983.
018742 Maculan, N.*Relaxation lagrangienne: Le probleme du knapsack 0-1*.*
Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
435.*1982.
018743 Braga, L.P.V. Maculan, N.* Kriging theory and applications for automated
cartography.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 477.*1983.
018744 Cerny, E. Gecsei, J.* Functional description of connector switch
attenuator networks.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 479.*1983.
018745 Ferland, J.A. Potvin, J.-Y.* Generalized fractional programming:
Algorithms, and numerical experimentation.* Montreal U. Dept. d'Info. et
de Recherche Operationnelle.* Publ. 481.*1983.
018746 Aboulhamid, E.M. Cerny, E.* Built-in testing of unilateral iterative
arrays.* Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
482.*1983.
018747 Maculan, N.*Programmation lineaire en nombres entiers.* Montreal U. Dept.
d'Info. et de Recherche Operationnelle.* Publ. 486.*1983.
018748 Helbling, J.-M.*Analyse discriminante et ellipsoides minimaux de
couverture.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 491.*1983.
018749 Hennessy, M.* Synchronous and asynchronous experiments of processes.*
Edinburgh U. Comp.Sci.Dept.*CSR-125-82.*1982.
018750 Smyth, M.B.* Power domains and predicate transformers: A topological
view.* Edinburgh U. Comp.Sci.Dept.* CSR-126-83.*1983.
018751 Milne, G.J.*The correctness of a simple silicon computer.* Edinburgh U.
Comp.Sci.Dept.*CSR-127-83.*1983.
018752 Pettorossi, A. Skowron, A.* Complete modal theories for verifying
communicating agents behaviour in recursive equations programs.*
Edinburgh U. Comp.Sci.Dept.* CSR-128-83.*1983.
018753 Sannella, D.T. Burstall, R.M.* Structured theories in LCF.* Edinburgh U.
Comp.Sci.Dept.*CSR-129-83.*1983.
018754 Backhouse, R.* Specification and proof of a regular language recogniser
in synchronous CCS.* Edinburgh U. Comp.Sci.Dept.*CSR-130-83.*1983.
018755 Sanella, D. Wirsing, M.*A kernel language for algebraic specification and
implementation.* Edinburgh U. Comp.Sci.Dept.*CSR-131-83.*1983.
018756 Stirling, C.*A proof theoretic characterization of observational
equivalence.* Edinburgh U. Comp.Sci.Dept.* CSR-132-83.*1983.
018757 Henessy, M. Milner, R.* Algebraic laws for nondeterminism and
concurrency.* Edinburgh U. Comp.Sci.Dept.*CSR-133-83.* 1983.
018758 Benson, D.B.* Counting paths: nondeterminism as linear algebra.*
Edinburgh U. Comp.Sci.Dept.*CSR-134-83.*1983.
018759 Hennessy, M.*A model for nondeterministic machines.* Edinburgh U.
Comp.Sci.Dept.*CSR-135-83.*1983.
018760 Sheilds, M.W. Wray, M.J.*A CCS specification of the OSI network service.*
Edinburgh U. Comp.Sci.Dept.*CSR-136-83.* 1983.
018761 Costa, G. Stirling, C.*A fair calculus of communicating systems.*
Edinburgh U. Comp.Sci.Dept.*CSR-137-83.*1983.
018762 Milne, G.J.*A formal basis for the analysis of circuit timing.* Edinburgh
U. Comp.Sci.Dept.*CSR-138-83.*1983.
018763 Jerrum, M.*The complexity of finding minimum length generator sequeces.*
Edinburgh U. Comp.Sci.Dept.* CSR-139-83.*1983.
018764 Sokolowski, S.*A note on tactics in LCF.* Edinburgh U.
Comp.Sci.Dept.*CSR-140-83.*1983.
018765 Schmidt, D.*A programming notation for tactical reasoning.* Edinburgh U.
Comp.Sci.Dept.*CSR-141-83.*1983.
018766 Schmidt, D.* Natural deduction theorem proving in set theory.* Edinburgh
U. Comp.Sci.Dept.*CSR-142-83.*1983.
018767 Schmidt, D.*Detecting global variables in denotational specifications.*
Edinburgh U. Comp.Sci.Dept.*CSR-143-83.* 1983.
018768 Mann, W.C.*An overview of the Nigel text generation grammar.* Southern
California U. Info.Sci.Inst.* ISI/RR-83-113.*1983.
018769 Mann, W.C. Thompson, S.A.* Relational propositions in discourse.*
Southern California U. Info.Sci.Inst.* ISI/RR-83-115.*1983.
018770 Kaczmarek, T. Mark, W. Wilczynski, D.*The CUE project.* Southern
California U. Info.Sci.Inst.*ISI/RS-83-01.*1983.
018771 Swartout, W.R.* XPLAIN: A system for creating and explaining expert
consulting programs.* Southern California U.
Info.Sci.Inst.*ISI/RS-83-04.*1983.
018772 Casner, S.L. Cohen, D. Cole, E.R.*Issues in satellite packet video
communication.* Southern California U.
Info.Sci.Inst.*ISI/RS-83-05.*1983.
018773 Morgenstern, M.* Active databases as a paradigm for enhanced computing
environments.* Southern California U.
Info.Sci.Inst.*ISI/RS-83-07.*1983.
018774 Mann, W.C.* Inquiry semantics: A functional semantics of natural language
grammar.* Southern California U. Info.Sci.Inst.*ISI/RS-83-08.*1983.
018775 Mann, W.C.*A linguistic overview of the Nigel text generation grammar.*
Southern California U. Info.Sci.Inst.*ISI/RS-83-09.*1983.
018776 Finkel, R. Solomon, M. DeWitt, D. Landweber, L.*The Charlotte distributed
operating system. Part IV of the First Report on the Crystal project.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 502.*1983.
018777 Qi, L.*An alternating method for stochastic linear programming with
simple recourse.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 515.*1983.
018778 Mangasarian, O.L.*Simple computable bounds for solutions of linear
complementarity problems and linear programs.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 519.*1983.
018779 Bent, S.W.* Stable transversals and stochastic functions in polyominoes.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 520.* 1983.
018780 Qi, L.* Forest iteration method for stochastic transportation problem.*
Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 522.*1983.
018781 Uhr, L.*Pyramid multi-computers, and extensions and augmentations.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 523.*1983.
018782 Chou, H.-T. DeWitt, D.J. Katz, R.H. Klug, A.C.*Design and implementation
of the Wisconsin storage system.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt.
524.*1983.
018783 Parter, S.V. Steuerwalt, M.* Iterative methods for discrete elliptic
equations.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 525.*1983.
018784 Bitton, D. DeWitt, D.J. Turbyfill, C.* Benchmarking database systems a
systematic approach.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 526.*1983.
018785 Kepecs, J. Solomon, M.* SODA: A simplified operating system for
distributed applications.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 527,
Ph.D. Thesis. Kepecs, J.* 1983.
018786 Byckling, E.* Coding of bilevel data at high resolution.* Helsinki U. of
Tech.Dept. of Tech. Physics.*Report TKK-F-A517.*1983.
018787 Byckling, E.* Data flow in digital page production systems.* Helsinki U.
of Tech.Dept. of Tech. Physics.*Report TKK-F-A518.*1983.
018788 Rushby, J.M.* Verification of secure systems.* Newcastle Upon Tyne U.
Computing Lab.*No. 166.*1981.
018789 Rushby, J.M. Randell, B.*A distributed secure system.* Newcastle Upon
Tyne U. Computing Lab.*No. 182.*1983.
018790 Zu-fan, M.* SCALE - A Fortran program for a scaling procedure.* Royal
Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8314.*1983.
018791 Pohl, P.* Pseudo random number generator MCV, a portable Fortran
version.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8317.*1983.
018792 Sethi, I.K. Jayaramamurthy, S.N.* Surface classification using
characteristic contours.* Wayne State U.
Comp.Sci.Dept.*CSC-83-007.*1983.
018793 Zeigler, B.P. Oren, T.I.* Simulation education: Software augmented
textbooks emphasizing modelling concepts.* Wayne State U.
Comp.Sci.Dept.*CSC-83-008.*1983.
018794 Conrad, M. Kirby, K.G.*The enzymatic neuron as a reaction diffusion
network of cyclic nucleotides.* Wayne State U.
Comp.Sci.Dept.*CSC-83-009.*1983.
018795 Bank, R.E. Douglas, C.C.*Sharp estimates for multigrid rates of
convergence with general smoothing and acceleration.* Yale U.
Comp.Sci.Dept.*Res.Rpt. 277.*n.d.
018796 Boswell, I.J.*Improving the efficiency of heapsort.* Auckland U.
Comp.Sci.Dept.*Rpt. 31.*1983.
018797 Guttman, A. Stonebraker, M.*R-trees: A dynamic index structure for
spatial searching.* California U., Berkeley. Electronics Res.Lab.*Memo.
No. UCB/ERL M83/64.* 1983.
018798 Stonebraker, M. Anderson, E. Hanson, E. Rubenstein, B.* Quel as a data
type.* California U., Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL
M83/73.*1983.
018799 Stonebraker, M.* Virtual memory transaction management.* California U.,
Berkeley. Electronics Res.Lab.*Memo. No. UCB/ERL M83/74.*1983.
018800 Oliver, R.M.*A forecasting column.* California U., Berkeley. O.R.
Center.*ORC 83-07.*1983.
018801 Ross, S.M.*A random walk subject to a randomly changing environment.*
California U., Berkeley. O.R. Center.*ORC 83-09.*1983.
018802 Jewell, W.S.*Approximating the distribution of a dynamic risk portfolio.*
California U., Berkeley. O.R. Center.* ORC 83-15.*1983.
018803 Gale, D.* Ms. Machiavelli and the Gale Shapley algorithm.* California U.,
Berkeley. O.R. Center.*ORC 83-16.*1983.
018804 Ehrenfeucht, A. Haussler, D. Rozenberg, G.*On regularity of context free
languages.* Colorado U. Comp.Sci.Dept.* CU-CS-235-82.*1982.
018805 Kolstad, R.B.* Distributed path Pascal: A language for programming
coupled systems.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-83-1136, Ph.D.
Thesis Kolstad, R.B.*1983.
018806 Orailoglu, A.* Software design issues in the implementation of
hierarchical, display editors.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-83-1139, Ph.D. Thesis. Orailoglu, A.*1983.
018807 Yates, S.B.*A simulation study of learning algorithms applied to
distributed processing communication networks.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-83-1140.*1983.
018808 Rus, T.* TICS system: A compiler generator.* Iowa U.
Comp.Sci.Dept.*Tech.Rpt. 83-08.*1983.
018809 Eichmann, D.A.*A preprocessor approach to separate compilation in Ada.*
Iowa U. Comp.Sci.Dept.*Tech.Rpt. 83-10.*1983.
018810 Shultz, R.K.* Simulation of multiprocessor computer architectures using
ACL.* Iowa U. Comp.Sci.Dept.* Tech.Rpt. 83-11.*1983.
VOL. 6, NO. 3 03/19/84
018811 Borodin, A. Gathen, J. von zur Hopcoft, J.*Fast parallel matrix and GCD
computations.* Cornell U. CS Dept * Tech.Rpt. 82-487.*1982.
018812 Whitesides, S.H.*A method for solving certain graph recognition and
optimization problems, with applications to perfect graphs.* Cornell U.
CS Dept *Tech.Rpt. 82-488.*1982.
018813 Lamport, L. Schneider, F.B.*The " Hoare logic" of CSP, and all that.*
Cornell U. CS Dept *Tech.Rpt. 82-490.* 1982.
018814 Schlichting, R.D. Schneider, F.B.*Using message passing for distributed
programming: proof rules and disciplines.* Cornell U. CS Dept
*Tech.Rpt. 82-491.*1982.
018815 Bates, J.L. Constable, R.L.*The definition of mu-prl.* Cornell U. CS
Dept *Tech.Rpt. 82-492.*1981.
018816 Gries, D.*The 711 problem.* Cornell U. CS Dept * Tech.Rpt. 82-493.*1982.
018817 Van Loan, C.*A symplectic method for approximating all the eigenvalues of
a Hamiltonian matrix.* Cornell U. CS Dept *Tech.Rpt. 82-494.*1982.
018818 Conway, R.W. Schneider, F.B. Skeen, D.* Northwest by southeast: database
task batching and pipelining.* Cornell U. CS Dept *Tech.Rpt.
82-495.*1982.
018819 Skeen, D.*Determining the last process to fail.* Cornell U. CS Dept
*Tech.Rpt. 82-496.*1983.
018820 Whitesides, S.H.*A classification of certain graphs with minimal
imperfection properties.* Cornell U. CS Dept *Tech.Rpt. 82-497.*1982.
018821 Joseph, D.* Polynomial time computations in models of ET.* Cornell U. CS
Dept *Tech.Rpt. 82-500.*1982.
018822 Joseph, D.A. Young, P.R.*A survey of some recent results on computational
complexity in weak theories of arithmetic.* Cornell U. CS Dept
*Tech.Rpt. 82-501.*1982.
018823 Coleman, T.F. More, J.J.*Software for estimating sparse Jacobian
matrices.* Cornell U. CS Dept *Tech.Rpt. 82-502.*1982.
018824 Hood, R.*The efficient implementation of very high level programming
language constructs.* Cornell U. CS Dept *Tech.Rpt. 82-503, Ph.D.
Thesis. Hood, R.* 1982.
018825 Pritchard, P.*A case study of number theoretic computation: searching
for primes in arithmetic progression.* Cornell U. CS Dept *Tech.Rpt.
82-504.*1982.
018826 Misra, J. Gries, D.*Finding repeated elements.* Cornell U. CS Dept
*Tech.Rpt. 82-505.*1982.
018827 Gilbert, J.R. Hutchinson, J.P. Tarjan, R.E.*A separator theorem for
graphs of bounded genus.* Cornell U. CS Dept *Tech.Rpt. 82-506.*1982.
018828 Haggard, G. Skeen, D.*Extensions of the reduction process in the Wong
Youssefi strategy for query processing.* Cornell U. CS Dept *Tech.Rpt.
82-507.*1982.
018829 Hartmanis, J.*On sparse sets in NP-P.* Cornell U. CS Dept *Tech.Rpt.
82-508.*1982.
018830 Coleman, T.F. Conn, A.R.*On the local convergence of a quasi Newton
method for the nonlinear programming problem.* Cornell U. CS Dept
*Tech.Rpt. 82-509.* 1982.
018831 Coleman, T.F. Sorensen, D.C.*A note on the computation of an orthonormal
basis for the null space of a matrix.* Cornell U. CS Dept *Tech.Rpt.
82-510.*1982.
018832 Salton, G. Fox, E. Wu, H.*Extended boolean information retrieval.*
Cornell U. CS Dept *Tech.Rpt. 82-511.* 1982.
018833 Babaoglu, O. Ferrari, D.* Hierarchical replacement decisions in
hierarchical stores.* Cornell U. CS Dept *Tech.Rpt. 82-512.*1982.
018834 Alpern, B. Schneider, F.B.* Key exchange using "keyless cryptography".*
Cornell U. CS Dept *Tech.Rpt. 82-513.*1982.
018835 Reps, T.*Generating language based environments.* Cornell U. CS Dept
*Tech.Rpt. 82-514, Ph.D. Thesis. Reps, T.*1982.
018836 Hopcraft, J.E. Joseph, D.A. Whitesides, S.H.* Movement problems for
2-dimensional linkages.* Cornell U. CS Dept *Tech.Rpt. 82-515.*1982.
018837 Hopcraft, J. Joseph, D. Whitesides, S.*Determining points of a circular
region reachable by joints of a robot arm.* Cornell U. CS Dept
*Tech.Rpt. 82-516.*1982.
018838 Cole, R.* Graph rigidity.* Cornell U. CS Dept * Tech.Rpt. 82-517.*1982.
018839 Brent, R.P. Luk, F.T.*Computing the Cholesky factorization using a
systolic architecture.* Cornell U. CS Dept * Tech.Rpt. 82-521.*1982.
018840 Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent
programming.* Cornell U. CS Dept * Tech.Rpt. 82-520.*1982.
018841 Brent, R.P. Luk, F.T.*A systolic architecture for the singular value
decomposition.* Cornell U. CS Dept * Tech.Rpt. 82-522.*1982.
018842 Gilbert, J.R. Rose, D.J.*A separator theorem for chordal graphs.* Cornell
U. CS Dept *Tech.Rpt. 82-523.* 1982.
018843 Salton, G. Buckley, C. Fox, E.A.* Automatic query formulations in
information retrieval.* Cornell U. CS Dept *Tech.Rpt. 82-524.*1982.
018844 Brent, R.P. Luk, F.T.*A systolic architecture for almost linear time
solution of the symmetric eigenvalue problem.* Cornell U. CS Dept
*Tech.Rpt. 82-525.*1982.
018845 Brent, R.P. Luk, F.T.*A systolic array for the linear time solution of
Toeplitz systems of equations.* Cornell U. CS Dept *Tech.Rpt.
82-526.*1982.
018846 Brent, R.P. Luk, F.T. Van Loan, C.*Computation of the singular value
decomposition using mesh connected processors.* Cornell U. CS Dept
*Tech.Rpt. 82-528.* 1982.
018847 Birman, K.P.*Using SEEK for multi channel pattern recognition.* Cornell
U. CS Dept *Tech.Rpt. 82-529.* 1982.
018848 Bates, J.L. Constable, R.L.* Proofs as programs.* Cornell U. CS Dept
*Tech.Rpt. 82-530.*1983.
018849 Gries, D.*A note on the standard strategy for developing loop invariants
and loops.* Cornell U. CS Dept * Tech.Rpt. 82-531.*1982.
018850 Conway, R. Worona, S.* COFE: A prototype memo and mail system for
nonprogrammers.* Cornell U. CS Dept * Tech.Rpt. 82-536.*1982.
018851 Constable, R.L.* Constructive mathematics as a programming logic I: Some
principles of theory.* Cornell U. CS Dept *Tech.Rpt. 83-554.*1983.
018852 Raeuchle, T. Toueg, S.*Exposure to deadlock for communicating processes
is hard to detect.* Cornell U. CS Dept *Tech.Rpt. 83-555.*1983.
018853 Wright, D.D. Schneider, R.B.*A distributed path algorithm and its
correctness proof.* Cornell U. CS Dept * Tech.Rpt. 83-556.*1983.
018854 Bracha, G. Toueg, S.*A distributed algorithm for generalized deadlock
detection.* Cornell U. CS Dept *Tech.Rpt. 83-558.*1983.
018855 Bracha, G. Toueg, S.* Asynchronous censensus and Byzantine protocols in
faulty environments.* Cornell U. CS Dept *Tech.Rpt. 83-559.*1983.
018556 Fox, E.A.*Some considerations for implementing the SMART information
retrieval system under UNIX.* Cornell U. CS Dept *Tech.Rpt.
83-560.*1983.
018857 Fox, E.A.*Characterization of two new experimental collections in
computer and information science containing textual and bibliographic
concepts.* Cornell U. CS Dept *Tech.Rpt. 83-561.*1983.
018858 Brent, R.P. Luk, F.T.*The solution of singular value and symmetric
eigenvalue problems on multiprocessor arrays.* Cornell U. CS Dept
*Tech.Rpt. 83-562.*1983.
018859 Brent, R.P. Luk, F.T. Van Loan, C.*Computation of the generalized
singular value decomposition using mesh connected processors.* Cornell
U. CS Dept * Tech.Rpt. 83-563.*1983.
018860 Salton, G. Fox, E.A. Voorhees, E.*A comparison of two methods for boolean
query relevance feedback.* Cornell U. CS Dept *Tech.Rpt. 83-564.*1983.
018861 Constable, R.L.* Mathematics as programming.* Cornell U. CS Dept
*Tech.Rpt. 83-565.*1983.
018862 Qian, J.*An assertional proof of a Byzantine agreement protocal.* Cornell
U. CS Dept *Tech.Rpt. 83-566.* 1983.
018863 Bajaj, C. Li, M.*On the duality of intersections and closest points.*
Cornell U. CS Dept *Tech.Rpt. 83-568.*1983.
018864 Schneider, F.B.* Byzantine generals in action: implementing fail stop
processors.* Cornell U. CS Dept * Tech.Rpt. 83-569.*1983.
018865 Salton, G. Fox, E.A. Voorhees, E.*Advanced feedback methods in
information retrieval.* Cornell U. CS Dept * Tech.Rpt. 83-570.*1983.
018866 Conway, R.*The case for PL/I as the language for instruction in
programming.* Cornell U. CS Dept * Tech.Rpt. 83-571.*1983.
018867 Wright, D.D.*Managing distributed databases in partitioned networks.*
Cornell U. CS Dept *Tech.Rpt. 83-572.* 1983.
018868 Hartmanis, J.* Generalized Kolmogorov complexity and the structure of
feasible computations.* Cornell U. CS Dept *Tech.Rpt. 83-573.*1983.
018869 Pritchard, P. Gries, D.*The seven eleven problem.* Cornell U. CS Dept
*Tech.Rpt. 83-574.*1983.
018870 Sewelson, V.*A study of the structure of NP.* Cornell U. CS Dept
*Tech.Rpt. 83-575.*1983.
018871 Gottlieb, A. Kruskal, C.P.* Supersaturated ultracomputer algorithms.* New
York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 024.*1980.
018872 Gottlieb, A.* WASHCLOTH - The logical successor to soapsuds.* New York U.
Inst. of Math. Sci. CS Dept * Tech.Rpt. 029.*1980.
018873 Gottlieb, A. Schwartz, J.T.* Networks and algorithms for very large scale
parallel computation.* New York U. Inst. of Math. Sci. CS Dept
*Tech.Rpt. 030.*1981.
018874 Kruskal, C.P.* Supersaturated paracomputer algorithms.* New York U. Inst.
of Math. Sci. CS Dept *Tech.Rpt. 031.* 1981.
018876 Lubachevsky, B.D.* Verification of several parallel coordination programs
based on descriptions of their reachability sets.* New York U. Inst. of
Math. Sci. CS Dept *Tech.Rpt. 036.*1981.
018877 Snir, M.*On parallel searching.* New York U. Inst. of Math. Sci. CS
Dept *Tech.Rpt. 045.*1982.
018878 Kruskal, C.P. Snir, M.*Some results on multistage interconnection
networks for multiprocessors.* New York U. Inst. of Math. Sci. CS Dept
*Tech.Rpt. 051.* 1982.
018879 Lubachevsky, B.D.*An approach to automating the verification of compact
parallel coordination programs.* New York U. Inst. of Math. Sci. CS
Dept *Tech.Rpt. 060; New York U. Inst. of Math. Sci.*Ultracomputer
Note 045.*1982.
018880 Vishkin, U.*On choice of a model of parallel computation.* New York U.
Inst. of Math. Sci. CS Dept *Tech.Rpt. 061; New York U. Inst. of Math.
Sci.*Ultracomputer Note 050.*1982.
018881 Lubachevsky, B.D.*An approach to automating the verification of compact
parallel coordination programs. II.* New York U. Inst. of Math. Sci.
CS Dept * Tech.Rpt. 064; New York U. Inst. of Math. Sci.* Ultracomputer
Note 049.*1983.
018882 Meertens, L.* Bitonic sort on Ultracomputer.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 001.*1979.
018883 Meertens, L.*Recurrent ultracomputers are not log n-fast.* New York U.
Inst. of Math. Sci.*Ultracomputer Note 002.* 1979.
018884 Schwartz, J.T.*Preliminary thoughts on ultracomputer programming style.*
New York U. Inst. of Math. Sci.* Ultracomputer Note 003.*1979.
018885 Schwartz, J.*A remark on nearly planar embeddings of small
ultracomputers.* New York U. Inst. of Math. Sci.* Ultracomputer Note
004.*1979.
018886 Schwartz, J.T.*The Burroughs FMP machine.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 005.*1980.
018887 Kruskal, C. Rudolph, L.*Observations concerning multidimensional
ultracomputers.* New York U. Inst. of Math. Sci.*Ultracomputer Note
006.*1980.
018888 Gottlieb, A. Kruskal, C.*A data motion algorithm.* New York U. Inst. of
Math. Sci.*Ultracomputer Note 007.*1980.
018889 Rudolph, L.*A remark on the planarity of the shuffle exchange network of
sizes 16 and 32.* New York U. Inst. of Math. Sci.*Ultracomputer Note
008.*1980.
018890 Gottlieb, A.*Another remark on the planarity of the shuffle exchange
network of sizes 16 and 32.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 009.*1980.
018891 Gottlieb, A.* PLUS: A PL/I based ultracomputer simulator, I.* New York U.
Inst. of Math. Sci.*Ultracomputer Note 010.*1980.
018892 Gottlieb, A.* MOP--A (minimal) multiprocessor operating system extending
WASHCLOTH.* New York U. Inst. of Math. Sci.*Ultracomputer Note
013.*1980.
018893 Gottlieb, A.* PLUS: A PL/I based ultracomputer simulator, II.* New York
U. Inst. of Math. Sci.*Ultracomputer Note 014.*1980.
018894 Gottlieb, A. Kruskal, C.* MULT - A multitasking ultracomputer language
with timing, I & II.* New York U. Inst. of Math. Sci.*Ultracomputer
Note 015.*1980.
018895 Peskin, C.S. Widlund, O.B.*Remarks on efficient numerical algorithms for
ultracomputers.* New York U. Inst. of Math. Sci.*Ultracomputer Note
018.*1981.
018896 Peskin, C.S.* Ultracomputer implementation of odd even reduction.* New
York U. Inst. of Math. Sci.*Ultracomputer Note 019.*1981.
018897 Peskin, C.S.*A comparison of ultracomputer architecture and lattice
architecture for problems on lattices.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 020.*1981.
018898 Gottlieb, A.* WASHCLOTH 81.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 021.*1981.
018899 Rushfield, N.* Atmospheric computations on highly parallel MIMD
computers.* New York U. Inst. of Math. Sci.* Ultracomputer Note
022.*1981.
018900 Korn, D.*Converting scientific codes to run under the WASHCLOTH
simulator.* New York U. Inst. of Math. Sci.* Ultracomputer Note
023.*1981.
018901 Korn, D.* Timing analysis for scientific codes run under WASHCLOTH
simulation.* New York U. Inst. of Math. Sci.* Ultracomputer Note
024.*1981.
018903 Snir, M.*"Netsim" network simulator for the ultracomputer.* New York U.
Inst. of Math. Sci.*Ultracomputer Note 028.* 1981.
018905 Korn, D.* Timing simulations for elliptic PDE's fun under WASHCLOTH.* New
York U. Inst. of Math. Sci.*Ultracomputer Note 031.*1981.
018906 Gottlieb, A. Kruskal, C.P.* Coordinating parallel processors: A partial
unification.* New York U. Inst. of Math. Sci.*Ultracomputer Note
034.*1981.
018907 Lubachevsky, B.D.*Review of Soviet publications on parallel data
processing (1978-1980).* New York U. Inst. of Math. Sci.*Ultracomputer
Note 035.*1981.
018908 Lubachevsky, B.D.*A parallel computer implementation of the
ascend/descend types of vector algorithms.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 037.*1981.
018909 Snir, M.*Comments on lens and hypertrees - or the perfect shuffle again.*
New York U. Inst. of Math. Sci.* Ultracomputer Note 038.*1981.
018910 Gottlieb, A.*A historical guide to the ultracomputer literature.* New
York U. Inst. of Math. Sci.* Ultracomputer Note 036.*1981.
018911 Snir, M. Solworth, J.*The ultraswitch--A VLSI network node for parallel
processing.* New York U. Inst. of Math. Sci.* Ultracomputer Note
039.*1982.
018812 Lubachevsky, B.D.* Parallelizing an algorithm of Charles S. Peskin for
describing incompressible flow of a fluid coupled to an elastic
membrane.* New York U. Inst. of Math. Sci.*Ultracomputer Note 042.*1982.
018813 Bianchini, R. Bianchini, R. Jr.* Wireability of an ultracomputer.* New
York U. Inst. of Math. Sci.* Ultracomputer Note 043.*1982.
018914 Zhong, Y-Q. Kalos, M.H.* Monte Carlo transport calculations on an
ultracomputer.* New York U. Inst. of Math. Sci.* Ultracomputer Note
046.*1982.
018915 Bernstein, H.J. Goldstein, M.* RINSE - What follows WASHCLOTH.* New York
U. Inst. of Math. Sci.*Ultracomputer Note 047.*n.d.
018916 Kalos, M.H.*The NYU ultracomputer.* New York U. Inst. of Math.
Sci.*Ultracomputer Note 048.*1983.
018917 Wieczorek, A.* Fixed points of multifunctions in general convexity
spaces.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
508.*1983.
018918 Orlowska, E.* Measurement and indiscernibility.* Polish Academy of
Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 509.*1983.
018919 Leszcylowski, J. Rudnicki, P.*Computer assisted reasoning.* Polish
Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 510.*1983.
018920 Danecki, R. Karpinski, M.* Binary L systems and generalized tree
automata.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt.
No. 512.*1983.
018921 Kowalski, A.*Useful rules of reasoning.* Polish Academy of Sciences.
Inst. of Comp.Sci.*ICS PAS Rpt. No. 515.*1983.
018922 Wieczorek, A.* Constrained and indefinite games and their applications.*
Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No.
517.*1983.
018923 Winkowski, J.*A distributed implementation of Petri nets.* Polish Academy
of Sciences. Inst. of Comp.Sci.*ICS PAS Rpt. No. 518.*1983.
018924 Veloso, P.A.S.*On the logic of namable models.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 14/83.*1983.
018925 Veloso, P.A.S. Maibaum, T.S.E.*A theory of abstract data types for
program development: Bridging the gap?* Pontificia U., Rio de Janeiro.
Info.Dept.*No. 15/83.* 1983.
018926 Ruas, V.*Automatic generation of tetrahedral meshes with application to
finite element solution of Stefan problems.* Pontificia U., Rio de
Janeiro. Info.Dept.*No. 18/83.*1983.
018927 Veloso, P.A.S. Martins, R.C.B.*On some notions of reduction among general
problems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 19/83.*1983.
018928 Itai, A. Rosberg, Z.*A golden ratio control policy for a multiple access
channel.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt.
256.*1983.
018929 Even, S. Goldreich, O.* DES like functions can generate the alternating
group.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt. 258.*1983.
018931 Bar-Yehuda, R. Even, S.*A local ratio theorem for approximating the
weighted vertex cover problem.* Technion - Israel Inst. of Tech. CS
Dept *Tech.Rpt. 260.*1983.
018932 Markowitz, V.M. Raz, Y.* ERROL: An entity relationship, role oriented,
query language.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt.
262.*1983.
018933 Markowitz, V.M. Raz, Y.*Modifying the relational algebra for use in an
entity relationship environment.* Technion - Israel Inst. of Tech. CS
Dept *Tech.Rpt. 263.* 1983.
018934 Gordon, D. Koren, I. Silberman, G.M.* Embedding tree structures in fault
tolerant VLSI hexagonal array.* Technion - Israel Inst. of Tech. CS
Dept *Tech.Rpt. 265.*1983.
018935 Korach, E. Moran, S. Zaks, S.*0(n log n) lower and upper bounds for a
class of distributed algorithms for a complete network of processors
(extended abstract).* Technion - Israel Inst. of Tech. CS Dept
*Tech.Rpt. 272.*1983.
018936 Chlamtac, I. Eisenger, M.*Voice/data integration on Ethernet: backoff and
priority considerations.* Technion - Israel Inst. of Tech. CS Dept
*Tech.Rpt. 273.* 1983.
018937 Chlamtac, I. Kutten, S.*On broadcasting and spatial reuse in radio
networks - problem analysis and design of protocols with provable
properties.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt.
274.*1983.
018938 Markowitz, V.M. Raz, Y.* RRA: A reshaped relational algebra.* Technion -
Israel Inst. of Tech. CS Dept * Tech.Rpt. 278.*1983.
018939 Awerbuch, B. Even, S.*A formal approach to communication network
protocol; broadcast, as a case study.* Technion - Israel Inst. of Tech.
CS Dept *Tech.Rpt. 284.*1983.
018940 Even, S. Goldreich, O.*On the security of multi party ping pong
protocols.* Technion - Israel Inst. of Tech. CS Dept *Tech.Rpt.
285.*1983.
018941 Makowsky, J.A.* Abstract embedding relations.* Technion - Israel Inst. of
Tech. CS Dept *Tech.Rpt. 286.*1983.
018942 Willmertinger, W.*Denotationelle beschreibung von Prozessoren und
Prozessorsystemen zur generierung von simulatoren.* Technische
Universitaet Muenchen. Institut fuer Informatik.*TUM-I8305.*1983.
018943 Ganzinger, H.*Increasing modularity and language independency in
automatically generated compilers.* Technische Universitaet Muenchen.
Institut fuer Informatik.*TUM-I8306.*1983.
018944 Kiessling, W.*Datenbanksysteme fuer rechenanlagen mit intelligenten
subsystemen: architektur, algorithmen, optimierung.* Technische
Universitaet Muenchen. Institut fuer Informatik.*TUM-I8307.*1983.
018945 Schreck, H.*Ueber ein diskretes optimierungsproblem mit baumstruktur aus
der versorgungsplanung.* Technische Universitaet Muenchen. Institut fuer
Mathematik.* TUM-M8306.*1983.
018946 Hayes, S.*The Gelfand topology for complex spaces.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8307.*1983.
018947 Jakubowicz, A.*Ueber den symmetrischen homomorphismus, der durch eine
derivation im antisymmetrischen tensorraum vom typ (0,2) induziert ist.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8308.*1983.
018948 Kosin, E.*Ein homotopieverfahren zur numerischen berechnung von
Loesungszweigen nichtlinearer gleichungssysteme mit spezieller anwendung
auf die mehrzielmethode.* Technische Universitaet Muenchen. Institut
fuer Mathematik.* TUM-M8309.*1983.
018949 Oberle, H.J.*Numerische berechnung optimaler steuerungen von Heizung und
Kuehlung fuer ein realistisches sonnenhausmodell.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8310.*1983.
018950 Hauf, M.*Zur extrapolationsmethode bei gemischten hyperbolischen
problemen.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8311.*1983.
018951 Gschrei, U.*Ueber ein ein - maschinen - reihenfolgeproblem mit umruest -
und lagerhaltungskosten bei vorgeschriebenem bedarf.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8312.*1983.
018952 Marnitz, J.*Behandlung von Wartenetzen mit mehreren subketten mach dem
verfahren der operationalen analyse.* Hamburg U. Fachbereich
Informatik.*Bericht Nr. 96.*1983.
018953 Lange, K-J.*Kontextfrei kontrollierte ETOL systeme.* Hamburg U.
Fachbereich Informatik.*Bericht Nr. 97.*1983.
018954 Vernon, M.K.* Performance oriented design of distributed systems.*
California U., L.A. CS Dept *CSD-821217, Ph.D. Thesis. Vernon,
M.K.*1982.
018955 Walker, B.J.*Issues of network transparency and file replication in the
distributed filesystem component of LOCUS.* California U., L.A. CS Dept
*CSD-830905, Ph.D. Thesis. Walker, B.J.*1983.
018956 Thiel, G.I.* Partitioned operation and distributed data base management
system catalogs.* California U., L.A. CS Dept *CSD-830906, Ph.D.
Thesis. Thiel, G.I.* 1983.
018957 Miller, L.H. Devillez, G. Vidal, J.*Adaptive user interfaces for
distributed information management.* California U., L.A. CS Dept
*CSD-831031.*1983.
018958 Rangel, R.A.P.*Evaluation and design of integrated packet switching and
circuit switching computer networks.* California U., L.A. CS Dept
*CSD-831212, Ph.D. Thesis. Rangel, R.A.P.*1983.
018959 Wolfe, M.J.*Optimizing supercompilers for supercomputers.* Illinois U.
CS Dept *UIUCDCS-R-83-1105, Ph.D. Thesis. Wolfe, M.J.*1982.
018960 Sheikh, Q.M.*Systems of nonlinear algebraic equations arising in
simulation of semiconductor devices.* Illinois U. CS Dept
*UIUCDCS-R-83-1133, Ph.D. Thesis. Sheikh, Q.M.*1983.
018961 Emrath, P.A.* Page indexing for textual information retrieval systems.*
Illinois U. CS Dept * UIUCDCS-R-83-1141, Ph.D. Thesis. Emrath,
P.A.*1983.
018962 Mickunas, M.D. Jalote, P.*The delay/re-read protocol for concurrency
control in databases.* Illinois U. CS Dept *UIUCDCS-R-83-1145.*1983.
018963 Cook, S.A.*The classification of problems which have fast parallel
algorithms.* Toronto U. CS Dept *Tech.Rpt. 164/83.*1983.
018964 Enright, W.H. Pryce, J.D.*Two Fortran packages for assessing initial
value methods.* Toronto U. CS Dept *Tech.Rpt. 167/83.*1983.
018965 Flajolet, P. Ottmann, T. Wood, D.* Search trees and bubble memories.*
Waterloo U. CS Dept *CS-83-02.*1983.
018966 Larson, P-A.* Performance analysis of a single-file version of linear
hashing.* Waterloo U. CS Dept *CS-83-28.* 1983.
018967 Char, B.W. Geddes, K.O. Gonnet, G.H. (Eds.)*Record of the first annual
Maple workshop June 11-12, 1983 Wild Echo Lodge Port Stanton, Ontario.*
Waterloo U. CS Dept * CS-83-31.*1983.
018968 Chazelle, B. Ottmann, T. Soisalon-Soininen, E. Wood, D.*The complexity
and decidability of separation.* Waterloo U. CS Dept *CS-83-34.*1983.
018969 Geddes, K.O.*(Chapter) 6. Newton's iteration and the Hensel
construction.* Waterloo U. CS Dept *CS-83-26.*1983.
018970 Ottmann, T. Rosenberg, A.L. Six, H-W. Wood, D.* Binary search trees with
binary comparison cost.* Waterloo U. CS Dept *CS-83-37.*1983.
018971 Czapor, S.R. Geddes, K.O.*A comparison of algorithms for the symbolic
computation of Pade approximants.* Waterloo U. CS Dept *CS-83-39.*1983.
018972 Geddes, K.O. Gonnet, G.H. Char, B.W.* MAPLE user's manual third edition.*
Waterloo U. CS Dept *CS-83-41.* 1983.
018973 Cunto, W.* Average case selection.* Waterloo U. CS Dept *CS-84-02, Ph.D.
Thesis. Cunto, W.*1984.
018974 Leighton, F.T. Rivest, R.L.*Estimating a probability using finite memory
(Extended abstract).*
018975 Leighton, F.T. Rivest, R.L.*The Markov chain tree theorem.* No issuing
agency indicated (authors' addresses: Frank Thomson Leighton -
Mathematics Department, Massachusetts Institute of Technology,
Cambridge, Mass. 02139; Ronald L. Rivest - Laboratory for Computer
Science, Massachusetts Institute of Technology, Cambridge, Mass.
02139).*1982, revised (December 1982).
018976 Braegger, R.P. Reimer, M.* Predicative scheduling: integration of
locking and optimistic methods.* Eidgenoessische Technische Hochschule
Zuerich. Institut fuer Informatik.*Bericht 53.*1983.
VOL. 6, NO. 4 04/26/84
041644 Stallman, R.M.*The SUPDUP protocol.* M.I.T. A.I. Lab.*Memo 644.*1983.
041702 Simmons, R.G. Davis, R.* Representations for reasoning about change.*
M.I.T. A.I. Lab.*Memo 702.*1983.
041706 Ullman, S.*Computational studies in the interpretation of structure and
motion: Summary and extension.* M.I.T. A.I. Lab.*Memo 706.*1983.
041708 McAllester, D.A.*Solving uninterpreted equations with context free
expression grammars.*
041710 McAllester, D.A.* Symmetric set theory: A general theory of isomorphism,
abstraction, and representation.* M.I.T. A.I. Lab.*Memo 710.*1983.
041711 Brady, M. Yuille, A.*An extremum principle for shape from contour.*
M.I.T. A.I. Lab.*Memo 711.*1983.
041712 Koch, C. Poggio, T.* Information processing in dendritic spines.* M.I.T.
A.I. Lab.*Memo 712.*1983.
041713 Koch, C. Poggio, T.*A theoretical analysis of electrical properties of
spines.* M.I.T. A.I. Lab.*Memo 713.*1983.
041714 Ikeuchi, K.*Determining attitude of object from needle map using extended
Gaussian image.* M.I.T. A.I. Lab.*Memo 714.*1983.
041716 Tonfoni, G. Doyle, R.J.*Understanding text through summarization and
analogy.* M.I.T. A.I. Lab.*Memo 716.* 1983.
041717 Hollerbach, J.M. Sahar, G.* Wrist partitioned inverse kinematic
accelerations and manipulator dynamics.* M.I.T. A.I. Lab.*Memo
717.*1983.
041719 Barber, G. de Jong, P. Hewitt, C.* Semantic support for work in
organizations.* M.I.T. A.I. Lab.*Memo 719.*1983.
041721 Ullman, S.*Maximizing rigidity: The incremental recovery of 3-D structure
from rigid and rubbery motion.* M.I.T. A.I. Lab.*Memo 721.*1983.
041722 Yuille, A.L. Poggio, T.* Scaling theorems for zero crossings.* M.I.T.
A.I. Lab.*Memo 722.*1983.
041723 Ullman, S.* Visual routines.* M.I.T. A.I. Lab.*Memo 723.* 1983.
041724 Yuille, A.L.*The smoothest velocity field and token matching schemes.*
M.I.T. A.I. Lab.*Memo 724.*1983.
041725 Brooks, R.A.* Planning collision free motions for pick and place
operations.* M.I.T. A.I. Lab.*Memo 725.*1983.
041726 Ikeuchi, K. Horn, B.K.P. Nagata, S. Callahan, T. Feingold, O.* Picking up
an object from a pile of objects.* M.I.T. A.I. Lab.*Memo 726.*1983.
041727 Hewitt, C. de Jong, P.*Analyzing the roles of descriptions and actions in
open systems.* M.I.T. A.I. Lab.*Memo 727.* 1983.
041730 Yuille, A.L. Poggio, T.* Fingerprints theorems for zero crossings.*
M.I.T. A.I. Lab.*Memo 730.*1983.
041734 Hildreth, E.C.*The computation of the velocity field.* M.I.T. A.I.
Lab.*Memo 734.*1983.
041736 Donald, B.R.*Hypothesizing channels through free-space in solving the
findpath problem.* M.I.T. A.I. Lab.*Memo 736.*1983.
041737 Nishihara, H.K. Poggio, T.* Hidden cues in random line stereograms.*
M.I.T. A.I. Lab.*Memo 737.*1983.
041738 Grimson, W.E.L. Lozano-Perez, T.* Model based recognition and
localization from sparse range or tactile data.* M.I.T. A.I. Lab.*Memo
738.*1983.
041740 Horn, B.K.P.* Extended Gaussian images.* M.I.T. A.I. Lab.* Memo
740.*1983.
041743 Nielsen, K.R.K. Poggio, T.* Vertical image registration in stereopsis.*
M.I.T. A.I. Lab.*Memo 743.*1983.
041744 Ikeuchi, K.*Constructing a depth map from images.* M.I.T. A.I. Lab.*Memo
744.*1983.
041750 Hewitt, C. Lieberman, H.*Design issues in parallel architectures for
artificial intelligence.* M.I.T. A.I. Lab.*Memo 750.*1983.
040720 Canny, J.F.*Finding edges and lines in images.* M.I.T. A.I.
Lab.*TR-720.*1983.
040707 Hamscher, W.*Using structural & functional information in diagnostic
design.* M.I.T. A.I. Lab.*TR-707.*1983.
040728 Theriault, D.G.*Issues in the design and implementation of Act2.* M.I.T.
A.I. Lab.*TR-728.*1983.
020302 Arvind. Dertouzos, M.L. Iannucci, R.A.*A multiprocessor emulation
facility.* M.I.T. Lab. for Comp.Sci.*TR-302.* 1983.
020303 Bloom, T.* Dynamic module replacement in a distributed programming
system.* M.I.T. Lab. for Comp.Sci.*TR-303, Ph.D. Thesis. Bloom, T.*1983.
020304 Terman, C.J.* Simulation tools for digital LSI design.* M.I.T. Lab. for
Comp.Sci.*TR-304, Ph.D. Thesis. Terman, C.J.*1983.
020305 Bhatt, S.N. Leighton, F.T.*A framework for solving VLSI graph layout
problems.* M.I.T. Lab. for Comp.Sci.* TR-305.*1983.
020306 Leung, C.K.C. Lim, W.Y-P.* PADL - A packet architecture description
language: A preliminary reference manual.* M.I.T. Lab. for
Comp.Sci.*TR-306.*1983.}1
020307 Guttag, J.V. Horning, J.J.*Preliminary report on the Larch shared
language.* M.I.T. Lab. for Comp.Sci.*TR-307.*1983.
020308 Oki, B.M.* Reliable object storage to support atomic actions.* M.I.T.
Lab. for Comp.Sci.*TR-308.*1983.
020309 Brock, J.D.*A formal model of non-determinate dataflow computation.*
M.I.T. Lab. for Comp.Sci.*TR-309, Ph.D. Thesis. Brock, J.D.*1983.
020310 Granville, R.A.* Cohesion in computer text generation: Lexical
substitution.* M.I.T. Lab. for Comp.Sci.*TR-310.* 1983.
038220 Hughes, J.L.A.* Error detection and correction techniques for dataflow
systems.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 220; Stanford
U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt.
83-01.*1983.
038221 Xu, X.* Test generation and fault diagnosis for multiple faults in
combinational circuits.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note
221; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-02.*1983.
038222 Hassan, S.Z. Hughes, J.L.A. Khakbaz, J. Lu, D.J. McCluskey, E.J. Namjoo,
M. Xu, X.*The thirteenth annual conference on fault tolerant computing (
FTCS-13) preprints.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 222;
Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-03.*1983. Contents: Preprints of six papers
accepted for presentation at The thirteenth annual international
conference on fault tolerant computing (FTCS-13), Milan, Italy, June
28-30, 1983.
038223 Min, Y.*Generating a complete test set for programmable logic arrays
(PLAs).* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 223; Stanford U.
SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt.
83-04.*1983.
038224 Min, Y.*A unified fault model for programmable logic arrays.* Stanford U.
SEL. Comp. Systems Lab.*Tech. Note 224; Stanford U. SEL. Comp. Systems
Lab. Center for Reliable Computing.*Tech.Rpt. 83-05.*1983.
038225 Iyer, R.K. Rossetti, D.J.*Hard CPU related failures and system activity:
measurement and modelling.* Stanford U. SEL. Comp. Systems Lab.*Tech.
Note 225; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.* Tech.Rpt. 83-06.*1983.
038226 Velardi, P. Iyer, R.K.*A study of software failures and recovery in the
MVS operating system.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note
226; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-07.*1983.
038227 McCluskey, E.J.* Verification testing: A pseudo-exhaustive test
technique.* Stanford U. SEL. Comp. Systems Lab.* Tech. Note 227;
Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-08.*1983.
038228 Iyer, R.K. Amer, H.H.*Effect of uncertainty in failure rate on memory
system reliability.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note
228; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-09.*1983.
038229 Preprints of the international test conference - Cherry Hill '83.*
Stanford U. SEL. Comp. Systems Lab.*Tech. Note 229; Stanford U. SEL.
Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-10.*1983.
Contents: (1) Hassan, S.Z.* Signature testing of sequential machines;
(2) Lu, D.J. McCluskey, E.J.* Recurrent test patterns; (3) Mahmood, A.
McCluskey, E.J. Lu, D.J.* Concurrent fault detection using a watchdog
processor and assertions; (4) McCluskey, E.J.* Teaching testing.
038230 A real time systems symposium preprint.* Stanford U. SEL. Comp. Systems
Lab.*Tech. Note 230; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Tech.Rpt. 83-11.*1983. 12p. Contents: Iyer, R.K.
Rossetti, D.J.* Permanent CPU errors and system activity: measurement
and modelling.
038231 Iyer, R.K. Velardi, P.*A statistical study of hardware related software
errors in MVS.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note 231;
Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-12.*1983.
038232 Hassan, S.Z. McCluskey, E.J.* Testing PLAs using multiple parallel
signature analyzers.* Stanford U. SEL. Comp. Systems Lab.*Tech. Note
232; Stanford U. SEL. Comp. Systems Lab. Center for Reliable
Computing.*Tech.Rpt. 83-13.*1983.
038233 Patashnik, O.* Circuit segmentation for pseudo exhaustive testing.*
Stanford U. SEL. Comp. Systems Lab.*Tech. Note 233; Stanford U. SEL.
Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt. 83-14.*1983.
038234 McCluskey, E.J.*Exhaustive and pseudo exhaustive test.* Stanford U. SEL.
Comp. Systems Lab.*Tech. Note 234; Stanford U. SEL. Comp. Systems Lab.
Center for Reliable Computing.*Tech.Rpt. 83-15.*1983.
038235 Mahmood, A. McCluskey, E.J. Lu, D.J.* Concurrent fault detection using a
watchdog processor and assertions.* Stanford U. SEL. Comp. Systems
Lab.*Tech. Note 235; Stanford U. SEL. Comp. Systems Lab. Center for
Reliable Computing.*Tech.Rpt. 83-16.*1983.
038236 Gross, T. Gill, J.*A short guide to MIPS assembly instructions.* Stanford
U. SEL. Comp. Systems Lab.*Tech. Note 83-236.*1983.
038239 Alpert, D.* Performance tradeoffs for microprocessor cache memories.*
Stanford U. SEL. Comp. Systems Lab.*Tech. Note 83-239.*1983.
038240 Hughes, J.L.A. McCluskey, E.J. Lu, D.J.*Design of totally self checking
comparators with an arbitrary number of inputs.* Stanford U. SEL. Comp.
Systems Lab.*Tech. Note 240; Stanford U. SEL. Comp. Systems Lab. Center
for Reliable Computing.*Tech.Rpt. 83-18.*1983.
038241 Khakbaz, J. McCluskey, E.J.* Self testing embedded checkers.* Stanford U.
SEL. Comp. Systems Lab.*Tech. Note 241; Stanford U. SEL. Comp. Systems
Lab. Center for Reliable Computing.*Tech.Rpt. 83-19.*1983.
038242 Archambeau, E.C. McCluskey, E.J.* Fault coverage of pseudo exhaustive
testing.* Stanford U. SEL. Comp. Systems Lab.* Tech. Note 242; Stanford
U. SEL. Comp. Systems Lab. Center for Reliable Computing.*Tech.Rpt.
83-20.*1983.
035236 Hennessy, J. Jouppi, N. Przybylski, S. Rowen, C. Gross, T.* Design of a
high performance VLSI processor.* Stanford U. SEL. Comp. Systems
Lab.*Tech.Rpt. 236.*1983.
035240 Luckham, D.C. von Henke, F.W. Larsen, H.J. Stevenson, D.R.* Adam: An Ada
based language for multiprocessing.* Stanford U. SEL. Comp. Systems
Lab.*Tech.Rpt. 240.*1983.
035241 Cory, W.E.* Verification of hardware design correctness: symbolic
execution techniques and criteria for consistency.* Stanford U. SEL.
Comp. Systems Lab.* Tech.Rpt. 83-241, Ph.D. Thesis. Cory, W.E.*1983.
035242 Ghosh, S. Vancleemput, W.* Fault simulation in ADLIB SABLE.* Stanford U.
SEL. Comp. Systems Lab.*Tech.Rpt. 83-242.* 1983.
035243 Huck, J.C.* Comparative analysis of computer architectures.* Stanford U.
SEL. Comp. Systems Lab.*Tech.Rpt. 83-243, Ph.D. Thesis. Huck, J.C.*1983.
035244 Demetrescu, S.*High speed image rasterization using a highly parallel
smart bulk memory.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt.
83-244.*1983.
035245 Finlayson, R.S.*EDT: A syntax based program editor. Reference manual.*
Stanford U. SEL. Comp. Systems Lab.* Tech.Rpt. 83-245.*1983.
035247 Marzullo, K. Owicki, S.*Maintaining the time in a distributed system.*
Stanford U. SEL. Comp. Systems Lab.* Tech.Rpt. 83-247.*1983.
035248 Ossher, H.L. Reid, B.K.* Fable: A programming language solution to IC
process automation problems.* Stanford U. SEL. Comp. Systems
Lab.*Tech.Rpt. 83-248.*1983.
035249 Helmbold, D. Luckham, D.C.* Runtime detection and description of deadness
errors in Ada tasking.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt.
83-249.*1983.
035250 Alpert, D.* Data buffers for execution architectures.* Stanford U. SEL.
Comp. Systems Lab.*Tech.Rpt. 83-250.* 1983.
035251 Lansky, A.L. Owicki, S.S.* Gen: A tool for concurrency specification and
verification.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt.
83-251.*1983.
035252 Fine, M. Tobagi, F.A.* Performance of unidirectional broadcast local area
networks: Express-net and Fasnet.* Stanford U. SEL. Comp. Systems
Lab.*Tech.Rpt. 83-252.* 1983.
035253 Mitchell, C.L.*Evaluation of an interpreted architecture for Pascal on a
personal computer.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt.
83-253.*1983.
035254 Chow, F.C.*A portable machine-independent global optimizer - design and
measurements.* Stanford U. SEL. Comp. Systems Lab.*Tech.Rpt.
83-254.*1983.
018977 Itai, A. Rodeh, M.* Scheduling transmissions in a network.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 261.*1983.
018978 Boral, H. DeWitt, D.J.* Database machines: an idea whose time has passed.
A critique of the future of database machines.* Technion - Israel Inst.
of Tech. Comp.Sci.Dept.*Tech.Rpt. 288.*1983.
018979 Goldin, L. Grunwald, A.J. Kantorowitz, E.*Inexpensive graphics for real
time motion simulation.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 291.*1983.
018980 Korach, E. Moran, S. Zaks, S.*Finding a minimum spanning tree can be
harder than finding a spanning tree in distributed networks.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 294.*1983.
018981 Itai, A. Zehavi, A.* Minimal path disconnected graphs.* Technion - Israel
Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 295.*1983.
018982 Gold, Y.I. Moran, S.* Distributed algorithms for computing all internode
distances and for constructing a minimum weights spanning tree in a
fully connected broadcast network.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.* Tech.Rpt. 297.*1983.
018983 Korach, E. Moran, S. Zaks, S.*Tight lower and upper bounds for some
distributed algorithms for a complete network of processors.* Technion -
Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 298.*1983.
018984 Francez, N. Yemini, S.*A fully abstract and composable inter task
communication construct.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 299.*1983.
018985 Erdoes, P. Moran, S. Zaks, S. Koren, I. Silberman, G.M.* Mapping data
flow graphs on VLSI processing arrays.* Technion - Israel Inst. of Tech.
Comp.Sci.Dept.*Tech.Rpt. 306.*1983.
018986 Bartels, R.H. Beatty, J.C. Barsky, B.A.*An introduction to the use of
splines in computer graphics.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/136; Waterloo U. Comp.Sci.Dept.*Res.Rpt.
CS-83-09.*1983.
018987 Fujimoto, R.M.* VLSI communication components for multicomputer
networks.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/137, Ph.D.
Thesis. Fujimoto, R.M.*1983.
018988 Thompson, C.D. Raghavan, P.*On estimating the performance of VLSI
circuits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/138.*1983.
018989 Lawler, E.L.* Scheduling a single machine to minimize the number of late
jobs.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/139.*1983.
018990 Fujimoto, R.M.* SIMON: A simulator of multicomputer networks.* California
U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/140.*1983.
018991 Katevenis, M.G.H.* Reduced instruction set computer architectures for
VLSI.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/141, Ph.D.
Thesis. Katevenis, M.G.H.*1983.
018992 Ferrari, D. Lee, T-y.P.*Modeling file system organizations in a local
area network environment.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/142; California U., Berkeley. Comp.Sci.Div.
PROGRES Group.*Rpt. 83.07.*1983.
018993 Blomseth, R.A.*A big RISC.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/143.*1983.
018994 Stonebraker, M. Woodfill, J. Ranstrom, J. Kalash, J. Arnold, D.
Andersen, E.* Performance analysis of distributed data base systems.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/144.*1983.
018995 Leffler, S.J. Fabry, R.S. Joy, W.N.*A 4.2bsd interprocess communication
primer. Draft of July 27, 1983.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/145.* 1983.
018996 Leffler, S.J. Joy, W.N. Fabry, R.S.*4.2bsd networking implementation
notes. Revised July, 1983.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/146.*1983.
018997 McKusich, M.K. Joy, W.N. Leffler, S.J. Fabry, R.S.*A fast file system for
UNIX. Revised July 27, 1983.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/147.*1983.
018998 Woods, J.A.*Finding files fast.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/148.*1983.
018999 Stonebraker, M. Rowe, L.A.*Data base portals: A new application program
interface.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/149.*1983.
019000 Woodfill, J. Stonebraker, M.*An implementation of hypothetical
relations.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/150.*1983.
019001 Stonebraker, M. Woodfill, J. Andersen, E.*Implementation of rules in
relational data base systems.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/151.*1983.
019002 Barsky, B.A. DeRose, T.D.*The Beta2 spline: A special case of the
Beta-spline curve and surface representation.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/152.* 1983.
019003 Hac, A.*On the modeling of shared resources by queueing networks with
serialization delays.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/153; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt.
83.08.*1983.
019004 Ousterhout, J.K. Hamachi, G.T. Mayo, R.N. Scott, W.S. Taylor, G.S.*A
collection of papers on Magic.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/154.* 1983. Contents: (1)Magic: a VLSI layout
system, by John K. Ousterhout, Gordon T. Hamachi, Robert N. Mayo, Walter
S. Scott, and George S. Taylor; (2) Magic's incremental design-rule
checker, by George S. Taylor and John K. Ousterhout; (3) Plowing:
interactive stretching and compaction in Magic, by Walter S. Scott and
John K. Ousterhout; (4) A switchbox router with obstacle avoidance, by
Gordon T. Hamachi and John K. Ousterhout.
019005 Ferrari, D.*The evolution of Berkeley UNIX.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 83/155; California U., Berkeley. Comp.Sci.Div.
PROGRES Group.*Rpt. 83.09.*1983.
019006 Terry, D.B.*An analysis of naming convention for distributed computer
systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/156;
California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 83.10.*1983.
019007 Adler, I. Karp, R. Shamir, R.*A family of simplex variants solving for an
m x d linear program in expected number of pivot steps depending on d
only.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/157.*1983.
019008 Adler, I. Karp, R. Shamir, R.*A simplex variant solving an m x d linear
program in O(min(m superscript 2, d superscript 2)) expected number of
pivot steps.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/158.*
1983.
019009 Voge, B.A.*Implementation of network primitives for a network
monitor/debugger.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/159; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt.
83.11.*1983.
019010 Foderaro, J.K.*The design of a language for algebraic computation
systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/160, Ph.D.
Thesis. Foderaro, J.K.*1983.
019011 Sequin, C.H. Segal, M. Wensley, P.* UNIGRAFIX 2.0 user's manual and
tutorial.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/161.*1983.
019012 Sequin, C.H. (ed.)*Creative geometric modeling with UNIGRAFIX.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 83/162.*1983.
019013 Gusella, R. Zatti, S.* TEMPO: a network time controller for a distributed
Berkeley UNIX system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
83/163; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt.
83.12.*1983. Cover title: TEMPO: Time services for the Berkeley local
network.
019014 Linton, M.A.* Queries and views of programs using a relational database
system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/164, Ph.D.
Thesis. Linton, M.A.* 1983.
019015 Presotto, D.L.* PUBLISHING: A reliable broadcast communication
mechanism.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 83/165,
Ph.D. Thesis. Presotto, D.L.*1983.
019016 Khoshafian, S.N. Bates, D.M. DeWitt, D.J.* Parallel algorithms and
secondary storage methods for X'X.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 528.*1984.
019017 DeWitt, D.J. Katz, R.H. Olken, F. Shapiro, L.D. Stonebraker, M.R. Wood,
D.*Implementation techniques for main memory database systems.*
Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 529.*1984.
019018 Carey, M.J.*The performance of concurrency control algorithms for
database management systems.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt.
530.*1984.
019019 Agrawal, R. DeWitt, D.J.*Whither hundreds of processors in a database
machine?* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 531.*1984.
019020 Boral, H. DeWitt, D.J.*A methodology for database system performance
evaluation.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 532.*1984.
019021 Joseph, D. Young, P.*Some remarks on witness function for non-polynomial
and non-complete sets in NP.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt.
533.*1984.
019022 Manber, U.*On maintaining dynamic information in a concurrent
environment.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 535.*1984.
019023 Vernon, M.K.* Performance simulation study of an applicative
multiprocessor.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 536.*1984.
019024 Joseph, D. Young, P.*A survey of some recent results on computational
complexity in weak theories of arithmetic.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 537.*1984.
019025 Dyer, C.R. Chin, R.T.* Model based industrial part recognition: systems
and algorithms.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 538.*1984.
VOL. 6, NO. 5 05/14/84
019026 Brown, M.H. Sedgewick, R.*Progress report: Brown University instructional
computing laboratory.* Brown U. CS Dept *Tech.Rpt. 83-28.*1983.
019027 Brown, M.H. Sedgewick, R.*A system for algorithm animation.* Brown U. CS
Dept *Tech.Rpt. 84-01.*1984.
019028 Brown, M.H. Sedgewick, R.*Techniques for algorithm animation.* Brown U.
CS Dept *Tech.Rpt. 84-02.* 1984.
019029 Pato, J.N. Reiss, S.P. Brown, M.H.*The Brown workstation environment.*
Brown U. CS Dept *Tech.Rpt. 84-03.* 1984.
019030 Reiss, S.P.* Graphical program development with PECAN program development
system.* Brown U. CS Dept * Tech.Rpt. 84-04.*1984.
019031 Smolka, S.A.*Analysis of communicating finite state processes.* Brown U.
CS Dept *Tech.Rpt. 84-05, Ph.D. Thesis. Smolka, S.A.*1984.
019032 Flajolet, P. Sedgewick, R.* Digital search trees revisited.* Brown U. CS
Dept *Tech.Rpt. 84-07.*1984.
019033 Bergstra, J.A. Klop, J.W.*An abstraction mechanism for process algebras.*
Mathematisch Centrum.*IW 231/83.* 1983.
019034 Bergstra, J.A. Klop, J.W.*An algebraic specification method for processes
over a finite action set.* Mathematisch Centrum.*IW 232/83.*1983.
019035 Lenstra, A.K.* Factoring multivariate polynomials over algebraic number
fields.* Mathematisch Centrum.*IW 233/83.*1983.
019036 Bergstra, J.A. Klop, J.W. Tucker, J.V.* Algebraic tools for system
construction.* Mathematisch Centrum.*IW 234/83.* 1983.
019037 Bergstra, J.A. Klop, J.W.*The algebra of recursively defined processes
and the algebra of regular processes.* Mathematisch Centrum.*IW
235/83.*1983.
019038 Bergstra, J.A. Tucker, J.V.*The axiomatic semantics of programs based on
Hoare's logic.* Mathematisch Centrum.* IW 236/83.*1983.
019039 Bergstra, J.A. Meyer, J.-J.Ch.*On specifying sets of integers.*
Mathematisch Centrum.*IW 237/83.*1983.
019040 De Bakker, J.W. Zucker, J.I.* Compactness in semantics for merge and fair
merge.* Mathematisch Centrum.*IW 238/83.* 1983.
019041 Vitanyi, P.M.B. Meertens, L.G.L.T.* Big omega versus the wild functions.*
Mathematisch Centrum.*IW 239/83.*1983.
019042 Klint, P.*A survey of three language independent programming
environments.* Mathematisch Centrum.*IW 240/83.*1983.
019043 Bergstra, J.A. Tiuryn, J.* Process algebra semantics for queues.*
Mathematisch Centrum.*IW 241/83.*1983.
019044 Lenstra, A.K.* Polynomial factorization by root approximation.*
Mathematisch Centrum.*IW 242/83.*1983.
019045 Vitanyi, P.M.B.* Distributed elections in an Archimedean ring of
processors (Preliminary version).* Mathematisch Centrum.*IW
243/83.*1983.
019046 Vitanyi, P.M.B.*The simple roots of real time computation hierarchies
(Preliminary version).* Mathematisch Centrum.*IW 244/83.*1983.
019047 Vitanyi, P.M.B.*An N superscript 1.618 lower bound on the time to
simulate one queue or two pushdown stores by one tape.* Mathematisch
Centrum.*IW 245/83.*1983.
019048 Houwen, P.J. van der Sommeijer, B.P.* Linear multistep methods with
minimized truncation error for periodic initial value problems.*
Mathematisch Centrum.*NW 157/83.*1983.
019049 Hemker, P.W.* Multigrid methods for problems with a small parameter in
the highest derivative.* Mathematisch Centrum.*NW 158/83.*1983.
019050 Asselt, E.J. van* Termination strategies for Newton iteration in full
multigrid methods.* Mathematisch Centrum.*NW 159/83.*1983.
019051 Asselt, E.J. van*On M-functions and nonlinear relaxation methods.*
Mathematisch Centrum.*NW 160/83.*1983.
019052 Gottlieb, A.*Comparing the NYU ultracomputer with other large scale
parallel processors.* New York U. Inst. of Math.
Sci.*DOE/ER/03077-205.*1983.
019053 Tarjan, R.E. Vishkin, U.*An efficient parallel biconnectivity algorithm.*
New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt.069; New York U.
Inst. of Math. Sci.*Ultracomputer note 051.*1983.
019054 Paul, W. Vishkin, U. Wagener, H.* Parallel computation on 2-3 trees.* New
York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 070; New York U. Inst.
of Math. Sci.*Ultracomputer note 052.*1983.
019055 Vishkin, U.* Synchronous parallel computation.* New York U. Inst. of
Math. Sci. CS Dept *Tech.Rpt. 071; New York U. Inst. of Math.
Sci.*Ultracomputer note 053.*1983.
019056 Mehlhorn, K. Vishkin, U.* Granularity of parallel memories.* New York U.
Inst. of Math. Sci. CS Dept *Tech.Rpt. 089; New York U. Inst. of Math.
Sci.*Ultracomputer note 059.*1983.
019057 Bar-On, I. Vishkin, U.* Optimal parallel generation of a computation tree
form.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt. 090; New York
U. Inst. of Math. Sci.*Ultracomputer note 061.*1983.
019058 Vishkin, U.*A parallel design distributed implementation ( PDDI) general
purpose computer.* New York U. Inst. of Math. Sci. CS Dept *Tech.Rpt.
096; New York U. Inst. of Math. Sci.*Ultracomputer note 058.*1983.
019059 Vishkin, U.*An optimal parallel algorithm for selection.* New York U.
Inst. of Math. Sci. Comp.Sci.Dep.*Tech.Rpt. 106; New York U. Inst. of
Math. Sci.*Ultracomputer note 064.*1983.
019060 Vishkin, U.* Randomized speed-ups in parallel computation.* New York U.
Inst. of Math. Sci. CS Dept *Tech.Rpt. 107; New York U. Inst. of Math.
Sci.*Ultracomputer note 066.*1984.
019061 Vishkin, U. Wigderson, A.* Dynamic parallel memories.* New York U. Inst.
of Math. Sci.*Ultracomputer note 054.*1983.
019062 Korn, D. Rushfield, N.* Washcloth simulation of three dimensional weather
forcasting codes.* New York U. Inst. of Math. Sci.*Ultracomputer note
055.*1983.
019063 Vishkin, U. Wigderson, A.*Trade-offs between depth and width in parallel
computation.* New York U. Inst. of Math. Sci.*Ultracomputer note
056.*1983.
019064 Harrison, M.C.*An ultracomputer switch design using circuit and packet
switching.* New York U. Inst. of Math. Sci.* Ultracomputer note
057.*1983.
019065 Gottlieb, A.*Avoiding serial bottlenecks in ultraparallel MIMD
computers.* New York U. Inst. of Math. Sci.* Ultracomputer note
062.*1983.
019066 Vishkin, U.* Lucid boxes vs. black boxes.* New York U. Inst. of Math.
Sci.*Ultracomputer note 065.*1983.
019067 Vichnevetsky, R. Pariser, E.C.* High order numerical Sommerfeld boundary
conditions: theory and experiments.* Rutgers U. CS Dept
*DCS-TR-132.*1983.
019068 Gerasoulis, A.* Singular integral equations - the singular value
decomposition of the Gauss Chebyshev and Lobatto Chebyshev matrices.*
Rutgers U. CS Dept * DCS-TR-133.*1983.
019069 Epstein, S.L.* Knowledge representation in mathematics: a case study in
graph theory.* Rutgers U. CS Dept * DCS-TR-134, Ph.D. Thesis. Epstein,
S.L.*1983.
019070 Corneil, D.G. Peri, Y.* Clustering and domination in perfect graphs.*
Rutgers U. CS Dept *DCS-TR-135.* 1983.
019071 Vichnevetsky, R.*The energy flow equation.* Rutgers U. CS Dept
*DCS-TR-136.*1983.
019072 Vichnevetsky, R.* Invariance theorems concerning reflection at numerical
boundaries.* Rutgers U. CS Dept * DCS-TR-137.*1983.
019073 Amarel, S.* Program synthesis as a theory formation task - problem
representations and solution methods.* Rutgers U.
Comp.Sci.Res.Lab.*CBM-TR-135.*1983.
019074 Goldberg, A. Paige, R.* Stream processing.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-046.*1983.
019075 Minsky, N. Borgida, A.*Controlling software evolution: an overview of
Darwin.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-048.*1983.
019076 Minsky, N.* Power and its distribution in software systems.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-049.*1983.
019077 Borgida, A.*Features of languages for the development of information
systems at the conceptual level.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-052.*1983.
019078 Luhukay, J.F.P.* Layout synthesis of NMOS gate cells.* Illinois U. CS
Dept *UIUCDCS-R-83-1099, Ph.D. Thesis. Luhukay, J.F.P.*1983.
019079 Coletti, N.B.* Image processing on MPP like arrays.* Illinois U. CS Dept
*UIUCDCS-R-83-1132, Ph.D. Thesis. Coletti, N.B.*1983.
019080 Ely, J. Liu, J.W.S.*A prototype binary image scaling facility.* Illinois
U. CS Dept *UIUCDCS-R-84-1143.* 1984.
019081 Lo, V.M.* Task assignment in distributed systems.* Illinois U. CS Dept
*UIUCDCS-R-84-1144, Ph.D. Thesis. Lo, V.M.*1984.
019082 Montoye, R.K.*Optimization and testing on nMOS arithmetic structures.*
Illinois U. CS Dept * UIUCDCS-R-84-1146, Ph.D. Thesis. Montoye,
R.K.*1983.
019083 Abu-Sufah, W. Lee, R.L.* Program behavior under VAX/VMS.* Illinois U. CS
Dept *UIUCDCS-R-83-1147.*1983.
019084 Campbell, R.H.* Error recovery in asynchronous systems.* Illinois U. CS
Dept *UIUCDCS-R-83-1148.*1983.
019085 Jalote, P. Campbell, R.H.* Fault tolerance using communicating sequential
processes.* Illinois U. CS Dept *UIUCDCS-R-83-1149.*1983.
019086 Chen, B. Gao, C. Jacobson, W.* Illinet network interface driver.*
Illinois U. CS Dept *UIUCDCS-R-83-1150.* 1983.
019087 Shilling, J.*The Fred user's manual.* Illinois U. CS Dept
*UIUCDCS-R-84-1151.*1984.
019088 Husmann, H.E.*High-speed format conversion and parallel I/O in numerical
programs.* Illinois U. CS Dept * UIUCDCS-R-84-1152.*1984.
019089 Campbell, R.H. Kirslis, P.A.*The SAGA project: a system for software
development.* Illinois U. CS Dept * UIUCDCS-R-83-1153.*1983.
019090 Slamet, S.* Quasi Newton and multigrid methods for semiconductor device
simulation.* Illinois U. CS Dept *UIUCDCS-R-84-1154.*1983.
019091 Shilling, J.J.*Improvements to a structured, screen oriented editor.*
Illinois U. CS Dept * UIUCDCS-R-83-1155.*1983.
019092 Kamgnia, E.R.*A numerical conformal mapping method and the Poisson
equation on irregular domains.* Illinois U. CS Dept *UIUCDCS-R-83-1157,
Ph.D. Thesis. Kamgnia, E.R.*1983.
019093 Cheng, R.F.* Naming and addressing in interconnected computer networks.*
Illinois U. CS Dept * UIUCDCS-R-84-1158, Ph.D. Thesis. Cheng, R.F.*1984.
019094 Yip, P.K.*Extraction and simulation of NMOS cells.* Illinois U. CS Dept
*UIUCDCS-R-84-1159.*1984.
019095 Kim, J.K.* Deadlock detection algorithms in distributed database
systems.* Illinois U. CS Dept * UIUCDCS-R-84-1162.*1984.
019096 Mickunas, M.D. Jalote, P. Campbell, R.H.*A new protocol for concurrency
control using both preventive and corrective techniques.* Illinois U. CS
Dept * UIUCDCS-R-84-1163.*1984.
019097 Horton, K.H.* Multicomputer interconnection using word parallel shift
register ring networks.* Illinois U. CS Dept *UIUCDCS-R-84-1164, Ph.D.
Thesis. Horton, K.H.*1984.
019098 Essick, R.B. IV* Notesfiles: a unix communications tool.* Illinois U. CS
Dept *UIUCDCS-R-84-1165.*1984.
019099 Grosky, W.I. Jain, R.* Shape matching in pyramids.* Michigan U. Computing
Res.Lab.*CRL-TR-02-84.*1984.
019100 Gurevich, Y.*Toward logic tailored for computational complexity.*
Michigan U. Computing Res.Lab.*CRL-TR-03-84.* 1984.
019101 Delp, E.J. Knoll, T.F.* Adaptive gray scale mapping to remove
registration noise in difference pictures.* Michigan U. Computing
Res.Lab.*CRL-TR-05-84.*1984.
019102 Jain, R.* Dynamic scene analysis.* Michigan U. Computing
Res.Lab.*CRL-TR-06-84.*1984.
019103 Delp, E.J. Ansari, N.*The use of the Deanza IP6400 image processor for
local window operations.* Michigan U. Computing
Res.Lab.*CRL-TR-07-84.*1984.
019104 Furchtgott, D.G.* Performability models and solutions.* Michigan U.
Computing Res.Lab.*CRL-TR-08-84, Ph.D. Thesis. Furchtgott, D.G.*1984.
019105 Rajlich, V.*An efficient algorithm for containment problem.* Michigan U.
Computing Res.Lab.*CRL-TR-09-84.*1984.
019106 Jain, R. Sethi, I.K.*Establishing correspondence of non-rigid objects
using smoothness of motion.* Michigan U. Computing
Res.Lab.*CRL-TR-10-84.*1984.
019107 O'Brien, N. Jain, R.* Axial motion stereo.* Michigan U. Computing
Res.Lab.*CRL-TR-11-84.*1984.
019108 Chow, C.H. Gouda, M.G. Lam, S.S.*A discipline for constructing multi
phase communication protocols.* Texas U. CS Dept *TR-233.*1983.
019109 Gouda, M.G. Rosier, L.E.* Priority networks of communicating finite state
machines.* Texas U. CS Dept *TR-83-10.*1983.
019110 Gouda, M.G. Yu, Y.-T.*Synthesis of communicating finite state machines
with guaranteed progress.* Texas U. CS Dept *TR-179.*1981 (revised 1982
and 1983).
019111 Brumfield, J.A.* Operational response time formulas and their sensitivity
to error.* Texas U. CS Dept * TR-83-11.*1983.
019112 Emerson, E.A. Sistla, A.P.*Deciding branching time logic: a triple
exponential decision procedure for CTL.* Texas U. CS Dept
*TR-83-12.*1983.
019113 Brown, F.M.* Set theory and its symmetric logic.* Texas U. CS Dept
*TR-83-13.*1983.
019114 Kumar, V. Kanal, L.* Parallel branch and bound formulations for and/or
tree search.* Texas U. CS Dept * TR-83-14.*1983.
019115 Brown, F.M.*Automatic analysis of the complexity of recursive functions.*
Texas U. CS Dept *TR-83-15.* 1983.
019116 Brown, F.M.* Experimental logic and the automatic analysis of
algorithms.* Texas U. CS Dept *TR-83-16.*1983.
019117 Rosier, L.E.* Presburger arithmetic with array segments, permutation and
equality.* Texas U. CS Dept * TR-83-17.*1983.
019118 Scott, D.S.*The complexity of interpolating given data in three space
with a convex function of two variables.* Texas U. CS Dept
*TR-83-18.*1983.
019119 Scott, D.S.*On the accuracy of the Gerschgorin circle theorem for
bounding the spread of a symmetric matrix.* Texas U. CS Dept
*TR-83-19.*1983.
019120 Lengauer, C.*On the mechanical transformation of program executions to
derive concurrency.* Texas U. CS Dept *TR-83-20.*1983. (revised 1984).
019121 Batory, D.S.*Modeling the physical structures of commercial database
systems.* Texas U. CS Dept *TR-83-21.* 1983.
019122 Rosier, L.E. Gouda, M.G.*Deciding progress for a class of communicating
finite state machines.* Texas U. CS Dept *TR-83-22.*1983.
019123 Ibarra, O.H. Rosier, L.E.*The equivalence problem and correctness
formulas for a simple class of programs.* Texas U. CS Dept
*TR-83-23.*1983.
019124 Simmons, R.F.*A text knowledge base for the AI handbook.* Texas U. CS
Dept *TR-83-24.*1983.
019125 Cline, A.K. Rich, E.*Building and evaluating abstract data types.* Texas
U. CS Dept *TR-83-26.*1983.
019126 Fujimura, K. Toriya, H. Yamaguchi, K. Kunii, T.L.*An enhanced oct-tree
data structure and operation for solid modeling.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 83-01.* 1983.
019127 Enomoto, H. Saito, A.* Weakly 4-lined graphs.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 83-02.*1983.
019128 Maekawa, M.*A square root of N algorithm for mutual exclusion in
decentralized systems.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-03.*1983.
019129 Fujimura, K. Toriya, H. Yamaguchi, K. Kunii, T.L.* Oct-tree algorithms
for solid modeling.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 83-04.*1983.
019130 Yamada, H.*An examination of typing process in terms of interference
between simultaneously executed heterogeneous tasks (in Japanese).*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-05.*1983.
019131 Yamada, H.*Some issues of basic research concerning Japanese input
methods for professional typists (in Japanese).* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 83-06.* 1983.
019132 Watanabe, H. Yamada, H. Ikeda, K. Saito, M.* Cognitive aspects of reflex
code typing for Japanese text.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
83-07.*1983.
019133 Maekawa, M. Sakamura, K. Ishikawa, C. Shimizu, T.* Multimedia machine.*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-08.*1983.
019134 Sato, M. Sakurai, T.* Qute: a Prolog/Lisp type language for logic
programming.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-09.*1983.
019135 Sakurai, T.* Prolog and inductive definition.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 83-10.*1983.
019136 Maekawa, M.* Distributed deadlock detection algorithms without phantom
deadlocks.* Tokyo U. Info.Sci.Dept.* Tech.Rpt. 83-11.*1983.
019137 Shimizu, T. Sakamura, K.* Mixer: an expert system for microprogramming.*
Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-12.*1983.
019138 Okadome, T. Yamada, H. Ikeda, K. Saito, M.*Another brain wave study of
cerbral hemisphericity in Japanese touch typing.* Tokyo U.
Info.Sci.Dept.*Tech.Rpt. 83-13.*1983.
019139 Yamaguchi, K. Kunii, T.L. Fujimura, K. Toriya, H.* Octree related data
structures and algorithms.* Tokyo U. Info.Sci.Dept.*Tech.Rpt.
83-14.*1983.
019140 Yamaguchi, K. Kunii, T.L.*A layered string data structure for an octree
model.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-15.*1983.
019141 Yamaguchi, K. Rogers, D.F. Satterfield, S.G. Rodriguez, F.A. Kunii, T.L.*
Computer integrated manufacturing of surfaces using octree encoding: a
preliminary report.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-16.*1983.
019142 Iizawa, A. Kunii, T.L.* Graph based design specification of parallel
computation.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 83-17.*1983.
019143 Booth, K.S. Schaeffer, J. Gentleman, W.M.* Anthropomorphic programming.*
Waterloo U. CS Dept *CS-82-47.*1984.
019144 Bartels, R.H. Jezioranski, J.J.*On least squares fitting using orthogonal
multinomials.* Waterloo U. CS Dept *CS-83-24.*1983.
019145 Abdallah, M.A.N.* Metric interpretation and greatest fixpoint semantics
of logic programs.* Waterloo U. CS Dept *CS-83-29.*1983.
019146 Bartels, R.H. Beatty, J.C. Booth, K.S. Field, D.E.* Computer graphics
laboratory Fall 1983 review.* Waterloo U. CS Dept *CS-83-33.*1983.
019147 Larson, P.-A.* Linear hashing with linear probing.* Waterloo U. CS Dept
*CS-83-38.*1984.
019148 Wood, D.*An isothetic view of computational geometry.* Waterloo U. CS
Dept *CS-84-10.*1984.
019149 Dulik, K. II Yu, S.* Iterative tree automata.* Waterloo U. CS Dept
*CS-84-03.*1984.
019150 Char, B.W. Geddes, K.O. Gonnet, G.H.*An introduction to MAPLE: sample
interactive session.* Waterloo U. CS Dept *CS-84-04.*1984.
019151 George, A. Ng, E.* Orthogonal reduction of sparse matrices to upper
triangular form using Householder transformations.* Waterloo U. CS Dept
*CS-84-05.* 1984.
019152 Karhumaeki, J. Wood, D.* Inverse morphic equivalence on languages.*
Waterloo U. CS Dept *CS-84-06.*1984.
019153 Budd, T. Hess, R. Sayward, F.* Error programs and test data for life
cycle experiments.* Yale U. CS Dept * Res.Rpt. 180.*1980.
019154 Sun, J. Jackson, K.* Nonlinear implicit one step schemes for solving
initial value problems for ordinary differential equations with steep
gradients.* Yale U. CS Dept *Res.Rpt. 215.*1982.
019155 Fischer, M.J. Michael, A.*Sacrificing serializability to attain high
availability of data in an unreliable network.* Yale U. CS Dept
*Res.Rpt. 221.*1982.
019156 Saad, Y.F.* Projection methods for solving large sparse eigenvalue
problems.* Yale U. CS Dept *Res.Rpt. 224.*1982.
019157 Eisenstat, S.C.*A note on the generalized conjugate gradient method.*
Yale U. CS Dept *Res.Rpt. 228.* 1982.
019158 Chan, T.F.* Newton like pseudo arclength methods for computing simple
turning points.* Yale U. CS Dept * Res.Rpt. 233.*1982.
019159 Chan, T.F. Saad, Y.* Iterative methods for solving bordered systems with
applications to continuation methods.* Yale U. CS Dept *Res.Rpt.
235.*1982.
019160 Fischer, M.J. Lynch, N.A. Paterson, M.S.*Impossibility of distributed
consensus with one faulty process.* Yale U. CS Dept *Res.Rpt.
245.*1982.
019161 Douglas, C.C.*A multi grid optimal order solver for elliptic boundary
value problems.* Yale U. CS Dept * Res.Rpt. 248.*1982.
019162 Fischer, M.J. Paterson, M.S.* Storage requirements for fair scheduling.*
Yale U. CS Dept *Res.Rpt. 251.*1982.
019163 Fischer, M.J. Salzberg, S.L.*Finding a majority among N votes.* Yale U.
CS Dept *Res.Rpt. 252.*1982.
019164 Fisher, J.A.* Very long instruction word architectures and the ELI-512.*
Yale U. CS Dept *Res.Rpt. 253.*1983.
019165 Saad, Y. Schultz, M.H.* GMRES: a generalized minimal residual algorithm
for solving nonsymmetric linear systems.* Yale U. CS Dept *Res.Rpt.
254.*1982.
019166 Lowney, P.G.* Carrier arrays: an extension to APL.* Yale U. CS Dept
*Res.Rpt. 256, Ph.D. Thesis. Lowney, P.G.*1983.
019167 Ehrlich, K. Soloway, E. Abbott, V.* Transfer effects from programming to
algebra word problems: a preliminary study.* Yale U. CS Dept *Res.Rpt.
257.*1982.
019168 Soloway, E. Rubin, E. Woolf, B. Bonor, J. Johnson, W.L.* MENO-II: an
AI-based programming tutor.* Yale U. CS Dept *Res.Rpt. 258.*1982.
019169 Chan, T.F. Schreiber, R.* Parallel networks for multi grid algorithms:
architecture and complexity.* Yale U. CS Dept *Res.Rpt. 262.*1983.
019170 Chan, T.F. Saied, F.*A comparison of elliptic solvers for general two
dimensional regions.* Yale U. CS Dept * Res.Rpt. 263.*1983.
019171 Miller, D.* Scheduling heuristics for problem solvers.* Yale U. CS Dept
*Res.Rpt. 264.*1983.
019172 Eisenstat, S.C. Elman, H.C. Schultz, M.H. Sherman, A.H.*The (new) Yale
sparse matrix package.* Yale U. CS Dept * Res.Rpt. 265.*1983.
019173 Elman, H.C.* Iterative methods for non self adjoint elliptic problems.*
Yale U. CS Dept *Res.Rpt. 266.* 1983.
019174 Baldwin, D. Kelsey, R. Ruttenberg, J. Fisher, J. Ellis, J.R.*Design and
use of the Yale digital similator.* Yale U. CS Dept *Res.Rpt. 267.*1983.
019175 Hudak, P.* Distributed graph marking.* Yale U. CS Dept *Res.Rpt.
268.*1983.
019176 Dongarra, J.J. Eisenstat, S.C.*Squeezing the most out of an algorithm in
Cray Fortran.* Yale U. CS Dept * Res.Rpt. 269.*1983.
019177 Riesbeck, C.K.* Knowledge reorganization and reasoning style.* Yale U. CS
Dept *Res.Rpt. 270.*1983.
019178 Gelernter, D. Gelernter, J.* Expert systems and diagnostic monitors.*
Yale U. CS Dept *Res.Rpt. 271.*1983.
019179 Schultz, M.H.*Solving elliptic problems on an array processor system.*
Yale U. CS Dept *Res.Rpt. 272.* 1983.
019180 Fischer, M.J.*The consensus problem in unreliable distributed systems (a
brief survey).* Yale U. CS Dept *Res.Rpt. 272.*1983.
019181 McDermott, D.*The NISP manual.* Yale U. CS Dept * Res.Rpt. 274.*1983.
019182 Douglas, C.C.*Abstract multi grid with applications to elliptic boundary
value problems.* Yale U. CS Dept * Res.Rpt. 275.*1983.
019183 Saad, Y.* Least squares polynomials in the complex plane with
applications to solving sparse nonsymmetric matrix problems.* Yale U. CS
Dept *Res.Rpt. 276.*1983.
019184 Gropp, W.D.* Local uniform mesh refinement for elliptic partial
differential equations.* Yale U. CS Dept * Res.Rpt. 278.*1983.
019185 St. Mary, D.F. Lee, D.*Analysis of an implicit finite difference solution
to an underwater wave propagation problem.* Yale U. CS Dept *Res.Rpt.
279.*1983.
019186 Smith, F.T.* Large scale separation and wake closure/reattachment - the
Cascade problem.* Yale U. CS Dept *Res.Rpt. 281.*1983.
019187 Saad, Y. Schultz, M.H.* Conjugate gradient like algorithms for solving
nonsymmetric linear systems.* Yale U. CS Dept *Res.Rpt. 283.*1983.
019188 Johnson, W.L. Soloway, E.* PROUST: Knowledge based program
understanding.* Yale U. CS Dept *Res.Rpt. 285.* 1983.
019189 Johnson, W.L. Soloway, E. Cutler, B. Draper, S.* Bug catalogue: I.* Yale
U. CS Dept *Res.Rpt. 286.* 1983.
019190 Elman, H.C. Schultz, M.H.* Preconditioning by fast direct methods for non
self adjoint nonseparable elliptic equations.* Yale U. CS Dept *Res.Rpt.
287.*1983.
VOL. 6, NO. 6 05/28/84
019191 Martin, M.A.*A Pascal color graphics package for the IBM PC.* IBM Watson
Res. Center.*RC 10009.*1983.
019192 Pickover, C.A.*The use of a vector graphics system in the generation of
facial multivariate point representations for data series.* IBM Watson
Res. Center.*RC 10156.*1983.
019193 Barnes, E.R. Hoffman, A.J.*On transportation problems with upper bounds
on leading rectangles.* IBM Watson Res. Center.*RC 10158.*1983.
019194 Iyer, B.R. Sinclair, J.B.* Dynamic memory interconnections for rapid
access.* IBM Watson Res. Center.*RC 10160.* 1983.
019195 Berger, L. MacNair, E.A.*The research queueing package: full screen
model construction.* IBM Watson Res. Center.* RC 10161.*1983.
019196 Miyahara, G. Nishida, T. Takashima, K.* Distributed queueing network
simulator with multi micro processors.* IBM Watson Res. Center.*RC
10162.*1983.
019197 Unger, S.H.*Assigning delay values to meet long and short path
constraints.* IBM Watson Res. Center.*RC 10166.* 1983.
019198 Dahmen, W. Micchelli, C.A.*On the optimal approximation rates for criss
cross finite element spaces.* IBM Watson Res. Center.*RC 10168.*1983.
019199 Gopal, I.S. Segall, A.* Dynamic address assignment protocols.* IBM Watson
Res. Center.*RC 10173.*1983.
019200 Scranton, R.A. Thompson, D.A. Hunter, D.W.*The access time myth.* IBM
Watson Res. Center.*RC 10197.*1983.
019201 Pickover, C.A.*Characterization of melody patterns using topographic
spectral distribution functions.* IBM Watson Res. Center.*RC
10140.*1983.
019202 Carroll, J.M.* Presentation and form in user interface architecture.* IBM
Watson Res. Center.*RC 10144.*1983.
019203 Nelson, R.F. Iyer, B.R.*Analysis of a replicated data base.* IBM Watson
Res. Center.*RC 10148.*1983.
019204 Huang, S.-H.S. Wong, C.K.* Generalized binary split trees.* IBM Watson
Res. Center.*RC 10150.*1983.
019205 Franaszek, P. Robinson, J.T.*Limitations of concurrency in transaction
processing.* IBM Watson Res. Center.*RC 10151.*1983.
019206 Adams, E.N.*Optimizing preventive service of software.* IBM Watson Res.
Center.*RC 10152.*1983.
019207 Wagner, E.G. Bloom, S.L. Thatcher, J.W.*Why algebraic theories?* IBM
Watson Res. Center.*RC 10171.*1983.
019208 Coppersmith, D.*Fast evaluation of logarithms in fields of characteristic
two.* IBM Watson Res. Center.*RC 10187.* 1983.
019209 Evangelisti, C.J. Goertzel, G.*The architecture of a decision support
system.* IBM Watson Res. Center.*RC 10205.*1983.
019210 Ferrante, J. Ottenstein, K.J. Warren, J.D.*The program dependence graph
and its use in optimization.* IBM Watson Res. Center.*RC 10208.*1983.
019211 Blum, A. Donatiello, L. Heidelberger, P. Lavenberg, S.S. MacNair,
E.A.*Experiments with decomposition of extended queueing network
models.* IBM Watson Res. Center.*RC 10213.*1983.
019212 Grossman, D.D.*Teaching robotics with a video game on the IBM PC.* IBM
Watson Res. Center.*RC 10216.*1983.
019213 Kruskal, V.*Managing multi version programs with an editor.* IBM Watson
Res. Center.*RC 10217.*1983.
019214 Chen, T.C. Schlag, M.D.F. Wong, C.K.*The hypercube connection network.*
IBM Watson Res. Center.*RC 10219.* 1983.
019215 Nackman, L.R. Pizer, S.M.* Three dimensional shape description using the
symmetric axis transform I: theory.* IBM Watson Res. Center.*RC
10223.*1983.
019216 Adler, R.L. Kitchens, B. Marcus, B.H.* Finite group actions on shifts of
finite type.* IBM Watson Res. Center.*RC 10236.*1983.
019217 Haltsonen, S.*Improved dynamic time warping methods for discrete
utterance.* IBM Watson Res. Center.*RC 10239.* 1983.
019218 Haltsonen, S.*Recognition of isolated word sentences from a large
vocabulary using dynamic time warping methods.* IBM Watson Res.
Center.*RC 10240.*1983.
019219 Grossman, B.M. Buturia, E.M. Cottrell, P.E.* Finite element solution of
the semiconductor transport equations.* IBM Watson Res. Center.*RC
10241.*1983.
019220 Micchelli, C.A. Sharma, A.* Convergence of complete spline interpolation
for holomorphic functions.* IBM Watson Res. Center.*RC 10245.*1983.
019221 Segall, A. Jaffe, J.M.*A distributed protocol for maintaining central
network control.* IBM Watson Res. Center.*RC 10246.*1983.
019222 Miranker, W.L. Rump. S.M.*Case studies for ACRITH: I. Ill posed problems
and II. Stiff differential systems.* IBM Watson Res. Center.*RC
10249.*1983.
019223 Jaffe, J.M. Segall, A.*Automatic update of replicated topology data
bases.* IBM Watson Res. Center.*RC 10254.* 1983.
019224 Pickover, C.A.* Symmetrized random dot patterns.* IBM Watson Res.
Center.*RC 10256.*1983.
019225 Kaucher, E. Miranker, W.L.* Iterative residual correction and self
validating numerics in functoids.* IBM Watson Res. Center.*RC
10260.*1983.
019226 Cobham, A.* Stochastic automata with large state spaces and low rank.*
IBM Watson Res. Center.*RC 10262.*1983.
019227 Suhl, U.H.*Solving large scale mixed integer programs with fixed charge
variables.* IBM Watson Res. Center.*RC 10266.*1983.
019228 Roth, J.P.* Verification of change in VLSI computer design file: Vc.* IBM
Watson Res. Center.*RC 10267.*1983.
019229 Cristian, F.*A rigorous approach to fault tolerant system development
(extended abstract).* IBM Watson Res. Center.* RJ 4008.*1983.
019230 Fagin, R. Klawe, M.M. Pippenger, N.J. Stockmeyer, L.* Bounded depth
polynomial size circuits for symmetric functions.* IBM Watson Res.
Center.*RJ 4040.*1983.
019231 Ghosh, S.P.*An application ofstatistical databases in manufacturing
testing.* IBM Watson Res. Center.*RJ 4055.* 1983.
019232 Dinstein, I. Merkle, F. Lam, T.D. Wong, K.Y.* Imaging system response
linearization and shading correction.* IBM Watson Res. Center.*RJ
4044.*1983.
019233 Schubert, K.D.* Resource management in the VM environment - a short
discussion.* IBM Watson Res. Center.*RJ 4049.* 1983.
019234 Harel, D. Paterson, M.S.* Undecidability of PDL with L =
left-curly-bracket 2 superscript 2 superscript i / i
greater-than-or-equal-to 0 right-curly bracket.* IBM Watson Res.
Center.*RJ 4066.*1983.
019235 Stockmeyer, L.*On approximation algorithms for #P.* IBM Watson Res.
Center.*RJ 4071.*1983.
019236 Klawe, M.M.*A tight bound for black and white pebbles on the pyramid.*
IBM Watson Res. Center.*RJ 4072.*1983.
019237 Gladney, H.M.* CONCISE language reference manual. Version 2.*
019238 Sacca, D. Wiederhold, G.* Database partitioning in a cluster of
processors.* IBM Watson Res. Center.*RJ 4076.* 1983.
019239 Allender, E. Klawe, M.*Improved lower bounds for the cycle detection
problem.* IBM Watson Res. Center.*RJ 4078.* 1983.
019240 German, S.M. Halpern, J.Y.*On the power of the hypothesis of
expressiveness.* IBM Watson Res. Center.*RJ 4079.* 1983.
019241 Jipson, V.B. Ahn, K.Y.*Materials for optimal storage.* IBM Watson Res.
Center.*RJ 4112.*1983.
019242 Iglehart, D.L. Shedler, G.S.* Simulation output analysis for local area
computer networks.* IBM Watson Res. Center.*RJ 4020.*1983.
019243 Iglehart, D.L. Shedler, G.S.* Simulation for passage times in
non`Markovian networks of queues.* IBM Watson Res. Center.*RJ
4021.*1983.
019244 Lochovsky, F.H.*A knowledge based approach to supporting office work.*
IBM Watson Res. Center.*RJ 4027.*1983.
019245 Gajski, D. Kim, W. Fushimi, S.*A parallel pipelined relational query
processor: an architectural overview.* IBM Watson Res. Center.*RJ
4087.*1983.
019246 Rudin, H.*Some user of telecommunication needs: a summary.* IBM Watson
Res. Center.*RZ 1251.*1983.
019247 Svobodova, L.* File servers for network based distributed systems:
updated version of RZ 1186 (November 2, 1982).* IBM Watson Res.
Center.*RZ 1258.*1983.
019248 Bux, W.* Performance issues in local area networks.* IBM Watson Res.
Center.*RZ 1268.*1983.
019249 Persson, M.*Manual of the microprogram simulator generator of Micgen.*
Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8312.*1983.
019250 Lisper, B.*Description and synthesis of systolic arrays.* Royal Inst. of
Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8318.*1983.
019251 Hedetniemi, S.M. Proskurowski, A. Syslo, M.M.* Interior graphs of maximal
outerplane graphs.* Royal Inst. of Tech., Stockholm. Num.Anal. &
Computing Sci.Dept.* TRITA-NA-8401.*1984.
019252 Arnborg, S. Proskurowski, A.*Characterization and recognition of partial
k trees.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8402.* 1984.
019253 Arnborg, S. Proskurowski, A.* Linear time algorithms for NP hard problems
on graphs embedded in k trees.* Royal Inst. of Tech., Stockholm.
Num.Anal. & Computing Sci.Dept.* TRITA-NA-8404.*1984.
019254 The integral projects: progress report, 1983.* Royal Inst. of Tech.,
Stockholm. Num.Anal. & Computing Sci.Dept.* TRITA-NA-8405, Royal Inst.
of Tech., Stockholm. Num.Anal. & Computing Sci.Dept. INTEGRAL
Project.*INTEGRAL-15.1984.
019255 Arnborg, S.* Design methods for microelectronics and software: progress
report and research program.* Royal Inst. of Tech., Stockholm. Num.Anal.
& Computing Sci.Dept.*TRITA-NA-8406.*1984.
019256 Haridi, S. Ciepielewski, A.*An or parallel token machine.* Royal Inst. of
Tech., Stockholm. Telecomm. & Comp. Systems Dept.*TRITA-CS-8303.*1983.
019257 Haridi, S. Sahlin, D.*Evaluation of logic programs based on natural
deduction.* Royal Inst. of Tech., Stockholm. Telecomm. & Comp. Systems
Dept.*TRITA-CS-8305 B.*1983.
019258 CSALAB progress report.* Royal Inst. of Tech., Stockholm. Telecomm. &
Comp. Systems Dept.*TRITA-CS-8306.*1983.
019259 Tenenbaum, J.M. Fischler, M.A. Barrow, H.G.* Scene modeling: a structural
basis for image description.* SRI International. A.I. Center.*Tech.Note
221.*1980.
019260 Haas, N. Hendrix, G.G.*An approach to acquiring and applying knowledge.*
SRI International. A.I. Center.* Tech.Note 227.*1980.
019261 Gendrix, G.G. Lewis, W.H.* Transportable natural language interfaces to
databases.* SRI International. A.I. Center.* Tech.Note 228.*1981.
019262 Nilsson, N.J.*The interplay between experimental and theoretical methods
in artificial intelligence.* SRI International. A.I. Center.*Tech.Note
229.*1980.
019263 Walker, D.E. Hobbs, J.R.* Natural language access to medical text.* SRI
International. A.I. Center.*Tech.Note 240.*1981.
019264 Pereira, F.* Logic for natural language analysis.* SRI International.
A.I. Center.*Tech.Note 275, Ph.D. Thesis. Pereira, F.*1983. (Slightly
revised version of a thesis submitted to the Department of Artificial
Intelligence, University of Edinburgh for the degree of Doctor of
Philosophy).
019265 Fischler, M.A. Wolf, H.C.*A general approach to machine perception of
linear structure in imaged data.* SRI International. A.I.
Center.*Tech.Note 276.*1983.
019266 Hanson, A.J.*The DARPA/DMA image understanding testbed user's manual.
Version 1.1.* SRI International. A.I. Center.*Tech.Note 277.*1984.
019267 Cheeseman, P.*A representation of time for planning.* SRI International.
A.I. Center.*Tech.Note 278.*1983.
019268 Shieber, S.M.* Sentence disambiguation by a shift reduce parsing
technique.* SRI International. A.I. Center.* Tech.Note 281.*1983.
019269 Pereira, F.C.N.*Can drawing be liberated from the von Neumann style?* SRI
International. A.I. Center.*Tech.Note 282.*1983.
019270 Shieber, S.M. Stucky, S.U. Uszkoreit, H. Robinson, J.J.* Formal
constraints on metarules.* SRI International. A.I. Center.*Tech.Note
283.*1983.
019271 Moore, R.C.* Semantical considerations on nonmonotonic logic.* SRI
International. A.I. Center.*Tech.Note 284.* 1983.
019272 Uszkoreit, H.*A framework for processing partially free word order.* SRI
International. A.I. Center.*Tech.Note 285.*1983.
019273 Stickel, M.E.* Theory resolution: building in nonequational theories.*
SRI International. A.I. Center.*Tech.Note 286.* 1983.
019274 Smith, G.B.* Shape from shading: an assessment.* SRI International. A.I.
Center.*Tech.Note 287.*1983.
019275 Laws, K.I.*The Ghough generalized Hough transform package: description
and evaluation.* SRI International. A.I. Center.*Tech.Note 288.*1982.
019276 Laws, K.I.*The Phoenix image segmentation system: description and
evalution.* SRI International. A.I. Center.*Tech.Note 289.*1982.
019277 Warren, D.H.D.* Applied logic - its use and implementation as a
programming tool.* SRI International. A.I. Center.* Tech.Note 290, Ph.D.
Thesis. Warren, D.H.D.*1983. (Verbatim copy of a thesis submitted to
the Department of Artificial Intelligence, University of Edinburgh in
1977 for the degree of Doctor of Philosophy).
019278 Shieber, S.M.* Direct parsing of ID/LP grammars.* SRI International. A.I.
Center.*Tech.Note 291R.*1983 (revised).
019279 Grosz, B.J. Joshi, A.K. Weinstein, S.*Providing a unified account of
definite noun phrases in discourses.* SRI International. A.I.
Center.*Tech.Note 292.*1983.
019280 Martin, P. Appelt, D. Pereira, F.* Transportability and generality in a
natural language interface system.* SRI International. A.I.
Center.*Tech.Note 293.*1983.
019281 Konolige, K.*A deductive model of belief.* SRI International. A.I.
Center.*Tech.Note 294.*1983.
019292 Pereira, F.C.N. Warren, D.H.D.* Parsing as deduction.* SRI International.
A.I. Center.*Tech.Note 295.*1983.
019283 Pereira, F.C.N.*A new characterization of attachment preferences.* SRI
International. A.I. Center.*Tech.Note 296.*1983.
019284 Appelt, D.E.* Telegram: a grammar formalism for language planning.* SRI
International. A.I. Center.*Tech.Note 297.* 1983.
019285 Laws, K.I.*The DARPA/DMA image understanding testbed: programmer's
manual. Version 1.1.* SRI International. A.I. Center.*Tech.Note
298.*1984.
019286 Laws, K.I. Smith, G.B.*The RELAX image relaxation system: description
and evaluation.* SRI International. A.I. Center.*Tech.Note 301.*1983.
019287 Stucky, S.U.* Metarules as meta node admissibility conditions.* SRI
International. A.I. Center.*Tech.Note 304.*1983.
019288 Tick, E.*An overlapped Prolog processor.* SRI International. A.I.
Center.*Tech.Note 308.*1983.
019289 Warren, D.H.D.*An abstract Prolog instruction set.* SRI International.
A.I. Center.*Tech.Note 309.*1983.
019290 Appelt, D.* Planning English referring expressions.* SRI International.
A.I. Center.*Tech.Note 312.*1983.
019291 Barnard, S.T.*Choosing a basis for perceptual space.* SRI International.
A.I. Center.*Tech.Note 315.*1984.
019292 Nilsson, N.J.*The SRI artificial intelligence center: a brief history.*
SRI International. A.I. Center.*Tech.Note 317.*1984.
019293 Moore, R.C.*A formal theory of knowledge and action.* SRI International.
A.I. Center.*Tech.Note 320.*1984.
019294 Nilsson, N.J.* Probabilistic logic.* SRI International. A.I.
Center.*Tech.Note 321.*1984.
019295 Nilsson, N.J.* Artificial intelligence, employment, and income.* SRI
International. A.I. Center.*Tech.Note 322.* 1984.
019296 Matula, D.W. Dolev, D.* Path regular graphs.* Southern Methodist U.
Comp.Sci. & Eng.Dept.*82-CSE-03.*1982.
019297 Korfhage, R.R.* Forest based sigma polynomials and hypergraph colorings.*
Southern Methodist U. Comp.Sci. & Eng.Dept.*82-CSE-04.*1982.
019298 Johri, A. Matula, D.W.* Probabilistic bounds and heuristic algorithms.*
Southern Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-06.*1982.
019299 Matula, D.W.* Cluster validity by concurrent chaining.* Southern
Methodist U. Comp.Sci. & Eng.Dept.*82-CSE-09.* 1982.
019300 Korfhage, R.R.* Sigma polynomials for color weighted graphs, I.* Southern
Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-13.*1982.
019301 Korfhage, R.R.* Sigma polynomials for color weighted graphs, II.*
Southern Methodist U. Comp.Sci. & Eng.Dept.* 82-CSE-14.*1982.
019302 Yun, D.Y.Y.* Personal computers as knowledge base development
environment.* Southern Methodist U. Comp.Sci. &
Eng.Dept.*83-CSE-10.*1983.
019303 Matula, D.W. Kornerup, P.* Finite precision rational arithmetic: slash
number systems.* Southern Methodist U. Comp.Sci. &
Eng.Dept.*83-CSE-11.*1983.
019304 Biswas, P. Majumdar, A.K.*A supervised learning algorithm for
hierarchical classification of fuzzy patterns.* Southern Methodist U.
Comp.Sci. & Eng.Dept.*83-CSE-12.* 1983.
019305 Meandzija, B.*Dynamic protocol definition.* Southern Methodist U.
Comp.Sci. & Eng.Dept.*83-CSE-13.*1983.
019306 Zhang, C-n. Yun, D.Y.Y.*An area time optimal systolic network for
discrete Fourier transform.* Southern Methodist U. Comp.Sci. &
Eng.Dept.*83-CSE-14.*1983.
019307 Eastman, C.M.*Experimental procedures in the evaluation of file
organizations for multikey retrieval.* Southern Methodist U. Comp.Sci. &
Eng.Dept.*83-CSE-15.*1983.
019308 Meandzija, B.*Automated generation of communication systems.* Southern
Methodist U. Comp.Sci. & Eng.Dept.* 83-CSE-16.*1983.
019309 Korfhage, R.R.* Data structures and access.* Southern Methodist U.
Comp.Sci. & Eng.Dept.*83-CSE-17.*1983.
019310 Boley, H.*From pattern directed to adapter driven computation via
function applying matching.* Kaiserslautern U. Fachbereich
Informatik.*Memo Seki-83-06.*1983.
019311 Boley, G.* Fit - Prolog: a functional relational language comparison.*
Kaiserslautern U. Fachbereich Informatik.* Memo Seki-83-14.*1983.
019312 Nielsen, T.*Effect of cell geometry of throughput in a model with
capture.* Arizona U. Comp.Sci.Dept.*TR 83-13.* 1983.
019313 Griswold, R.E.*Understanding pattern matching - a cinematic display of
string scanning.* Arizona U. Comp.Sci.Dept.*TR 83-14.*1983.
019314 Griswold, R.E.*The description and manipulation of sequences.* Arizona U.
Comp.Sci.Dept.*TR 83-15.*1983.
019315 Griswold, R.E.* Seque: an experimental language for manipulating
sequences.* Arizona U. Comp.Sci.Dept.*TR 83-16.*1983.
019316 Gopal, A. Budd, T.* Program testing by specification mutation.* Arizona
U. Comp.Sci.Dept.*TR 83-17.*1983.
019317 Budd, T.A. Miller, W.*Testing numerical software.* Arizona U.
Comp.Sci.Dept.*TR 83-18.*1983.
019318 Griswold, R.E.*The construction of variant translators for Icon.* Arizona
U. Comp.Sci.Dept.*TR 83-19.*1983.
019319 Griswold, R.E.*The implementation of an experimental language for
manipulating sequences.* Arizona U. Comp.Sci.Dept.*TR 83-20.*1983.
019320 Davidson, J.W. Fraser, C.W.* Code selection through object code
optimization.* Arizona U. Comp.Sci.Dept.*TR 83-21.* 1983.
019321 Davidson, J.W. Fraser, C.W.*Automatic generation of peephole
optimizations.* Arizona U. Comp.Sci.Dept.*TR 83-22.*1983.
019322 Draper, S.W. Norman, D.A.* Software engineering for user interfaces.*
California U., San Diego. Inst. for Cognitive Sci.*ICS Rpt. 8401.*1984.
019323 Smolensky, P.* Harmony theory: a mathematical framework for stochastic
parallel processing.* California U., San Diego. Inst. for Cognitive
Sci.*ICS Rpt. 8308.*1983.
019324 Ehrenfeucht, A. Rozenberg, G. Verraedt, R.*A combinatorial property of
EOL languages.* Colorado U. Comp.Sci.Dept.* CU-CS-288-82.*1982.
019325 Schnabel, R.B. Koontz, J.E. Weiss, B.E.*A modular system of algorithms
for unconstrained minimization.* Colorado U.
Comp.Sci.Dept.*CU-CS-240-82.*1982.
019326 Perry, M.*Software aid for optimizing 0-1 matrices.* Colorado U.
Comp.Sci.Dept.*CU-CS-242-82.*1982.
019327 Main, M.G. Lorentz, R.J.*An 0(n log n) algorithm for finding all
repetitions in a string.* Colorado U.
Comp.Sci.Dept.*CU-CS-241-82.*1982.
019328 Schnabel, R.B. Frank, P.D.* Tensor methods for nonlinear equations.*
Colorado U. Comp.Sci.Dept.*CU-CS-243-83.* 1983.
019329 Perry, R.M.*Computer techniques for cluster analysis.* Colorado U.
Comp.Sci.Dept.*CU-CS-244-83.*1983.
019330 Shultis, J.*A functional shell.* Colorado U. Comp.Sci.Dept.*
CU-CS-245-83.*1983.
019331 Main, M. Benson, D.B.* Functional behavior of nondeterministic and
concurrent programs.* Colorado U. Comp.Sci.Dept.*CU-CS-246-83.*1983.
019332 Schnabel, R.B.* Quasi Newton methods using multiple secant equations.*
Colorado U. Comp.Sci.Dept.*CU-CS-247-83.* 1983.
019333 Clemm, G.M.* FSCAN-83 report and user's manual.* Colorado U.
Comp.Sci.Dept.*CU-CS-248-83.*1983.
019334 Clemm, G.M.* TREGRM-83 report and user's manual.* Colorado U.
Comp.Sci.Dept.*CU-CS-249-83.*1983.
019335 Baker, D.A.* EASE--an extensible abstract structure editor.* Colorado U.
Comp.Sci.Dept.*CU-CS-250-83.*1983.
019336 Janssens, D. Rozenberg, G.* Graph grammars with node label controlled
rewriting and embedding.* Colorado U.
Comp.Sci.Dept.*CU-CS-251-83.*1983.
019337 Gabow, H.N.*An efficient reduction technique for degree constrained
subgraph and bidirected network flow problems.* Colorado U.
Comp.Sci.Dept.*CU-CS-252-82.*1982.
019338 Perry, R.M.*A number sequence relating to the closepacking of primes.*
Colorado U. Comp.Sci.Dept.*CU-CS-253-83.* 1983.
019339 Gabow, H.N. Tarjan, R.E.*A linear time algorithm for a special case of
disjoint set union.* Colorado U. Comp.Sci.Dept.*CU-CS-261-82.*1982.
019340 Helman, P. Rosenthal, A.*A decomposition scheme for combinational
circuits.* New Mexico U. Comp.Sci.Dept.* Tech.Rpt. CS-83-01.*1983.
019341 Manthey, M.J.* Hierarchy in sequential and concurrent systems or What's
in a reply.* New Mexico U. Comp.Sci.Dept.*Tech.Rpt. CS-83-02.*1983.
019342 Ingham, K.L. Ziegler, W.S. Luger, G.F.* HECTOR: a logic based parser,
semantic interpreter, and planner.* New Mexico U.
Comp.Sci.Dept.*Tech.Rpt. CS-83-04.*1983.
019343 Lander, R. Luger, G. Stibbard, P. Alverson, D.*A newborn intensive care
monitoring system: providing medical personnel information handling
capabilities at a reasonable cost.* New Mexico U.
Comp.Sci.Dept.*Tech.Rpt. CS-83-05.*1983.
019344 Moret, B.M.E. Thomason, M.G.* Boolean differences techniques for time
sequence & common cause analysis of fault trees.* New Mexico U.
Comp.Sci.Dept.*Tech.Rpt. CS-83-06.*1983.
019345 Manthey, M.J.* Nondeterminism can be casual.* New Mexico U.
Comp.Sci.Dept.*Tech.Rpt. CS-83-07.*1983.
019346 Neufeld, E.M.*Construction of reliable series parallel networks: a
combinatorial approach.* Saskatchewan U. Computational Sci.Dept.*Rpt.
84-01.*1984.
019347 Peachey, D.R. Bunt, R.B. Williamson, C.L. Brecht, T.B.*An experimental
investigation of scheduling strategies for UNIX.* Saskatchewan U.
Computational Sci.Dept.*Rpt. 84-02.*1984.
019348 Harms, D.D.*An investigation into bounds on network reliability.*
Saskatchewan U. Computational Sci.Dept.* Rpt. 84-03.*1984.
019349 El-Mallah, E.S.* Recursive graph structure and the optimum communication
spanning tree problem.* Saskatchewan U. Computational Sci.Dept.*Rpt.
84-04.*1984.
019350 Wald, J.A. Sorenson, P.G.*The entity relationship involvement data model
and minimum cost objects.* Saskatchewan U. Computational Sci.Dept.*Rpt.
84-05.*1984.
019351 Hamilton, H.J. Sorenson, P.G. Tremblay, J.P.*Survey of dynamic hashing
techniques.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-06.*1984.
019352 Channen, E.W. Sorenson, P.G. Tremblay, J.P.* Structured systems analysis
using SPSL/SPSA.* Saskatchewan U. Computational Sci.Dept.*Rpt.
84-07.*1984.
019353 Zeigler, B.P. Oren, T.I.* Simulation education: software-augmented
textbooks emphasizing modelling concepts.* Wayne State U.
019354 Kampfner, R.*The analysis of an organization's systemic structure and the
determination of its information requirements.* Wayne State U.
Comp.Sci.Dept.*CSC-83-010.* 1983. requirements.010.*1983.
019355 Conrad, M.*Design principles for a molecular computer.* Wayne State U.
Comp.Sci.Dept.*CSC-83-011.*1983.
019356 Grosky, W.I. Lu, Y.* Iconic indexing using generalized pattern matching
techniques.* Wayne State U. Comp.Sci.Dept.*CSC-84-001.*1984.
019357 Boogs, D.R.* Internet broadcasting.* Xerox. Palo Alto Res.
Center.*CSL-83-03, Ph.D. Thesis. Boggs, D.R.*1983. (This report
reproduces a dissertation submitted to the Department of Electrical
Engineering of Stanford University in partial fulfillment of the
requirements for the degree of Doctor of Philosophy).
019358 Guttag, J.V. Horning, J.J.*Preliminary report on the Larch shared
language.* Xerox. Palo Alto Res. Center.* CSL-83-06.*1983.
019359 Birrell, A.D. Nelson, B.J.*Implementing remote procedure calls.* Xerox.
Palo Alto Res. Center.*CSL-83-07.*1983.
019360 Ranshaw, L.*Deftly replacing go to statements with exit's.* Xerox. Palo
Alto Res. Center.*CSL-83-10.*1983.
019361 Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.* Grapevine: two
papers and a report.* Xerox. Palo Alto Res. Center.*CSL-83-12.*1983.
CONTENTS: (1) Birrell, A.D. Levin, R. Needham, R.M. Schroeder, M.D.*
Grapevine: an exercise in distributed computing; (2) Schroeder, M.D.
Birrell, A.D. Needham, R.M.*Experience with Grapevine: the growth of a
distributed system; (3) Birrell, A.D.*The Grapevine interface.
019362 Barlow, R.E. Shor, S.W.W.*Informative stopping rules.* California U.,
Berkeley. O.R. Center.*ORC 84-01.*1984.
019363 Chistov, A.L. Grigoryev, D.Y.* Subexponential time solving systems of
algebraic equations. I.* U.S.S.R. Academy of Sci. Steklov Math.Inst.
Leningrad Dept.*LOMI Preprints E-09-83.*1983.
019364 Chistov, A.L. Grigoryev, D.Y.* Subexponential time solving systems of
algebraic equations. II.* U.S.S.R. Academy of Sci. Steklov Math.Inst.
Leningrad Dept.*LOMI Preprints E-10-83.*1983.
019365 Cohen, R.*A computational model for the analysis of arguments.* Toronto
U. Comp. Systems Res. Group.* CSRG-151, Ph.D. Thesis. Cohen, R.*1983.
019366 Fermilab Industrial Affiliates Roundtable on Supercomputer developments
in the Universities: Fermilab Industrial Affiliates Third Annual
Meeting, May 19, 1983. Sponsored by Fermilab and the Fermilab Industrial
Affiliates.* Fermi National Accelerator Laboratory, Batavia, Illinois.*
1983.
019367 Fischer, T.*On the weighted path length of multidimensional ternary
search trees.* DDR. Akademie der Wissenschaften. Institut fuer
Mathematik, Berlin.*P-Math-16/83.*1983.
019368 Koskimies, K.*Extensions of one-pass attribute grammars.* Helsinki U.
Comp.Sci.Dept.*Rpt. A-1983-04.*1983.
019369 Lobb, R.J. Mugridge, W.B.* AUSCNET - a status report.* Auckland U.
Comp.Sci.Dept.*Rpt. 032.*1983.
019370 Loefgren, M. Magnusson, B.*An execution environment for Simula on a small
computer.* Lund U. Lund Inst. of Tech. Comp.Sci.Dept.*1984.
019371 Marshall, R.M. Buchanan, I.* SCALE: a language for VLSI design.*
Edinburgh U. Comp.Sci.Dept.*CSR-158-84.*1984.
019372 Price, W.L.*A sixth annotated bibliography of recent publications on data
security and cryptography.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 35/83.*1983.
019373 Shilcrat, E. Panangaden, P. Henderson, T.*Implementing multi sensor
systems in a functional language.* Utah U.
Comp.Sci.Dept.*UUCS-84-001.*1984.
019374 Slagle, J.R. Gaynor, M.W. Hamburger, H.* Decision support system for fire
support command and control.* U.S. Naval Res.Lab.*NRL Rpt. 8769.*1983.
019375 Thune, M.* IBSTAB - a software system for automatic stability analysis of
difference methods for hyperbolic initial boundary value problems.*
Uppsala U. Comp.Sci.Dept.*Rpt. 93.*1984.
019376 Ferm, L.*Numerical methods for inviscid flow with open boundaries.*
Uppsala U. Comp.Sci.Dept.*Rpt. 95.*1984. CONTENTS: (1) Ferm, L.
Gustafsson, B.*A downstream boundary prodedure for the Euler
equation.*1982 (Reprint: Computer and Fluids, v.10, no.4, pp.261-276);
(2) Ferm, L.* Open boundary procedures for stationary inviscid flow
problems.* Uppsala U. Comp.Sci.Dept.*Rpt. 94.*1984.
VOL. 6, NO. 7 06/11/84
019377 Gay, D.M. *On convergence testing in model trust region algorithms for
unconstrained optimization. * Bell Labs. * CS Tech Rpt 104. *1982.
019378 Kaufman, L. *Usage of the sparse matrix programs in the PORT library. *
Bell Labs. *CS Tech Rpt 105. *1981.
019379 Kaufman, L. *A package of subroutines for solving systems of linear
equations. * Bell Labs. *CS Tech Rpt 106. * 1981.
019380 Cardelli, L. *The functional abstract machine. * Bell Labs. * CS Tech Rpt
107. *n.d.
019381 Stroustrup, B. *The C + + programming language - reference manual. * Bell
Labs. *CS Tech Rpt 108. *1984.
019382 Stroustrup, B. * Data abstraction in C. * Bell Labs. * CS Tech Rpt 109.
*1984.
019383 Pavlidis, T. * PED users manual. * Bell Labs. * CS Tech Rpt 110. *1984.
019384 Trimberger, S. *A comparison of MOS PLAs. * California Inst. of Tech. CS
Dept. *No. 5059. *1982.
019385 Bryant, R.E. *A switch level model and simulator for MOS digital systems.
* California Inst. of Tech. CS Dept. *No. 5065. *1983.
019386 Chen, M. Mead, C. *A hierarchical simulator based on formal semantics. *
California Inst. of Tech. CS Dept. *No. 5068. *1983.
019387 Trimberger, S.M. *Automated performance optimization of custom integrated
circuits. * California Inst. of Tech. CS Dept. *No. 5073, Ph.D. Thesis.
Trimberger, S.M. * 1983.
019388 Trawick, D.J. * Robust sentence analysis and habitability. * California
Inst. of Tech. CS Dept. *No. 5074, Ph.D. Thesis. Trawick, D.J. *1983.
019389 Martin, A.J. *A general proof rule for procedures in predicate
transformer semantics. * California Inst. of Tech. CS Dept. *No. 5075.
*1983.
019390 Submicron Systems Architecture: semiannual technical report. Reporting
period: 16 October 1982 to 15 April 1982. * California Inst. of Tech. CS
Dept. *No. 5078. * 1983.
019391 Johnsson, L. * Highly concurrent algorithms for solving linear systems of
equations. * California Inst. of Tech. CS Dept. *No. 5079. *1983.
019392 Lam, J. * RTsim: a register transfer simulator. * California Inst. of
Tech. CS Dept. *No. 5081. *1983.
019393 Neches, P.M. * Hardware support for advanced data management systems. *
California Inst. of Tech. CS Dept. *No. 5082, Ph.D. Thesis. Neches,
P.M. *1983.
019394 Li, P-y.P. Johnsson, L. *The tree machine: an evaluation of strategies
for reducing program loading time. * California Inst. of Tech. CS Dept.
*No. 5084. *1983.
019395 Athas, W.C., Jr. *A VLSI combinator reduction engine. * California Inst.
of Tech. CS Dept. *No. 5086. *1983.
019396 Lin, T.-M. Mead, C.A. * Signal delay in general RC networks with
application to timing simulation of digital integrated circuits. *
California Inst. of Tech. CS Dept. *No. 5089. *1983.
019397 Chen, M.C-m. * Space time algorithms: semantics and methodology. *
California Inst. of Tech. CS Dept. * No. 5090, Ph.D. Thesis. Chen,
M.C-m. *1983.
019398 Bryant, R.E. * Race detection in MOS circuits by ternary simulation. *
California Inst. of Tech. CS Dept. *No. 5091. *1983.
019399 Chiang, C.-L. Johnsson, L. * Residue arithmetic and VLSI. * California
Inst. of Tech. CS Dept. *No. 5092. *1983.
019400 Lutz, C. Rabin, S. Seitz, C. Speck, D. *Design of the Mosaic element. *
California Inst. of Tech. CS Dept. *No. 5093. *1983.
019401 Kajiya, J.T. *New techniques for ray tracing procedurally defined
objects. * California Inst. of Tech. CS Dept. *No. 5098. *1983.
019402 Mead, C. * VLSI and the foundations of computation. * California Inst. of
Tech. CS Dept. *No. 5099. *1983.
019403 Schuster, M.D. Bryant, R.E. * Concurrent fault simulation of MOS digital
circuits. * California Inst. of Tech. CS Dept. *No. 5101. *1983.
019404 Submicron Systems Architecture: semiannual technical report. Reporting
period: 16 April 1983 to 15 October 1983. Principal investigator:
Charles L. Seitz. Faculty investigators: Randal E. Bryant, James T.
Kajiya, Alain J. Martin, Robert J. McEliece, Martin Rem, Charles L.
Seitz. * California Inst. of Tech. CS Dept. *No. 5013. *1983.
019405 Wawrzynek, J. * Memory management in the programming language ICL. *
California Inst. of Tech. CS Dept. * No. 5105. *1983.
019406 Kajiya, J.T. * Ray tracing parametric patches. * California Inst. of
Tech. CS Dept. *No. 5106. *1982.
019407 Ullner, M.K. * Parallel machines for computer graphics. * California
Inst. of Tech. CS Dept. *No. 5112, Ph.D. Thesis. Ullner, M.K. *1983.
019408 Mead, C. *The WOLery. * California Inst. of Tech. CS Dept. *No. 5113.
*1984.
019409 Thompson, B.H. Thompson, F.B. * ASK as window to the world. * California
Inst. of Tech. CS Dept. *No. 5114. *1984.
019410 Segal, R.L. *An integrative approach to engineering data and automatic
project coordination. * California Inst. of Tech. CS Dept. *No. 5119.
*1983.
019411 Submicron Systems Architecture: semiannual technical report. Reporting
period: 16 October 1983 to 15 March 1984. Principal investigator:
Charles L. Seitz. Faculty investigators: Randal E. Bryant, James T.
Kajiya, Alain J. Martin, Robert J. McEliece, Martin Rem, Charles L
Seitz. * California Inst. of Tech. CS Dept. *No. 5122. *1984.
019412 Constable, R.L. Bates, J.L. *The nearly ultimate PEARL. * Cornell U. CS
Dept. *Tech Rpt 83-551. *1984.
019413 Hartmanis, J. *On non-isomorphic NP complete sets. * Cornell U. CS Dept.
*Tech Rpt 83-576. *1983.
019414 Kirkpatrick, D.G. Seidel, R. *The ultimate planar convex hull algorithm?*
Cornell U. CS Dept. *Tech Rpt 83-577. *1983.
019415 Coleman, T.F. Edenbrandt, A. Gilbert, J.R. *Predicting fill for sparse
orthogonal factorization. * Cornell U. CS Dept. *Tech Rpt 83-578.
*1983.
019416 Li, M. Yesha, Y. * String matching cannot be done by a two head one way
deterministic finite automaton. * Cornell U. CS Dept. *Tech Rpt 83-579.
*1983.
019417 Pritchard, P. *Long arithmetic progressions of primes: some old some new.
* Cornell U. CS Dept. *Tech Rpt 83-580. *1984.
019418 Skeen, D. Wright, D.D. *Increasing availability in partitioned database
systems. * Cornell U. CS Dept. * Tech Rpt 83-581. *1983 (revised 1984).
019419 Dwork, C. *Bounds on fundamental problems in parallel and distributed
computation. * Cornell U. CS Dept. * Tech Rpt 84-582, Ph.D. Thesis.
Dwork, C. *1984.
019420 Salton, G. *Howard Aiken's children: the Harvard computation laboratory
and its students. * Cornell U. CS Dept. * Tech Rpt 83-583. *1983.
019421 Babaoglu, O. Bussan, M. Drummond, R. Schneider, F.B. * Documentation for
the CHIP computer system (Version 1.0). * Cornell U. CS Dept. *Tech Rpt
83-584. *1983.
019422 Babaoglu, O. Schneider, F.B. *The HOCA operating system specifications. *
Cornell U. CS Dept. *Tech Rpt 83-585. *1983.
019423 McCurley, R. Schneider, F.B. *Derivation of a distributed algorithm for
finding paths in directed networks. * Cornell U. CS Dept. *Tech Rpt
83-586. *1983.
019424 Toueg, S. * Randomized asynchronous Byzantine agreements. * Cornell U. CS
Dept. *Tech Rpt 83-587. *1983 (revised 1984).
019425 Salton, G. *The use of extended boolean logic in information retrieval. *
Cornell U. CS Dept. *Tech Rpt 84-588. * 1984.
019426 Bitton, D. Turbyfill, C. *Design and analysis of multi user benchmarks
for database systems. * Cornell U. CS Dept. *Tech Rpt 84-589. *1984.
019427 Bracha, G. *An asynchronous [(n-1)/3]-resilient consensus protocol. *
Cornell U. CS Dept. *Tech Rpt 84-590. * 1984.
019428 Li, M. *On one tape versus two stacks. * Cornell U. CS Dept. *Tech Rpt
84-591. *1984.
019429 Seidel, R. *A method for proving lower bounds for certain geometric
problems. * Cornell U. CS Dept. *Tech Rpt 84-592. *1984.
019430 Boehm, H.-J. *A logic for the Russell programming language. * Cornell U.
CS Dept. *Tech Rpt 84-593, Ph.D. Thesis. Boehm, H.-J. *1984.
019431 Akl, S.G. *An optimal algorithm for parallel selection. * Queen's U.
Computing & Info.Sci.Dept. *Tech Rpt 83-146. * 1983.
019432 Glasgow, J.I. *Towards a more operational semantics for LUCID. * Queen's
U. Computing & Info.Sci.Dept. *Tech Rpt 83-148. *1983.
019433 Crawford, R.G. Becker, H.S. Ogilvie, J.E. *A relational bibliographic
database. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 83-149.
*1983.
019434 Crawford, R.G. Becker, H.S. Ogilvie, J.E. * Universal relation theory as
applied to bibliographic data. * Queen's U. Computing & Info.Sci.Dept.
*Tech Rpt 83-150. * 1983.
019435 Akl, S.G. *On the security of compressed encodings. * Queen's U.
Computing & Info.Sci.Dept. *Tech Rpt 83-151. *1983.
019436 Akl, S.G. Schmeck, H. * Systolic sorting in a sequential input/output
environment. * Queen's U. Computing & Info.Sci.Dept. *Tech Rpt 84-154.
*1984.
019437 Jenkins, M.A. *The Q'NIAL reference manual. Release 1.0. * Queen's U.
Computing & Info.Sci.Dept. *1983.
052001 Stanford U. Center for the Study of Language and Info. * Research program
on situated language. * Stanford U. Center for the Study of Language
and Info. *CLSI-84-01. * 1984. 11p.
052002 Barwise, J. *The situation in logic - 1. * Stanford U. Center for the
Study of Language and Info. *CLSI-84-02. *1984.
052003 Sag, I.A. Gazdar, G. Wasow, T. Weisler, S. *Coordination and how to
distinguish categories. * Stanford U. Center for the Study of Language
and Info. *CLSI-84-03. *1984. 48p.
052004 Konolige, K. * Belief and incompleteness. * Stanford U. Center for the
Study of Language and Info. *CLSI-84-04. * 1984. 67p.
052005 Goguen, J.A. Meseguer, J. * Equality, types, modules and generics for
logic programming. * Stanford U. Center for the Study of Language and
Info. *CLSI-84-05. *1984. 30p.
052007 Kanerva, P. *Self-propagating search: a unified theory of memory. *
Stanford U. Center for the Study of Language and Info. *CLSI-84-07.
*1984. 174p.
024987 Ullman, J.D. *Some thoughts about supercomputer organization. * Stanford
U. CS Dept. * STAN-CS-83-987. *1983. 17p.
024989 Knuth, D.E. Weening, J.S. *A programming and problem-solving seminar. *
Stanford U. CS Dept. *STAN-CS-83-989. * 1983. 91p. This report
contains edited transcripts of the discussions held in Stanford's course
CS204, Problem Seminar, during Autumn Quarter 1981.
024990 Hobby, J.D. Knuth, D.E. *A programming and problem-solving seminar. *
Stanford U. CS Dept. *STAN-CS-83-990. * 1983. 61p. This report
contains edited transcripts of the discussions held in Stanford's course
CS204, Problem Seminar, during Autumn Quarter 1982.
024991 Morgensteren, M. Shamir, E. * Parallel algorithms for arithmetics,
irreducibility and factoring of GFq-polynomials. * Stanford U. CS Dept.
* STAN-CS-83-991. *1983. 10p.
024992 Ketonen, J. Weening, J.S. *The language of an interactive proof checker.
* Stanford U. CS Dept. * STAN-CS-83-992. *1983. 34p.
024993 Lansky, A.L. * Specification and analysis of concurrency. * Stanford U.
CS Dept. *STAN-CS-83-993, Ph.D. Thesis. Lansky, A.L. *1983. 282p.
024994 Chapiro, D.M. * Sorting by recursive partitioning. * Stanford U. CS Dept.
*STAN-CS-83-994. *1983. 30p.
024995 Clancey, W.J. *The advances of abstract control knowledge in expert
system design. * Stanford U. CS Dept. * STAN-CS-83-995; Stanford U. CS
Dept. Heuristic Programming Project. *HPP-83-17. *1983. 14p.
024996 Hasling, D.W. Clancey, W.J. Rennels, G. * Strategic explanations for a
diagnostic consultation system. * Stanford U. CS Dept. *STAN-CS-83-996;
Stanford U. CS Dept. Heuristic Programming Project. *HPP-83-41. * 1983.
23p.
024997 Clancey, W.J. * GUIDON. * Stanford U. CS Dept. * STAN-CS-83-997; Stanford
U. CS Dept. Heuristic Programming Project*HPP-83-42. *1983. 8p.
024998 Mulsant, B. Servan-Schreier, D. * Knowledge engineering: a daily activity
on a hospital ward. * Stanford U. CS Dept. *STAN-CS-83-998; Stanford U.
CS Dept. Heuristic Programming Project. *HPP-83-40. *1983. 41p.
024999 Dolev, D. Maier, D. Mairson, H. Ullman, J. *Correcting faults in
write-once memory. * Stanford U. CS Dept. * STAN-CS-83-999. *1983. 5p.
025002 Van Gelder, A. *A satisfiability tester for non-clausal propositional
calculus. * Stanford U. CS Dept. * STAN-CS-83-1002. *1984. 12p.
025003 Anderson, R. Mayr, E. * Parallelism and greedy algorithms. * Stanford U.
CS Dept. *STAN-CS-83-1003. *1984. 16p.
019439 Zadeh, L.A. *A theory of commonsense knowledge. * California U.,
Berkeley. Electronics Res.Lab. *Memo No. UCB/ERL M83/26. *1983.
019440 Zadeh, L.A. * Test score semantics as a basis for a computational
approach to the representation of meaning. * California U., Berkeley.
Electronics Res.Lab. *Memo No. UCB/ERL M84/08. *1984.
019441 Page, T.W. Jr. * Distributed query processing in local network databases.
* California U., L.A. CS Dept. * CSD-840222. *1983.
019442 Popek, G.J. * Secure reliable processing systems. Final technical report:
1 July 1977 - 31 March 1982. Gerald J. Popek, Principal investigator. *
California U., L.A. CS Dept. *CSD-840228. *1984.
019443 Chu, W.W. Hellerstein, J. Lan, M.T. An, J.M. Leung, K.K. * Database
management algorithms for advanced BMD applications. Final report for
the period: February 1, 1983 to January 31, 1984. Wesley W. Chu,
Principal investigator. Researchers: J. Hellerstein, M.T. Lan, J.M. An,
and K.K. Leung. * California U., L.A. Eng. & Appl.Sci.Sch.
*UCLA-ENG-8407; California U., L.A. Eng. & CS Dept. *CSD-840031. *1984.
019444 Bannon, L.J. Conway, E. Cypher, A. Draper, S.W. Greenspan, S.L. Monty,
M.L. Norman, D.A. O'Malley, C. Owen, D. Riley, M.S. Smolensky, P. *
User centered system design. Part II. Collected papers from the UCSD
HM1 Project. * California U., San Diego. Inst. for Cognitive Sci. *ICS
Rpt. 8402. *1984.
019445 Smolensky, P. Riley, M.S. * Harmony theory: problem solving, parallel
cognitive models, and thermal physics. * California U., San Diego. Inst.
for Cognitive Sci. *ICS Rpt. 8404. *1984.
019446 Belford, G.G. Liu, J.W.S. Cho, D. Cotten, P. England, S. Goldstein, J.D.
Hwung, S.C. Kaufman, K.A. Kim, C.K. Leo, J. Manolas, A.P. Moon, A. Smet,
A.D. Yan, Y.L. * Mutual consistency maintenance in a prototype data
traffic management system. * Illinois U. CS Dept. * UIUCDCS-R-83-1142.
*1983.
019447 Padmanabhan, K. * Fault tolerance and performance improvement in
multiprocessor interconnection networks. * Illinois U. CS Dept.
*UIUCDCS-R-84-1156, Ph.D. Thesis. Padmanabhan, K. *1984.
019448 Schwiesow, J.D. *Automatic layout generation of MOS fixed function cells.
* Illinois U. CS Dept. * UIUCDCS-R-84-1161. *1984.
019449 Peterson, J.S. *Automatic file migration: reload queuing simulations and
Markov models. * Illinois U. CS Dept. *UIUCDCS-R-84-1166, Ph.D. Thesis.
Peterson, J.S. *1984.
019450 Franta, W.R. Heath, J.R. *Performance of HYPERchannel networks:
parameters, measurements, models and analysis. Part II: Satellite
connected HYPERchannel networks. * Minnesota U. CS Dept. *Tech Rpt
82-23. *1982.
019451 Cohoon, J. Sahni, S. * Heuristics for the circuit realization problem. *
Minnesota U. CS Dept. * Tech Rpt 82-24. *1982.
019452 Lai, T.-H. Sahni, S. * Anomalies in parallel branch and bound algorithms.
* Minnesota U. CS Dept. *Tech Rpt 82-25. *1982.
019453 Ibarra, O.H. Kim, S.M. Rosier, L.E. * Space and time efficient TM
simulations and characterizations of some restricted classes of
automata. * Minnesota U. CS Dept. *Tech Rpt 83-01. *1983.
019454 Ibarra, O.H. Kim, S.M. *Characterizations and computational complexity of
systolic trellis automata. * Minnesota U. CS Dept. *Tech Rpt 83-02.
*1983.
019455 Sahni, S. * Scheduling supercomputers. * Minnesota U. CS Dept. *Tech Rpt
83-03. *1983.
019456 Zhang, X.S. Rosen, J.B. * Global concave minimization. * Minnesota U. CS
Dept. *Tech Rpt 83-04. *1983.
019457 Kalantari, B. Rosen, J.B. *Construction of large scale global minimum
concave quadratic test problems. * Minnesota U. CS Dept. *Tech Rpt
83-05. *1983.
019458 Rosen, J.B. *Performance of approximate algorithms for global
minimization. * Minnesota U. CS Dept. * Tech Rpt 83-06. *1983.
019459 Zhang, X.S. * Solution property of parametric linear programs. *
Minnesota U. CS Dept. *Tech Rpt 83-07. * 1983.
019460 Han, S. Sahni, S. * Single row routing in narrow streets. * Minnesota U.
CS Dept. *Tech Rpt 83-08. *1983.
019461 Du, H.C. * Distributing a database for parallel processing is NP-hard. *
Minnesota U. CS Dept. *Tech Rpt 83-09. * 1983.
019462 Boley, D. *A perturbation result for linear control problems. * Minnesota
U. CS Dept. *Tech Rpt 83-10. * 1983.
019463 Zhang, S.X. *On the convergence of Rosen's gradient projection method. *
Minnesota U. CS Dept. *Tech Rpt 83-11. *1983.
019464 Gini, M. Gini, G. *From goals to manipulator programs. * Minnesota U. CS
Dept. *Tech Rpt 83-12. *1983.
019465 Kane, R. Sahni, S. *A systolic design rule checker. * Minnesota U. CS
Dept. *Tech Rpt 83-13. *1983.
019466 Berzins, V. *Estimating errors in Laplacian edge detectors. * Minnesota
U. CS Dept. *Tech Rpt 83-14. *1983.
019467 Du, H.C. *On the file design problem for partial match retrieval. *
Minnesota U. CS Dept. *Tech Rpt 83-15. * 1983.
019468 Borgwardt, P. * Parallel Prolog using stack segments on shared memory
multiprocessors. * Minnesota U. CS Dept. *Tech Rpt 83-16. *1983.
019469 Ibarra, O.H. Kim, S.M. *A characterization of systolic binary tree
automata and applications. * Minnesota U. CS Dept. *Tech Rpt 83-17.
*1983.
019470 Ibarra, O.H. Kim, S.M. * Trellis automata: characterizations, speed-up,
hierarchy, decision problems. * Minnesota U. CS Dept. *Tech Rpt 83-18. *
1983.
019471 Bruell, S.C. Balbo, G. Ghanta, S. Afshari, P.V. *A mean value analysis
based package for the solution of product form queueing network models.
* Minnesota U. CS Dept. *Tech Rpt 83-19. *1983.
019472 Ibarra, O.H. Kim, S.M. *Characterizations of linear iterative arrays. *
Minnesota U. CS Dept. *Tech Rpt 83-20. *1983.
019473 Lauer, P.E. * Computer system dossiers. * Newcastle Upon Tyne U.
Computing Lab. *No. 185. *1983.
019474 Campbell, R.H. Randell, B. * Error recovery in asynchronous systems. *
Newcastle Upon Tyne U. Computing Lab. *No. 186. * 1983.
019475 Shrivastava, S.K. *On the treatment of orphans in a distributed system. *
Newcastle Upon Tyne U. Computing Lab. *No. 188. *1983.
019476 Panzieri, F. Randell, B. *Interfacing UNIX to data communications
networks. * Newcastle Upon Tyne U. Computing Lab. *No. 190. *1983.
019477 Hisdal, E. *A theory of logic based on probability. Part I, the tee
model. * Oslo U. Informatics Inst. *Res Rpt 64. * 1984.
019478 Gjessing, S. * Verification of monitors based on a partial correctness
semantics. * Oslo U. Informatics Inst. * Res Rpt 77. *1983.
019479 Koch, P.E. * Error bounds for interpolation by fourth order trigonometric
splines. * Oslo U. Informatics Inst. * Res Rpt 78. *1983.
019480 Dahl, O.-J. * LIFO disciplined simplex algorithm. * Oslo U. Informatics
Inst. *Res Rpt 79. *1984.
019481 Cohen, E. Lyche, T. Riesenfeld, R. * Discrete box splines and refinement
algorithms. * Oslo U. Informatics Inst. * Res Rpt 80. *1983.
019482 Cohen, D. Postel, J. * Gateways, bridges and tunnels in computer mail. *
Southern California U. Info.Sci.Inst. * ISI/RS-83-117. *1984.
019483 Cohen, D. * Real time packet video over satellite channels. * Southern
California U. Info.Sci.Inst. *ISI/RS-83-118. * 1984.
019484 Moses, L. Coyazo, S. *Using Scribe to select fonts on the the Penguin. *
Southern California U. Info.Sci.Inst. * ISI/TM-83-119. *1984.
019485 Matthiessen, C.M.I.M. *How to make grammatical choices in text
generation. * Southern California U. Info.Sci.Inst. * ISI/RS-83-120.
*1984.
019486 Matthiessen, C.M.I.M. * Systemic grammar in computation: the Nigel case.
* Southern California U. Info.Sci.Inst. * ISI/RS-83-121. *1984.
019487 Robinson, J.J. *Extending grammars to new domains. * Southern California
U. Info.Sci.Inst. *ISI/RR-83-123. * 1984.
019488 Mann, W.C. * Discourse structures for text generation. * Southern
California U. Info.Sci.Inst. *ISI/RR-84-127. * 1984.
019489 Raymond, D.R. * Personal data structuring in videotex. * Waterloo U. CS
Dept. *CS-84-07. *1984.
019490 Culberson, J.C. * Updating binary trees. * Waterloo U. CS Dept.
*CS-84-08. *1984.
019491 Trickett, S.R. * Rational approximations to the exponential function or
the numerical solution of the heat conduction problem. * Waterloo U. CS
Dept. *CS-84-09. *1984.
019492 Mangasarian, O.L. McLinden, L. *Simple bounds for solutions of monotone
complementarity problems and convex programs. * Wisconsin U. CS Dept.
*Tech Rpt 534. *1984.
019493 Krueger, P. Finkel, R. *An adaptive load balancing algorithm for a
multicomputer. * Wisconsin U. CS Dept. * Tech Rpt 539. *1984.
019494 Scott, M.L. Finkel, R.A. * Partitioning files for Huffman encoding. *
Wisconsin U. CS Dept. *Tech Rpt 540. * 1984.
019495 Marzullo, K.A. *Maintaining the time in a distributed system: an example
of a loosely coupled distributed service. * Xerox. Palo Alto Res.
Center. Office Products Div. *OSD-T8401, Ph.D. Thesis. Marzullo, K.A.
*1984.
019496 Dean, T. * Time map maintenance. * Yale U. CS Dept. * Res Rpt 289. *1983.
019497 Ipsen, I.C.F. * Singular value computations with systolic arrays. * Yale
U. CS Dept. *Res Rpt 291. *1983.
019498 Davis, E. *Representing and acquiring geographic knowledge. * Yale U. CS
Dept. *Res Rpt 292, Ph.D. Thesis. Davis, E. *1984.
019499 O'Donnell, S.T. Geiger, P. Schultz, M.H. *Solving the Poisson equation on
the FPS-164. * Yale U. CS Dept. * Res Rpt 293. *1983.
019500 Gelernter, D. * Generative communication in Linda. * Yale U. CS Dept.
*Res Rpt 294. *1983.
019501 Chan, T.F. Kerkhoven, T. * Fourier methods with extended stability
intervals for the Korteweg de Vries equation. * Yale U. CS Dept. *Res
Rpt 295. *1983.
019502 Letovsky, S. *Qualitative and quantitative temporal reasoning. * Yale U.
CS Dept. *Res Rpt 296. *1983.
019503 Fisher, J.A. O'Donnell, J.J. * VLIW machines: multiprocessors we can
actually program. * Yale U. CS Dept. *Res Rpt 298. *1984.
019504 Ipsen, I.C.F. *A parallel QR method using fast Givens' rotations. * Yale
U. CS Dept. *Res Rpt 299. *1984.
019505 Elman, H.C. Saad, Y. Saylor, P.E. *A hybrid Chebyshev Krylov subspace
algorithm for solving nonsymmetric systems of linear equations. * Yale
U. CS Dept. *Res Rpt 301. * 1984.
019506 Dembo, R.S. Tulowitzki, U. *On the minimization of quadratic functions
subject to box constraints. * Yale U. CS Dept. *Res Rpt 302. *1984.
019507 Dembo, R. Sahi, S. *A convergent framework for constrained nonlinear
optimization. * Yale U. CS Dept. *Res Rpt 303. *1984.
019508 Dembo, R. *A primal truncated Newton algorithm with application to large
scale nonlinear network optimization. * Yale U. CS Dept. *Res Rpt 304.
*1983.
019509 Chan, T.F. Lee, D. Shen, L. * Stable explicit schemes for equations of
the Schroedinger type. * Yale U. CS Dept. *Res Rpt 305. *1984.
019510 Schank, R.C. *The explanation game. * Yale U. CS Dept. * Res Rpt 307.
*1984.
019511 Gusfield, D. Pitt, L. *Understanding approximations for node cover and
other subset selection problems. * Yale U. CS Dept. *Res Rpt 308.
*1984.
019512 Bramble, J.H. Pasciak, J.E. * Preconditioned iterative methods for
nonselfadjoint or indefinite elliptic boundary value problems. * Yale U.
CS Dept. *Res Rpt 309. *1984.
VOL. 6, NO. 8 08/06/84
019513 Clarke, E.M. Emerson, E.A. Sistla, A.P.* Automatic verification of finite
state concurrent systems using temporal logic specifications: a
practical approach.* Carnegie Mellon U. CS Dept. *CMU-CS-83-152.*1983.
019514 Brookes, S.D. Hoare, C.A.R. Roscoe, A.W.*A theory of communicating
sequential processes.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-153.*1983.
019515 Winskel, G.*A representation of completely distributive algebraic
lattices.* Carnegie Mellon U. CS Dept. * CMU-CS-83-154.*1983.
019516 Mishra, B. Clarke, E.M.* Automatic and heirarchical verification of
asynchronous circuits using temporal logic.* Carnegie Mellon U. CS
Dept. *CMU-CS-83-155.* 1983.
019517 Hayes, P.J. Carbonell, J.G.*A tutorial on techniques and applications for
natural language processing.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-158.*1983.
019518 Winskel, G.*A note on powerdomains and modality.* Carnegie Mellon U. CS
Dept. *CMU-CS-83-159.*1983.
019519 Doyle, J.*What should AI want from the supercomputers?.* Carnegie Mellon
U. CS Dept. *CMU-CS-83-160.*1983.
019520 Ohta, Y. Kanade, T.* Stereo by intra- and inter-scanline search using
dynamic programming.* Carnegie Mellon U. CS Dept. *CMU-CS-83-162.*1983.
019521 Schwarz, P.M. Spector, A.Z.* Synchronizing shared abstract types.*
Carnegie Mellon U. CS Dept. *CMU-CS-83-163.* 1983.
019522 Jones, A.K. Segall, Z. Sietz, C. Wilson, A.* Workshop on Multiprocessors
for High Performance parallel Computation, Seven Springs, Champion,
Pennsylvania, June 27-29, 1983. Sponsored by Carnegie-Mellon University
and the National Science Foundation. Edited by Anita K. Jones, Zary
Segall, Chuck Seitz, and Andrew Wilson.* Carnegie Mellon U. CS Dept.
*CMU-CS-83-164.*1983.
019523 Kung, H.T. Lam, M.S.* Fault tolerance and two-level pipelining in VLSI
systolic arrays.* Carnegie Mellon U. CS Dept. *CMU-CS-83-166.*1983.
019524 Gupta, A. Forgy, C.L.*Measurements on production systems.* Carnegie
Mellon U. CS Dept. *CMU-CS-83-167.*1983.
019525 Winskel, G.* Nondeterministic recursive program schemes and
powerdomains.* Carnegie Mellon U. CS Dept. * CMU-CS-83-169.*1983.
019526 Hon, R.W.*The hierarchical analysis of VLSI designs.* Carnegie Mellon U.
CS Dept. *CMU-CS-83-170, Ph.D. Thesis. Hon, R.W.*1983.
099091 The Robotics Institute: annual research review.* Carnegie Mellon U. CS
Dept. *1983-
019527 Cutkowski, M.R. Jourdain, J.M. Wright, P.K.*Testing and control of a
compliant wrist.* Carnegie Mellon U. Robotics
Inst.*CMU-RI-TR-84-04.*1984.
019528 Cutkowsky, M.R. Fussell, P.S. Milligan, R.* Precision flexible machining
cells within a manufacturing system.* Carnegie Mellon U. Robotics
Inst.*CMU-RI-TR-84-12.*1984.
019529 Reif, J.H. Lewis, H.R.*Efficient symbolic analysis of programs.* Harvard
U. Comp.Tech.Res. Center.*TR-37-82.* 1982.
019530 Goodman, N. Suri, R. Tay, Y.C.*A simple analytic model for performance of
exclusive locking in database systems.* Harvard U. Comp.Tech.Res.
Center.*TR-01-83.*1983.
019531 Konchan, T.E.*Using the Musa model to quantify the reliability of
embedded computer software.* Harvard U. Comp.Tech.Res.
Center.*TR-03-83.*1983.
019532 Suri, R.*Characterization of monotonicity in closed queueing networks.*
Harvard U. Comp.Tech.Res. Center.* TR-06-83.*1983.
019533 Tay, Y.C. Suri, R.*Sample statistics and error bounds for performance
predictions in queueing networks.* Harvard U. Comp.Tech.Res.
Center.*TR-07-83.*1983.
019534 Reif, J.* Probabilistic parallel prefix computation.* Harvard U.
Comp.Tech.Res. Center.*TR-08-83.*1983.
019535 Komorowski, H.J.* Interactive and incremental programming environments:
experience, foundations, and future.* Harvard U. Comp.Tech.Res.
Center.*TR-09-83.*1983.
019536 Bernstein, P.A. Goodman, N. Hadzilacos, V.* Recovery algorithms for
database systems.* Harvard U. Comp.Tech.Res. Center.*TR-10-83.*1983.
019537 Homer, S. Reif, J.* Arithmetic theories for computational complexity
problems.* Harvard U. Comp.Tech.Res. Center.* TR-11-83.*1983.
019538 Reif, J.H.* Data flow analysis of distributed communicating processes.*
Harvard U. Comp.Tech.Res. Center.*TR-12-83.* 1983.
019539 Reif, J.H.*The complexity of reachability and deadlock detection for
distributed communicating processes.* Harvard U. Comp.Tech.Res.
Center.*TR-13-83.*1983.
019540 Reif, J.* Parallel algorithms for graph isomorphism.* Harvard U.
Comp.Tech.Res. Center.*TR-14-83.*1983.
019541 Gasarch, W.I. Homer, S.* Relativizations comparing NP and exponential
time.* Harvard U. Comp.Tech.Res. Center.* TR-15-83.*1983.
019542 Tay, Y.C. Suri, R. Goodman, N.*A mean value performance model for locking
in databases: the no waiting case.* Harvard U. Comp.Tech.Res.
Center.*TR-16-82.*1983.
019543 Goodman, N. Tay, Y.C.*Synthesizing fourth normal form relations from
multivalued dependencies.* Harvard U. Comp.Tech.Res.
Center.*TR-17-83.*1983.
019544 Tay, Y.C.* Byzantine agreement is shortlived: reliability of k-resilient
distributed protocols.* Harvard U. Comp.Tech.Res.
Center.*TR-18-83.*1983.
019545 Hadzilacos, V.* Byzantine agreement under restricted types of failures.*
Harvard U. Comp.Tech.Res. Center.*TR-19-83.* 1983.
019546 Bernstein, P.A. Goodman, N.* Concurrency control and recovery for
replicated distributed databases.* Harvard U. Comp.Tech.Res.
Center.*TR-20-83.*1983.
019547 Hadzilacos, V.*A lower bound for Byzantine agreement with fail stop
processors.* Harvard U. Comp.Tech.Res. Center.* TR-21-83.*1983.
019548 Herrman, J.C.* Reference based protection.* Harvard U. Comp.Tech.Res.
Center.*TR-22-83, Ph.D. Thesis. Herrmann, J.C.*1983.
019549 Kelley, J.F.*An iterative design methodology for user friendly natural
language office information applications.* IBM Watson Res. Center.*RC
10276.*1983.
019550 Chess, D.M.*The IBM PC database and conferencing facility.* IBM Watson
Res. Center.*RC 10277.*1983.
019551 Gilbert, R.S.*Performance comparison of contention and token protocols
for a sample high latency ring network.* IBM Watson Res. Center.*RC
10278.*1983.
019552 Nair, R. Bruss, A. Reif, J.* Linear time algorithms for optimal CMOS
layout.* IBM Watson Res. Center.*RC 10279.* 1983.
019553 Brand, D.*Detecting sneak paths in transistor networks.* IBM Watson Res.
Center.*RC 10281.*1983.
019554 Stone, H.S.* Optimal decision chains.* IBM Watson Res. Center.*RC
10283.*1983.
019555 Hauge, P.S. Yoffa, E.J.* ACORN: a system for CVS macro design by tree
placement and tree customization.* IBM Watson Res. Center.*RC
10298.*1983.
019556 Tetzlaff, L.S.* Videotex human factors.* IBM Watson Res. Center.*RC
10313.*1984.
019557 Perlman, A.* CRASH! Obstacle detection in robotic application
simulation.* IBM Watson Res. Center.*RC 10319.*1984.
019558 Rosson, M.B.*Effects of experience on learning, using and evaluating a
text editor.* IBM Watson Res. Center.*RC 10322.*1984.
019559 Rosson, M.B.*The interaction of pronunciation rules and lexical
representations in reading aloud.* IBM Watson Res. Center.*RC
10323.*1984.
019560 Wesley, M.A. Markowsky, G.*Generation of solid models from two and three
dimensional data.* IBM Watson Res. Center.* RC 10328.*1984.
019561 Arnold, R. Coppersmith, D.*An alternative to perfect hashing.* IBM Watson
Res. Center.*RC 10332.*1984.
019562 Mack, R.*Understanding text editing: evidence from predictions and
descriptions given by computer naive people.* IBM Watson Res. Center.*RC
10333.*1984.
019563 McCord, M.C.* Semantic interpretation for the EPISTLE system.* IBM Watson
Res. Center.*RC 10334.*1984.
019564 Coppersmith, D. Silberger, A.*On the minimality of Eklundh type
algorithms for computing the transposes of matrices.* IBM Watson Res.
Center.*RC 10335.*1984.
019565 Hailpern, B.*A simple protocol whose proof isn't.* IBM Watson Res.
Center.*RC 10336.*1984.
019566 Coppersmith, D.*Each four celled animal tiles the plane.* IBM Watson Res.
Center.*RC 10337.*1984.
019567 Trevillyan, L. Joyner, W. Berman, L.* Global flow analysis in automatic
logic design.* IBM Watson Res. Center.*RC 10340.*1984.
019568 Wittrock, R.J.* Dual nested decomposition of staircase linear programs.*
IBM Watson Res. Center.*RC 10343.*1984.
019569 Wittrock, R.J.*A nested decomposition algorithm for solving staircase
linear programs.* IBM Watson Res. Center.*RC 10344.*1984.
019570 Tantawi, A.N. Towsley, D.*Optimal load balancing in distributed computer
systems.* IBM Watson Res. Center.*RC 10346.*1984.
019571 Ostapko, D.L.*A mapping and memory chip hardware which provides symmetric
reading/writing of horizontal and vertical lines.* IBM Watson Res.
Center.*RC 10348.*1984.
019572 Baratz, A.E. Jaffe, J.M.*Establishing virtual circuits in large computer
networks.* IBM Watson Res. Center.*RC 10350.*1984.
019573 Schechtman, B.H. Bjorklund, G.C. Moerner, W.E.*A horse of a different
color: frequency domain optical storage.* IBM Watson Res. Center.*RJ
4128.*1983.
019574 Cristian, F.*On exceptions, failures, faults, and errors.* IBM Watson
Res. Center.*RJ 4130.*1983.
019575 Rissanen, J.* Minimum description length principle.* IBM Watson Res.
Center.*RJ 4131.*1983.
019576 Ladner, R.E. Stockmeyer, L.J. Lipton, R.J.* Alternation bounded auxiliary
pushdown automata.* IBM Watson Res. Center.*RJ 4144.*1983.
019577 Vardi, M.Y.*A note on lossless database decompositions.* IBM Watson Res.
Center.*RJ 4145.*1983.
019578 Lorie, R. Kim, W. McNabb, D. Plouffe, W.* User interface and access
techniques for engineering databases.* IBM Watson Res. Center.*RJ
4155.*1984.
019579 Kimoto, T. Casey, R.G.* Edge smoothing algorithms for horizontal and
vertical line patterns in binary images.* IBM Watson Res. Center.*RJ
4156.*1984.
019580 Terry, D.B.*The COSIE name server.* IBM Watson Res. Center.* RJ
4161.*1984.
019581 Langdon, G.G.*On parsing versus mixed order model structures for data
compression.* IBM Watson Res. Center.* RJ 4163.*1984.
019582 Deransart, P. Jourdan, M. Lorho, B.*Speeding up circularity tests for
attribute grammars.* INRIA.*Rapport de Recherche 211.*1983.
019583 Camion, P. Courteau, B. Fournier, G. Kanetkar, S.V.* Weight distribution
of translates of linear codes and generalized Pless identities.*
INRIA.*Rapport de Recherche 213.*1983.
019584 Andre, F. Frison, P. Quinton, P.*Algorithmes systoliques: de la theorie
a la pratique.* INRIA.*Rapport de Recherche 214.*1983.
019585 Frison, P.*Un processeur pour la reconnaissance de la parole.*
INRIA.*Rapport de Recherche 215.*1983.
019586 Quinton, P.*The systematic design of systolic arrays.* INRIA.*Rapport de
Recherche 216.*1983.
019587 Besnard, P.*Une procedure de decision en logique non-monotone.*
INRIA.*Rapport de Recherche 217.*1983.
019588 Darondeau, P. Kott, L.*A formal proof system for infinitary rational
expressions.* INRIA.*Rapport de Recherche 218.* 1983.
019589 Benveniste, A. Goursat, M.* Blind equalizers.* INRIA.* Rapport de
Recherche 219.*1983.
019590 Jacquet, P.*Proprietes moyennes du protocole capetanakis a arrivees
libres.* INRIA.*Rapport de Recherche 240.*1983.
019591 Flajolet, P. Peuch, C. Vuillemin, J.*The analysis of simple list
structures.* INRIA.*Rapport de Recherche 241.*1983.
019592 Bonnans, J.F.*A variant of a projected variable metric method for bound
constrained optimization problems.* INRIA.*Rapport de Recherche
242.*1983.
019593 Saint-Dizier, P.*On quantifier heirarchy and its paraphrase in a semantic
representation of natural language sentences.* INRIA.*Rapport de
Recherche 243.*1983.
019594 Marie, R. Rubino, G.*Sur l'existence et l'unicite du reseau homogene a un
reseau ferme de files d'attente a lois generales.* INRIA.*Rapport de
Recherche 244.*1983.
019595 Fayolle, G. Flajolet, P. Hofri, M. Jacquet, P.*The evaluation of packet
transmission characteristics in a multi access channel with stack
collision resolution protocol.* INRIA.*Rapport de Recherche 245.*1983.
019596 Le Lann, G.* Deterministic multiple access protocols for real time local
area networks.* INRIA.*Rapport de Recherche 246.*1983.
019597 Nain, P.* Interdeparture times from a queueing system with preemptive
resume priority.* INRIA.*Rapport de Recherche 248.*1983.
019598 Bancilhon, F. Richard, P.*A sound and complete axiomatization of embedded
cross dependencies.* INRIA.* Rapport de Recherche 249.*1983.
019599 Angrand, F. Dervieux, A. Loth, L. Vijayasundaram, G.* Simulation of Euler
transonic flows by means of explicit finite element type schemes.*
INRIA.*Rapport de Recherche 250.*1983.
019600 Hamatsuka, T.*On spectral span and eigenvalue eigenvector assignment for
a class of infinite dimensional control systems.* INRIA.*Rapport de
Recherche 252.*1983.
019601 Bonnans, J.F.*On an algorithm for optimal control using Pontryagin's
maximum principle.* INRIA.*Rapport de Recherche 254.*1983.
019602 Giboin, A. Michard, A.*Introducing novices to structured programming with
a "tree" programming language and a "tree" editor.* INRIA.*Rapport de
Recherche 255.*1983.
019603 Sebillotte, S.*Representation des actions de l'operateur.* INRIA.*Rapport
de Recherche 256.*1983.
019604 Klint, P.*A survey of three language independent programming
environments.* INRIA.*Rapport de Recherche
v 257.*1983.
019605 Bouzeghoub, M.*Une synthese des methodes et des outils d'aide a la
conception de systemes d'information.* INRIA.* Rapport de Recherche
258.*1983.
019606 Le Boudec, J.*Distribution des interentrees et intersorties pour des
reseaux a forme produit.* INRIA.*Rapport de Recherche 261.*1983.
019607 Schroeder, A.*Une etude quantitative statique de programmes Pascal.*
INRIA.*Rapport Technique 029.*1983.
019608 Sebillotte, S.*Etude preliminaire du travail de secretariat dans un
service hospitalier specialise.* INRIA.*Rapport Technique 030.*1983.
019609 Serlet, B.*Le langage HELL de description de circuits integres.*
INRIA.*Rapport Technique 031.*1983.
019610 Akkerhuis, J.N.* Typesetting and TROFF.* Mathematisch Centrum.*IW
247/83.*1983.
019611 Nienhaus, A.*On the design of an editor for the B programming language.*
Mathematisch Centrum.*IW 248/83.* 1983.
019612 Vitanyi, P.M.B.*On two tape real time computation and queues.*
Mathematisch Centrum.*IW 246/83.*1983.
019613 Bergstra, J.A. Tucker, J.V.* Top down design and the algebra of
communicating processes.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*Rpt. CS-R8401.*1984.
019614 Bergstra, J.A. Klop, J.W.* Algebra of communicating processes with
abstraction.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*Rpt. CS-R8403.* 1984.
019615 Symm, G.T. Wichman, B.A. Kok, J. Winter, D.T.*Guidelines for the design
of large modular scientific libraries in ADA: final report for the
Commission of the European Communities.* Mathematisch Centrum. Centrum
voor Wiskunde en Informatica.*Note NM-N8401.*1984.
019616 Konolige, K.* Belief and incompleteness.* SRI International.*Tech. note
319.*1984.
019617 Wichmann, B.A.*Tutorial material on the real data types in Ada.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
34/83.*1984.
019618 Vaswani, P.K.T.*The Demos multi-computer project: hardware aspects.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
36/84.*1984.
019619 Wichmann, B.A. Meijerink, J.G.J.*Converting to ADA packages.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
39/84.*1984.
019620 Bramhoff, H. Jantzen, M.*Durch Petrinetze definierte Klassen
zahlentheoretischer Funktionen.* Hamburg U. Institut fuer
Informatik.*Bericht nr. 098.*1983.
019621 Jantzen, M.*Extending regular expressions with iterated shuffle.* Hamburg
U. Institut fuer Informatik.*Bericht nr. 099.*1984.
019622 Valk, R. Jantzen, M.*The residue of vector sets with applications to
decidability problems in petri nets.* Hamburg U. Institut fuer
Informatik.*Bericht nr. 101.* 1984.
019623 Muller, H.*An estimation of the statistic time complexity of hereditary
graph properties with an application to the vertex coloring problem.*
Karlsruhe Universitaet. Institut fuer Informatik.*Interner Bericht
01/83.*1983.
019624 Hoffman, W. Lehmann, A.*Leistungsfahigkeit eines Mehrprozessorsystems mit
Kreuzschienenverteiler und lokalen Pufferspeichern.* Karlsruhe
Universitaet. Institut fuer Informatik.*Interner Bericht 10/83.*1983.
019625 Ohlbach, H.J. Wrightson, G.*Solving a problem in relevance logic with an
automated theorem prover.* Karlsruhe Universitaet. Institut fuer
Informatik.*Interner Bericht 11/83.*1983.
019626 Adams, M. Ferkinghoff, B. Bender, K. Drobnik, O. Lockmann,
P.C.*Datenhaltungssysteme in der Prozessdatenverarbeitung: ein
Anforderungsprofil.* Karlsruhe Universitaet. Institut fuer Informatik.*
Interner Bericht 16/83.*1983.
019627 Zadeh, L.A.*A computational theory of dispositions.* California U.,
Berkeley. Electronics Res.Lab.*n.d.
019628 Bozek, J.J.* Music: management and editing of functional designs.*
Illinois U. CS Dept. *UIUCDCS-R-84-1160.* 1984.
019629 Markt, D.E.*Study of file migration strategies.* Illinois U. CS Dept.
*UIUCDCS-R-84-1167.*1984.
019630 Whaley, A.D.* Higher layer protocols for a workstation architecture.*
Illinois U. CS Dept. * UIUCDCS-R-84-1169, Ph.D. Thesis. Whaley,
A.D.*1984.
019631 Dollas, A.* Spectrum sample transmission: a new concept in wavelength
division multiplexing.* Illinois U. CS Dept. *UIUCDCS-R-84-1172.*1984.
019632 Goldstein, J.*Designing user interfaces.* Illinois U. CS Dept.
*UIUCDCS-R-84-1173.*1984.
019633 Ray, S.R. Lee, W.D. Morgan, C.D. Airth-Kindree, W.* Sleep stage scoring
of normal human subjects by computer: a preliminary algorithm based on
the expert system approach.* Illinois U. CS Dept. *UIUCDCS-R-84-1174.*
1984.
019634 Augusteijn, M.F. Dyer, C.R.* Model based shape from contour and point
patterns.* Wisconsin U. CS Dept. * Tech.rpt. 542.*1984.
019635 Khoshafian, S.N.*A building blocks approach to statistical databases.*
Wisconsin U. CS Dept. *Tech.rpt. 543, Ph.D. Thesis. Khoshafian,
S.N.*1984.
VOL. 6, NO. 9 08/20/84
019636 Chazelle, B. Ottman, T. Soisalon-Soisinen, E. Wood, D.*The complexity and
decidability of SEPARATION.* Brown U. CS Dept *CS-84-08.*1984.
019637 Reiss, S.P.*An approach to incremental compilation.* Brown U. CS Dept
*CS-84-09.*1984.
019638 Wegner, P.*Perspectives on capital intensive software technology.* Brown
U. CS Dept *CS-84-10.*1984.
019639 Schmidt, D.*A programming notation for tactical reasoning.* Edinburgh U.
CS Dept *CSR-141-83.*1983.
019640 Schmidt, D.* Natural deduction theorem proving in set theory.* Edinburgh
U. CS Dept *CSR-142-83.*1983.
019641 Schmidt, D.*Detecting global variables in denotational specifications.*
Edinburgh U. CS Dept *CSR-143-83.* 1983.
019642 Shields, M.W.* Non sequential behaviours: 2.* Edinburgh U. CS Dept
*CSR-144-83.*1983.
019643 Deas, A.R.*The UNIT silicon compiler.* Edinburgh U. CS Dept
*CSR-145-83.*1983.
019644 Sokolowski, S.*An LCF proof of soundness of Hoare's logic - a paper
without a happy ending.* Edinburgh U. CS Dept *CSR-146-83.*1983.
019645 McCaskill, G.A.* Interactive ILAP.* Edinburgh U. CS Dept
*CSR-147-83.*1983.
019646 Tarlecki, A.*A language of specified programs.* Edinburgh U. CS Dept
*CSR-148-83.*1983.
019647 Tarlecki, A.* Free constructions in algebraic institutions.* Edinburgh U.
CS Dept *CSR-149-83.*1983.
019648 Marshall, R.M.*A compiler for large scale.* Edinburgh U. CS Dept
*CSR-150-83.*1983.
019649 Salus, P.H.* Writing and technical writing: some notes and comments.* IBM
Watson Res. Center.*RA 155.*1984.
019650 Falcigno, K.M. Guynup, P.E.*Toward the information environment of 1985.*
IBM Watson Res. Center.*RA 151.* 1984.
019651 Orth, D.L.* Polygonal functions and their use in teaching calculus.* IBM
Watson Res. Center.*RC 10451.*1984.
019652 Kumar, M. Jump, J.R.* Performance enhancement in buffered delta
networks.* IBM Watson Res. Center.*RC 10450.*1984.
019653 Cobham, A.*Should a machine think? -- reflections on AI.* IBM Watson Res.
Center.*RC 10447.*1984.
019654 Georgiou, C.J.* Fault tolerant crosspoint switching networks.* IBM Watson
Res. Center.*RC 10446.*1984.
019655 Beetem, J.F. Debefve, P. Donath, W. Hsieh, H.Y. Odeh, F. Ruehli, A.E.
White, J. Wolff, P.K. Sr.*A large scale MOSFET circuit analyzer based on
waveform relaxation.* IBM Watson Res. Center.*RC 10443.*1983.
019656 Carroll, J.M. Mack, R.L. Lewis, C.H. Grichkowsky, N.L. Robertson, S.R.*
Learning to use a word processor by guided exploration.* IBM Watson Res.
Center.*RC 10428.* 1984.
019657 Micchelli, C.A. Smith, P.W. Ward, J.D.* Constrained L subscript P
approximation.* IBM Watson Res. Center.*RC 10425.*1984.
019658 Crow, J.D.*Computer applications for fiber optics.* IBM Watson Res.
Center.*RC 10423.*1984.
019659 Nunan, K.C.*Analysis of a porous cylindrical bearing.* IBM Watson Res.
Center.*RC 10418.*1984.
019660 Damerau, F.J.*An interactive customization program for a natural language
database query system.* IBM Watson Res. Center.*RC 10411.*1984.
019661 Weinberg, L. Ruehli, A.E.*Combined modified loop analysis, modified nodal
analysis for large scale circuits.* IBM Watson Res. Center.*RC
10407.*1984.
019662 Nelson, R.* Stochastic catastrophe theory in computer performance
modelling.* IBM Watson Res. Center.*RC 10406.* 1984.
019663 Dahmen, W. Micchelli, C.A.*On the solution of certain systems of partial
difference equations and linear dependence of translates of box
splines.* IBM Watson Res. Center.*RC 10395.*1984.
019664 Dahmen, W. Micchelli, C.A. Smith, P.W.*On factorization of biinfinite
totally positive block Toeplitz matrices.* IBM Watson Res. Center.*RC
10394.*1984.
019665 Roth, J.P.* Embedding sans cyclic shorts.* IBM Watson Res. Center.*RC
10392.*1984.
019666 Weinberg, L. Ruehli, A.*An introduction to the principle partition and
its applications.* IBM Watson Res. Center.* RC 10377.*1984.
019667 Dahmen, W. Micchelli, C.A.* Subdivision algorithms for the generation of
box spline surfaces.* IBM Watson Res. Center.*RC 10372.*1984.
019668 Nadas, A.*Optimal solution of a training problem in speech recognition.*
IBM Watson Res. Center.*RC 10373.*1984.
019669 Sauer, C.H. MacNair, E.A.*The evolution of the Research Queueing
Package.* IBM Watson Res. Center.*RC 10376.* 1984.
019670 Tolimieri, R. Winograd, S.*Computing the ambiguity surface.* IBM Watson
Res. Center.*RC 10390.*1984.
019671 Vardi, M.Y. Wolper, P.* Automata theoretic techniques for modal logics of
programs.* IBM Watson Res. Center.*RJ 4232.*1984.
019672 Kirkpatrick, D.G. Klawe, M. Pippinger, N.*Some graph coloring theorems
with applications to generalized connection networks.* IBM Watson Res.
Center.*RJ 4222.* 1984.
019673 Van Vliet, J.C. Gladney, H.M.*An evaluation of tagging.* IBM Watson Res.
Center.*RJ 4220.*1984.
019674 Dolev, D. Halpern, J. Strong, H.R.*On the possibility and impossibility
of achieving clock synchronization.* IBM Watson Res. Center.*RJ
4218.*1984.
019675 Reuter, A. Haerder, T.*Principles of transaction oriented database
recovery.* IBM Watson Res. Center.*RJ 4214.* 1984.
019676 Fong, A.C.*An optimal component labeling algorithm with label merging.*
IBM Watson Res. Center.*RJ 4201.*1984.
019677 Emerson, E.A. Halpern, J.Y.*" Sometimes" and " not never" revisited: on
branching vs. linear time.* IBM Watson Res. Center.*RJ 4197.*1984.
019678 Rissanen, J.* Universal coding, information, prediction, and estimation.*
IBM Watson Res. Center.*RJ 4198.*1984.
019679 Kuper, G.M. Vardi, M.Y.*A new approach to database logic.* IBM Watson
Res. Center.*RJ 4202.*1984.
019680 Kuper, G.M. Ullman, J.D. Vardi, M.Y.*On the equivalence of logical
databases.* IBM Watson Res. Center.*RJ 4203.* 1984.
019681 Engberson, A.P.J.*On the optimization of 2D signal processing systems.*
IBM Watson Res. Center.*RZ 1289.* 1984.
019682 Tudruj, M. Gajda, R.*On the implementation of compound microconstruction
sequencing functions in microprogrammed control units.* Polish Academy
of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 523.*1983.
019683 Tudruj, M. Gajda, R.* HLL control statement implementation through
extensive modular microprogramming.* Polish Academy of Sciences. Inst of
Comp.Sci.*ICS PAS rpt. no. 524.*1983.
019684 Subieta, K.* Semantics of query language for network databases.* Polish
Academy of Sciences. Inst of Comp.Sci.* ICS PAS rpt. no. 526.*1983.
019685 Subieta, K.*A simple method of data correction.* Polish Academy of
Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 527.*1983.
019686 Prazmowski, K. Rudnicki, P.* MIZAR MSE primer.* Polish Academy of
Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 529.*1983.
019687 Rudnicki, P. Drabent, W.*Proving properties of Pascal programs in MIZAR
2.* Polish Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no.
530.*1983.
019688 Kulikowski, J.L.*On some formal properties of tripartite graphs.* Polish
Academy of Sciences. Inst of Comp.Sci.* ICS PAS rpt. no. 531.*1983.
019689 Pawlak, A.* MODLAN: A hardware module description language.* Polish
Academy of Sciences. Inst of Comp.Sci.*ICS PAS rpt. no. 532.*1983.
019690 Hendren, L.J.* ISON: an introductory subset of Nial.* Queen's U.
Computing & Info.Sci.Dept.*Tech.rpt. 84-156.* 1984.
019691 Ryder, B.G. Paull, M.C.*A unified model of elimination algorithms.*
Rutgers U. CS Dept *DCS-TR-140.*1984.
019692 Israeli, A. Perl, Y.*On scheduling the construction of a treelike
communication network.* Rutgers U. CS Dept *DCS-TR-141.*1984.
019693 Imielinski, T. Rozenshtein, D.*Towards a flexible user interface to
relational database systems: processing simple second order queries.*
Rutgers U. CS Dept * DCS-TR-142.*1984.
019694 Vichnevetsky, R.* Propogation and reflection in discrete space discrete
time structures.* Rutgers U. CS Dept *DCS-TR-143.*1984.
019695 Kastner, J.K.* Strategies for expert consultation in therapy planning.*
Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-136, Ph.D. Thesis. Kastner,
J.K.*1983.
019696 Hawrusik, F.M.*An extension of the pebble game for LISP like programs.*
Rutgers U. Comp.Sci.Res.Lab.*CTA-TR-006, Ph.D. Thesis. Hawrusik,
F.M.*1983.
019697 Minsky, N.H.*Selective and locally controlled transport of privileges.*
Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-017.* 1981, revised.
019698 Steinberg, L.I. Mitchell, T.M.*A knowledge based approach to VLSI CAD.*
Rutgers U. Comp.Sci.Res.Lab.*LCSR-TR-047.* 1983.
019699 Sridharan, N.S. Bresina, J.L.*Exploration of problem reformulation and
strategy acquisition - a proposal.* Rutgers U.
Comp.Sci.Res.Lab.*LCSR-TR-053; Rutgers U.
Comp.Sci.Res.Lab.*CBM-TR-137.*1984.
019700 Sridharan, N.S.*Evolving systems of knowledge.* Rutgers U.
Comp.Sci.Res.Lab.*LRP-TR-016.*1984.
019701 Warren, D.S.*Using lambda calculus to represent meanings in logic
grammars.* SUNY, Stony Brook. CS Dept * Tech.rpt. 83/044.*1983.
019702 Jones, M.A.* Activation based parsing.* SUNY, Stony Brook. CS Dept
*Tech.rpt. 83/045.*1983.
019703 Gelernter, H.*Realization of a large expert problem solving system.
SYNCHEM2: A case study.* SUNY, Stony Brook. CS Dept *Tech.rpt.
83/046.*1983.
019704 Dasgupta, P. Kedem, Z.M.*A non two phase locking protocol for concurrency
control in general databases.* SUNY, Stony Brook. CS Dept *Tech.rpt.
83/047.*1983.
019705 Maier, D. Rozenshtein, D. Maier, J.*Representing roles in universal
scheme interfaces.* SUNY, Stony Brook. CS Dept *Tech.rpt.
83/048.*1983.
019706 Bernstein, A.J.*A loosely coupled distributed system for reliably storing
data.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/049.*1983.
019707 Ahamad, M. Bernstein, A.J.*An application of name based addressing to low
level distributed algorithms.* SUNY, Stony Brook. CS Dept *Tech.rpt.
83/050.*1983.
019708 Warren, D.S.* Runtime environment for a PROLOG compiler.* SUNY, Stony
Brook. CS Dept *Tech.rpt. 83/052.*1983.
019709 Warren, D.S.*Efficient PROLOG memory management for flexible control
strategies.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/053.*1983.
019710 Warren, D.S. Ahamad, M. Debray, S.K. Kale, L.V.*Executing distributed
PROLOG programs on a broadcast network.* SUNY, Stony Brook. CS Dept
*Tech.rpt. 83/054.*1983.
019711 Curtis, R. Wittie, L.*Tools for debugging distributed real time systems.*
SUNY, Stony Brook. CS Dept * Tech.rpt. 83/055.*1983.
019712 Curtis, R. Wittie, L.* Naming in distributed language systems.* SUNY,
Stony Brook. CS Dept *Tech.rpt. 83/056.*1983.
019713 Frank, A.J. Wittie, L.D. Bernstein, A.J.* Group communications on
netcomputers.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/057.*1983.
019714 Kedem, Z.M. Zorat, A.*On the computation of transitive functions in an
unrestricted VLSI model.* SUNY, Stony Brook. CS Dept *Tech.rpt.
83/058.*1983.
019715 Siddappa, M. Zorat, A.*Designing a fault tolerant PLA for testability.*
SUNY, Stony Brook. CS Dept *Tech.rpt. 83/059.*1983.
019716 Silberschatz, A. Kieburtz, R.B. Bernstein, A.*Extending concurrent Pascal
to allow dynamic resource management.* SUNY, Stony Brook. CS Dept
*Tech.rpt. 83/060.*1983.
019717 Gupta, V. Zorat, A.*On constructing a grid of processors for wafer scale
integration.* SUNY, Stony Brook. CS Dept *Tech.rpt. 83/061.*1983.
019718 Choi, H.M. Wittie, L.D.*An implementation of a Pascal to Modula-2
translator.* SUNY, Stony Brook. CS Dept * Tech.rpt. 83/062.*1983.
019719 Bernstein, A.J.*The semantics of timeout.* SUNY, Stony Brook. CS Dept
*Tech.rpt. 83/065.*1983.
019720 Wittie, L.D. Frank, A.J.*A portable Modula-2 operating system: SAM2S.*
SUNY, Stony Brook. CS Dept * Tech.rpt. 84/068.*1984.
019721 Smith, D.R.* SUSB3 micron CMOS library.* SUNY, Stony Brook. CS Dept
*Tech.rpt. 84/070.*1984.
019722 Smolka, S.A. Frank, A.J. Debray, S.K.*Testing protocol robustness the CCS
way.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/071.*1984.
019723 Debray, S.K. Frank, A.J. Smolka, S.A.*On the existence and construction
of robust communication protocols for unreliable channels.* SUNY, Stony
Brook. CS Dept * Tech.rpt. 84/072.*1984.
019724 Warren, D.S.* Database updates in pure PROLOG.* SUNY, Stony Brook. CS
Dept *Tech.rpt. 84/073.*1984.
019725 Hsiang, J. Srivas, M.*A PROLOG environment for developing and reasoning
about data types.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/074.*1984.
019726 Hsiang, J. Srivas, M.*On proving first order inductive properties in Horn
clauses.* SUNY, Stony Brook. CS Dept *Tech.rpt. 84/075.*1984.
019727 Potvin, J.Y.*Observations concerning a parametric problem in generalized
linear fractional programming.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 489.*1983.
019728 Potvin, J.Y.*Nouvelles approches de resolution en programmation lineaire
fractionnaire generalisee.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.* Publ. 480.*1983.
019729 Cerny, E. Bochmann, G.V. Maksud, M. Leveille, A. Serre, J.M. Sarikaya,
B.*Experiments in testing communication protocol implementations.*
Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
492.*1983.
019730 Bochmann, G.V.* Formal description techniques for OSI: an example.*
Montreal U. Dept. d'Info. et de Recherche Operationnelle.*Publ.
493.*1983.
019731 Bochmann, G.V.*Some comments on "transition-oriented" vs. "structured"
specification of distributed algorithms and protocols.* Montreal U.
Dept. d'Info. et de Recherche Operationnelle.*Publ. 495.*1984.
019732 Braga, L.P.V. Maculan, N.*Une methodologie pour la realisation de cartes
geologiques.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 496.*1984.
019733 Frasson, C.*Bases de donnees sur micro-ordinateurs.* Montreal U. Dept.
d'Info. et de Recherche Operationnelle.* Publ. 498.*1984.
019734 Barchanski, J. Bochmann, G.V. Desjardins, P. Gecsei, J. Landry, J.L.*
Access protocol to external videotex databases.* Montreal U. Dept.
d'Info. et de Recherche Operationnelle.*Publ. 500.*1984.
019735 Magnenat-Thalmann, N. Fortin, M. Langlois, L. Thalmann, D.* MIRA-SHADING:
a structured language for the synthesis and the animation of realistic
languages.* Montreal U. Dept. d'Info. et de Recherche
Operationnelle.*Publ. 503.*1984.
019736 Magnenat-Thalmann, N. Thalmann, D. Ratib, O. Righetti, A.* Modeled
computer animation of the heart.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 504.* 1984.
019737 Gecsei, J.* User interactive teletext.* Montreal U. Dept. d'Info. et de
Recherche Operationnelle.*Publ. 506.*1984.
019738 Silva, E.S. Gerla, M.* Load balancing in distributed systems with
multiple classes and site constraints.* California U., L.A. CS Dept
*CSD-840033.*1984.
019739 Betser, J. Gerla, M. Popek, G.J.*A dual priority MVA model for a a large
distributed system: LOCUS.* California U., L.A. CS Dept
*CSD-840036.*1984.
019740 Rus, T. Herr, F.B.*An algebraic directed compiler generator.* Iowa U. CS
Dept *Tech.rpt. 84-02.* 1984.
019741 Wagner, M.E.* Performance evaluation of abstract data type language
implementations.* Iowa U. CS Dept * Tech.rpt. 84-03.*1984.
019742 Emerson, E.A. Sistla, A.P.*Deciding branching time logic.* Texas U. CS
Dept *TR-83-12.*1984, revised.
019743 Emerson, E.A. Halpern, J.Y.*"Sometimes and "not never" revisited: on
branching versus linear time.* Texas U. CS Dept *TR-84-01.*1984.
019744 Rich, E. Temin, A.*Representing programs for reasoning.* Texas U. CS
Dept *TR-84-02.*1984.
019745 Rich, E.*The gradual encroachment of artificial intelligence.* Texas U.
CS Dept *TR-84-05.*1984.
019746 Gouda, M.G. Chang, C.K.*Proving liveness for networks of communicating
finite state machines.* Texas U. CS Dept *TR-84-04.*1984.
019747 Lengauer, C.*A short note on" predicative programming": global and local
chaos.* Texas U. CS Dept * TR-84-06.*1984.
019748 Tseng, S.H.H.* Questioning English text with clausal logic case studies
of three texts.* Texas U. CS Dept * TR-84-08.*1984.
019749 Rathi, B.D.*The design and performance analysis of a self managing
secondary memory.* Texas U. CS Dept * TR-84-09, Ph.D. Thesis. Rathi,
B.D.*1984.
019750 Gouda, M.G. Chow, C.H. Lam, S.S.* Livelock detection in networks of
communicating finite state machines.* Texas U. CS Dept *TR-84-10.*1984.
019751 Rosier, L.E. Yen, H.C.* Boundedness, empty channel detection and
synchronization for communicating finite automata.* Texas U. CS Dept
*TR-84-13.*1984.
VOL. 6, NO. 10 09/20/84
019752 Lamb, D.A.*Sharing intermediate representations: the interface
description language.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-129,
Ph.D. Thesis.*1983.
019753 Korf, R.E.* Learning to solve problems by searching for macro operators.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-138, Ph.D. Thesis.*1983.
019754 Winskel, G.* Synchronisation trees. Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-139.*1983.
019755 Walker, H.*A 4-kbit four-transistor dynamic ram.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-140.*1983.
019756 Laird, J. Newell, A.*A universal weak method.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-141.*1983.
019757 Scherlis, W.L. Scott, D.S.*First steps towards inferential programming.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-142.*1983.
019758 Carbonell, J.G. Boggs, W.M. Maudlin, M.L. Anick, P.G.* XCALIBUR project
report 1: first steps towards and integrated natural language
interface.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-143.*1983.
019759 Maudlin, M. Jacobson, G. Appel, A Hamey, L.* ROG-O-MATIC: a belligerent
expert system.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-144.*1983.
019760 Palay, A.J.* Searching with probabilities.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-145, Ph.D. Thesis. Palay, A.J.*1983.
019761 Sistla, A.P.*Theoretical issues in the design and verification of
distributed systems.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-83-146,
Ph.D. Thesis. Sistla, A.P.* 1983. Thesis submitted to Harvard
University in partial fulfillment of the requirements for the degree of
Doctor of Philosophy.
019762 Sherman, M.S.* Paragon: a language using type heirarchies for the
specification, implementation, and selection of abstract data types.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-147, Ph.D. Thesis. Sherman,
M.S.*1983.
019763 Rosenbloom, P.S.*The Chunking of goal hierarchies: a model of practice
and stimulus response compatability.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-83-148, Ph.D. Thesis. Rosenbloom, P.S.*1983.
019764 Brookes, S.D.*A model for communicating sequential processes.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-83_149, Ph.D. Thesis. Brookes,
S.D..*1983. Thesis submitted for degree of Doctor of Philosophy,
University College, Oxford University, January 1983.
019765 Rosenburg, J.*Generating compact code for generic subprograms.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-83-150, Ph.D. Thesis. Rosenberg,
J.*1983.
019766 Kung, H.T. Lin, W.T.*An algebra for VLSI algorithm design.* Carnegie
Mellon U. Comp.Sci.Dept.*CMU-CS-83-100.*1983.
019767 Annaratone, M.*Let's design CMOS circuits! part one.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-101.*1984.
019768 Herman, M. Kanade, T.*The 3D MOSAIC scene understanding system:
incremental reconstruction of 3D scenes from complex images.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-84-102.*1984.
019769 Notkin, D.* Interactive structure oriented computing.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-103, Ph.D. Thesis. Notkin, D.*1984.
019770 Rudolph, L.*A robust sorting network.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-104.*1984.
019771 Zong, Y.X.*Implementation of dynamic process communication on Intel432.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-105.*1984.
019772 Carbonell, J.G. Hayes, P.J.* Recovery strategies for parsing
extragrammatical language.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-107.*1984.
019773 Langley, P. Coarbonell, J.G.*Approaches to machine learning.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-84-108.*1984.
019774 Clarke, E.M.*The characterization problem for Hoare logics. Carnegie
Mellon U. Comp.Sci.Dept.*CMU-CS-84-109.*1984.
019775 Hayes, P.J.* Executable interface definitions using form based interface
abstractions.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-110.*1984.
019776 Kannan, R. Lenstra, A.K. Lovasz, L.* Polynomial factorization and
nonrandomness of bits of algebraic and some transcendental numbers.*
Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-111.*1984.
019777 Bachem, A. Kannan, R.* Lattices and the basis reduction algorithm.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-112.*1984.
019778 McCracken, D.L. Akscyn, R.M.*Experience with the ZOG human computer
interface system.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-113.*1984.
019779 Bloch, J.J. Daniels, D.S. Spector, A.Z.* Weighted voting for directories:
a comprehencive study.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-114.*1984.
019780 Gupta, A.*Implementing OPS5 producition systems on DADO.* Carnegie Mellon
U. Comp.Sci.Dept.*CMU-CS-84-115.*1984.
019781 Doyle, J.* Expert systems without computers or theory and trust in
artificial intelligence.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-116.*1984.
019782 McKeown, D.M. Dellinger, J.L.* Map guided feature extraction from aerial
imagery.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-117.*1984.
019783 Hinton, G.F. Sejnowski, T.J. Ackley, D.H.* Boltzmann machines: constraint
satisfaction networks that learn.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-119.*1984.
019784 Donner, M.D.* Control of walking local control and real time systems.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-121, Ph.D. Thesis. Donner,
M.D.*1984.
019785 Gumpertz, R.H.* Error detection with memory tags.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-122, Ph.D. Thesis. Gumpertz, R.H.*1984.
019786 Siewiorek, D.P.*A summary of fault tolerant computing research.* Carnegie
Mellon U. Comp.Sci.Dept.* CMU-CS-84-123.*1984.
019787 Coutaz, J.*A paradigm for user interface architecture.* Carnegie Mellon
U. Comp.Sci.Dept.*CMU-CS-84-124.*1984.
019788 Sindhu, P.S.*Distribution and reliability in a multiprocessor operating
system.* Carnegie Mellon U. Comp.Sci.Dept.*CMU-CS-84-125, Ph.D. Thesis.
Sindhu, P.S.* 1984.
019789 Mulmuley, K.* Lattice based algorithms.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-126.*1984.
019790 Akscyn, R.M. McCracken, D.L.*The ZOG approach to database management.*
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-84-128.*1984.
019791 Laird, J.E.* Universal subgoaling.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-129, Ph.D. Thesis. Laird, J.E.* 1984.
019792 Clune, E. Segall, Z. Siewiorek, D.*Validation of fault free behavior of a
reliable multiprocessor system FTMP: A case study.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-130.* 1984.
019793 McCarty, D.C.* Realizability and recursive mathematics.* Carnegie Mellon
U. Comp.Sci.Dept.*CMU-CS-84-131, Ph.D. Thesis. McCarty, D.C.*1984.
019794 Forgy, C.L.*The OPS83 Report.* Carnegie Mellon U.
Comp.Sci.Dept.*CMU-CS-84-133.*1984.
019795 Mulmuley, K.*A semantic characterization of full abstraction.
019796 Touretzky, D.S.*The mathematics of inheritance systems.* Carnegie Mellon
U. Comp.Sci.Dept.*CMU-CS-84-135, Ph.D. Thesis. Touretzky, D.S.*1984.
019797 Langley, P. Simon, H.A. Bradshaw, G.L.* Heuristics for empirical
discovery.* Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-14.*1984.
019798 Foster, N.J. Sanderson, A.C.*Determining object orientation from a single
image using multiple information sources.* Carnegie Mellon U. Robotics
Inst.*CMU-RI-TR-84-15.*1984.
019799 Weiss, L.E.* Dynamic visual servo control of robots: an adaptive image
based approach.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-16,
Ph.D. Thesis. Weiss, L.E.* 1984.
019800 Vepsalainen, A.P.J.* State dependent priority rules for scheduling.*
Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-19.*1984.
019801 Germani, A. Piccioni, M.*A Galerkin approximation for the Zakai
equation.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei
Sistemi ed Informatica.*R. 68.* 1983.
019802 Bertolazzi, P. Sudborough, I.H.*The grid embedding problem is NP-complete
even for edge length 2.* Consiglio Nazionale delle Ricerche. Instituto
di Analiso dei Sistemi ed Informatica.*R. 69.*1983.
019803 Bertolazzi, P. De Stefanis, D. Terranova, M.*On optimal file allcation in
database machines.* Consiglio Nazionale delle Ricerche. Instituto di
Analiso dei Sistemi ed Informatica.*R. 70.*1983.
019804 Germani, A. Piccioni, M.* Nonlinear filtering for Markov processes: an L
superscript 2 approach.* Consiglio Nazionale delle Ricerche. Instituto
di Analiso dei Sistemi ed Informatica.*R. 71.*1983.
019805 Bielli, M. Calicchio, G. Cini, M. Magliozzi, L. Oddone, M.* Network
models in planning the new generation of submarine communication
systems.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei
Sistemi ed Informatica.*R. 72.*1983.
019806 Gandolfi, A. Gerardi, A. Marchetti, F.* Association rates of diffusion
controlled reactions in two dimensions.* Consiglio Nazionale delle
Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 73.*1983.
019807 Di Pillo, G. Grippo, L.*A class of continuously differentiable exact
penalty function algorithms for nonlinear programming problems.*
Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed
Informatica.*R. 74.*1983.
019808 Bertolazzi, P. Missikoff, M. Terranova, M.* CID: A VLSI device for lists
intersection.* Consiglio Nazionale delle Ricerche. Instituto di Analiso
dei Sistemi ed Informatica.*R. 75.*1983.
019809 Bovet, D.P. Gambosi, G. Menasche, D.A.*Detection and removal of deadlocks
in store and forward communication networks.* Consiglio Nazionale delle
Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R. 76.*1983.
019810 Atzeni, P. Morfuni, N.M.* Functional dependencies and existence
constraints in database relations with null values.* Consiglio Nazionale
delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R.
77.*1983.
019811 D'atri, A. Moscarini, M.*Recognition and design of acyclic databases.*
Consiglio Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed
Informatica.*R. 78.* 1983.
019812 Salza, S. Bonelli, G.* Directory management of a distributed file system:
a performance analysis.* Consiglio Nazionale delle Ricerche. Instituto
di Analiso dei Sistemi ed Informatica.*R. 79.*1983.
019813 Bertolazzi, P. Bongiovanni, G.*A VLSI structure for the deadlock
avoidance problem.* Consiglio Nazionale delle Ricerche. Instituto di
Analiso dei Sistemi ed Informatica.*R. 80.*1983.
019814 Protasi, M. Talamo, M.*A new probabilistic model for the study of
algorithmic properties of random graph problems.* Consiglio Nazionale
delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R.
81.*1983.
019815 Pettorossi, A.* Towers of Hanoi problems: deriving the iterative
solutions using the program transformation technique.* Consiglio
Nazionale delle Ricerche. Instituto di Analiso dei Sistemi ed
Informatica.*R. 82.* 1984.
019816 Pettorossi, A.*A note on Cohen's paper: eliminating redundant recursive
calls.* Consiglio Nazionale delle Ricerche. Instituto di Analiso dei
Sistemi ed Informatica.*R. 83.*1984.
019817 Monaco, S. Normand-cyrot, D.* Input output approximation of a nonlinear
discrete time system from an equilibrium point.* Consiglio Nazionale
delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R.
84.*1984.
019818 Padberg, M. Sassano, A.* Matching with bonds: 1.* Consiglio Nazionale
delle Ricerche. Instituto di Analiso dei Sistemi ed Informatica.*R.
85.*1984.
019819 Stelovsky, J.* XS-2: The user interface of an interactive system.*
Eidenoessische Technische Hochschule Zurich. Institut fuer
Informatik.*Diss. ETH no. 7425, Ph.D. Thesis. Stelovsky, J.*1984. A
dissertation submitted to the Swiss Federal Institute of Technology
Zurich for the degree of Doctor of Technical Sciences.
019820 Peter, P.*Contribution de la classification automatique pour
l'organisation et l'interrogation d'un corpus de "petit annonces".*
INRIA.*Rapport de Recherche 276.*1984.
019821 Chu, W.Z.*A microcomputer implementation of an interactive functional
programming system.* INRIA.*Rapport de Recherche 277.*1984.
019822 Ecault, C.*Une approache a la validation des protocoles d'enchere par la
methode des tests de specification.* INRIA.*Rapport de Recherche
279.*1984.
019823 Bekkers, Y. Canet, B. Ridoux, O.` Ungaro, L.*Presentation simplifiee
d'une machine de gestion de memoire pour les interpreteurs PROLOG.*
INRIA.*Rapport de Recherche 280.* 1984.
019824 Flajolet, P. Odlyzko, A.M.* Limit distributions for coefficients of
iterates of polynomials with applications to combinatorial
enumerations.* INRIA.*Rapport de Recherche 282.*1984.
019825 Bekkers, Y. Canet, B. Ridoux, O. Ungaro, L.*Specification d'une machine
de gestion memoire pour les interpretuers des langages logiques.*
INRIA.*Rapport de Recherche 283.* 1984.
041731 Richards, W.* Structure from stereo and motion.* M.I.T. A.I. Lab.*Memo
731.*1983.
041732 Hoffman, D.D. Richards, W.* Parts of recognition.* M.I.T. A.I. Lab.*Memo
732.*1984.
041746 Horn, B.K.P. Ikeuchi, K.*Picking parts out of a bin.* M.I.T. A.I.
Lab.*Memo 746.*1983.
041747 Mansour, H.*A structural approach to analogy.* M.I.T. A.I. Lab.*Memo
747.*1983.
041755 Hofstadter, D.R.*The copycat project: An experiment in nondeterminism and
creative analogies.* M.I.T. A.I. Lab.* Memo 755.*1984.
041756 Brady, M.* Artificial intelligence and robotics.* M.I.T. A.I. Lab.*Memo
756.*1984.
041757 Brady, M. Asada, H.* Smoothed local symmetries and their implementation.*
M.I.T. A.I. Lab.*Memo 757.*1984.
041758 Asada, H. Brady, M.*The curvature primal sketch.* M.I.T. A.I. Lab.*Memo
758.*1984.
041759 Lozano-Perez, T. Mason, M.T. Taylor, R.H.* Automatic synthesis of fine
motion strategies for robots.* M.I.T. A.I. Lab.*Memo 759.*1983.
041760 Nguyen, V.D.*The find-path problem in the plane.* M.I.T. A.I. Lab.*Memo
760.*1984.
041761 Hildreth, E.C.*Computations underlying the measurement of visual motion.*
M.I.T. A.I. Lab.*Memo 761.*1984.
041762 Grimson, W.E.L.*Computational experiments with a feature based stereo
algorithm.* M.I.T. A.I. Lab.*Memo 762.*1983.
041780 Nishihara, H.K.* PRISM: A practical real-time imaging stereo matcher.*
M.I.T. A.I. Lab.*Memo 780.*1984.
040704 Brotsky, D.C.*An algorithm for parsing flow graphs.* M.I.T. A.I.
Lab.*AI-TR-704.*1984.
040749 Simmons, R.G.*Representing and reasoning about change in geologic
interpretation.* M.I.T. A.I. Lab.*AI-TR-749.* 1983.
040754 Lathrop, R.H.* Parallelism in manipulator dynamics.* M.I.T. A.I.
Lab.*AI-TR-754.*1984.
019827 Sharir, M. Ariel-Sheffi, E.*On the piano movers' problem. IV. various
decomposable two-dimensional motion planning problems.* New York U.
Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 58; Robotics rpt. 6.*1983.
019828 Hopcroft, J.E. Schwartz, J.T. Sharir, M.*Efficient detection of
intersections among spheres.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 59; Robotics rpt. 7.*1983.
019829 Bleich, C. Overton, M.L.*A linear time algorithm for the weighted median
problem.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt.
75.*1983.
019830 Spirakis, P. Yap, C.*On the combinatorial complexity of motion
coordination.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt.
76; Robotics rpt. 12.*1983.
019831 Bernstein, H.J.*An accelerated bisection method for the calculation of
eigenvalues of a symmetric tridiagonal matrix.* New York U. Inst. of
Math. Sci. Comp.Sci.Dept.* Tech.rpt. 79.*1983.
019832 Vishkin, U.* Lucid-boxes vs. black-boxes.* New York U. Inst. of Math.
Sci. Comp.Sci.Dept.*Tech.rpt. 81.*1983.
019833 Reif, J.H. Spirakis, P.*On the depth of a random graph.* New York U.
Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 82.*1983.
019834 Schwartz, J.T. Sharir, M.*On the piano movers' problem: V. the case of a
rod moving in three dimensional space amidst polyhedral obstacles.* New
York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 83.*1983.
019835 Cole, R. Yap, C.K.* Geometric retrieval problems.* New York U. Inst. of
Math. Sci. Comp.Sci.Dept.*Tech.rpt. 87.*1983.
019836 Cole, R.* Searching and storing similar lists.* New York U. Inst. of
Math. Sci. Comp.Sci.Dept.*Tech.rpt. 88.*1983.
019837 Reif, J. Spirakis, P.*Expected parallel time and sequential space
complexity of graph and digraph problems.* New York U. Inst. of Math.
Sci. Comp.Sci.Dept.*Tech.rpt. 91.*1983.
019838 Spirakis, P. Yap, C.K.*Strong NP hardness of moving many discs.* New York
U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 92; Robotics rpt.
20.*1983.
019839 Spirakis, P.G.*Moving many pebbles in a graph is polynomial time.* New
York U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 93; Robotics rpt.
21.*1983.
019840 Spirakis, P.* Buffered versus unbuffered tree networks for accessing a
critical resource.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 94.*1983.
019841 Trefethen, L.N.* Stability of hyperbolic finite difference models with
one or two boundaries.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 97.*1983.
019842 Spirakis, P.G.*Very fast algorithms for the area of the union of many
circles.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 98;
Robotics rpt. 22.*1983.
019843 Weyuker, E.J.*Axiomatizing software test data adequacy.* New York U.
Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 99.*1984.
019844 Overton, M.L.*Numerical solution of a model problem from collapse load
analysis.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt.
100.*1984.
019845 Widlund, O.B.* Iterative methods for elliptic problems on regions
partitioned into substructures and the biharmonic Dirichlet problem.*
New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 101.*1984.
019846 Spirakis, P. Reif, J.* Probabilistic techniques for two phase locking in
database systems.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 102.1983.
019847 Hopcroft, J.E. Schwartz, J.T. Sharir, M.*On the complexity of motion
planning for multiple independent objects; pspace hardness of the "
warehouseman's problem".* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 103; Robotics rpt. 14.*1984.
019848 Cole, R. Yap, C.K.* Shape form probing.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 104; Robotics rpt. 15.*1983.
019849 Yap, C.K.*Coordinating the motion of several discs.* New York U. Inst. of
Math. Sci. Comp.Sci.Dept.*Tech.rpt. 105; Robotics rpt. 16.*1984.
019850 Cole, R. Sharir, M. Yap, C.K.*On k-hulls and related problems.* New York
U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 108.; Robotics rpt.
17.*1984.
019851 Vishkin, U.*An efficient parallel strong orientation.* New York U. Inst.
of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 109; Ultracomputer note 67.*1984.
019852 Trefethen, L.N.* Square blocks, and equioscillation in the Pade, Walsh,
and CF tables.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 110.*1983.
019853 Hummel, R.A. Gidas, B.C.* Zero crossings and the heat equation.* New York
U. Inst. of Math. Sci. Comp.Sci.Dept.* Tech.rpt. 111; Robotics rpt.
18.*1984.
019854 Trefethen, L.N.*Analysis and design of polygonal resistors by conformal
mapping.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt.
112.*1984.
019855 Spirakis, P.G.* Queuing delay modeling multistage interconnection
multiprocessor networks.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 114; Ultracomputer note 68.*1984.
019856 Hummel, R. Kimia, B.* Deblurring Gaussian blur.* New York U. Inst. of
Math. Sci. Comp.Sci.Dept.*Tech.rpt. 115; Robotics rpt. 23.*1984.
019857 Trefethen, L.N.*On l superscript p and oscillation at discontinuities in
finite difference schemes.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 116.* 1984.
019858 Cole, R.*Slowing down sorting networks to obtain faster sorting
algorithms.* New York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt.
117.*1984.
019859 Reif, J. Spirakis, P.* Probabilistic bidding gives optimal distributed
resource allocation.* New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 118; Robotics rpt. 24.*1983.
019860 Schwartz, J.T. Sharir, M.*Some remarks on robot vision.* New York U.
Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 119; Robotics rpt.
25.*1984.
019861 Bernstein, H.J. Lowney, P.G. Schwartz, J.T.* SERVOL: preliminary
proposal for a programming language for real time servo control.* New
York U. Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 120; Robotics rpt.
26.*1984.
019862 Neale, P.T.* Elastic buffers for digital rings.* U.K. National Physical
Lab. Info. Technology and Computing Div.*DITC 38/84.*1984.
019863 DeWitt, D.J. Katz, R.H. Olken, F. Shapiro, L.D. Stonebraker, M.R. Wood,
D.* California U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL
84/5.*1984.
019864 Murphy, M.* Performance estimates for distributed query processing.*
California U., Berkeley. Electronics Res.Lab.*Memo. no. UCB/ERL
84/30.*1984.
019865 Politof, T. Satyanarayana, A.*An O(/v/ squared) algorithm for a class of
planar graphs to compute the probability that the graph is connected.*
California U., Berkeley. O.R. Center.*ORC 84-4.*1984.
019866 Oliver, R.M.* Exponential smoothing--I.* California U., Berkeley. O.R.
Center.*ORC 84-5.*1984.
019867 Gentner, D.R.* Expertise in typewriting.* California U., San Diego. Human
Info.Proces. Center.*CHIP 121.*1984.
019868 Mozer, M.C.* Inductive information retrieval using parallel distributed
computation.* California U., San Diego. Inst. for Cognitive Sci.*ICS
rpt. 8406.*1984.
019869 Randell, B.* Fault tolerance & system structuring.* Newcastle upon Tyne
U. Computing Lab.*No. 189.*1983.
019870 Peters, J.G.* Time accuracy trade-offs for hard maximization problems.*
Toronto U. Comp.Sci.Dept.*Tech rpt. 169/83, Ph.D. Thesis. Peters,
J.G.*1983.
019871 Mendell, M.P.*Structure of a portable operating system.* Toronto U. Comp.
Systems Res. Group.*CSRG-152.*1983.
019872 Holt, R.C. Cordy, J.R.*The Turing language report.* Toronto U. Comp.
Systems Res. Group.*CSRG-153.*1983.
019873 Gibbs, S.J.*An object oriented office data model.* Toronto U. Comp.
Systems Res. Group.*CSRG-154, Ph.D. Thesis. Gibbs, S.J.*1984.
019874 Norsett, S.P. Thomsen, P.G.*Local error in SDIRK-methods.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-84-10.*1984.
019875 Culik, K. II. Fris, I.*Topological transformations as a tool in the
design of systolic networks.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-84-11.*1984.
019876 Poole, D.L.*The logical definition of deduction systems.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-84-12.*1984.
019877 van Emden, M.*Towards a western fifth generation computer system
project.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-14.*1984.
019878 Joe, B.* Delaunay triangular meshes in convex polygons.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-84-15.*1984.
019879 Courier: The remote procedure call protocol.* Xerox.*XSIS 038112.*1981.
019880 Donahue, J. Demers, A.* Data types are values.* Xerox. Palo Alto Res.
Center.*CSL-83-5.*1984. 019881 Swinehart, D.C. Stewart, L.C. Ornstein,
S.M.*Adding voice to an office computer network.* Xerox. Palo Alto Res.
Center.*CSL-83-8.*1984.
019882 Cartwright, R. Donahue, J.*The semantics of lazy (and industrious)
evaluation.* Xerox. Palo Alto Res. Center.* CSL-83-9.*1984.
VOL. 6, NO. 11 10/22/84
019883 Verwer, J.G. Dekker, K.*Step-by-step stability in the numerical solution
of partial differential equations.* Mathematisch Centrum.*NW
161/83.*1983.
019884 Hemker, P.W.* Mixed defect correction iteration for the solution of a
singular perturbation problem.* Mathematisch Centrum.*NW 162/83.*1983.
019885 Bergstra, J.A. Klop, J.W.* Verification of an alternating bit protocol by
means of process algebra.* Mathematisch Centrum. Centrum voor Wiskunde
en Informatica.*CS-R8404.* 1984.
019886 Bergstra. J.A. Klop, J.W.* Fair FIFO queues satisfy an algebraic
criterion for protocol correctness.* Mathematisch Centrum. Centrum voor
Wiskunde en Informatica.*CS-R8405.*1984.
019887 Vitanyi, P.M.B*One queue or two pushdown stores take square time on a one
head tape unit.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*CS-R8406.*1984.
019888 Baeten, J.C.M. Bergstra, J.A. Klop, J.W.* Mathematisch Centrum. Centrum
voor Wiskunde en Informatica.*CS-R8407.* 1984.
019889 Van de Graaf, J.A.M.*Towards a specification of the B programming
environment.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*CS-R8408.*1984.
019890 Bergstra, J.A. Klop, J.W.* Process algebra for communication and mutual
exclusion.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*CS-R8409.* 1984.
019891 Hemker, P.W. De Zeeuw, P.M.*Some implementations of multigrid linear
system solvers.* Mathematisch Centrum. Centrum voor Wiskunde en
Informatica.*NM-R8401.*1984.
019892 Van der Houwen, P.J. Sommeijer, B.P. De Vries, H.B.* Generalized
predictor corrector methods of high order for the time integration of
parabolic differential equations.* Mathematisch Centrum. Centrum voor
Wiskunde en Informatica.*NM-R8402.*1984.
019893 Sanz-Senrna, J.M. Verwer, J.G.*A study of the recursion y subscript (n +
1) = y subscript (n) + t((y subscript (n)) exp (m)).* Mathematisch
Centrum. Centrum voor Wiskunde en Informatica.*NM-R8403.*1984.
019894 Verwer, J.G. Sanz-Serna, J.M.*Convergence of method of lines
approximations to partial differential equations.* Mathematisch Centrum.
Centrum voor Wiskunde en Informatica.*NM-R8404.*1984.
019895 Sanz-Serna, J.M. Verwer, J.G.* Conservative and nonconservative schemes
for the solution of the nonlinear Schroedinger equation.* Mathematisch
Centrum. Centrum voor Wiskunde en Informatica.*NM-R8405.*1984.
019896 Hendren, L.J.* RIPO - An automated prototyping tool based on nested
arrays.* Queen's U. Computing & Info.Sci.Dept.* Tech.rpt. 84-155.*1984.
019897 Glasgow, J.I.* Logic programming in NIAL.* Queen's U. Computing &
Info.Sci.Dept.*Tech.rpt. 84-158.*1984.
025000 Ullman, J.D.*Implementation of logical query languages for databases.
Stanford U. Comp.Sci.Dept.*STAN-CS-84-1000.* 1984. 41p.
025001 Brinkley, J.F.* Ultrasonic three-dimensional organ modelling.* Stanford
U. Comp.Sci.Dept.*STAN-CS-84-1001, Ph.D. Thesis. Brinkley, J.F.*1984.
141p. A dissertation submitted to the Committee on Graduate Studies of
Stanford University in partial fulfillment of the requirements for the
degree of Doctor of Philosophy in Medical Computer Engineering.
025004 Goldschlager, L.M.*A computational theory of higher brain function.*
Stanford U. Comp.Sci.Dept.*STAN-CS-84-1004.* 1984. 29p.
025005 Manna, Z. Pnueli, A.*Adequate proof principles for invariance and
liveliness properties of concurrent programs.* Stanford U.
Comp.Sci.Dept.*STAN-CS-84-1005.* 1984. 35p.
025006 Ketonen, J. Weening, J.S.* EKL - An interactive proof checker user's
reference manual.* Stanford U. Comp.Sci.Dept.*STAN-CS-84-1006.*1984.
55p.
025007 Gabriel, R.P. McCarthy, J.*Queue-based multi-processing LISP.* Stanford
U. Comp.Sci.Dept.*STAN-CS-84-1007.*1984. 35p.
019898 Marsland, T.A.*A quantitative study of refinements to the alpha beta
algorithm.* Alberta U. Computing Sci.Dept.* TR82-06.*1984.
019899 Chin, F. Wang, C.A.*Optimal algorithms for the intersection and the
minimum distance problems between planar polygons.* Alberta U. Computing
Sci.Dept.*TR82-08.*1982.
019900 Chin, F. Ramarao, K.V.S.*Optimal termination protocols for network
partitioning.* Alberta U. Computing Sci.Dept.* TR82-9.*1982.
019901 Davis, W.A. Lee, D.L.*A very fast associative memory algorithm.* Alberta
U. Computing Sci.Dept.*TR82-10.* 1982.
019902 Schubert, L.K. Papalaskaris, M.A. Taugher, J.*Special inference methods
in a semantic net: lattices of types, parts, colours and times.* Alberta
U. Computing Sci.Dept.* TR83-03.*1983.
019903 Marsland, T.A. Popowich, F.*A multiprocessor tree searching system
design.* Alberta U. Computing Sci.Dept.*TR83-06.* 1983.
019904 Popowich, F. Marsland, T.A.* Parabelle: experience with a parallel chess
program.* Alberta U. Computing Sci.Dept.* TR83-07.*1983.
019905 Jagannathan, D. Marsland, T.A.*An architecture model for distributed
databases.* Alberta U. Computing Sci.Dept.* TR83-08.*1983.
019906 Cabay, S. Kao, T.T.C.*The diagonal Pade table and the triangular
decomposition of Hankel matrices.* Alberta U. Computing
Sci.Dept.*TR83-10.*1983.
019907 Ward, D. Wang, X. Davis, W.A.*A graphics package for constructing Chinese
characters.* Alberta U. Computing Sci.Dept.*TR84-01.*1984.
019908 Cabay, S. Choi, D.K.* Algebraic computations of scaled Pade fractions.*
Alberta U. Computing Sci.Dept.*TR84-02.* 1984.
019909 Ward, D.B. Heuft, R. Tartar, J.* AHF - A graphics language for VLSI
design.* Alberta U. Computing Sci.Dept.*TR84-03.* 1984.
054166 Mayo, R.N.*Combining graphics and procedures in a VLSI layout tool: The
Tpack system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/166.*1984.
054167 Baden, S.B.*High performance storage reclamation in an object-based
memory system.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/167.*1984.
054168 Luby, M.G.*Monte-Carlo methods for estimating system reliability.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 84/168, Ph.D. Thesis.
Luby, M.G.*1984.
054169 De Smedt, P.*Discrete characterization of program referencing dynamics.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/169; California U.,
Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.01.*1984.
054170 Harrison, M.A.*Theoretical issues concerning protection in operating
systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/170.*1984.
054171 Goldberg, A.V.*Finding a maximum density subgraph.* California U.,
Berkeley. Comp.Sci.Div.*UCB/CSD 84/171.* 1984.
054172 Wensley, P.* Hidden feature elimination and visible polygon return in
UNIGRAFIX 2.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/172.*1984.
054173 Sherburne, R.W. Jr.* Processor design tradeoffs in VLSI.* California U.,
Berkeley. Comp.Sci.Div.*UCB/CSD 84/173, Ph.D. Thesis. Sherburne, R.W.
Jr.*1984.
054174 Riggle, D.W.*A name server database.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/174; California U., Berkeley. Comp.Sci.Div.
PROGRES Group.*Rpt. 84.02.*1984.
054175 Hill, M.D. Smith, A.J.*Experimental evaluation of on-chip microprocessor
cache memories.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/175;
California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.03.*1984.
054176 Painter, M.*The design and implementation of a "domain names" resolver.*
California U., Berkeley. Comp.Sci.Div.* UCB/CSD 84/176; California U.,
Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.04.*1984.
054177 Zhou, S.*The design and implementation of the Berkeley Internet Name
Domain ( BIND) servers.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/177; California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt.
84.05.*1984.
054178 Cohen, S.*Multi-version structures in PROLOG.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/178.*1984.
054179 Cohen, S.*The APPLOG language: PROLOG vs. LISP - if you can't fight them
join them.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/179.*1984.
054180 Hac, A.*A decomposition solution to a queueing network model of a
distributed file system with dynamic locking.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/180; California U., Berkeley. Comp.Sci.Div.
PROGRES Group.* Rpt. 84.06.*1984.
054181 Wallace, D.*A comparison of tile-based wire representations for
interactive IC layout tools.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/181.*1984.
054182 Terry, D.B. Painter, M. Riggle, D.W. Zhou, S.*The Berkeley internet name
domain server.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/182;
California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.07.*1984.
054183 Lee, T.P.*Configuring local network-based distributed systems.*
California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/183; California U.,
Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.08, Ph.D. Thesis. Lee,
T.-Y.P.*1984.
054184 Henry, R.R.*Graham-Glanville code generators.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/184, Ph.D. Thesis. Henry, R.R.*1984.
054185 Ramamoorthy, C.V. Nishiguchi, O. Tsai, W.-T.* Simulation of hierarchical
routing algorithms.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/185.*1984.
054186 Bach, E.* Discrete logarithms and factoring.* California U., Berkeley.
Comp.Sci.Div.*UCB/CSD 84/186.*1984.
054187 Bach, E.*Matching modulo divisors, and a simple N superscript 1/4
factoring algorithm.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/187.*1984.
054190 Berger, R. Karloff, H.J. Shmoys, D.B.*The cryptographic security of the
sum of bits.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD
84/190.*1984.
054191 Sechrest, S.*Tutorial examples of interprocess communication in Berkeley
UNIX 4.2 BSD.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/191;
California U., Berkeley. Comp.Sci.Div. PROGRES Group.*Rpt. 84.09.*1984.
054192 Foster, G.* User interface considerations for algebraic manipulation
systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/192.*1984.
054193 Foster, G.* Dreams: Display representation for algebraic manipulation
systems.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 84/193.*1984.
019910 Nau, D.S.* Expert computer systems: a tutorial.* Maryland U. Comp.Sci.
Center.*TR-1201.*1982.
019911 Chu, Y. Abrams, M.* Columbia Ada: A concurrent Ada computer system
organization.* Maryland U. Comp.Sci. Center.* TR-1203.*1982.
019912 David, N.A. Stewart, G.W.* Significance testing in a functional model.*
Maryland U. Comp.Sci. Center.*TR-1204.* 1982.
019913 Cao, D.*The intensional database in the ZMOB parallel problem solving
system.* Maryland U. Comp.Sci. Center.* TR-1205.*1982.
019914 Stewart, G.W.*A note on complex division.* Maryland U. Comp.Sci.
Center.*TR-1206.*1982.
019915 Samet, H.* Hierarchical data structures for representing geographical
information.* Maryland U. Comp.Sci. Center.* TR-1208.*1982.
019916 Samet, H.* Data structures for quadtree approximation and compression.*
Maryland U. Comp.Sci. Center.*TR-1209.* 1982.
019917 Reed, G.M. Rosenfeld, A.*Recognition of surfaces in three dimensional
digital images.* Maryland U. Comp.Sci. Center.*TR-1210.*1982.
019918 Stewart, G.W. Stewart, W.J.*An iterative method for the solution of
nearly decomposable Markov chains.* Maryland U. Comp.Sci.
Center.*TR-1213.*1982.
019919 Reed, G.M.*On the characterization of simple closed surfaces in three
dimensional digital images.* Maryland U. Comp.Sci.
Center.*TR-1214.*1982.
019920 Chu, Y. Abrams, M.* Kernel processor of Columbia Ada concurrent
architecture.* Maryland U. Comp.Sci. Center.* TR-1215.*1982.
019921 Kim, C.E.*Digital disks.* Maryland U. Comp.Sci. Center.* TR-1216.*1982.
019922 Rosenfeld, A.*Some notes on digital triangles.* Maryland U. Comp.Sci.
Center.*TR-1217.*1982.
019923 Rosenfeld, A.*A note on "geometric transforms" of digital sets.* Maryland
U. Comp.Sci. Center.*TR-1218.*1982.
019924 Wood, R.J.* Computer aided program synthesis.* Maryland U. Comp.Sci.
Center.*TR-1219, Ph.D. Thesis. Wood, R.J.*1982.
019925 Hsu, Y.-C.*A brush pen Chinese character output system.* Maryland U.
Comp.Sci. Center.*TR-1220.*1982.
019926 Phillips, T.-Y. Davis, L.S. Rosenfeld, A.*Automatic segmentation of
electron micrographs of berea sandstone cross-sections.* Maryland U.
Comp.Sci. Center.*TR-1221.* 1982.
019927 Samet, H.*Reconstruction of quadtrees from quadtree medical axis
transforms.* Maryland U. Comp.Sci. Center.*TR-1224.* 1982.
019928 Rosenfeld, A.* Image processing in remote sensing data analysis: the
state of the art.* Maryland U. Comp.Sci. Center.*TR-1225.*1982.
019929 Agrawala, A.K. Lakshman, T.V. Ramakrishnan, K.K. Singhal, M. Tripathi,
S.K.* Interconnection architecture.* Maryland U. Comp.Sci.
Center.*TR-1227.*1982.
019930 Krishnamurthy, E.V.*Error-free parallel high-order convergent iterative
matrix inversion based on p-adic approximation.* Maryland U. Comp.Sci.
Center.*TR-1229.* 1982.
019931 Rosenfeld, A.* Diameter time cellular warping.* Maryland U. Comp.Sci.
Center.*TR-1230.*1982.
019932 Krishnamurthy, E.V.*High-order tensor product approximation for 2D and 3D
image blocks with application to multi resolution image representation.*
Maryland U. Comp.Sci. Center.*TR-1231.*1982.
019933 Samet, H.* Quadtree related research.* Maryland U. Comp.Sci.
Center.*TR-1233.*1982.
019934 O'Leary, D.P.*Solving sparse matrix problems on parallel computers.*
Maryland U. Comp.Sci. Center.*TR-1234.*1982.
019935 Samet, H.*A top-down quadtree traversal algorithm.* Maryland U. Comp.Sci.
Center.*TR-1237.*1982.
019936 Hamlet, R. Mills, H.* Functional semantics.* Maryland U. Comp.Sci.
Center.*TR-1238.*1983.
019937 Rosenfeld, A.* Picture processing: 1982.* Maryland U. Comp.Sci.
Center.*TR-1239.*1983.
019938 Beck, J. Prazdny, K.*The perception of transparency with achromatic
colors.* Maryland U. Comp.Sci. Center.* TR-1240.*1983.
019939 Stewart, G.W.*A second order perturbation expansion for small singular
values.* Maryland U. Comp.Sci. Center.* TR-1241.*1983.
019940 Kasif, S. Kohli, M. Minker, J.* PRISM: A parallel inference system for
problem solving.* Maryland U. Comp.Sci. Center.*TR-1243.*1983.
019941 Shneiderman, B.* Human factors of interactive software.* Maryland U.
Comp.Sci. Center.*TR-1244.*1983.
019942 Shneiderman, B.* Direct manipulation: a step beyond programming
languages.* Maryland U. Comp.Sci. Center.* TR-1245.*1983.
019943 Brodd, S.S.* Automason: A robot construction planning scheme.* Maryland
U. Comp.Sci. Center.*TR-1247.*1983.
019944 Kasif, S. Kitchen, L. Rosenfeld, A.*A Hough transform technique for
subgraph isomorphism.* Maryland U. Comp.Sci. Center.*TR-1248.*1983.
019945 Minker, J.*On theories of definite and indefinite databases.* Maryland U.
Comp.Sci. Center.*TR-1250.*1983.
019946 Agrawala, A.K. Woo, N.S.*Properties and an operation rule for the stream
generating CONS function in the data driven computation.* Maryland U.
Comp.Sci. Center.* TR-1251.*1983.
019947 Agrawala, A.K. Woo, N.S.*The generic data/control flow schema and the DC1
flow schema with the data/control-driven evaluation.* Maryland U.
Comp.Sci. Center.*TR-1252.*1983.
019948 Chu, Y. Abrams, M.* Instruction set processor of Columbia Ada concurrent
architecture.* Maryland U. Comp.Sci. Center.*TR-1253.*1983.
019949 Kasif, S. Rosenfeld, A.*The fixed points of images and scenes.* Maryland
U. Comp.Sci. Center.*TR-1254.*1983.
019950 Klette, R.*The m-dimensional grid point space.* Maryland U. Comp.Sci.
Center.*TR-1256.*1983.
019951 Klette, R.*Analysis of data flow for SIMD systems.* Maryland U. Comp.Sci.
Center.*TR-1257.*1983.
019952 Klette, R.*On the approximation of convex hulls of finite grid point
sets.* Maryland U. Comp.Sci. Center.*TR-1258.* 1983.
019953 Matsuyama, T. Hao, L.V. Nagao, M.*A file organization for geographic
information systems based on spatial proximity.* Maryland U. Comp.Sci.
Center.*TR-1260.*1983.
019954 Matsuyama, T. Phillips, T.Y.*Extracting the medial axis from the Voronoi
diagram of boundary segments: an alternative method for closed boundary
detection.* Maryland U. Comp.Sci. Center.*TR-1261.*1983.
019955 Stewart, G.W.*A nonlinear version of Gauss's minimum variance theorem
with applications to an errors-in-the-variables model.* Maryland U.
Comp.Sci. Center.*TR-1263.*1983.
019956 Roussopoulos, N.* Intensional semantics of a self documenting relational
model.* Maryland U. Comp.Sci. Center.*TR-1264.*1983.
019957 Mark, L. Roussopoulos, N.*Integration of data, schema and meta-schema in
the context of self-documenting data models.* Maryland U. Comp.Sci.
Center.*TR-1265.*1983.
019958 Coolahan, J.E. Roussopoulos, N.* Timing requirements for time driven
systems using augmented Petri nets.* Maryland U. Comp.Sci.
Center.*TR-1266.*1983.
019959 Kasif, S.*A note on translating flowchart and recursive schemas to PROLOG
schemas.* Maryland U. Comp.Sci. Center.* TR-1273.*1983.
019960 Xiem H.-C. Wohn, K. Davis, L.S. Rosenfeld, A.* Optical flow field
smoothing by local use of global information.* Maryland U. Comp.Sci.
Center.*TR-1274.*1983.
019961 Representation and processing of spatial knowledge.* Maryland U.
Comp.Sci. Center.*TR-1275.*1983. This is the "proceedings" of an
informal workshop on representing and processing spatial knowledge; it
includes seven complimentary papers.
019962 Lee, C.-H. Rosenfeld, A.*Improved methods of estimating shape from
shading using the light source coordinate system.* Maryland U. Comp.Sci.
Center.*TR-1277.*1983.
019963 Phillips, T. Matsuyama, T.*The labeled discrete Voronoi diagram.*
Maryland U. Comp.Sci. Center.*TR-1278.*1983.
019964 Dunn, S. Harwood, D. Davis, L.S.* Local estimation of the uniform error
threshold.* Maryland U. Comp.Sci. Center.* TR-1279.*1983.
019965 Rosenfeld, A.*Why computers can't see (yet).* Maryland U. Comp.Sci.
Center.*TR-1280.*1983.
019966 Klette, R.* M-dimensional cellular spaces.* Maryland U. Comp.Sci.
Center.*TR-1281.*1983.
019967 Hao, K.*An axiomatic proof system for communicating sequential
processes.* Maryland U. Comp.Sci. Center.* TR-1282.*1983.
019968 Wallace, R.S.* PiL ( Prolog in Lisp) introduction, implementation,
documentation.* Maryland U. Comp.Sci. Center.*TR-1284.*1983.
019969 Eastman, R.D.* Reliability in cellular arrays through data sharing.*
Maryland U. Comp.Sci. Center.*TR-1285.*1983.
019970 Rosenfeld, A. Haber, S.*The perimeter of a fuzzy set.* Maryland U.
Comp.Sci. Center.*TR-1286.*1983.
019971 Samet, H.*Using quadtrees to represent spatial data.* Maryland U.
Comp.Sci. Center.*TR-1287.*1983.
019972 Protsko, L.B. Sorenson, P.G. Tremblay, J.-P.*A system for the automatic
generation of data flow diagrams.* Saskatchewan U. Computational
Sci.Dept.*Rpt. 84-08.*1984.
019973 Kalita, J.K.*Generating summary responses to natural langauge database
queries.* Saskatchewan U. Computational Sci.Dept.*Rpt. 84-09.*1984.
019974 Dandamudi, S.P. Sorenson, P.G.*Performance of a modified k-d tree.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 84-10.*1984.
019975 Dandamudi, S.P. Sorenson, P.G.*Algorithms for the BD tree structure.*
Saskatchewan U. Computational Sci.Dept.*Rpt. 84-11.*1984.
019976 Dandamudi, S.P. Bunt, R.B.*Refined models of program behaviour for
improved memory management.* Saskatchewan U. Computational
Sci.Dept.*Rpt. 84-12.*1984.
019977 Dandamudi, S.P. Sorenson, P.G.*An empirical performance comparison of
some variations of the k-d tree and BD tree.* Saskatchewan U.
Computational Sci.Dept.*Rpt. 84-13.*1984.
019978 Feather, M.S.* Specification and transformation: automated
implementation.* Southern California U. Info.Sci.Inst.*
ISI/RR-83-124.*1984.
019979 Feather, M.S.* Reuse in the context of a transformation based
methodology.* Southern California U.
Info.Sci.Inst.*ISI/RR-83-125.*1984.
019980 Kaczmarek, T. Mark, W. Sondheimer, N.*The Consul/ Cue interface: An
integrated interactive environment.* Southern California U.
Info.Sci.Inst.*ISI/RR-83-126.* 1984.
019981 Bates, R.L. Dyer, D. Koomen, J.A.G.M.*Implementation of Interlisp on the
VAX.* Southern California U. Info.Sci.Inst.*ISI/RR-83-129.*1984.
019982 The MOSIS system.* Southern California U. Info.Sci.Inst.*
ISI/RR-83-128.*1984.
019983 Batory, D.S.*Modeling the storage architectures of commercial database
systems.* Texas U. Comp.Sci.Dept.* TR-83-21.*1984.
019984 Batory, D.S.*Progress toward automating the development of database
system software.* Texas U. Comp.Sci.Dept.* TR-84-03.*1984.
019985 Batory, D.S. Buchmann, A.P.* Molecular objects, abstract data types, and
data models: a framework.* Texas U. Comp.Sci.Dept.*TR-84-07.*1984.
019986 Boyer, R.S. Moore, J.S.* Proof checking, theorem proving, and program
verification.* Texas U. Computing Sci.Inst.* TR-035.*1983.
019988 Russinoff, D.M.*An experiment with the Boyer Moore program verification
system: a proof of Wilson's theorem.* Texas U. Computing
Sci.Inst.*TR-038.*1983.
019989 Akers, R.L.*A gypsy to Ada program compiler.* Texas U. Computing
Sci.Inst.*TR-039.*1983.
019990 McHugh, J.*Towards the generation of efficient code from verified
programs.* Texas U. Computing Sci.Inst.*TR-040, Ph.D. Thesis. McHugh,
J.*1984.
019991 Good, D.I.*Mechanical proofs about computer programs.* Texas U. Computing
Sci.Inst.*TR-041.*1984.
019992 Siebert, A.E. Good, D.I.*General message flow modulator.* Texas U.
Computing Sci.Inst.*TR-042.*1984.
019987 Boyer, R.S. Moore, J.S.*A mechanical proof of the Turing completeness of
Pure LISP.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable
Minicomputer Project.* ICSCA-CMP-37.*1983.
019993 Scott, M.L. Finkel, R.A.*A simple mechanism for type security across
compilation units.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 541.*1984.
019994 Mangasarian, O.L.*Some applications of penalty functions in mathematical
programming.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 544.*1984.
019995 Kamowitz, D. Parter, S.V.*A study of some multi grid ideas.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 545.*1984.
019996 Bent, S.W. Manber, U.*On non intersecting Eulerian circuits.* Wisconsin
U. Comp.Sci.Dept.*Tech.Rpt. 546.* 1984.
019997 Johnson, G.F.*An approach to incremental semantics.* Wisconsin U.
Comp.Sci.Dept.*Tech.Rpt. 547, Ph.D. Thesis. Johnson, G.F.*1984.
019998 Parter, S.V.* Iterative methods for elliptic problems and the discovery
of "q".* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 548.*1984.
019999 Smith, J.E. Goodman, J.R.* Instruction cache replacement policies and
organizations.* Wisconsin U. Comp.Sci.Dept.* Tech.Rpt. 549.*1984.
VOL. 6, NO. 12 11/15/84
100001 Thorpe, C.E.*An analysis of interest operators for FIDO.* Carnegie Mellon
U. Robotics Inst.*CMU-RI-TR-83-19.*1983.
100002 Kosy, D.W. Dhar, V.* Knowledge based support systems for long range
planning.* Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-83-31.*1983.
100003 Fox, M.S.* Constraint directed search: a case study of job shop
scheduling.* Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-83-22;
Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-83-161, Ph.D. Thesis. Fox,
M.S.*1983.
100004 Book, W.J.* Recursive Lagrangian dynamics of flexible manipulator arms
via transformation matrices.* Carnegie Mellon U. Robotics
Inst.*CMU-RI-TR-83-23.*1983.
100005 Willis, J.C. Sanderson, A.C.* RAPIDbus: design of an extensible
multiprocessor structure.* Carnegie Mellon U. Robotics
Inst.*CMU-RI-TR-84-13.*1984.
100006 Fuhrman, M. Kanade, T.*Design of an optical proximity sensor using
multiple cones of light for measuring surface shape.* Carnegie Mellon U.
Robotics Inst.* CMU-RI-TR-84-17.*1984.
100007 Crowley, J.L.* Navigation for an intelligent mobile robot.* Carnegie
Mellon U. Robotics Inst.*CMU-RI-TR-84-18.*1984.
100008 Langley, P. Zytkow, J. Simon, H.A. Bradshaw, G.L.*The search for
regularity: four aspects of scientific discovery.* Carnegie Mellon U.
Robotics Inst.* CMU-RI-TR-84-20.*1984.
100009 Langley, P.* Learning to search: From weak methods to domain specific
heuristics.* Carnegie Mellon U. Robotics Inst.*CMU-RI-TR-84-21.*1984.
100010 Mandai, T.*On exceptional cases of Cauchy problems for Fuchsian partial
differential operators.*Kyoto U. Res.Inst.Math.Sci.*RIMS-457.*1983.
100011 Iwasaki, N.*The Cauchy problem for effectively hyperbolic
equations.*Kyoto U. Res.Inst.Math.Sci.*RIMS-468.*1984.
099091 M.I.T. E.E. & Comp.Sci.Dept.* VLSI Memoranda.*No. 83-151- 1983- "Memos in
this series...are not considered to be published merely by virtue of
appearing in this series. References to these works should be either to
the published version, if any, or in the form 'private
communication'...":
099091/151 Baratz, A.*Algorithms for integrated circuit signal routing.*1983.
099091/153 Karp, R.M. Leighton, F.T. Rivest, R.L. Thompson, C.D. Vazirani, U.
Vazirani, V.*Global wire routing in two-dimensional arrays.*1983.
099091/172 Leighton, T.*Tight bounds on the complexity of parallel
sorting.*1984.
099091/178 Franzblau, D.S. Kleitman, D.J.*An algorithm for constructing regions
with rectangles: independence and minimum generating sets for
collections of intervals.*1984.
099091/182 Leighton, T. Rosenberg, A.L.*Three-dimensional circuit layouts.*1984.
099091/191 McCormick, S.P.*EXCL: a circuit extractor for IC designs.*1984.
099091/195 Bain, I.L.*Methodology verification of hierarchically described VLSI
circuits.*1984.
100012 Pawlak, Z.* Discrimination power of attributes in knowledge
representation system.* Polish Academy of Sciences. Inst. of
Comp.Sci.*ICS PAS rpt. no. 533.*1984.
100013 Bazewicz, M. Lazor, E.* User access method to heterogenous computer
network resources.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS rpt. no. 534.*1984.
100014 Orlowska, E. Pawlak, Z.* Logical foundations of knowledge
representation.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS
rpt. no. 537.*1984.
100015 Subieta, K. Karczewski, J.* NETUL: An integrated and user interface for
CODASYL databases.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS
PAS rpt. no. 539.*1984.
100016 Pawlak, Z.* Rough sets and fuzzy sets.* Polish Academy of Sciences. Inst.
of Comp.Sci.*ICS PAS rpt. no. 540.*1984.
100017 Wendel, H.*Zur Bestimmung optimaler Diagonalpivotfolgen fur schwach
besetzte, positiv definite Matrizen.* Technische Universitaet Muenchen.
Institut fuer Informatik.* TUM-I8308.*1983.
100018 Kroger, F.*Some new aspects of the temporal logic of concurrent
programs.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8311.*1983.
100019 Bauer, F.L. Wossner, H.*Beispiele zur Programmentwicklung: Abgebrochener
Dual-Logarithmus.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8312.*1983.
100020 Benk, M. Giegerich, R. Mose, U.*A miniature study in automatic code
generator generation.* Technische Universitaet Muenchen. Institut fuer
Informatik.* TUM-I8313.*1983.
100021 Partsch, H.*A transformational approach to parsing and recognition.*
Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8314.*1983.
100022 Gerold, R. Heigert, J. Roth, C. Schutt, T.E.* MARS - Technische
Beschreibung.* Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8401.*1984.
100023 Kiessling, W. Pfeiffer, H.*A comprehensive analysis of lockprotocol
quality for centralized database systems.* Technische Universitaet
Muenchen. Institut fuer Informatik.*TUM-I8402.*1984.
100024 Berghammer, R.*Zur formalen Entwicklung von graphentheoretischen
Algorithmen durch Transformation.* Technische Universitaet Muenchen.
Institut fuer Informatik.*TUM-I8403.*1984.
100025 Zink, L.*Speichereffizienter Plotalgorithmus fur Matrixdrucker.*
Technische Universitaet Muenchen. Institut fuer
Informatik.*TUM-I8404.*1984.
100026 Kroger, F.*On the formal description and derivation of temporal proof
rules for program properties.* Technische Universitaet Muenchen.
Institut fuer Informatik.* TUM-I8405.*1984.
100027 Castigiano, D.P.L.* Orthogonal polynomials and rigged Hilbert space.*
Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8313.*1983.
100028 Castrigiano, D.P.L. Mutze, U.*On repeated measurements in quantum
theory.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8314.*1983.
100029 Zink, L.*Numerische Behandling von Eckensingulatitaten der biharmonischen
Gleichung.* Technische Universitaet Muenchen. Institut fuer
Mathematik.*TUM-M8315.*1983.
100030 Castrigiano, D. Mutze, U.*On the commutant of an irreducible set of
operators in real Hilbert space.* Technische Universitaet Muenchen.
Institut fuer Mathematik.*TUM-M8316.*1983.
100031 Castrigiano, D.P.L. Kokiantonis, N. Stierstorfer, H.* Free energy and
effective mass of the polaron at finite temperatures.* Technische
Universitaet Muenchen. Institut fuer Mathematik.*TUM-M8401.*1984.
100032 Cox, M.G. Manneback, P.E.* Least squares spline regression with block
diagonal variance matrices.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 40/84.*1984.
100033 Brocklehurst, E.R.*Computer methods of signature verification.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
41/84.*1984.
100034 Anthony, G.T.*On an algorithm for Pythagorean sums and its connection
with continued fractions.* U.K. National Physical Lab. Info. Technology
and Computing Div.*DITC 42/84.*1984.
100035 Oliver, P.*Implementation assessment of a network service: The test
responder exerciser specification.* U.K. National Physical Lab. Info.
Technology and Computing Div.*DITC 44/84.*1984.
100036 Kok, J. Symm, J.T.*A proposal for standard basic functions in Ada.* U.K.
National Physical Lab. Info. Technology and Computing Div.*DITC
45/84.*1984.
100037 Symm, J.T.* Boundary element methods in potential theory - four
lectures.* U.K. National Physical Lab. Info. Technology and Computing
Div.*DITC 46/84.*1984.
100038 Janssen, T.M.V. Emde Boas, P. van* Compositionality of meaning in logic
and computer science.* Amsterdam U. Math.Dept.*Rpt. 84-13.*1984.
100039 Meyling, R.H.J.G. Pfluger, P.R.* B-spline approximation of a closed
surface.* Amsterdam U. Math.Dept.*Rpt. 84-16.* 1984.
100040 Chow, S.N. De Jager, E.M.*The ghost solution of the logistic equation and
a singular perturbation problem.* Amsterdam U. Math.Dept.*Rpt.
84-18.*1984.
100041 Jewell, W.S. Schnieper, R.* Credibility approximations for Bayesian
prediction of second moments.* California U., Berkeley. O.R. Center.*ORC
84-3.*1984.
100042 Ross, S.M. Schechner, Z.* Simulation uses of the exponential
distribution.* California U., Berkeley. O.R. Center.*ORC 84-6.*1984.
100043 Barlow, R.E. Singpurwalla, N.D.*Assessing the reliability of computer
software and computing networks: an opportunity for partnership with
computer scientists.* California U., Berkeley. O.R. Center.*ORC
84-7.*1984.
100044 Chan, M.Y.*On redundancy for strict optimal performance in disk modulo
allocation.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-A1-84.*1984.
100045 Chan, M.Y.* Multidisk file design: An analysis of folding buckets to
disks.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-A3-84.*1984.
100046 Evans, J.B.* Simulation and intelligence.* Hong Kong U. Comp. Studies
and Appl. Centre.*TR-A5-84.*1984.
100047 Evans, J.B.*A characterisation of discrete simulation complexity.* Hong
Kong U. Comp. Studies and Appl. Centre.* TR-A6-84.*1984.
100048 Chen, T.C. Tong, P.C. Chan, C.*The development of Chinese language
computers in Hong Kong.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-B3-84.*1984.
100049 Chan, F.T. Chen, T.Y.* AIDA - A data flow analysis system for Pascal
programs.* Hong Kong U. Comp. Studies and Appl. Centre.*TR-B5-84.*1984.
100050 Kao, H. Luk, M.S. Ying, W.C. Chen, T.Y.* COD - an automated data flow
analysis system for Cobol programs.* Hong Kong U. Comp. Studies and
Appl. Centre.*TR-B6-84.*1984.
100051 Chan, C.*Separation of fricatives from aspirated plosives by means of
temporal spectral variation.* Hong Kong U. Comp. Studies and Appl.
Centre.*TR-C5-84.*1984.
100052 Gao, C. Liu, J.W.S. Railey, M.* Load balancing algorithms in homogenous
distributed systems.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-84-1168.*1984.
100053 Berman, A.* Ramteklib: low-level library package for the Ramtek 9460
graphic display system.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-84-1175.*1984.
100054 Plaisted, D.A.*Constructs for sets, quantifiers, and rewrite rules in
LISP.* Illinois U. Comp.Sci.Dept.* UIUCDCS-R-84-1176.*1984.
100055 Miller, A.R.* Control unit performance issues in a multiprogrammed,
multiprocessing computer.* Illinois U.
Comp.Sci.Dept.*UIUCDCS-R-84-1178.*1984.
100056 Ford, R. Wagner, M.* Performance evaluation methodologies for abstract
data type implementation techniques.* Iowa U. Comp.Sci.Dept.*Tech.rpt.
84-04.*1984.
100057 Brinck, K.*The expected performance of traversal algorithms in binary
trees.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 84-05.* 1984.
100058 Yu, K.S.-M.*A testbed database generator.* Iowa U.
Comp.Sci.Dept.*Tech.rpt. 84-07.*1984.
100059 Sawamiphakdi, D.*A multiprocess design for an integrated programming
environment.* Iowa U. Comp.Sci.Dept.* Tech.rpt. 84-08, Ph.D. Thesis.
Sawamiphakdi, D.*1984.
100060 Jones, D.W.* Machine independent SMAL: A symbolic macro assembly
language.* Iowa U. Comp.Sci.Dept.*Tech.rpt. 84-09.*1984.
100061 Lyche, T.*A note on Chebyshevian B-splines.* Oslo U. Informatics
Inst.*Res.rpt. 81.*1984.
100062 Koch, P.E.* Exponentially fitted collocation methods for singularly
perturbed two point boundary value problems.* Oslo U. Informatics
Inst.*Res.rpt. 82.*1984.
100063 Krogdahl, S.*An efficient implementation of Simula classes with multiple
prefixing.* Oslo U. Informatics Inst.* Res.rpt. 83.*1984.
100064 Dahl, O.-J.* Logic of programming and specification.* Oslo U. Informatics
Inst.*Res.rpt. 84.*1984.
100065 Koch, P.E.* Multivariate trigonometric B splines.* Oslo U. Informatics
Inst.*Res.rpt. 85.*1984.
100066 Nossum, R.* Decision algorithms for program verification.* Oslo U.
Informatics Inst.*Res.rpt. 86.*1984.
100067 Bajcsy, R.* Shape from touch.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-01.*1983.
100068 Bajcsy, R. Brown, D. Wolfield, J. Peters, D.*What can we learn from one
finger experiments?* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-03.*1983.
100069 Bajcsy, R.*What can artificial intelligence techniques do for processing
of satellite pictures?* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-06.*1983.
100070 Ait-Kaci, H.*An algorithm for finding a minimal recursive path ordering.*
Penna. U. Moore Sch. of E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-07.*1983.
100071 Bajcsy, R.*Integrating vision and touch for robotics applications.*
Penna. U. Moore Sch. of E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-08.*1983.
100072 Jalali, F.*Design of incremental compilers.* Penna. U. Moore Sch. of
E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-09, Ph.D. Thesis. Jalali, F.*1983.
100073 Hirschberg, J.* Scalar quantity implicature: a strategy for processing
scalar utterances.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-10.*1983.
100074 Winston, I.* PMDF - A Pascal based memo distribution facility.* Penna. U.
Moore Sch. of E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-11.*1983.
100075 Schuster, E. Finin, T.W.*Understanding misunderstandings.* Penna. U.
Moore Sch. of E.E. Comp. & Info.Sci.Dept.* MS-CIS-83-12.*1983.
100076 Schuster, E.*Custom-made responses: maintaining and updating the user
model.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-13.*1983.
100077 Howe, A.* HOW? A customizable, associative network based help facility.*
Penna. U. Moore Sch. of E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-14.*1983.
100078 Chafetz, R.M.* Incremental partial matching of descriptions in a
knowledge representation network.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-15.*1983.
100079 Bajcsy, R.*Parallel between vision and touch.* Penna. U. Moore Sch. of
E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-17.* 1983.
100080 Webber, B.L.* Logics and natural language.* Penna. U. Moore Sch. of E.E.
Comp. & Info.Sci.Dept.*MS-CIS-83-18.*1983.
100081 Duncan, R.J.* CADRS: a system for the design of complex data structures
in LISP.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-19.*1984.
100082 Joshi, A.K.*Processing of sentences with intra-sentential
code-switching.* Penna. U. Moore Sch. of E.E. Comp. &
Info.Sci.Dept.*MS-CIS-83-23.*1983.
100083 Joshi, A.K.*How much context-sensitivity is required to provide
reasonable structural descriptions: tree adjoining grammars.* Penna. U.
Moore Sch. of E.E. Comp. & Info.Sci.Dept.*MS-CIS-83-24.*1983.
100084 Mockapetris, P. Postel, J. Kirton, P.* Name server design for distributed
systems.* Southern California U. Info.Sci.Inst.*ISI/RS-84-132.*1984.
100085 Mockapetris, P.*The domain name system.* Southern California U.
Info.Sci.Inst.*ISI/RS-84-133.*1984.
100086 Katz, A.R.*An experimental internetwork multimedia mail system.* Southern
California U. Info.Sci.Inst.* ISI/RS-84-134.*1984.
100087 Cohen, D.* Satellite communication of real time packet video images.*
Southern California U. Info.Sci.Inst.* ISI/RS-84-136.*1984.
100088 Bates, R.L. Dyber, D. Feber, M.*Recent developments in ISI Interlisp.*
Southern California U. Info.Sci.Inst.* ISI/RS-84-131.*1984.
099034 Southern California U. Info.Sci.Inst.*Annual technical report: July 1982
- June 1983.
100089 Char, B.W. Fee, G.J. Geddes, K.O. Gonnet, G.H. Monagan, M.B. Watt,
S.M.*On the design and performance of the Maple system.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-84-13.*1984.
100090 Chan, P.P.*Learning considerations in user interface design: the room
model.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-84-16.*1984.
100091 Mavaddat, F.*An architecture and layout for register transfer level IC
design.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-84-18.*1984.
100092 Joe, B.* Finite element triangulation of complex regions using
computational geometry.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-19,
Ph.D. Thesis. Joe, B.* 1984.
100093 Munro, J.I.*An implicit data structure for the dictionary problem that
runs in polylog time.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-84-20.*1984.
100094 Chu, E. George. A.*An algorithm to estimate the error in Gaussian
elimination without pivoting.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-84-21.*1984.
100095 Yoeli, M. Brzozowski, J.A.*A mathematical model of digital CMOS
networks.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-22.*1984.
100096 Ashcroft, E.A. Wadge, W.W.*The syntax and semantics of LUCID.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-84-24.* 1984.
100097 Brzozowski, J.A. Knast, R.* Graph congruences and pair testing.* Waterloo
U. Comp.Sci.Dept.*Res.rpt. CS-84-25.* 1984.
100098 Conn, A.R.* Nonlinear programming, exact penalty functions and projection
techniques for non-smooth functions.* Waterloo U.
Comp.Sci.Dept.*Res.rpt. CS-84-26.*1984.
100099 Lucena, C.J. Martins, R.C.B. Cowan, D.D.* Data driven prototyping and
implementation of file processing programs using the data transform
method.* Waterloo U. Comp.Sci.Dept.*Res.rpt. CS-84-28.*1984.
100100 Mavaddat, F. Cheng, S.K.S.* Word recognition in a reduced linear
prediction space.* Waterloo U. Comp.Sci.Dept.* Res.rpt. CS-84-29.*1984.
100101 Smith, C.J.*A discussion and implementation of Kovacic's algorithm for
ordinary differential equations.* Waterloo U. Comp.Sci.Dept.*Res.rpt.
CS-84-35.*1984.
100102 Carey, M.J. Muhanna, W.A.*The performance of multiversion concurrency
control algorithms.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt. 550.*1984.
100103 Moran, S. Snir, M. Manber, U.*Applications of Ramsey's theorem to
decision trees complexity.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt.
551.*1984.
100104 Robinson, S.M.* Local structure of feasible sets in nonlinear
programming, part III: stability and sensitivity.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 552.* 1984.
100105 DeWitt, D.J. Finkel, R. Solomon, M.*The CRYSTAL multicomputer: design and
implementation experience.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt.
553.*1984.
100106 Artsy, Y. Chang, H.-Y. Finkel, R.* Charlotte: design and implementation
of a distributed kernel.* Wisconsin U. Comp.Sci.Dept.*Tech.rpt.
554.*1984.
100107 Parter, S.V.*A note on convergence of the multigrid v-cycle.* Wisconsin
U. Comp.Sci.Dept.*Tech.rpt. 555.* 1984.
100108 Carey, M.J. Livny, M. Lu, H.* Dynamic task allocation in a distributed
database system.* Wisconsin U. Comp.Sci.Dept.* Tech.rpt. 556.*1984.
100109 Ho, S.-B. Dyer, C.R.* Medial axis based shape smoothing.* Wisconsin U.
Comp.Sci.Dept.*Tech.rpt. 557.*1984.
100110 Guerra, J.*Numerical solution of the Euler equations for small Mach
numbers.* Uppsala U. Comp.Sci.Dept.*Rpt. 96, Ph.D. Thesis. Guerra,
J.*1984. The second of two parts of the author's doctoral dissertation.
100111 Guerra, J.*Numerical methods for hyperbolic problems with different time
scales.* Uppsala U. Comp.Sci.Dept.*Rpt. 97, Ph.D. Thesis. Guerra,
J.*1984. Summary of the author's doctoral dissertation (the body of the
dissertation is contained in Uppsala University Department of Computer
Science report nos. 90 and 96).
100112 Rada, R.* Search spaces and constraints.* Wayne State U.
Comp.Sci.Dept.*CSC-84-002.*1984.
100113 Grosky, W.I. Mehrotra, R.* Opaque and transparent entity databases.*
Wayne State U. Comp.Sci.Dept.*CSC-84-003.* 1984.
100114 Kampfner, R.R.*Formal specification of information systems requirements.*
Wayne State U. Comp.Sci.Dept.*CSC-84-004.* 1984.
100115 Collier, P.A. Lakos, C.A.*A rigorous logic basis for the science of
programming.* Tasmania U. Info.Sci.Dept.*No. R84-01.*1984.
100116 De Souza e Silva, E. Lavenburg, S.S. Muntz, R.R.*A clustering
approximation technique for queueing network models with a large number
of chains.* California U., L.A. Comp.Sci.Dept.*CSD-840034.*1984.
100117 Rumelhart, D.E. Zipser, D.* Feature discovery by competitive learning.*
California U., San Diego. Inst. for Cognitive Sci.*ICS rpt. 8407.*1984.
100118 Shibayama, K.*Developments and applications of universal host computer
systems.* Kyoto U. Faculty of Eng. Info.Sci.Dept.* Ph.D. Thesis.
Shibayama, K.*1984.
100119 Vitanyi, P.M.B.* Square time is optimal for simulation of one pushdown
store by an oblivious one-head tape unit.* Mathematisch Centrum. Centrum
voor Wiskunde en Informatica.*CS-R8402.*1984.
VOL. 6, NO. 13 11/30/84
100120 Bromley, H.*A program for therapy of acid-base and electrolyte
disorders.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TM-240.*1983.
100121 Arvind. Iannucci, R.A.*Two fundamental issues in multiprocessing: the
dataflow solution.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TM-241.*1983.
100122 Pingali, K. Arvind.*Efficient demand driven evaluation (1).* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TM-242.*1983.
100123 Pingali, K. Arvind.*Efficient demand driven evaluation (II).* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TM-243.*1983.
100124 Goldreich, O. Goldwasser, S. Micali, S.*How to construct random
functions.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TM-244.*1983.
100125 Meyer, A.R.*Understanding Algol: a view of a recent convert to
denotational semantics.* M.I.T. Lab. for Comp.Sci.*
MIT/LCS/TM-245.*1983.
100126 Trakhtenbrot, B.A. Halpern, J.Y. Meyer, A.R.*From denotational to
operational and axiomatic semantics for Algol like languages: an
overview.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TM-246.*1983.
100127 Leighton, T. Lepley, M.* Probabilistic searching in sorted linked lists.*
M.I.T. Lab. for Comp.Sci.*MIT/LCS/TM-247.* 1983.
100128 Leighton, F.T. Rivest, R.L.*Estimating a probability using finite
memory.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TM-248.*1983.
100129 Leighton, F.T. Rivest, R.L.*The Markov chain tree theorem.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TM-249.*1983.
100130 Goldreich, O.*On concurrent identification protocols.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TM-250.*1983.
100131 Dolev, D. Lynch, N. Pinter, S. Stark, E. Weihl, W.*Reaching approximate
agreement in the presence of faults.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TM-251.*1983.
100132 Zachos, S. Heller, H.*On BPP.* M.I.T. Lab. for Comp.Sci.*
MIT/LCS/TM-252.*1983.
100133 Chor, B. Leiserson, C. Rivest, R. Shearer, J.*An application of number
theory to the organization of raster graphics memory.* M.I.T. Lab. for
Comp.Sci.* MIT/LCS/TM-253.*1984.
100134 Feldmeier, D.C.*Empirical analysis of a token ring network.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TM-254.*1984.
100135 Bhatt, S.N. Leiserson, C.E.*How to assemble tree machines.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TM-255.*1984.
100136 Goldreich, O.*On the number of close-and-equal pairs of bits in a string
(with implications on the security of RSA's L.S.B.).* M.I.T. Lab. for
Comp.Sci.* MIT/LCS/TM-256.*1984.
100137 Dwork, C. Kanellakis, P.C. Mitchell, J.C.*On the sequential nature of
unification.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TM-257.*1984.
100138 Halpern, J.Y. Meyer, A.R. Trakhtenbrot, B.A.*The semantics of local
storage, or what makes the free list free?* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TM-258.*1984.
100139 Lynch, N.A. Frederickson, G.N.*The impact of synchronous communication on
the problem of electing a leader in a ring.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TM-259.*1984.
100140 Chor, B. Goldreich, O.*RSA/Rabin least significant bits are (1/2 +
1/(poly(log N))) secure.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TM-260.*1984.
100141 Zaks, S.*Optimal distributed algorithms for sorting and ranking.* M.I.T.
Lab. for Comp.Sci.*MIT/LCS/TM-261.*1984.
100142 Leighton, T. Rosenburg, A.*Three-dimensional circuit layouts.* M.I.T.
Lab. for Comp.Sci.*MIT/LCS/TM-262.* 1984.
100143 Sirbu, M.A. Jr. Sutherland, J.B.* Naming and directory issues in message
transfer systems.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TM-263.*1984.
100144 Sarin, S.K. Greif, I.*Software for interactive on-line conferences.*
M.I.T. Lab. for Comp.Sci.*MIT/LCS/TM-264.* 1984.
100145 Lundelius, J. Lynch, N.*A new fault tolerant algorithm for clock
synchronization.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TM-265.*1984.
020289 Sirbu, M.A. Jr. Schoichet, S.R. Kunin, J.S. Hammer, M.M. Sutherland,
J.B. Zarmer, C.L.* Office analysis: methodology and case studies.*
M.I.T. Lab. for Comp.Sci.* MIT/LCS/TR-289.*1983.
020290 Sutherland, J.*An office analysis and diagnosis methodology.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TR-290.* 1983.
020291 Pinter, R.Y.*The impact of layer assignment methods on layout algorithms
for integrated circuits.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-291,
Ph.D. Thesis. Pinter, R.Y.* 1982.
020292 Dornbrook, M. Blank, M.*The MDL programming language primer.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TR-292.*1979.
020293 Galley, S.W. Pfister, G.*The MDL programming language.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-293.*1979.
020294 Lebling, P.D.*The MDL programming environment.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-294.*1980.
020295 Church, K.W.* Phrase structure parsing: a method for taking advantage of
allophonic constraints.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-296, Ph.D.
Thesis. Church, K.W.* 1983.
020297 Mok, A.K.-L.*Fundamental design problems of distributed systems for the
hard real time environment.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-297,
Ph.D. Thesis. Mok, A.K.-L.* 1983.
020298 Krugler, K.* Video games and computer aided instruction.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-298.*1983.
020299 Wing, J.M.*A two tiered approach to specifying programs.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-299, Ph.D. Thesis. Wing, J.M.*1983.
020300 Cooper, G.H.*An argument for soft layering of protocols.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-300.*1983.
020301 Valente, J.A.*Creating a computer based learning environment for
physically handicapped children.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-301, Ph.D. Thesis. Valente, J.A.*1983.
020312 Lancaster, J.N.* Naming in a programming support environment.* M.I.T.
Lab. for Comp.Sci.*MIT/LCS/TR-312.* 1983.
020313 Koile, K.*The design and implementation of an online directory assistance
system.* M.I.T. Lab. for Comp.Sci.* MIT/LCS/TR-313.*1983.
020314 Weihl, W.E.* Specification and implementation of atomic data types.*
M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-314, Ph.D. Thesis. Weihl,
W.E.*1984.
020315 Coan, B.A. Turpin, R.*Extending binary Byzantine agreement to multivalued
Byzantine agreement.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-315.*1984.
020316 Comer, M.H.* Loose consistency in a personal computer mail system.*
M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-316.*1984.
020317 Traub, K.R.*An abstract architecture for parallel graph reduction.*
M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-317.* 1984.
020318 Asbell, I.J.*A constraint repression and explanation facility for renal
physiology.* M.I.T. Lab. for Comp.Sci.*MIT/LCS/TR-318.*1984.
020319 Herlihy, M.P.* Replication methods for abstract data types.* M.I.T. Lab.
for Comp.Sci.*MIT/LCS/TR-319, Ph.D. Thesis. Herlihy, M.P.*1984.
020320 Kornhauser, D.M.*Coordinating pebble motion on graphs, the diameter of
permutation groups, and applications.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-320.*1984.
020321 Kuszmaul, B.C.* Type checking in VIMVAL.* M.I.T. Lab. for
Comp.Sci.*MIT/LCS/TR-321.*1984.
020322 Moulton, A.S.* Routing the power and ground wires on a VLSI chip.* M.I.T.
Lab. for Comp.Sci.*MIT/LCS/TR-322.*1984.
020323 Ackerman, W.B.*Efficient implementation of applicative languages.* M.I.T.
Lab. for Comp.Sci.*MIT/LCS/TR-323, Ph.D. Thesis. Ackerman, W.B.*1984.
100146 Snyder, L.*The configurable, highly parallel (CHiP) approach for signal
processing applications.* Purdue U. Comp.Sci.Dept.*CSD TR 402.*1982.
100147 Bondi, A.B. Buzen, J.P.*The response times of priority classes under
preemptive resume in M/G/m queues.* Purdue U. Comp.Sci.Dept.*CSD TR
404.*1983.
100148 Cuny, J.E. Snyder, L.*A model for analyzing generalized interprocessor
communication systems.* Purdue U. Comp.Sci.Dept.*CSD TR 406.*1982.
100149 Berman, F. Bock, M.E. Dittert, E. O'Donnell, M.J. Plank, D.* Collections
of functions for perfect hashing.* Purdue U. Comp.Sci.Dept.*CSD TR
408.*1982.
100150 Denning, P.J.*The notation of operational analysis.* Purdue U.
Comp.Sci.Dept.*CSD TR 408a.*1982.
100151 Reed, D.A.*Optimal routing in the cube connected cycles interconnection
network.* Purdue U. Comp.Sci.Dept.*CSD TR 412.*1983.
100152 Dyksen, W.R. Lynch, R.E. Rice, J.R.*The performance of the collocation
and Galerkin methods with Hermite bi-cubics.* Purdue U.
Comp.Sci.Dept.*CSD TR 413.*1982.
100153 Denning, D.E.* Signature protocols for RSA and other public key
cryptosystems.* Purdue U. Comp.Sci.Dept.*CSD TR 419.* 1982.
100154 Yu, T.J.* Software metrics data collection.* Purdue U.
Comp.Sci.Dept.*CSD TR 421.*1982.
100155 Frederickson, G.N.*On linear time algorithms for 5-coloring planar
graphs.* Purdue U. Comp.Sci.Dept.*CSD TR 423.* 1982.
100156 Dyksen, W.R. Rice, J.R.*A new ordering scheme for the Hermite bicubic
collocation equations.* Purdue U. Comp.Sci.Dept.*CSD TR 425.*1983.
100157 Frederickson, G.N.*Upper bounds for time space tradeoffs in sorting and
selection.* Purdue U. Comp.Sci.Dept.*CSD TR 429.*1983.
100158 Brown, R.L. Denning, P.J. Tichy, W.F.*A model for coherent distributed
systems.* Purdue U. Comp.Sci.Dept.*CSD TR 430.*1983.
100159 Brumfield, J.A. Denning, P.J.* Operational state sequence analysis.*
Purdue U. Comp.Sci.Dept.*CSD TR 431.*1983.
100160 Siefkes, D.* Small systems.* Purdue U. Comp.Sci.Dept.*CSD TR 435.*1983.
100161 Reed, D.A.*Modeling multimicrocomputer networks.* Purdue U.
Comp.Sci.Dept.*CSD TR 436.*1983.
100162 Hambrusch, S.E.*On bounding the number of contact points in channel
routing.* Purdue U. Comp.Sci.Dept.*CSD TR 438.* 1983.
100163 Burch, C.D. Yu, T.-J. Dunsmore, H.E.* Software maintenance and
comprehension: some empirical results.* Purdue U. Comp.Sci.Dept.*CSD TR
439.*1983.
100164 Atallah, M.J.*Finding Euler tours in parallel.* Purdue U.
Comp.Sci.Dept.*CSD TR 440.*n.d.
100165 Houstis, E.N. Mitchell, W.F. Rice, J.R.* Collocation software for second
order elliptic partial differential equations.* Purdue U.
Comp.Sci.Dept.*CSD TR 446.*1983.
100166 Frederickson, G.N.* Data structures for on-line updating of minimum
spanning trees, with applications.* Purdue U. Comp.Sci.Dept.*CSD TR
449.*1984.
100167 Murtagh, T.P.*A technique to reduce procedure call overhead in block
structured languages.* Purdue U. Comp.Sci.Dept.* CSD TR 453.*1983.
100168 Arnon, D.S. McCallum, S.*A polynomial time algorithm for the topological
type of a real algebraic curve.* Purdue U. Comp.Sci.Dept.*CSD TR
454.*1984.
100169 Hambrusch, S.E.*Minimizing contact points and using overlap on two
layers.* Purdue U. Comp.Sci.Dept.*CSD TR 455.* 1983.
100170 Denning, P.J. Comer, D.E.*The CSNET user environment.* Purdue U.
Comp.Sci.Dept.*CSD TR 456.*1981.
100171 Atallah, M.J.*A graph orientation problem.* Purdue U. Comp.Sci.Dept.*CSD
TR 457.*n.d.
100172 Tichy, W.F.*The string-to-string correction problem with block moves.*
Purdue U. Comp.Sci.Dept.*CSD TR 459.*1983.
100173 Hambrusch, S.E.* Channal routing algorithms for overlap models.* Purdue
U. Comp.Sci.Dept.*CSD TR 461.*1983.
100174 Atallah, M.J.*A matching problem in the plane.* Purdue U.
Comp.Sci.Dept.*CSD TR 462.*n.d.
100175 Arnon, D.S. Gieselmann, J.P.*A linear time algorithm for the area
rectangle enclosing a convex polyon.* Purdue U. Comp.Sci.Dept.*CSD TR
463.*1983.
100176 Rice, J.R.* PARVEC Workshop on Very Large Least Squares Problems and
Supercomputers.* Purdue U. Comp.Sci.Dept.* CSD TR 464.*1983. "This is a
summary of an intensive workshop held at Purdue University on November
3-4, 1983."
100177 Comer, D.E. Peterson, L.L.* Conversation based mail.* Purdue U.
Comp.Sci.Dept.*CSD TR 465.*1984.
100178 Comer, D.* Transparent integrated local and distributed environment (
TILDE): project overview.* Purdue U. Comp.Sci.Dept.*CSD TR 466.*1984.
100179 Atallah, M.J. Hambrusch, S.E.*Optimal rotation problems in channel
routing.* Purdue U. Comp.Sci.Dept.*CSD TR 467.* 1984.
100180 Atallah, M.J. Hambrusch, S.E.*On terminal assignments that minimize the
density.* Purdue U. Comp.Sci.Dept.*CSD TR 468.*1984.
100181 Gannon, D. Panetta, J.* SIMPLE on the CHiP.* Purdue U.
Comp.Sci.Dept.*CSD TR 469.*n.d.
100182 Rice, J.R.* Fortran extensions for parallel and vector computation.*
Purdue U. Comp.Sci.Dept.*CSD TR 470.*1984.
100183 Comer, D. Korb, J.T.*The proposed DARPA IP to X.25 interface standard:
performance optimization with multiple circuits.* Purdue U.
Comp.Sci.Dept.*CSD TR 473.* 1984.
100184 Kerola, T.*The composite bound method (CBM) for computing throughput
bounds in multiple class environments.* Purdue U. Comp.Sci.Dept.*CSD TR
475.*1984.
100185 Atallah, M.J.*On symmetry detection.* Purdue U. Comp.Sci.Dept.*CSD TR
476.*1984.
100186 Dyksen, W.R. Rice, J.R.*The importance of scaling for the Hermite bicubic
collocation equations.* Purdue U. Comp.Sci.Dept.*CSD TR 477.*1984.
100187 Li, K.-C. Schwetman, H.* Vector C - a vector processing language.* Purdue
U. Comp.Sci.Dept.*CSD TR 478.*1984.
100188 Kerola, T. Schwetman, H.D.* Performance bounds for multiclass models.*
Purdue U. Comp.Sci.Dept.*CSD TR 479.* 1984.
100189 Tichy, W.F. Ruan, Z.*Towards a distributed file system.* Purdue U.
Comp.Sci.Dept.*CSD TR 480.*1984.
100190 Rieger, J.H. Lawton, D.T.*Determining the instantaneous axis of
translation from optic flow generated by arbitrary sensor motion.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-01.*1983.
100191 Barto, A.G. Sutton, R.S.* Neural problem solving.* Massachusetts U. Comp.
& Info.Sci.Dept.*COINS tech.rpt. 83-03.*1983.
100192 Cromarty, A. Rudahl, K. Ruggles, L. Sutton, R.*An associative search
network for knowledge acquisition: a VLSI design study.* Massachusetts
U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-04.*1983.
100193 Hill, J.C.*A model of language acquisition in the two-year-old.*
Massachusetts U. Comp. & Info.Sci.Dept.* COINS tech.rpt. 83-08.*1983.
100194 Xu, G.D.* Search control in semantic query optimization.* Massachusetts
U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-09.*1983.
100195 Franklin, J.A.*Computer interfaces and operating instructions for a
prototype Cartesian robot.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS tech.rpt. 83-10.*1983.
100196 Ruggles, L.* Letterform design systems.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS tech.rpt. 83-12.*1983.
100197 Conklin, E.J. Ehrlich, K. McDonald, D.D.*An empirical investigation of
visual salience and its role in text generation.* Massachusetts U. Comp.
& Info.Sci.Dept.* COINS tech.rpt. 83-14.*1983.
100198 Rissland, E.L.*The ubiquitous dialectic.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS tech.rpt. 83-15.*1984.
100199 Rissland, E.L.* Examples and learning systems.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS tech.rpt. 83-16.*1983.
100200 Zhao, W.*Improvements on Habermann's algorithm for deadlock avoidance.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-17.*1983.
100201 Bonar, J. Soloway, E.*The bridge from non-programmer to programmer.*
Massachusetts U. Comp. & Info.Sci.Dept.* COINS tech.rpt. 83-18.*1983.
100202 Lara, R. Arbib, M.A.*Proceedings of the Second Workshop on Visuomotor
Coordination in Frog and Toad: Models and Experiments (held at the
Universidad Nacional Autonoma de Mexico on November 17-19, 1982).
Organized by Rolando Lara and Michael A. Arbib.* Massachusetts U. Comp.
& Info.Sci.Dept.*COINS tech.rpt. 83-19.*1983.
100203 Noyes, T.A.* Robot programming languages: a study and design.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-22.*1983.
100204 Arbib, M.A. Iberall, T. Lyons, D.* Coordinated control programs for
movements of the hand.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS
tech.rpt. 83-25.*1983.
100205 Woolf, B. McDonald, D.D.* Human computer discourse in the design of a
Pascal tutor.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt.
83-27.*1983.
100206 Avrunin, G.S.*Describing and analyzing distributed software system
designs.* Massachusetts U. Comp. & Info.Sci.Dept.* COINS tech.rpt.
83-28.*1983.
100207 Shaw, G.B.*Determining motion parameters using a perturbation approach.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-30.*1983.
100208 Shaw, G.B.*Some remarks on the use of color in machine vision.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-31.*1983.
100209 Croft, W.B. Lefkowitz, L.S.* Decision support using office procedures.*
Massachusetts U. Comp. & Info.Sci.Dept.* COINS tech.rpt. 83-33.*1983.
100210 Wolf, A.L. Clarke, L.A. Wileden, J.C.*A formalism for describing and
evaluating visibility control mechanisms.* Massachusetts U. Comp. &
Info.Sci.Dept.*COINS tech.rpt. 83-34.*1983.
100211 McCue, D. Lesser, V.* Focusing and constraint management in intelligent
interface design.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS
tech.rpt. 83-36.*1983. Includes the following paper, submitted to the
AAAI-84 Conference, as a supplement: Focusing in plan recognition, by
Norman F. Carver, Victor P. Lesser, and Daniel L. McCue.
100212 Stemple, D. Sheard, T.* Verifiable abstract database types.*
Massachusetts U. Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-37.*1983.
100213 Zeil, S.J.* Perturbation testing for domain errors.* Massachusetts U.
Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-38.*1984.
100214 Lehnert, W. Loiselle, C.* Plot unit recognition for narratives.*
Massachusetts U. Comp. & Info.Sci.Dept.* COINS tech.rpt. 83-39.*1984.
100215 Rissland, E.L.*A.I. and the learning of mathematics.* Massachusetts U.
Comp. & Info.Sci.Dept.*COINS tech.rpt. 83-40.*1983.
100216 Clarke, L.A. Richardson, D.J.* Symbolic evaluation - an aid to testing
and verification.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS
tech.rpt. 83-41.*1983.
VOL. 6, NO. 14 12/26/84
100217 Cutkosky, M.R.*Mechanical properties for the grasp of a robotic hand.*
Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-24.*1984.
100218 Thibadeau, R.*The state of the art in printed wiring board inspection.*
Carnegie Mellon U. Robotics Inst.* CMU-RI-TR-84-25.*1984.
100219 Hoppe, J.* MAGNET: a local network for Lilith computers.* Eidgenoessische
Technische Hochschule Zurich. Institut fuer Informatik.*Bericht
57.*1983.
100220 Wagner, B. Hoppe, J.*Using the local area network MAGNET, by Bernhard
Wagner. Maintenance and testing of LILITH, by J. Hoppe.* Eidgenoessische
Technische Hochschule Zurich. Institut fuer Informatik.*Bericht
58.*1983.
100221 Wirth, N.*Schemes for multiprogramming and their implementation in
MODULA-2: revisions and amendments to MODULA-2.* Eidgenoessische
Technische Hochschule Zurich. Institut fuer Informatik.*Bericht
59.*1984.
100222 Carroll, J.M. Rosson, M.B.* Usability specifications as a tool in
iterative development.* IBM Watson Res. Center.* RC 10437.*1984.
100223 Sharon, A. Hardt, D.*Enhancement of robot accuracy using endpoint
feedback and a macro-micro manipulator system.* IBM Watson Res.
Center.*RC 10440.*1984.
100224 Schor, M.I.*Using declarative knowledge representation techniques:
implementing truth maintenance in OPS5.* IBM Watson Res. Center.*RC
10455.*1984.
100225 Jensen, K. Heidorn, G.E. Miller, L.A. Ravin, Y.* Parse fitting and prose
fixing: getting a hold on ill-formedness.* IBM Watson Res. Center.*RC
10457.*1984.
100226 Griesmer, J.H. Hong, S.J. Karnaugh, M. Kastner, J.K. Schor, M.I. Ennis,
R.L. Klein, D.A. Milliken, K.R. VanWoerkom, H.M.* YES/MVS: a continuous
real time expert system.* IBM Watson Res. Center.*RC 10461.*1984.
100227 Ish-Shalom, J.*On symbolic solution of the matrix algebraic and
differential Riccati equations.* IBM Watson Res. Center.*RC
10468.*1984.
100228 Cobham, A.* Finite rank approximations of word functions.* IBM Watson
Res. Center.*RC 10470.*1984.
100229 Widmayer, P. Wong, C.K.*Finding the maximum alignment of terminals.* IBM
Watson Res. Center.*RC 10485.*1984.
100230 Schlag, M.D.F. Woo, L.S. Wong, C.K.*Maximizing pin alignment by pin
permutations.* IBM Watson Res. Center.* RC 10486.*1984.
100231 Seetem, J.* Basic Logic Editor (BLE).* IBM Watson Res. Center.*RC
10491.*1984.
100232 Cullum, J.K. Willoughby, R.A.*A survey of Lanczos procedures for very
large real 'symmetric' eigenvalue problems.* IBM Watson Res. Center.*RC
10492.*1984.
100233 Heidelberger, P. Lavenberg, S.S.*Computer performance evaluation
methodology.* IBM Watson Res. Center.*RC 10493.*1984.
100234 Burkland, G.J. Heidelberger, P. Schatzoff, M. Welch, P.D. Wu, L.S.Y.*An
APL system for interactive scientific engineering graphics and data
analysis.* IBM Watson Res. Center.*RC 10494.*1983.
100235 Goyal, A. Nelson, R.* Distributed election and local ring networks.* IBM
Watson Res. Center.*RC 10495.*1984.
100236 Bonanni, P.G. Ish-Shalom, J.*Algorithms for automating the design of
deadbeat tracking systems.* IBM Watson Res. Center.*RC 10501.*1984.
100237 Petrick, S.R.* Natural language database query systems.* IBM Watson Res.
Center.*RC 10508.*1984.
100238 Wesley, M. Koppelman, G.*A robot planning system applied to VLSI
manufacturing processes.* IBM Watson Res. Center.*RC 10510.*1983.
100239 Feig, E.*On designing linear filters for speech synthesizers.* IBM Watson
Res. Center.*RC 10515.*1984.
100240 Lee, C.C. Lee, D.T. Wong, C.K.*Generation of binary trees of bounded
height.* IBM Watson Res. Center.*RC 10517.* 1984.
100241 Schlag, M.D.F. Yoffa, E.J. Hauge, P.S. Wong, C.K.*A method for improving
cascode switch macro wirability.* IBM Watson Res. Center.*RC
10518.*1984.
100242 Bernstein, R. Miller, V.S.* Multiplication by integer constants.* IBM
Watson Res. Center.*RC 10524.*1983.
100243 Bernstein, R.*Producing good code for the case statement.* IBM Watson
Res. Center.*RC 10525.*1983.
100244 Goyal, A. Tantawi, A.N.*Evaluation of performability in acyclic Markov
chains.* IBM Watson Res. Center.*RC 10529.* 1984.
100245 Kar, G. Nikolaou, C.N. Reif, J.*Assigning processes of processors: a
fault tolerant approach.* IBM Watson Res. Center.*RC 10538.*1983.
100246 Ferrante, J.*The program dependence graph as a basis for node splitting
transformations.* IBM Watson Res. Center.* RC 10542.*1984.
100247 Ferrante, J. Ottenstein, K.J. Warren, J.D.*The program dependence graph
and its use in optimization.* IBM Watson Res. Center.*RC 10543.*1984.
100248 Sockut, G.H. Krishnamurthy, R.* Concurrency control in Office-by-Example
(OBE).* IBM Watson Res. Center.*RC 10545.*1984.
100249 Georgiou, C.J. Anastassiou, D.*A real-time, single chip, Laplacian image
edge detector.* IBM Watson Res. Center.* RC 10549.*1984.
100250 Rosson, M.B.*Characterizing freeform editing behavior.* IBM Watson Res.
Center.*RC 10550.*1984.
100251 Rivlin, T.J.*The strong uniqueness constant in complex approximation.*
IBM Watson Res. Center.*RC 10551.*1984.
100252 Auslander, L.*On the use of SCRATCHPAD in the construction of convolution
algorithms.* IBM Watson Res. Center.*RC 10554.*1984.
100253 Fiebrich, R.-D. Liao, Y.-Z. Koppelman, G. Adams, E.* PSI: a symbolic
layout system.* IBM Watson Res. Center.*RC 10560.*1984.
100254 Barnes, E.R. Vannelli, A. Walker, J.Q.*A new procedure for partitioning
the nodes of a graph.* IBM Watson Res. Center.*RC 10561.*1984.
100255 Rivlin, T.J.* Optimal recovery of multivariate contractions.* IBM Watson
Res. Center.*RC 10564.*1984.
100256 Darringer, J.A. Gerbi, J.V.* LSS: a system for production logic
synthesis.* IBM Watson Res. Center.*RC 10577.*1984.
100257 Dolev, D. Halpern, J.*A new look at fault tolerant network routing.* IBM
Watson Res. Center.*RJ 4238.*1984.
100258 Mohan, C.*Recent and future trends in distributed data base management.*
IBM Watson Res. Center.*RJ 4240.*1984.
100259 Rissanen, J.* Complexity of strings in the class of Markov sources.* IBM
Watson Res. Center.*RJ 4247.*1984.
100260 Broder, A. Dolev, D. Fischer, M. Simons, B.*Efficient fault tolerant
routings in networks.* IBM Watson Res. Center.* RJ 4259.*1984.
100261 Lohman, G.M. Haas, L.M. Kistler, R. Selinger, P.G.* Optimization of
nested queries in a distributed relational database.* IBM Watson Res.
Center.*RJ 4260.* 1984.
100262 Lohman, G.M. Mohan, C. Haas, L.M. Lindsay, B.G. Selinger, P.G. Wilms,
P.F. Daniels, D.* Query processing in R*.* IBM Watson Res. Center.*RJ
4272.*1984.
100263 Effelsberg, W. Loomis, M.E.S.*Logical, internal and physical reference
behavior in CODASYL database systems.* IBM Watson Res. Center.*RJ
4291.*1984.
100264 Dolev, D. Dwork, C. Stockmeyer, L.*On the minimal synchronism needed for
distributed consensus.* IBM Watson Res. Center.*RJ 4292.*1984.
100265 Taylor, R.W.*New directions in database management: a workstation
perspective.* IBM Watson Res. Center.*RJ 4294.*1984.
100266 Bennett, J.L.*The concept of architecture applied to user interfaces in
interactive computer systems.* IBM Watson Res. Center.*RJ 4295.*1984.
100267 Reuter, A.* Performance analysis of recovery techniques.* IBM Watson Res.
Center.*RJ 4300.*1984.
100268 Kambayashi, Y. Shosh, S.P.* Query processing using the consecutive
retrieval property.* IBM Watson Res. Center.* RJ 4302.*1984.
100269 Kim, W.* Global optimization of relational queries: a first step.* IBM
Watson Res. Center.*RJ 4303.*1984.
100270 Chang, C.L. Walker, A.* PROSQL: a PROLOG programming interface with
SQL/DS.* IBM Watson Res. Center.*RJ 4314.* 1984.
100271 Hauser, R.F.*A stochastic approach to edge detection.* IBM Watson Res.
Center.*RZ 1303.*1984.
100272 Baccelli, F. Mussi, P.*An asynchronous parallel interpreter for
arithmetic expressions and its evaluation.* INRIA.* Rapport de Recherche
303.*1984.
100273 Bocharov, P.P. Naumov, V.A.* Matrix geometric stationary distribution for
the PH/PH/1/r queue.* INRIA.*Rapport de Recherche 304.*1984.
100274 Marrocco, A.*Simulations numeriques dans la fabrication des circuits a
semiconducteurs (process modelling).* INRIA.* Rapport de Recherche
305.*1984.
100275 Bancora-Imbert, M.C. Gonzalez, R. Miellou, J.-C. Rofman, E.* Numerical
optimization of energy production systems.* INRIA.*Rapport de Recherche
306.*1984.
100276 Pammett, K.G.* Mouse driven menu interfaces for software tools on a
bitmap UNIX system.* INRIA.*Rapport de Recherche 310.*1984.
100277 Flajolet, P. Sedgewick, R.* Digital search trees revisited.*
INRIA.*Rapport de Recherche 311.*1984.
100278 Sokolowski, J.* Differential stability of solutions to constrained
optimization problems.* INRIA.*Rapport de Recherche 312.*1984.
100279 Flajolet, P. Martin, G.N.* Probabilistic counting algorithms for data
base applications.* INRIA.*Rapport de Recherche 313.*1984.
100280 Veran, M. Potier, D.* QNAP2: a portable environment for queueing systems
modelling.* INRIA.*Rapport de Recherche 314.*1984.
100281 Bhattacharyya, P.K. Gopalsamy, S.*An equilibrium finite element method
for fourth order elliptic equations with variable coefficients.*
INRIA.*Rapport de Recherche 315.* 1984.
100282 Lindquist, W.B.*The scalar Riemann problem in two spatial dimensions:
piecewise smoothness of solutions and its breakdown.* New York U.
Courant Math. and Computing Lab.* DOE/ER/03077-227.*1984.
100283 Lindquist, W.B.*Construction of solutions for two dimensional Riemann
problems.* New York U. Courant Math. and Computing
Lab.*DOE/ER/03077-228.*1984.
100284 Kornhauser, D.M. Miller, G. Spirakis, P.*Coordinating pebble motion on
graphs, the diameter of permutation groups, & applications.*New York U.
Inst. of Math. Sci. Comp.Sci.Dept.*Tech.rpt. 121; Robotics rpt.
27.*1984.
100285 Siegel, A.* Tight area bounds and provably good ATā2 bounds
for sorting circuits.*New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 122.*1984.
100286 Davis, E.*An ontology of physical action.* New York U. Inst. of Math.
Sci. Comp.Sci.Dept.*Tech.rpt. 123.*1984.
100287 Bastuscheck, C.M. Schwartz, J.T.*Preliminary implementation of a ratio
image depth sensor.*New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 124; Robotics rpt. 28.* 1984.
100288 Bernstein, H.J.*Determining the shape of a convex n-sided polygon by
using 2n+k tactile probes.*New York U. Inst. of Math. Sci.
Comp.Sci.Dept.*Tech.rpt. 125; Robotics rpt. 29.*1984.
100289 Veloso, P.A.S. Casanova, M.A. Furtado, A.L.* Formal data base
specification - an eclectic perspective.* Pontificia U., Rio de Janeiro.
Info.Dept.*No. 1/84.*1984.
100290 Ruas, V.* Finite element solution of 3D viscous flow problems using
nonstandard degrees of freedom.* Pontificia U., Rio de Janeiro.
Info.Dept.*No. 2/84.*1984.
100291 Furtado, A.L. Moura, C.M.O.* Expert helpers to data-based information
systems.* Pontificia U., Rio de Janeiro. Info.Dept.*No. 5/84.*1984.
100292 Gustafson, S.-A.* Stable convergence acceleration using Laplace
transforms.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8410.*1984.
100293 Mellgren, D. Unification in some equational theories and the Knuth Bendix
algorithm.* Royal Inst. of Tech., Stockholm. Num.Anal. & Computing
Sci.Dept.*TRITA-NA-8411.* 1984.
100294 Li, J.*Generation of some Chinese characters with METAFONT.* Royal Inst.
of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.*TRITA-NA-8412;
Royal Inst. of Tech., Stockholm. Num.Anal. & Computing Sci.Dept.
Integral Project.* Integral-21.*1984.
052009 Des Rivieres, J. Smith, B.C.*The implementation of procedurally
reflective languages.* Stanford U. Center for the Study of Language and
Info.*CSLI-84-09.*1984.
052010 Goguen, J.* Parameterized programming.* Stanford U. Center for the Study
of Language and Info.*CSLI-84-10.*1984.
052012 Benthem, J. van* Partiality and nonmonotonicity in classical logic.*
Stanford U. Center for the Study of Language and Info.*CSLI-84-12.*1984.
052013 Barwise, J. Perry, J.*Shifting situations and shaken attitudes.* Stanford
U. Center for the Study of Language and Info.*CSLI-84-13.*1984.
052015 Goguen, J.A. Meseguer, J.* Completeness of many-sorted equational logic.*
Stanford U. Center for the Study of Language and Info.*CSLI-84-15.*1984.
052016 The Center for the Study of Language and Information.* Stanford
U. Center for the Study of Language and Info.* CSLI-84-16.*1984.
100295 Murtagh, B.A. Saunders, M.A.* MINOS 5.0 user's guide.* Stanford U. O.R.
Dept. Systems Optimization Lab.*SOL 83-20.*1983.
100296 Dantzig, G.B. Eaves, B.C. Rothblum, U.G.*A decomposition and scaling
inequality for line sum symmetric nonnegative matrices.* Stanford U.
O.R. Dept. Systems Optimization Lab.*SOL 83-21.*1983.
100297 Dantzig, G.B.*Can Leontief and P-matrices be rescaled positive definite.*
Stanford U. O.R. Dept. Systems Optimization Lab.*SOL 83-23.*1983.
100298 Kaul, R.N. Kaur, S. Lyall, V.* Duality in inexact fractional programming
with set inclusive constraints.* Stanford U. O.R. Dept. Systems
Optimization Lab.*SOL 84-03.*1984.
100299 Gouda, M.G. Molloy, M.K.*Modeling and analysis of LAN protocols using
labeled Petrinets.* Texas U. Comp.Sci.Dept.*TR-84-15.*1984.
100300 Scott, D.S. Iyengar, S.S.* TID - a translation invariant data structure
for storing images.* Texas U. Comp.Sci.Dept.*TR-84-16.*1984.
100301 Rich, E.A.*A high-level interpretation algorithm for points and ranges.*
Texas U. Comp.Sci.Dept.*TR-84-17.*1984.
100302 Struensee, M.C.*Uses of dipole oscillator strength sum rules in second
order perturbation theory.* Texas U. Comp.Sci.Dept.*TR-84-18, Ph.D.
Thesis. Struensee, M.C.* 1984.
100303 Gangopadhyay, D.*A formal system for network databases and its
applications to integrity related issues.* Texas U.
Comp.Sci.Dept.*TR-84-19, Ph.D. Thesis. Gangopadhyay, D.* 1984.
100304 Emerson, E.A. Lei, C.L.* Model checking under generalized fairness
constraints.* Texas U. Comp.Sci.Dept.*TR-84-20.* 1984.
100305 Gouda, M.G.*On "A Simple Protocol Whose Proof Isn't": the state machine
approach.* Texas U. Comp.Sci.Dept.* TR-84-21.*1984.
100306 Borm, A. Rosier, L.E.*On Parikh maps, abstract languages and decision
problems.* Texas U. Comp.Sci.Dept.*TR-84-22.* 1984.
100307 Brumfield, J.A.*A list expression interpreter as a teaching tool.* Texas
U. Comp.Sci.Dept.*TR-84-23.*1984.
100308 Herman, T. Chandy, K.M.*On distributed search.* Texas U.
Comp.Sci.Dept.*TR-84-24.*1984.
100309 Morgan, R.B. Scott, D.S.*Generalizations of Davidson's method for
computing eigenvalues of sparse symmetric matrices.* Texas U.
Comp.Sci.Dept.*TR-84-25.*1984.
100310 Greenspan, S.J.* Requirements modeling: a knowledge representation
approach to software requirements definition.* Toronto U. Comp. Systems
Res. Group.* CSRG-155, Ph.D. Thesis. Greenspan, S.J.*1984.
100311 Eager, D.L.* Bounding algorithms for queueing network models of computer
systems.* Toronto U. Comp. Systems Res. Group.*CSRG-156, Ph.D. Thesis.
Eager, D.L.*1984.
100312 Martin, T.P.*A communication model for message management systems.*
Toronto U. Comp. Systems Res. Group.*CSRG-157, Ph.D. Thesis. Martin,
T.P.*1984.
100313 Furuta, R. MacKay, P.* DVI2LGP: an output translator for TEX output.*
Washington U. Comp.Sci.Dept.*Tech.rpt. 83-12-02.*1983.
100314 Jacobson, D.M.*A protocol for optimistic transactions on abstract data
types.* Washington U. Comp.Sci.Dept.* Tech.rpt. 83-12-04.*1984.
100315 Boehm, H.-J. Hutchinson, N.* Biased B-trees.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 83-12-05.*1983.
100316 Shaw, A.C.*Specification of human machine interfaces: some problems, ols,
and approaches.* Washington U. Comp.Sci.Dept.*Tech.rpt. 84-01-01.*1984.
100317 Zahorjan, J. Lazowska, E.D.*Incorporating load dependent servers in
approximate mean value analysis.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-02-01.*1984.
100318 Spreen, D. Young, P.* Effective operators in a topological setting.*
Washington U. Comp.Sci.Dept.*Tech.rpt. 84-03-01.*1984.
100319 Jacobson, P.A.*Approximate solution techniques for queueing networks with
simultaneous resource possession.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-03-02, Ph.D. Thesis. Jacobson, P.A.*1984.
100320 Kapauan, A.A. Field, J.T. Gannon, D.B. Snyder, L.*The Pringle parallel
computer.* Washington U. Comp.Sci.Dept.* Tech.rpt. 84-04-01.*1984.
100321 Snyder, L.* Parallel programming and the Poker programming environment.*
Washington U. Comp.Sci.Dept.*Tech.rpt. 84-04-02.*1984.
100322 Ladner, R.E. Norman, J.K.* Solitaire automata.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-04-03.*1984.
100323 Baer, J.-L.*The evolution of computer architecture.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-04-04.*1984.
100324 Kwan, S.C. Baer, J.-L.*On the I/O performance of multi-way mergesort and
tag sort.* Washington U. Comp.Sci.Dept.* Tech.rpt. 84-04-05.*1984.
100325 Chi, U.H.* Formal specification of user interfaces: a comparison and
evaluation of four axiomatic approaches.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-05-01.*1984.
100326 Woll, H.* Reductions among number theoretic problems.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-05-02.*1984.
100327 Lazowska, E.D. Zahorjan, J. Cheriton, D.R. Zwaenepoel, W.* File access
performance of diskless workstations.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-06-01.*1984.
100328 Daasch, R. Fowler, R.*NETLIST/PRESIM/RNL V4.2(UW) tutorial.* Washington
U. Comp.Sci.Dept.*Tech.rpt. 84-07-01.*1984.
100329 Borodin, A. Fagin, R. Hopcroft, J.E. Tompa, M.*Decreasing the nesting
depth of expressions involving square roots.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-07-02.*1984.
100330 Kimura, G.D.*A structure editor and model for abstract document objects.*
Washington U. Comp.Sci.Dept.*Tech.rpt. 84-07-04, Ph.D. Thesis. Kimura,
G.D.*1984.
100331 Weyer, S. Borning, A.*A prototype electronic encyclopedia.* Washington U.
Comp.Sci.Dept.*Tech.rpt. 84-08-01.*1984.
100332 Fowler, R.J.*The analysis of a simple distributed resource finding
protocol.* Washington U. Comp.Sci.Dept.*Tech.rpt. 84-08-02.*1984.
100333 Almes, G. Holman, C.* Edmas: an object oriented, locally distributed mail
system.* Washington U. Comp.Sci.Dept.* Tech.rpt. 84-08-03.*1984.
100334 VLSI design tools: reference manual.*UW/NW VLSI Consortium, University of
Washington, Seattle.*1984. (Release 2.1 - October 1, 1984).
VOL. 7, NO. 1 03/08/85
100335 Derthick, M.* Variations on the Boltzmann machine learning algorithm.*
Carnegie Mellon U. CS Dept. * CMU-CS-84-120.* 1984.
100336 Akscyn, R.M. McCracken, D.L.* ZOG and the USS CARL VINSON: lessons in
system development.* Carnegie Mellon U. CS Dept. *CMU-CS-84-127.* 1984.
100337 Spector, A.Z. Butcher, J. Daniels, D.S. Duchamp, D.J. Eppinger, J.L.
Fineman, C.E. Heddaya, A. Schwarz, P.M.* Support for distributed
transactions in the TABS prototype.* Carnegie Mellon U. CS Dept. *
CMU-CS-84-132.* 1984.
100338 Brent, R.P. Kung, H.T.* A systolic algorithm for integer GCD
computation.* Carnegie Mellon U. CS Dept. * CMU-CS-84-135.* 1984.
100339 Reiner, A.* Cost minimization in register assignment for retargetable
compilers.* Carnegie Mellon U. CS Dept. *CMU-CS-84-137.* 1984.
100340 Hayes, P.J.* Entity oriented parsing.* Carnegie Mellon U. CS Dept.
*CMU-CS-84-138.* 1984.
100341 Rudolph, L. Segall, Z.* Dynamic decentralized cache schemes for MIMD
parallel processors.* Carnegie Mellon U. CS Dept. *CMU-CS-84-139.*
1984.
100342 Robertson, C.K. Newell, A.* Experimental evaluation of five techniques
for teaching for the ZOG frame editor.* Carnegie Mellon U. CS Dept.
*CMU-CS-84-140.* 1984.
100343 Mohan, J.* Performance of parallel programs: model and analyses.*
Carnegie Mellon U. CS Dept. * CMU-CS-84-141, Ph.D. Thesis. Mohan, J.*
1984.
100344 Tomita, M.* The design philosophy of personal machine translation
system.* Carnegie Mellon U. CS Dept. * CMU-CS-84-142.* 1984.
100345 Foster, M.J.* Specialized silicon compilers for language recognition.*
Carnegie Mellon U. CS Dept. * CMU-CS-84-143, Ph.D. Thesis. Foster, M.J.*
1984.
100346 Sugie, M. Menzilcioglu, O. Kung, H.T.* CARGuide -- on-board computer for
automobile route guidance.* Carnegie Mellon U. CS Dept. *CMU-CS-84-144.*
1984.
100347 Brookes, S.D.* Reasoning about synchronous systems.* Carnegie Mellon U.
CS Dept. *CMU-CS-84-145.* 1984.
100348 Frieze, A.M. Kannan, R. Lagarias, J.C.* Linear congruential generators do
not produce random sequences.* Carnegie Mellon U. CS Dept.
*CMU-CS-84-146.* 1984.
100349 Berliner, H. Goetsch, G.* A quantitative study of search methods and the
effect of constraint satisfaction.* Carnegie Mellon U. CS Dept.
*CMU-CS-84-147.* 1984.
100350 Luk, W.K.* A greedy switch-box router.* Carnegie Mellon U. CS Dept.
*CMU-CS-84-148.* 1984.
100351 Luk, W.K. Vuillemin, J.E.* Recursive implementation of optimal time VLSI
integer multipliers.* Carnegie Mellon U. CS Dept. *CMU-CS-84-149.* 1984.
100352 Annaratone, M. Shen, W.-Z.* The design of an LSI booth multiplier: nMOS
vs. CMOS technology.* Carnegie Mellon U. CS Dept. *CMU-CS-84-150.*
1984.
100353 Leivant, D.* Typing and convergence in the lambda calculus.* Carnegie
Mellon U. CS Dept. *CMU-CS-84-152.* 1984.
100354 Vrsalovic, D. Siewiorek, D. Segall, Z. Gehringer, E.* Performance
prediction and calibration for a class of multiprocessor systems.*
Carnegie Mellon U. CS Dept. *CMU-CS-84-153.* 1984.
100355 Doyle, J.* Circumspection and implicit definability.* Carnegie Mellon U.
CS Dept. *CMU-CS-84-154.* 1984.
100356 Peters, J. Rudolph, L.* Parallel approximation schemes for subset sum and
knapsack problems.* Carnegie Mellon U. CS Dept. *CMU-CS-84-155.* 1984.
100357 Krishnamachari, S.* Comparison of alternating direction and backward
difference methods for time dependent finite element problems.* General
Motors Corp. Res.Labs. CS Dept. *GMR-4862.* 1984.
100358 Ainslie, P.J. Knight, G.D. Schuarte, F.J.* Automating the design of
integrated circuits for vehicle applications.* General Motors Corp.
Res.Labs. CS Dept. *GMR-4870.* 1984.
099091 M.I.T. E.E. & CS Dept. *VLSI MEMORANDA ("Memos in this series...are not
considered to be published merely by virtue of appearing in this series.
References to these works should be either to the published version, if
any, or in the form 'private communication'...."):
099091/209 Lieberherr, K.J.* Report on the hardware description language Zeus.*
1984.
099091/211 Ressler, A.L.* A circuit grammar for operational amplifier design.*
Ph.D. Thesis.* 1984.
099091/214 Bamji, C.S. Hauck, C.E. Allen, J.* A design-by-example regular
structure generator.* 1984.
100359 Bergstra, J.A. Klop, J.W. Tucker, J.V.* Process algebra with asynchronous
communication mechanisms.* Mathematisch Centrum. Centrum voor Wiskunde
en Informatica.* CS-R8410.* 1984.
100360 Bergstra, J.A. Heering, J. Klop, J.W.* Object oriented algebraic
specification: proposal for a notation and 12 examples.* Mathematisch
Centrum. Centrum voor Wiskunde en Informatica.* CS-R8411.* 1984.
100361 Vitanyi, P.M.B.* Signal propagation delay, wire length distribution and
the efficiency of VLSI circuits.* Mathematisch Centrum. Centrum voor
Wiskunde en Informatica.* CS-R8412.* 1984.
100362 Ten Hagen, P.J.W. Derksen, J.* Parallel input and feedback in dialogue
cells.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*
CS-R8413.* 1984.
100363 Vitanyi, P.M.B.* Circuit topology, signal propagation delay and the
efficiency of VLSI circuits.* Mathematisch Centrum. Centrum voor
Wiskunde en Informatica.* CS-R8414.* 1984.
100364 Wubs, F.W.* Evaluation of time integrators for the shallow water
equations.* Mathematisch Centrum. Centrum voor Wiskunde en Informatica.*
NM-R8406.* 1984.
100365 Kok, J. Symm, G.T.* A proposal for standard basic functions in Ada.*
Mathematisch Centrum. Centrum voor Wiskunde en Informatica.* NM-R8407.*
1984.
100366 Van der Houwen, P.J. Sommeijer, B.P.* High order difference schemes with
reduced dispersion for hyperbolic differential equations.* Mathematisch
Centrum. Centrum voor Wiskunde en Informatica.* NM-R8408.* 1984.
100367 Van der Houwen, P.J. Blom, J.G.* Stability results for discrete Volterra
equations: Numerical experiments.* Mathematisch Centrum. Centrum voor
Wiskunde en Informatica.* NM-R8409.* 1984.
100368 Van der Houwen, P.J. Sommeijer, B.P. Baker, C.T.H.* On the stability of
predictor corrector methods for parabolic equations with delay.*
Mathematisch Centrum. Centrum voor Wiskunde en Informatica.* NM-R8410.*
1984.
100369 Verwer, J.G.* On the shift parameter in the backward beam method for
parabolic problems for preceding times.* Mathematisch Centrum. Centrum
voor Wiskunde en Informatica.* NM-R8411.* 1984.
100370 Paull, M.C. Berman, A.M. Cheng, C.C.-A.* Exploring the structure of
incremental algorithms.* Rutgers U. CS Dept. *DCS-TR-139.* 1984.
100371 Kalantari, B. Rosen, J.B.* An algorithm for large scale global
minimization of linearly constrained concave quadratic functions.*
Rutgers U. CS Dept. * DCS-TR-147.* 1984.
100372 Kalantari, B. Rosen, J.B.* Penalty formulation for zero-one programming.*
Rutgers U. CS Dept. *DCS-TR-148.* 1984.
100373 Ginsberg, A.* Representation and problem solving: theoretical
foundations.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-141.* 1984.
100374 Apte, C.V. Weiss, S.M.* A knowledge representation framework for expert
control of interactive software systems.* Rutgers U. Comp.Sci.Res.Lab.*
CBM-TR-143.* 1984.
100375 Apte, C.V.* A framework for expert control of interactive software
systems.* Rutgers U. Comp.Sci.Res.Lab.* CBM-TR-144, Ph.D. Thesis. Apte,
C.V.* 1984.
100376 Kelly, V.E.* The Critter System: automated critiquing of digital circuit
designs.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-055.* 1984.
100377 Mitchell, T.M. Steinberg, L.I. Shulman, J.S.* VEXED: a knowledge based
VLSI design consultant.* Rutgers U. Comp.Sci.Res.Lab.* LCSR-TR-057.*
1984.
100378 Roach, J.A.* The rectangle placement language.* Rutgers U.
Comp.Sci.Res.Lab.* LCSR-TR-058.* 1984.
100379 Grigoriadis, M.D. Kalantari, B.* A lower bound to the complexity of
Euclidean matching algorithms.* Rutgers U. Comp.Sci.Res.Lab.*
LCSR-TR-059.* 1984.
100380 Kedar-Cabelli, S.* Analogy with purpose in legal reasoning from
precedents.* Rutgers U. Comp.Sci.Res.Lab.* LRP-TR-017.* 1984.
100381 Warham, A.G.P.* A routine to find the lowest few eigenvalues and vectors
for the generalised sparse symmetric eigenproblem.* U.K. National
Physical Lab. Info. Technology and Computing Div.* DITC 43/84.* 1984.
100382 Pavel, J.R. Dwyer, D.J.* Some experiences of testing protocol
implementations.* U.K. National Physical Lab. Info. Technology and
Computing Div.* DITC 48/84.* 1984.
100383 Sepehr, H.* Untersuchungen an Petri-Netzen mit vorgegebener Schaltzeit
und Schaltzeitkapazitat (ZK-Netze).* Hamburg U. Fachbereich Informatik.*
Bericht nr. 102.* 1984.
100384 Ewart, B. Goetze, K.* Vom Umgang mit objektbezogenen Daten unter
besonderer Beruecksichtigung von personenbezogenen Daten.* Hamburg U.
Fachbereich Informatik.* Bericht nr. 103.* 1984.
100385 Maass, S.* Mensch-Rechner-Kommunikation- Herkunft und Chancen eines neuen
Paradigmas.* Hamburg U. Fachbereich Informatik.* Bericht nr. 104.* 1984.
100386 Fraser, C.W. Hanson, D.R.* The EZ reference manual.* Arizona U. CS Dept.
*TR 84-01.* 1984.
100387 Fraser, C.W. Hanson, D.R.* Integrating operating systems and languages.*
Arizona U. CS Dept. *TR 84-02.* 1984.
100388 Olsson, R.A. Andrews, G.R.* SuccessoR: Refinements to SR.* Arizona U. CS
Dept. *TR 84-03.* 1984.
100389 Olsson, R.A. Andrews, G.R.* An implementation of SuccessoR.* Arizona U.
CS Dept. *TR 84-04.* 1984.
100390 Townsend, G.* The Leo programming language.* Arizona U. CS Dept. *TR
84-07.* 1984.
100391 Mitchell, W.H.* An Icon subsystem for UNIX Emacs.* Arizona U. CS Dept.
*TR 84-08.* 1984.
100392 Griswold, R.E.* Rebus- A Snobol4 Icon hybrid.* Arizona U. CS Dept. *TR
84-09.* 1984.
100393 Griswold, R.E. McConeghy, R.K. Mitchell, W.H.* Extensions to Version 5 of
the Icon programming language.* Arizona U. CS Dept. *TR 84-10.* 1984.
100394 Griswold, R.E.* The Icon program library: version 5.9.* Arizona U. CS
Dept. *TR 84-12.* 1984.
100395 Hayes, R. Schlichting, R.D.* The application of a universal type system
to the problem of mixed language programming.* Arizona U. CS Dept. *TR
84-15.* 1984.
100396 Griswold, R.E.* Tables in Icon.* Arizona U. CS Dept. * TR 84-16.* 1984.
100397 Schlichting, R.D.* A technique for estimating performance of fault
tolerant programs.* Arizona U. CS Dept. *TR 84-17.* 1984.
100398 Miller, W. Myers, E.W.* A file comparison program.* Arizona U. CS Dept.
*TR 84-18.* 1984.
100399 Jewell, W.S.* Bayesian estimation of undetected errors.* California U.,
Berkeley. O.R. Center.* ORC 83-11.* 1983.
100400 Oliver, R.M.* Predicting future pollution exceedances under emission
controls.* California U., Berkeley. O.R. Center.* ORC 84-08.* 1984.
100401 Bundy, A.* Computer modelling of mathematical reasoning.* Edinburgh U.
A.I. Dept.* Res. paper 200.* 1983.
100402 Ross, P.* Programming in Logo.* Edinburgh U. A.I. Dept.* Res. paper 201.*
1983.
100403 Wallen, L.* Towards the provision of a natural mechanism for expressing
domain specific global strategies in general purpose theorem provers.*
Edinburgh U. A.I. Dept.* Res. paper 202.* 1983.
100404 Howe, J.A.M.* Learning middle school mathematics through Logo
programming: An evaluation programme.* Edinburgh U. A.I. Dept.* Res.
paper 203.* 1984.
100405 Finlayson, H.M.* Simple Logo in primary schools: A structured or
unstructured approach.* Edinburgh U. A.I. Dept.* Res. paper 204.* 1983.
100406 Finlayson, H.M.* The development of mathematical thinking through Logo.*
Edinburgh U. A.I. Dept.* Res. paper 205.* 1983.
100407 Howe, J.A.M.* Edinburgh Logo: a retrospective view.* Edinburgh U. A.I.
Dept.* Res. paper 206.* 1984.
100408 Kempf, K.G. Ambler, A.P.* An experimental comparison of symbolic and
graphic offline robot programming techniques.* Edinburgh U. A.I. Dept.*
Res. paper 207.* 1983.
100409 Ambler, A.P.* Languages for programming robots.* Edinburgh U. A.I. Dept.*
Res. paper 208.* 1983.
100410 Sterling, L.* Implementing problem solving strategies using the
meta-level.* Edinburgh U. A.I. Dept.* Res. paper 209.* 1984.
100411 Smith, P. Sterling, L.* Of integration by man and machine.* Edinburgh U.
A.I. Dept.* Res. paper 210.* 1983.
100412 Mycroft, A. O'Keefe, R.* A polymorphic type system for Prolog.* Edinburgh
U. A.I. Dept.* Res. paper 211.* 1983.
100413 Malcolm, C.A.* The outline corner filter.* Edinburgh U. A.I. Dept.* Res.
paper 212.* 1984.
100414 Featherstone, R.* Spatial notation: a tool for robot dynamics.* Edinburgh
U. A.I. Dept.* Res. paper 213.* 1984.
100415 Bundy, A.* What has learning got to do with expert sytems?* Edinburgh U.
A.I. Dept.* Res. paper 214.* 1984.
100416 Bundy, A. Silver, B. Plummer, D.* An analytic comparison of some rule
learning programs.* Edinburgh U. A.I. Dept.* Res. paper 215.* 1984.
100417 Bundy, A.* Incidence calculus: A mechanism for probabilistic reasoning.*
Edinburgh U. A.I. Dept.* Res. paper 216.* 1984.
100418 Bundy, A.* A generalized interval package and its use for semantic
checking.* Edinburgh U. A.I. Dept.* Res. paper 217.* 1984.
100419 Traub, N.* A LISP based Circal environment.* Edinburgh U. CS Dept.
*CSR-152-83.* 1983.
100420 Hennessy, M.C.B.* Modelling finite delay operators.* Edinburgh U. CS
Dept. *CSR-153-83.* 1983.
100421 DeNicola, R.* Two complete axiom systems for a theory of communicating
sequential processes.* Edinburgh U. CS Dept. *CSR-154-83.* 1983.
100422 Schoett, O.* A theory of program modules, their specification and
implementation (extended abstract).* Edinburgh U. CS Dept. *CSR-155-83.*
1983.
100423 Hennessy, M. Stirling, C.* The power of the future perfect in program
logics.* Edinburgh U. CS Dept. * CSR-156-83.* 1983.
100424 Milner, R.* A proposal for standard ML.* Edinburgh U. CS Dept.
*CSR-157-83.* 1983.
100425 Bergman, N.* A case study of the F.I.R.S.T. silicon compiler.* Edinburgh
U. CS Dept. *CSR-159-84.* 1984.
100426 MacQueen, D.B. Sannella, D.T.* Completeness of proof systems for
equational specifications.* Edinburgh U. CS Dept. *CSR-160-84.* 1984.
100427 Li, W.* A syntax directed approach for implementing the rendezvous
mechanism in Ada.* Edinburgh U. CS Dept. * CSR-161-84.* 1984.
100428 Hennessy, M.* Proving systolic systems correct.* Edinburgh U. CS Dept.
*CSR-162-84.* 1984.
100429 Dennison, I.C.* A sticks front end for scale.* Edinburgh U. CS Dept.
*CSR-163-84.* 1984.
100430 Milne, G.* Towards verifiably correct VLSI design.* Edinburgh U. CS Dept.
*CSR-164-84.* 1984.
100431 Tarlecki, A.* Abstract algebraic institutions which strongly admit
initial semantics.* Edinburgh U. CS Dept. *CSR-165-84.* 1984.
100432 Purtilo, J.M.* POLYLITH and environments for mathematical computation.*
Illinois U. CS Dept. * UIUCDCS-R-84-1135.* 1984.
100433 Yu, M.-L.* A data base for a VLSI computer aided design system.* Illinois
U. CS Dept. *UIUCDCS-R-84-1170.* 1984.
100434 Tang, J.L.* A DMA/PIO microprocessor interface for a high resolution
color graphics processor.* Illinois U. CS Dept. *UIUCDCS-R-84-1180.*
1984.
100435 Goering, S.K.* Smiler-2: porting a Modula-2 compiler onto the IBM
CS9000.* Illinois U. CS Dept. * UIUCDCS-R-84-1181.* 1984.
100436 Abu-Sufah, W. Husman, H. Kuck, D.* On input/output speed-up in tightly
coupled multiprocessors.* Illinois U. CS Dept. *UIUCDCS-R-84-1182.*
1984.
100437 Kambayashi, Y. Muroga, S.* Properties of wired logic.* Illinois U. CS
Dept. *UIUCDCS-R-84-1183.* 1984.
100438 Kalita, J.K.* Generating summary responses to natural language database
queries.* Saskatchawan U. Computational Sci.Dept.* Rpt. 84-09.* 1984.
100439 Majumdar, S.* Locality and file referencing behaviour: principles and
applications.* Saskatchawan U. Computational Sci.Dept.* Rpt. 84-14.*
1984.
100440 Carter, J.A. Tubman, J.B.* Integrated software packages: past, present
and future.* Saskatchawan U. Computational Sci.Dept.* Rpt. 84-15.* 1984.
100441 Eager, D.L. Lazowska, E.D. Zahorjan, J.* Dynamic load sharing in
homogenous distributed systems.* Saskatchawan U. Computational
Sci.Dept.* Rpt. 84-16.* 1984.
100442 Protsko, L.B. Kurtenbach, G.P.A. Sorenson, P.G. Tremblay, J.P.* DEPICT: a
graphical interface for systems analysis and design.* Saskatchawan U.
Computational Sci.Dept.* Rpt. 84-17.* 1984.
100443 Berg, A. Bocking, D.A. Peachey, D.R. Sorenson, P.G. Tremblay, J.P. Wald,
J.A.* VATS - The visible attributed translation system.* Saskatchawan U.
Computational Sci.Dept.* Rpt. 84-19.* 1984.
100444 Conn, A.R. Gould, N.I.M.* An exact penalty function for semi-infinite
programming.* Waterloo U. CS Dept. * Res.rpt. CS-84-17.* 1984.
100445 Larsen, P.-A.* Linear hashing with separators - a dynamic hashing scheme
achieving one-access retrieval.* Waterloo U. CS Dept. *Res.rpt.
CS-84-23.* 1984.
100446 Ottmann, T. Schrapp, M. Wood, D.* Purely top-down updating algorithms for
stratified search trees.* Waterloo U. CS Dept. *Res.rpt. CS-84-30.*
1984.
100447 Maurer, H.A. Salomaa, A. Welzl, E. Wood, D.* Denseness, maximality, and
decidability of grammatical families.* Waterloo U. CS Dept. *Res.rpt.
CS-84-31.* 1984.
100448 Ottmann, T. Wood, D.* Space-economical plane-sweep algorithms.* Waterloo
U. CS Dept. *Res.rpt. CS-84-32.* 1984.
100449 Ottmann, T. Wood, D.* The contour problem for polygons.* Waterloo U. CS
Dept. *Res.rpt. CS-84-33.* 1984.
100450 Chu, E. George, A. Liu, J. Ng, E.* SPARSPAK: Waterloo Sparse Matrix
Package. User's Guide for SPARSPAK-A: a collection of modules for
solving sparse systems of linear equations.* Waterloo U. CS Dept.
*Res.rpt. CS-84-36.* 1984.
100451 George, A. Ng, E.* SPARSPAK: Waterloo Sparse Matrix Package. User's
guide for SPARSPAK-B: a collection of modules to be used with SPARSPAK-A
for solving sparse constrained linear least squares problems.* Waterloo
U. CS Dept. *Res.rpt. CS-84-37.* 1984.
100452 Culik, K. II. Yu, S.* Fault-tolerant schemes for some systolic systems.*
Waterloo U. CS Dept. *Res.rpt. CS-84-39.* 1984.
100453 Rawlins, G. Wood, D.* Computing finitely-oriented polygon intersections.*
Waterloo U. CS Dept. *Res.rpt. CS-84-40.* 1984.
100454 George, J.A. Liu, J.W.H.* Householder reflections versus Givens rotations
in sparse orthogonal decompositions.* Waterloo U. CS Dept. *Res.rpt.
CS-84-42.* 1984.
100455 George, A. Ng, E.* Symbolic factorization for sparse Gaussian elimination
with partial pivoting.* Waterloo U. CS Dept. *Res.rpt. CS-84-43.* 1984.
100456 Cheng, M.H.M.* Design and implementation of the Waterloo Unix Prolog
environment.* Waterloo U. CS Dept. * Res.rpt. CS-84-47.* 1984.
100457 George, A. Heath, M.T. Liu, J.* Parallel Cholesky factorization on a
multiprocessor.* Waterloo U. CS Dept. *Res.rpt. CS-84-49.* 1984.
100458 Karlsson, R.G.* Algorithms in a restricted universe.* Waterloo U. CS
Dept. *Res.rpt. CS-84-50, Ph.D. Thesis. Karlsson, R.G.* 1984.
100459 Greenberg, A.G. Manber, U.* A probabilistic pipeline algorithm for
k-selection on the tree machine.* Wisconsin U. CS Dept. *Tech.rpt. 558.*
1984.
100460 Kjell, B. Dyer, C.R.* Edge separation and orientation texture measures.*
Wisconsin U. CS Dept. *Tech.rpt. 559.* 1984.
100461 Carey, M.J. DeWitt, D.J. Graefe, G.* Mechanisms for concurrency control
and recovery in Prolog - a proposal.* Wisconsin U. CS Dept. *Tech.rpt.
560.* 1984.
100462 Manber, R. Shao, J.-Y.* On digraphs with the odd cycle property.*
Wisconsin U. CS Dept. *Tech.rpt. 561.* 1984.
100463 Feijoo, B. Meyer, R.R.* Optimization on the CRYSTAL multicomputer.*
Wisconsin U. CS Dept. *Tech.rpt. 562.* 1984.
100464 Scott, M.L.* A framework for the evaluation of high level languages for
distributed computing.* Wisconsin U. CS Dept. *Tech.rpt. 563.* 1984.
100465 Madduri, H. Finkel, R.* A note on starvation control policies.* Wisconsin
U. CS Dept. *Tech.rpt. 564.* 1984.
100466 Kurtz, T.G. Manber, U.* A probabilistic distributed algorithm for set
intersection and its analysis.* Wisconsin U. CS Dept. *Tech.rpt. 565.*
1984.
100467 Hsieh, J.-T. Pleszkun, A.R. Goodman, J.R.* Performance evaluation of the
PIPE computer architecture.* Wisconsin U. CS Dept. *Tech.rpt. 566.*
1984.
VOL. 7, NO. 2 04/24/85
100468 AN ACTION ROUTINE MODEL FOR ALOE.
Vincenzo Ambriola, Gail E. Kaiser, and Robert J. Ellison.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-156. 1984.]
100469 SHAPE RECOVERY OF A SOLID OF REVOLUTION FROM APPARENT DISTORTIONS OF
PATTERNS.
Ellen Lowenfeld Walker and Takeo Kanade.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-157. 1984.]
100470 SYSTOLIC ALGORITHMS FOR THE CMU WARP PROCESSOR.
H. T. Kung.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-158. 1984.]
100471 LINC: THE LINK AND INTERCONNECTION CHIP.
F. H. Hsu et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-159. 1984.]
100472 MATCHMAKER: AN INTERFACE SPECIFICATION LANGUAGE FOR DISTRIBUTED
PROCESSING.
Michael B. Jones, Richard F. Rashid, and Mary R. Thompson.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-161. 1984.]
100473 AN EFFICIENT ALL-PATHS PARSING ALGORITHM FOR NATURAL LANGUAGES.
Masaru Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-163. 1984.]
100473 LR PARSERS FOR NATURAL LANGUAGES.
Masaru Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-163. 1984. Paper presented at the 10th (1984) International
Conference on Computational Linguistics, reprinted as an appendix to
Carnegie-Mellon University Department of Computer Science report
CMU-CS-84-163.]
100473 DISAMBIGUATING GRAMMATICALLY AMBIGUOUS SENTENCES BY ASKING.
Masaru Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-163. 1984. Paper presented at the 10th (1984) International
Conference on Computational Linguistics, reprinted as an appendex to
Carnegie-Mellon University Department of Computer Science report
CMU-CS-84-163.]
100474 GENERAL QUORUM CONSENSUS: A REPLICATION METHOD FOR ABSTRACT DATA
TYPES.
Maurice Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-164. 1984.]
100475 AUTOMATIC PARTITIONING AND SCHEDULING ON A NETWORK OF PERSONAL
COMPUTERS.
David A. Hornig.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-165. 1984. Thesis (Ph.D.).]
100476 TRANSACTIONS ON TYPED OBJECTS.
Peter M. Schwarz.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-166. 1984. Thesis (Ph.D.).]
100477 THE BOX, A LAYOUT ABSTRACTION FOR USER INTERFACE TOOLKITS.
Joelle Coutaz.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-167. 1984.]
100478 FIDO: VISION AND NAVIGATION FOR A ROBOT ROVER.
Charles E. Thorpe.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-168. 1984. Thesis (Ph.D.).]
100479 THE MAN-MACHINE INTERFACE.
Robert U. Ayres.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-84-26.
1984.]
100480 DYNAMIC WORLD MODELING FOR AN INTELLIGENT MOBILE ROBOT USING A
ROTATING ULTRA-SONIC RANGING DEVICE.
James L. Crowley.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-84-27.
1984.]
100481 A FUNCTIONAL VEHICLE FOR AUTONOMOUS MOBILE ROBOT RESEARCH.
Gregg Podnar, Kevin Dowling, and Mike Blackwell.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-84-28.
1984.]
100482 MULTIPLE RESOLUTION REPRESENTATION AND PROBABILISTIC MATCHING OF 2-D
GRAY-SCALE SHAPE.
James L. Crowley and Arthur C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-84-29.
1984.]
100483 THREE-DIMENSIONAL SENSING AND INTERPRETATION.
Gerald J. Agin, Martin J. Uram, and Peter T. Highnam.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-1.
1985.]
100483 A MOVEABLE LIGHT-STRIPE SENSOR FOR OBTAINING THREE-DIMENSIONAL
COORDINATE MEASUREMENTS.
Gerald J. Agin and Peter T. Highnam.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-1.
1985. Paper presented at the SPIE International Technical Symposum -
Conference 360 (Robotics and Industrial Inspection), August 21-27,
1982, San Diego, California. Reprinted as appendix to Carnegie-Mellon
University Robotics Institute report CMU-RI-TR-85-1.]
100484 ON THE EXISTENCE OF ACYCLIC VIEWS IN A DATABASE SCHEME.
G. Ausiello, A. D'Atri, and M. Moscarini.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 86. 1984.]
100485 OPTIMAL ACYCLIC COVERINGS OVER HYPERGRAPHS.
G. Ausiello, A. D'Atri, and M. Moscarini.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 87. 1984.]
100486 TIME-STAMPS APPROACH TO STORE-AND-FORWARD DEADLOCK PREVENTION.
J. Blazewicz, J. Brzezinski, and G. Gambosi.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 88. 1984.]
100487 FINITE-DIMENSIONAL APPROXIMATIONS FOR THE EQUATION OF NONLINEAR
FILTERING DERIVED IN MILD FORM.
A. Germani and M. Piccioni.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 89. 1984.]
100488 CATEGORICAL MODELS FOR HANDSHAKING COMMUNICATIONS.
A. Labella and A. Pettorossi.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 90. 1984.]
100489 THE DYNAMICS OF URBAN POPULATION.
D. Campisi and A. La Bella.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 91. 1984.]
100490 TOTAL UNIMODULARITY AND THE EULER-SUBGRAPH PROBLEM.
M. Padberg.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 92. 1984.]
100491 A POWERFUL STRATEGY FOR DERIVING EFFICIENT PROGRAMS BY
TRANSFORMATIONS.
A. Pettorossi.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 93. 1984.]
100492 HIGHER ORDER COMMUNICATIONS FOR CONCURRENT PROGRAMMING.
A. Pettorossi and A. Skowron.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 94. 1984.]
100493 APPROXIMATION OF THE INFINITE DIMENSIONAL KALMAN FILTER BY
PROJECTIONS.
A. Germani, L. Jetto, and M. Piccioni.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 95. 1984.]
100494 STAQUEL: A QUERY LANGUAGE FOR STATISTICAL DATABASE.
M. Rafanelli and F. L. Ricci.
[Consiglio Nazionale delle Ricerche (Italy). Istituto di Analisi dei
Sistemi ed Informatica. R. 96. 1984.]
100495 A KERNEL LANGUAGE FOR MODULES AND ABSTRACT DATA TYPES.
R. Burstall and B. Lampson.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 1. 1984.]
100496 OPTIMAL POINT LOCATION IN A MONOTONE SUBDIVISION.
Herbert Edelsbrunner, Leo J. Guibas, and Jorge Stolfi.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 2. 1984.]
100497 GRAPHICAL PROFILES OF MULTIVARIATE DATA (SAS PROCEDURES STARS AND
FACES).
Harold W. Gugel.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-4896. 1985.]
100498 VISION MACHINE TO DETECT POSITION OF OVERLAPPED WORKPIECES.
Ichiro Masaki.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-4895. 1985.]
100499 ENGINEERING ROBOT ACTIONS IN A COMPUTER INTEGRATED MANUFACTURING
ENVIRONMENT.
W. E. van Waning.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8415. 1984.]
100500 DISTRIBUTED ELECTIONS IN A RING OF PROCESSORS USING ARCHIMEDEAN TIME.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8416. 1984.]
100501 A SECURE HIGH-SPEED TRANSACTION PROTOCOL.
S. J. Mullender.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8417. 1984.]
100502 THE DESIGN OF A CAPABILITY-BASED DISTRIBUTED OPERATING SYSTEM.
S. J. Mullender and A. S. Tanenbaum.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8418. 1984.]
100503 DISTRIBUTED SYSTEMS MANAGEMENT IN WIDE AREA NETWORKS.
S. J. Mullender.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8419. 1984.]
100504 ALGEBRA OF COMMUNICATING PROCESSES.
J. A. Bergstra and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8421. 1984.]
100505 DISPROOF OF THE MERTENS CONJECTURE.
A. M. Odlyzko and H. J. J. te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8412. 1984.]
100506 ON THE ALGEBRAIC EQUATIONS IN IMPLICIT RUNGE-KUTTA METHODS.
W. H. Hundsdorfer and M. N. Spijker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8413. 1984.]
100507 NUMERICAL SOLUTION OF A FIRST KIND FREDHOLM INTEGRAL EQUATION ARISING
IN ELECTRON-ATOM SCATTERING.
H. J. J. te Riele and R. W. Wagenaar.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8414. 1984.]
100508 SOME HISTORICAL AND OTHER NOTES ABOUT THE MERTENS CONJECTURE AND ITS
RECENT DISPROOF.
H. J. J. te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8415. 1984.]
052018 ON THE MATHEMATICAL PROPERTIES OF LINGUISTIC THEORIES.
C. Raymond Perrault.
[Stanford University. Center for the Study of Language and
Information. CSLI-84-18. 1984.]
052019 A SIMPLE AND EFFICIENT IMPLEMENTATION OF HIGHER-ORDER FUNCTIONS IN
LISP.
Michael P. Georgeff and Stephen F. Bodnar.
[Stanford University. Center for the Study of Language and
Information. CSLI-84-19. 1984. Also issued as Technical note 339,
Artificial Intelligence Center, SRI International.]
052021 THE SITUATION IN LOGIC - II: CONDITIONALS AND CONDITIONAL INFORMATION.
Jon Barwise.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-21. 1985.]
052022 PRINCIPLES OF OBJ2.
Kokichi Futatsugi et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-22. 1985.]
025009 COMPLEXITY OF A TOP-DOWN CAPTURE RULE.
Yehoshua Sagiv and Jeffrey D. Ullman.
[Stanford University. Department of Computer Science.
STAN-CS-84-1009. 1984.]
025010 FILE ACCESS PERFORMANCE OF DISKLESS WORKSTATIONS.
Edward D. Lazowska et al.
[Stanford University. Department of Computer Science.
STAN-CS-84-1010. 1984. Also issued as Technical report 84-263,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
025011 ONE-TO-MANY INTERPROCESS COMMUNICATION IN THE V-SYSTEM.
David R. Cheriton and Willy Zwaenepoel.
[Stanford University. Department of Computer Science.
STAN-CS-84-1011. 1984. Also issued as Technical report 264, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
025012 TABLOG: THE DEDUCTIVE-TABLEAU PROGRAMMING LANGUAGE.
Yonathan Malachi, Zohar Manna, and Richard Waldinger.
[Stanford University. Department of Computer Science.
STAN-CS-84-1012. 1984.]
025013 HOW TO RUN TEX IN FRENCH.
Jacques Desarmenien.
[Stanford University. Department of Computer Science.
STAN-CS-84-1013. 1984.]
025014 A P-COMPLETE PROBLEM AND APPROXIMATIONS TO IT.
Richard Anderson and Ernst W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-84-1014. 1984.]
025015 THE COMPLEXITY OF RECOGNIZING POLYHEDRAL SCENES.
Lefteris Kirousis and Christos H. Papadimitriou.
[Stanford University. Department of Computer Science.
STAN-CS-84-1015. 1984.]
025016 INTRACTABLE PROBLEMS IN CONTROL THEORY.
Christos H. Papadimitriou and John Tsitsiklis.
[Stanford University. Department of Computer Science.
STAN-CS-84-1016. 1984.]
025017 THE THROUGHPUT OF A PRECEDENCE BASED QUEUING DISCIPLINE.
John Tsitsiklis and Christos H. Papadimitriou.
[Stanford University. Department of Computer Science.
STAN-CS-84-1017. 1984.]
025018 CLASSIFICATION PROBLEM SOLVING.
William J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-84-1018. 1984. Also issued as HPP-84-7, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
025019 SOME RESULTS ON CIRCUMSCRIPTION.
V. Lifschitz.
[Stanford University. Department of Computer Science.
STAN-CS-84-1019. 1984.]
025020 PERCEPTUAL ORGANIZATION AND VISUAL RECOGNITION.
David G. Lowe.
[Stanford University. Department of Computer Science.
STAN-CS-84-1020. 1984. Thesis (Ph.D.).]
025021 USE OF ARTIFICIAL INTELLIGENCE AND SIMPLE MATHEMATICS TO ANALYZE A
PHYSIOLOGICAL MODEL.
John C. Kunz.
[Stanford University. Department of Computer Science.
STAN-CS-84-1021. 1984. Thesis (Ph.D.). "A dissertation submitted to
the Committee on Graduate Studies of Stanford University in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy in Medical Information Sciences."]
025022 A DEDUCTION MODEL OF BELIEF AND ITS LOGICS.
Kurt Konolige.
[Stanford University. Department of Computer Science.
STAN-CS-84-1022. 1984. Thesis (Ph.D.). "This report is a slightly
revised version of a thesis submitted to the Department of Computer
Science at Stanford University in June, 1984, in partial fulfillment
of the requirements for the Degree of Doctor of Philosophy."]
025023 A METHOD FOR MANAGING EVIDENTIAL REASONING IN A HIERARCHICAL
HYPOTHESIS SPACE.
Jean Gordon and Edward H. Shortliffe.
[Stanford University. Department of Computer Science.
STAN-CS-84-1023. 1984. Also issued as HPP-84-35, Heuristic
Programming Project, Department of Computer Science, Stanford
University.]
025024 HOW TO SHARE MEMORY IN A DISTRIBUTED SYSTEM.
Eli Upfal and Avi Widgerson.
[Stanford University. Department of Computer Science.
STAN-CS-84-1024. 1984.]
025025 FAST SCHEDULING ALGORITHMS ON PARALLEL COMPUTERS.
David Helmbold and Ernst Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-84-1025. 1984.]
025026 GLOBALLY-ASYNCHRONOUS LOCALLY-SYNCHRONOUS SYSTEMS.
Daniel M. Chapiro.
[Stanford University. Department of Computer Science.
STAN-CS-84-1026. 1984. Thesis (Ph.D.).]
025027 A TORTURE TEST FOR TEX.
Donald E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-84-1027. 1984.]
025028 PARALLEL GRAPH ALGORITHMS.
Peter H. Hochschild, Ernst W. Mayr, and Alan R. Siegel.
[Stanford University. Department of Computer Science.
STAN-CS-84-1028. 1984.]
025029 COUNTERFACTUALS.
Matthew L. Ginsberg.
[Stanford University. Department of Computer Science.
STAN-CS-84-1029. 1984. Also issued as HPP-84-43, Heuristic
Programming Project, Department of Computer Science, Stanford
University.]
025030 CONSTRAINT PROPAGATION TECHNIQUES FOR THEORY-DRIVEN DATA
INTERPRETATION.
Thomas Glen Dietterich.
[Stanford University. Department of Computer Science.
STAN-CS-84-1030. 1984. Thesis (Ph.D.). Also issued as HPP-84-46,
Heuristic Programming Project, Department of Computer Science,
Stanford University.]
025031 NESTOR: A COMPUTER BASED MEDICAL DIAGNOSTIC AID THAT INTEGRATES
CAUSAL AND PROBABILISTIC KNOWLEDGE.
Gregory Floyd Cooper.
[Stanford University. Department of Computer Science.
STAN-CS-84-1031. 1984. Thesis (Ph.D.). "A dissertation submitted to
the Committee on Graduate Studies of Stanford University in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy in Medical Information Sciences." Also issued as
HPP-84-48, Heuristic Programming Project, Department of Computer
Science, Stanford University.]
025032 SOLVING THE PRISONER'S DILEMMA.
Michael R. Genesereth, Matthew L. Ginsberg, and Jeffrey S.
Rosenschein.
[Stanford University. Department of Computer Science.
STAN-CS-84-1032. 1984. Also issued as HPP-84-41, Heuristic
Programming Project, Department of Computer Science, Stanford
University.]
025033 PARTIAL ORDERS AND THE AXIOMATIC THEORY OF SHUFFLE.
Jay Loren Gischer.
[Stanford University. Department of Computer Science.
STAN-CS-84-1033. 1984. Thesis (Ph.D.).]
025034 BB1: AN ARCHITECTURE FOR BLACKBOARD SYSTEMS THAT CONTROL, EXPLAIN,
AND LEARN ABOUT THEIR OWN BEHAVIOR.
Barbara Hayes-Roth.
[Stanford University. Department of Computer Science.
STAN-CS-84-1034. 1984. Also issued as HPP-84-16, Heuristic
Programming Project, Department of Computer Science, Stanford
University.]
025035 RESIDUE: A DEDUCTIVE APPROACH TO DESIGN SYNTHESIS.
J. J. Finger and Michael R. Genesereth.
[Stanford University. Department of Computer Science.
STAN-CS-85-1035. 1985. Also issued as HPP-85-1, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
100509 A SURVEY OF THE PROJECT CIP: COMPUTER AIDED, INTUITION-GUIDED
PROGRAMMING - WIDE SPECTRUM LANGUAGE AND PROGRAM TRANSFORMATIONS.
EDITED BY B. MOELLER.
B. Moeller.
[Technische Universitaet Muenchen. Institut fuer Informatik.
TUM-I8406. 1984.]
100510 ZUR ALGEBRAISCHEN CHARAKTERISIERUNG DER GANZEN ZAHLEN.
Rudolf Berghammer.
[Technische Universitaet Muenchen. Institut fuer Informatik.
TUM-I8407. 1984.]
100511 THE PERFORMANCE OF A TYPE-INSENSITIVE RUNGE-KUTTA CODE ON A PERSONAL
COMPUTER.
Peter Rentrop.
[Technische Universitaet Muenchen. Institut fuer Informatik.
TUM-I8410. 1984.]
100512 PROPAGATOR FOR A PARTICLE IN A CONSTANT MAGNETIC FIELD AND AN
ADDITIONAL POTENTIAL.
D. P. L. Castrigiano and N. Kokiantonis.
[Technische Universitaet Muenchen. Institut fuer Mathematik.
TUM-M8403. 1984.]
100513 OPTIMAL FREQUENZEN FUER RUNDFUNKSENDER IM UKW - BEREICH.
Ralf Klensteuber.
[Technische Universitaet Muenchen. Institut fuer Mathematik.
TUM-M8404. 1984.]
100514 GENERALIZED GRAPH COLORING: A FREQUENCY ASSIGNMENT METHOD FOR
VHF-BROADCASTING.
Ralf Kleinsteuber.
[Technische Universitaet Muenchen. Institut fuer Mathematik.
TUM-M8405. 1984.]
100515 DIGITAL SIGNATURES - AN UPDATE.
D. W. Davies and W. L. Price.
[U.K. National Physical Laboratory. Division of Information
Technology & Computing. DITC 51/84. 1984.]
100516 AUTOMATIC ANALYSIS OF SPECKLE PHOTOGRAPHS BY MICROCOMPUTER.
P. J. Pobgee.
[U.K. National Physical Laboratory. Division of Information
Technology & Computing. DITC 47/84. 1984.]
100517 GATEWAY TESTING TECHNIQUES.
H. X. Zeng and D. Rayner.
[U.K. National Physical Laboratory. Division of Information
Technology & Computing. DITC 49/84. 1984.]
100518 THE DESIGN AND VALIDATION OF SOFTWARE FOR DIMENSIONAL METROLOGY.
G. T. Anthony and M. G. Cox.
[U.K. National Physical Laboratory. Division of Information
Technology & Computing. DITC 50/84. 1984.]
100519 ON THE SEMANTICS OF PETRI NETS.
Wolfgang Reisig.
[Universitaet Hamburg. Fachbereich Informatik. Bericht nr. 100. 1984.]
100520 NATURAL LANGUAGE DESCRIPTION OF TIME-VARYING SCENES.
Bernd Neumann.
[Universitaet Hamburg. Fachbereich Informatik. Bericht nr. 105. 1984.]
100521 KLEENE-ABGESCHLOSSENHEIT DETERMINISTISCHER PLATZKOMPLEXITAETSKLASSEN.
Birgit Jenner and Ingrid Niepel.
[Universitaet Hamburg. Fachbereich Informatik. Bericht nr. 106. 1984.]
100522 ON HOTZ GROUPS AND HOMOMORPHIC IMAGES OF SENTENTIAL FORM LANGUAGES.
Volker Diekert.
[Universitaet Hamburg. Fachbereich Informatik. Bericht nr. 107. 1984.]
100523 VERKEHRS-/ZUVERLAESSIGKEITS-MODELLE AUF DER BASIS VON BCMP-NETZEN.
Olaf Schoen.
[Universitaet Hamburg. Fachbereich Informatik. Bericht nr. 108. 1984.]
100524 REPARSING OF PROGRAMS IN AN INTERACTIVE ENVIRONMENT.
Bruce Hutton.
[University of Auckland. Department of Computer Science. Report no.
34. 1984.]
100525 A COMPUTER BOOKING SYSTEM.
R. J. Lobb.
[University of Auckland. Department of Computer Science. Report no.
35. 1984.]
100526 DESIGN ALGORITHM OF OPTIMAL NOR NETWORKS BY THE BRANCH-AND-BOUND
APPROACH.
Tomoyasu-Taguti Nakagawa, Hung-Chi Lai, and Saburo Muroga.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1128. 1984.]
100527 MATRIX: A PROGRAM THAT SHOWS HOW ROW AND COLUMN ORDERINGS AFFECT
MATRIX FILL IN.
Thomas J. Woodburn.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1171. 1984.]
100528 COMPILE-TIME SCHEDULING AND OPTIMIZATION FOR ASYNCHRONOUS MACHINES.
Ronald Gary Cytron.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1177. 1984. Thesis (Ph.D.).]
100529 TERMINATION ORDERINGS FOR ASSOCIATIVE COMMUTATIVE REWRITING SYSTEMS.
Leo Bachmair.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1179. 1984.]
100530 ACCESS PATH OPTIMIZATION FOR NETWORK DATABASE RETRIEVAL.
Huei-huang Chen.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1184. 1984. Thesis (Ph.D.).]
100531 CONJUNCTIVE CONCEPTUAL CLUSTERING: A METHODOLOGY AND EXPERIMENTATION.
Robert Earl Stepp III.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1189. 1984. Thesis (Ph.D.).]
100532 TED: A TREE EDITOR WITH APPLICATIONS FOR THEOREM PROVING.
David H. Hammerslag.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1190. 1984.]
100533 AN INTRA-CELL AUTOMATIC ROUTER.
Yi-Hua Yu.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1191. 1984.]
100534 BINARY LOGIC THEORY FOR DESIGN OF MINIMAL DECODED-PLA'S.
Sung Je Hong and Saburo Muroga.
[University of Illinois at Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1192. 1984.]
100535 A RELIABLE STABLE STORAGE SYSTEM FOR UNIX.
J. A. Anyanwu.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
191. 1984.]
100536 COMMUNICATIONS PROTOCOLS FOR LOCAL AREA NETWORKS.
F. Panzieri.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
192. 1984.]
100537 A COMMUNICATION SYSTEM SUPPORTING LARGE DATAGRAMS ON A LOCAL AREA
NETWORK.
A. Linton and F. Panzieri.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
193. 1984.]
100538 THE NEWCASTLE CONNECTION: A SOFTWARE SUBSYSTEM FOR CONSTRUCTING
DISTRIBUTED UNIX SYSTEMS.
B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
194. 1984.]
100539 THE CEDAR PROGRAMMING ENVIRONMENT: A MIDTERM REPORT AND EXAMINATION.
Warren Teitelman.
[Xerox Corporation. Palo Alto Research Center. CSL-83-11. 1984.]
100540 THE ALPINE FILE SYSTEM.
Mark R. Brown, Karen Kolling, and Edward A. Taft.
[Xerox Corporation. Palo Alto Research Center. CSL-84-4. 1984.]
100541 INTERACTIVE SOURCE-LEVEL DEBUGGING OF OPTIMIZED PROGRAMS.
Polle Trescott Zellweger.
[Xerox Corporation. Palo Alto Research Center. CSL-84-5. 1984. Thesis
(Ph.D.). "This report reproduces a dissertation submitted to the
University of California, Berkeley in partial fulfillment of the
degree requirements for the Doctor of Philosophy in Computer
Science."]
100542 PERFORMANCE OF HIERARCHICAL PRODUCTION SCHEDULING POLICY.
Ramakrishna Akella, Yong Choong, and Stanley B. Gershwin.
[Massachusetts Institute of Technology. Laboratory for Information
and Decision Systems. LIDS-FR-1357. 1984.]
100543 UNIFORM EMULATIONS OF THE SHUFFLE-EXCHANGE NETWORK.
H. L. Bodlaender and J. van Leeuwen.
[Rijksuniversiteit Utrecht. Vakgroep Informatica. RUU-CS-84-5. 1984.]
100544 THE ROLE OF EQUATIONS IN NIAL.
M. A. Jenkins.
[Queen's University. Department of Computing & Information Science.
Report no. 84-161. 1984.]
100545 THE LaTEX DOCUMENT PREPARATION SYSTEM.
Leslie Lamport.
[1984. Second preliminary edition: February 28, 1984. For LaTEX
version 2.0., TEX version 1.0. Includes errata for version 2.06a.]
100546 SHOCK WAVES, INCREASE OF ENTROPY AND LOSS OF INFORMATION.
Peter D. Lax.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-240. 1984.]
100547 THE ORGANIZATION OF KNOWLEDGE IN A MULTI-LINGUAL, INTEGRATED PARSER.
Steven Leo Lytinen.
[Yale University. Department of Computer Science. Research report
340. 1984. Thesis (Ph.D.).]
100548 EXECUTING TEMPORAL LOGIC PROGRAMS.
Ben Moszkowski.
[University of Cambridge. Computer Laboratory. Technical report 55.
1984.]
100549 A STATE OF THE ART SURVEY ON INFORMATION HANDLING IN AN OFFICE
INFORMATION SYSTEM.
Alan F. Smeaton et al.
[University College Dublin. Department of Computer Science. Internal
report no. CS0020. 1984.]
100550 IMPLICIT AND PARAMETRIC CURVES AND SURFACES FOR COMPUTER AIDED
GEOMETRIC DESIGN.
Thomas Warren Sederberg.
[Purdue University. Computer Aided Design and Graphics Laboratory.
CAD-83-009. 1983. Thesis (Ph.D.).]
100551 A SYNTAX-DIRECTED EDITOR FOR DESIGNING STRUCTURED CONVENTIONAL
FLOWCHART.
C.-S. Tang and W. Yin.
[n.d. No issuing agency indicated (author's address: The Institute of
Computing Technology, Akademia Sinica, P.O. Box 2704, Beijing,
China).]
100552 EXPERIENCES OF 'LITERATE PROGRAMMING' USING CWEB [A VARIANT OF
KNUTH'S WEB].
Harold Thimbleby.
[University of York. Department of Computer Science. YCS.74. 1984.]
VOL. 7, NO. 3 05/13/85
100553 THE MOSSIM SIMULATION ENGINE ARCHITECTURE AND DESIGN.
William J. Dally.
[California Institute of Technology. Computer Science Department.
Report no. 5123:TR:84. 1984.]
100554 THE PROBE: AN ADDITION TO COMMUNICATION PRIMITIVES.
Alain J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5124:TR:84. 1984.]
100555 SUPERMESH.
Wen-King Su.
[California Institute of Technology. Computer Science Department.
Report no. 5125:TR:84. 1984. Thesis (M.S.).]
100556 LINGUISTIC ANALYSIS OF NATURAL LANGUAGE COMMUNICATION WITH COMPUTERS.
Bozena Henisz Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5128:TR:84. 1984. "This paper is identical with the one
published in the 'Proceedings of COLING 80' except for the formating,
corrections of a few typographical errors, and the inclusion of the
Appendix."]
100557 DESIGN OF THE MOSAIC PROCESSOR.
Christopher Lutz.
[California Institute of Technology. Computer Science Department.
Report no. 5129:TR:84. 1984. Thesis (M.S.).]
100558 LOG: THE CHIPMONK LOGIC SIMULATOR. USER'S GUIDE.
David Gillespie.
[California Institute of Technology. Computer Science Department.
Report no. 5130:TR:84. 1984.]
100559 SWITCH-LEVEL FAULT SIMULATION OF MOS DIGITAL CIRCUITS.
Michael Schuster.
[California Institute of Technology. Computer Science Department.
Report no. 5132:TR:84. 1984. Thesis (M.S.).]
100560 A HIERARCHICAL TIMING SIMULATION MODEL FOR DIGITAL INTEGRATED
CIRCUITS AND SYSTEMS.
Tzu-Mu Lin.
[California Institute of Technology. Computer Science Department.
Report no. 5133:TR:84. 1984. Thesis (Ph.D.).]
100561 USING LOGIC PROGRAMMING FOR COMPILING APL.
Howard Derby.
[California Institute of Technology. Computer Science Department.
Report no. 5134:TR:84. 1984. Thesis (M.S.).]
100562 TOWARDS CONCURRENT ARITHMETIC: RESIDUE ARITHMETIC AND VLSI.
Chao-Lin Chiang.
[California Institute of Technology. Computer Science Department.
Report no. 5135:TR:84. 1984. Thesis (M.S.).]
100563 HETEROGENOUS DATA BASE ACCESS.
Alexandros Christou Papachristidis.
[California Institute of Technology. Computer Science Department.
Report no. 5136:TR:84. 1984. Thesis (Ph.D.).]
100564 THE DIALOGUE DESIGNING DIALOGUE SYSTEM.
Tai-Ping Ho.
[California Institute of Technology. Computer Science Department.
Report no. 5137:TR:84. 1984. Thesis (Ph.D.).]
100565 HEX: A HIERARCHICAL CIRCUIT EXTRACTOR.
Yen-Jen Oyang.
[California Institute of Technology. Computer Science Department.
Report no. 5139:TR:84. 1984. Thesis (M.S.).]
100566 HIERARCHY OF GRAPH ISOMORPHISM TESTING.
Wen-Chi Chen.
[California Institute of Technology. Computer Science Department.
Report no. 5140:TR:84. 1984. Thesis (M.S.).]
100567 THE GENERAL INTERCONNECT PROBLEM OF INTEGRATED CIRCUITS.
John Y. Ngai.
[California Institute of Technology. Computer Science Department.
Report no. 5143:TR:84. 1984. Thesis (M.S.).]
100568 FAIR MUTUAL EXCLUSION WITH UNFAIR P AND V OPERATIONS.
Alain J. Martin and Jerry R. Burch.
[California Institute of Technology. Computer Science Department.
Report no. 5148:TR:84. 1984.]
100569 BIT-SERIAL REED-SOLOMON DECODERS IN VLSI.
Douglas L. Whiting.
[California Institute of Technology. Computer Science Department.
Report no. 5157:TR:84. 1984. Thesis (Ph.D.).]
100570 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 APRIL 1984 TO 15 OCTOBER 1984.
[California Institute of Technology. Computer Science Department.
Report no. 5160:TR:84. 1984.]
100571 ASK-FRENCH: A FRENCH NATURAL LANGUAGE SYNTAX.
Remy Sanouillet.
[California Institute of Technology. Computer Science Department.
Report no. 5164:TR:84. 1984. Thesis (M.S.).]
100572 A OBJECT ORIENTED ARCHITECTURE.
William J. Dally and James T. Kajiya.
[California Institute of Technology. Computer Science Department.
Report no. 5168:TR:84. 1984.]
100573 A COMBINED LOGICAL AND FUNCTIONAL PROGRAMMING LANGUAGE.
Michael O. Newton.
[California Institute of Technology. Computer Science Department.
Report no. 5172:TR:85. 1985.]
100626 ON MONOTONE FORMULAE WITH RESTRICTED DEPTH.
Maria Klawe et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4490. 1984. Preliminary version.]
100627 A NEW PROCEDURE FOR COMPUTING BINARY AND MULTI-COLORED POLYGONAL
MASKS IN GENERAL PURPOSE IMAGE PROCESSING PIPELINE ARCHITECTURES.
Jorge L. C. Sanz, Its'hak Dinstein, and Dragutin Petrovic.
[International Business Machines Corporation (IBM). Research
Division. RJ 4491. 1984.]
100628 FAST ALGORITHMS FOR N-DIMENSIONAL RESTRICTIONS OF HARD PROBLEMS.
Friedhelm Meyer auf der Heide.
[International Business Machines Corporation (IBM). Research
Division. RJ 4493. 1984.]
100629 MEASUREMENT OF SQL: PROBLEMS AND PROGRESS.
Phyllis Reisner.
[International Business Machines Corporation (IBM). Research
Division. RJ 4510. 1984.]
100630 INFORMATION THEORETIC MEASURES FOR FEEDBACK BETWEEN TIME SERIES.
Mati Wax and Jorma Rissanen.
[International Business Machines Corporation (IBM). Research
Division. RJ 4511. 1984.]
100631 THIN FILMS FOR OPTICAL DATA STORAGE.
Wen-yaung Lee.
[International Business Machines Corporation (IBM). Research
Division. RJ 4518. 1984.]
100632 PROBLEMS IN FAULT TOLERANT DISTRIBUTED SYSTEMS.
H. Raymond Strong.
[International Business Machines Corporation (IBM). Research
Division. RJ 4519. 1984.]
100633 DENOTATIONAL SEMANTICS AND REWRITE RULES FOR FP: PRELIMINARY VERSION.
Joseph Y. Halpern et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4525. 1984.]
100634 A NONLINEAR LOWER BOUND FOR RANDOM ACCESS MACHINES UNDER LOGARITHMIC
COST.
Arnold Schonhage.
[International Business Machines Corporation (IBM). Research
Division. RJ 4527. 1984.]
100635 REGENERATIVE SIMULATION OF STOCHASTIC PETRI NETS.
Peter J. Haas and Gerald S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 4530. 1984.]
100636 ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE
AGREEMENT.
Flaviu Cristian et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4540. 1984.]
100637 WINDOWED FAST TRANSVERSAL FILTERS ADAPTIVE ALGORITHMS WITH
NORMALIZATION.
J. M. Cioffi and T. Kailath.
[International Business Machines Corporation (IBM). Research
Division. RJ 4544. 1984.]
100638 STATE SPLITTING FOR VARIABLE LENGTH GRAPHS.
Roy Adler et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4550. 1984.]
100639 INTEGRATED MANUFACTURING TESTING.
Sakti P. Ghosh.
[International Business Machines Corporation (IBM). Research
Division. RJ 4552. 1984.]
100640 SYMMETRIC STOCHASTIC PETRI NETS.
Lindsay A. Prisgrove and Gerald S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 4553. 1985.]
100641 CONTAM: AN EDGE-BASED APPROACH TO SEGMENTING IMAGES WITH IRREGULAR
OBJECTS.
Glenn Healy and Jorge L. C. Sanz.
[International Business Machines Corporation (IBM). Research
Division. RJ 4560. 1985.]
100642 A NEW APPROACH TO COMPUTING GEOMETRICAL FEATURES OF DIGITAL OBJECTS
FOR MACHINE VISION, IMAGE ANALYSIS AND IMAGE PROCESSING: ALGORITHMS
IN PIPELINE ARCHITECTURES.
Jorge L. C. Sanz and Its'hak Dinstein.
[International Business Machines Corporation (IBM). Research
Division. RJ 4561. 1985.]
100643 FROM FUNCTION LEVEL SEMANTICS TO PROGRAM TRANSFORMATION AND
OPTIMIZATION.
John Backus.
[International Business Machines Corporation (IBM). Research
Division. RJ 4567. 1985.]
100644 ON THE VERSATILITY OF KNOWLEDGE REPRESENTATIONS.
Peter Lucas.
[International Business Machines Corporation (IBM). Research
Division. RJ 4573. 1985.]
100645 OBJECT MODELS FOR OFFICE SYSTEMS - AN EXPOSITION OF ARCHITECTURAL
CONCEPTS.
H. M. Gladney and J. L. Bennett.
[International Business Machines Corporation (IBM). Research
Division. RJ 4584. 1985.]
100646 ON THE DATA MANIPULATION PARADIGM IN INTERACTIVE DISPLAY MANAGEMENT.
James R. Rhyne.
[International Business Machines Corporation (IBM). Research
Division. RJ 4585. 1985.]
100647 PROBOT - A TOOL FOR AUTOMATED SOFTWARE ASSEMBLY.
James R. Rhyne.
[International Business Machines Corporation (IBM). Research
Division. RJ 4586. 1985.]
100648 AN IMPROVED ALGORITHM FOR ESTIMATING PROTOCOL PERFORMANCE.
Harry Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1314. 1984.]
100649 ANALYZING THE TIME EFFICIENCY OF A COMMUNICATION PROTOCOL.
Pieter S. Kritzinger.
[International Business Machines Corporation (IBM). Research
Division. RZ 1317. 1984.]
100650 ON THE ANALYSIS OF TIME-DEPENDENT PROTOCOLS BY NETWORK FLOW
ALGORITHMS.
Tommaso Bolognesi and Harry Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1319. 1984.]
100651 SYNCHRONIZATION FAILURES IN A CHAIN OF PLL SYNCHRONIZERS.
Heinrich Meyr, Lutjens Popken, and Hans R. Mueller.
[International Business Machines Corporation (IBM). Research
Division. RZ 1332. 1984.]
100652 FILE TRANSFER IN LOCAL-AREA NETWORKS: A PERFORMANCE STUDY.
B. Meister, P. Janson, and L. Svobodova.
[International Business Machines Corporation (IBM). Research
Division. RZ 1333. 1984.]
100653 FLOW CONTROL IN LOCAL-AREA NETWORKS OF INTERCONNECTED TOKEN RINGS.
Werner Bux and Davide Grillo.
[International Business Machines Corporation (IBM). Research
Division. RZ 1336. 1984.]
100654 ARCHITECTURE OF A DIGITAL SIGNAL PROCESSOR.
G. Ungerboeck et al.
[International Business Machines Corporation (IBM). Research
Division. RZ 1342. 1984.]
100655 AN INFORMAL OVERVIEW OF FORMAL PROTOCOL SPECIFICATION.
Harry Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1344. 1984.]
100656 A PERFORMANCE MODEL OF THE OSI COMMUNICATION ARCHITECTURE.
Pieter S. Kritzinger.
[International Business Machines Corporation (IBM). Research
Division. RZ 1346. 1984.]
100657 WAITING TIMES IN MULTI-QUEUE SYSTEMS WITH CYCLIC SERVICE.
O. J. Boxma and B. Meister.
[International Business Machines Corporation (IBM). Research
Division. RZ 1348. 1985.]
100658 TIME IN FORMAL PROTOCOL SPECIFICATIONS.
Harry Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1349. 1985.]
100659 CLIENT/SERVER MODEL OF DISTRIBUTED PROCESSING.
Liba Svobodova.
[International Business Machines Corporation (IBM). Research
Division. RZ 1350. 1985.]
100660 USER DEFINED PARALLEL CONTROL STRATEGIES.
J. I. Glasgow, M. A. Jenkins, and C. D. McCrosky.
[Queen's University. Department of Computing and Information Science.
Technical report 84-163. 1984.]
100661 AN ADAPTIVE AND COST-OPTIMAL PARALLEL ALGORITHM FOR MINIMUM SPANNING
TREES.
Selim G. Akl.
[Queen's University. Department of Computing and Information Science.
Technical report 85-164. 1984.]
100662 THE PERFORMANCE OF MEGA-MICROPROCESSOR NETWORKS.
D. B. Skillicorn.
[Queen's University. Department of Computing and Information Science.
Technical report 85-166. 1985.]
100663 EFFICIENT SELECTION ON A BINARY TREE.
Jack Cooper and Selim G. Akl.
[Queen's University. Department of Computing and Information Science.
Technical report 85-167. 1985.]
100664 GENERATING COMBINATIONS IN PARALLEL.
Becky Chan and Selim G. Akl.
[Queen's University. Department of Computing and Information Science.
Technical report 85-168. 1985.]
100665 SEMANTICAL ANALYSIS OF SPECIFICATION LOGIC.
R. D. Tennent.
[Queen's University. Department of Computing and Information Science.
Technical report 85-169. 1985.]
100666 DIRECTOR-ORIENTED 3D SHADED COMPUTER ANIMATION.
Nadia Magnenat-Thalmann and Daniel Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 507. 1984.]
100667 MINIMUM COST FLOW PROBLEM WITH PIECEWISE NON-CONTINUOUS ARC COSTS.
Jean Ethier and Jacques A. Ferland.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 508. 1984.]
100668 USE OF FORMAL SPECIFICATIONS FOR PROTOCOL DESIGN, IMPLEMENTATION AND
TESTING.
G. v. Bochmann et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 509. 1984.]
100669 SOME RESULTS ON VECTOR CORRELATION.
P. Robert, R. Cleroux, and N. Ranger.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 510. 1984.]
100670 THE RV-COEFFICIENT: DEFINITION, APPLICATIONS, DISTRIBUTION AND OPEN
PROBLEMS.
Robert Cleroux, Yves Escoufier, and Pierre Robert.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 511. 1984.]
100671 ESTIMATION DE PARAMETRES D'UNE DISTRIBUTION MULTINORMALE A PARTIR
D'UN ECHANTILLON TRONQUE.
Jean-Marie Helbling.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 512. 1984.]
100672 GENERAL LINEAR BOUNDARY CONDITIONS FOR DIFFERENCE SYSTEMS.
R. V. M. Zahar.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 513. 1984.]
100673 AN OBJECT-ORIENTED SWITCH-LEVEL SIMULATOR.
C. Roy et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 514. 1984.]
100674 HOLONS: A NUCLEUS FOR A VLSI DESIGN SYSTEM.
L.-P. Demers et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 515. 1984.]
100675 LOGICON: AN INTEGRATION OF PROLOG INTO ICON.
Guy Lapalme and Suzanne Chapleau.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 516. 1984.]
100676 TESTING IMPLEMENTATIONS OF AN APPLICATION-LEVEL COMMUNICATION
PROTOCOL: INTER-LIBRARY LOAN SUBJECT INDEX: 2.
E. Cerny and G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 517. 1984.]
100677 SEMI-AUTOMATIC IMPLEMENTATION OF COMMUNICATION PROTOCOLS.
G. v. Bochmann, G. Gerber, and J. M. Serre.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publ. 518. 1984.]
100678 A SOUND AND SOMETIMES COMPLETE QUERY EVALUATION ALGORITHM FOR
RELATIONAL DATABASES WITH NULL VALUES.
Raymond Reiter.
[University of British Columbia. Department of Computer Science.
Technical report 83-11. 1983.]
100679 RF-MAPLE: A LOGIC PROGRAMMING LANGUAGE WITH FUNCTIONS, TYPES, AND
CONCURRENCY.
Paul J. Voda and Benjamin Yu.
[University of British Columbia. Department of Computer Science.
Technical report 84-8. 1984.]
100680 A VIEW OF PROGRAMMING LANGUAGES AS SYMBIOSIS OF MEANING AND CONTROL.
Paul J. Voda.
[University of British Columbia. Department of Computer Science.
Technical report 84-9. 1984.]
100681 PHOTOMETRIC METHOD FOR DETERMINING SHAPE FROM SHADING.
Robert J. Woodham.
[University of British Columbia. Department of Computer Science.
Technical report 84-10. 1984.]
100682 DEFINITE CLAUSE TRANSLATION GRAMMARS AND THE LOGICAL SPECIFICATION OF
DATA TYPES AS UNAMBIGUOUS CONTEXT FREE GRAMMARS.
Harvey Abramson.
[University of British Columbia. Department of Computer Science.
Technical report 84-11. 1984.]
100683 A GENERALIZATION OF THE FRANK MATRIX.
J. M. Varah.
[University of British Columbia. Department of Computer Science.
Technical report 84-12. 1984.]
100684 STABILITY OF COLLOCATION AT GAUSSIAN POINTS.
U. Ascher and G. Bader.
[University of British Columbia. Department of Computer Science.
Technical report 84-13. 1984.]
100685 SCALE-BASED DESCRIPTION AND RECOGNITION OF PLANAR CURVES AND
TWO-DIMENSIONAL SHAPES.
Farzin Mokhtarian and Alan Mackworth.
[University of British Columbia. Department of Computer Science.
Technical report 84-15. 1984.]
100686 COLLOCATION FOR TWO-POINT BOUNDARY VALUE PROBLEMS REVISITED.
Uri Ascher.
[University of British Columbia. Department of Computer Science.
Technical report 84-17. 1984.]
100687 THE DESIGN OF A DISTRIBUTED INTERPRETER FOR CONCURRENT PROLOG.
Chun Man Tam.
[University of British Columbia. Department of Computer Science.
Technical report 84-18. 1984. Thesis (M.S.).]
100688 NATURAL DEDUCTION BASED SET THEORIES: A NEW RESOLUTION OF THE OLD
PARADOXES.
Paul C. Gilmore.
[University of British Columbia. Department of Computer Science.
Technical report 84-19. 1984.]
100689 AN ALTERNATIVE CHARACTERIZATION OF PRECOMPLETE NUMERATIONS.
Akira Kanda.
[University of British Columbia. Department of Computer Science.
Technical report 84-20. 1984.]
100690 THE FILE SYSTEM OF A LOGIC OPERATING SYSTEM.
Anthony J. Kusalik.
[University of British Columbia. Department of Computer Science.
Technical report 84-21. 1984.]
100691 RECURSION THEOREMS AND EFFECTIVE DOMAINS.
Akira Kanda.
[University of British Columbia. Department of Computer Science.
Technical report 84-22. 1984.]
100692 NYSTROEM'S METHOD VERSUS FOURIER TYPE METHODS FOR THE NUMERICAL
SOLUTION OF INTEGRAL EQUATIONS.
Manfred R. Trummer.
[University of British Columbia. Department of Computer Science.
Technical report 84-23. 1984.]
100693 AN EFFICIENT IMPLEMENTATION OF A CONFORMAL MAPPING METHOD USING THE
SZEGO KERNEL.
Manfred R. Trummer.
[University of British Columbia. Department of Computer Science.
Technical report 84-24. 1984.]
100754 NOISY IMAGE RESTORATION BY COST FUNCTION MINIMIZATION.
Eli Harouche.
[University of Maryland. Computer Science Center. CS-TR-1363. 1984.
Also issued as CAR-TR-44, Center for Automation Research, University
of Maryland.]
100755 HEURISTICALLY-GUIDED SIMULATION AND ANALYSIS OF ERRORS IN DISCRETE
SEQUENTIAL PROCESSES.
Sanjeev B. Ahuja and James A. Reggia.
[University of Maryland. Computer Science Center. TR-1365. 1984.]
100756 DATA FLOW ALGORITHMS FOR PARALLEL MATRIX COMPUTATIONS.
Dianne P. O'Leary and G. W. Stewart.
[University of Maryland. Computer Science Center. TR-1366. 1984.]
100757 AN IMAGE FLOW PARADIGM.
Allen M. Waxman.
[University of Maryland. Computer Science Center. CS-TR-1367. 1984.
Also issued as CAR-TR-45, Center for Automation Research, University
of Maryland.]
100758 MEASURING THE SIZES OF CONCAVITIES.
Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1368. 1984.
Also issued as CAR-TR-46, Center for Automation Research, University
of Maryland.]
100759 DETERMINING PLANE ORIENTATION FROM SPECULAR REFLECTANCE.
Mohan D. R. Babu.
[University of Maryland. Computer Science Center. CS-TR-1369. 1984.
Also issued as CAR-TR-47, Center for Automation Research, University
of Maryland.]
100760 INEXACT SECANT METHODS FOR CONSTRAINED OPTIMIZATION.
Rodrigo Fontecilla.
[University of Maryland. Computer Science Center. TR-1370. 1984.]
100761 GENERATING SILHOUETTES OF POLYHEDRA.
Gyorgy Fekete.
[University of Maryland. Computer Science Center. CS-TR-1371. 1983.
Also issued as CAR-TR-48, Center for Automation Research, University
of Maryland.]
100762 STORING A COLLECTION OF POLYGONS USING QUADTREES.
Hanan Samet and Robert E. Webber.
[University of Maryland. Computer Science Center. CS-TR-1372. 1984.
Also issued as CAR-TR-49, Center for Automation Research, University
of Maryland.]
100763 SPECIFICATION AND VERIFICATION OF LIVENESS PROPERTIES OF CYCLIC,
CONCURRENT PROCESSES.
Joylyn N. Reed and Raymond T. Yeh.
[University of Maryland. Computer Science Center. TR-1373. 1983.]
100764 ANSWERING QUERIES IN INDEFINITE DATABASES AND THE NULL VALUE PROBLEM.
John Grant and Jack Minker.
[University of Maryland. Computer Science Center. TR-1374. n.d.]
100765 A NEWTON-LIKE METHOD FOR NONLINEAR CONSTRAINED OPTIMIZATION.
Rodrigo Fontecilla.
[University of Maryland. Computer Science Center. TR-1375. 1984.]
100766 ANALYSIS OF QUADTREE ALGORITHMS.
Robert E. Webber.
[University of Maryland. Computer Science Center. CS-TR-1376. 1984.
Thesis (Ph.D.). Also issued as CAR-TR-50, Center for Automation
Research, University of Maryland.]
100767 DECOMPOSITION AND APPROXIMATION OF THREE-DIMENSIONAL SOLIDS FROM
SERIAL SECTIONS.
Tsaiyun Phillips, Robert Cannon, and Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1378. 1984.
Also issued as CAR-TR-52, Center for Automation Research, University
of Maryland.]
100768 DEGREE OF ADJACENCY OR SURROUNDEDNESS.
Azriel Rosenfeld and Reinhard Klette.
[University of Maryland. Computer Science Center. CS-TR-1380. 1984.
Also issued as CAR-TR-53, Center for Automation Research, University
of Maryland.]
100769 EVIDENCE ACCUMULATION FOR SPATIAL REASONING.
Takashi Matsuyama, Vincent Shang-Shouq Hwang, and Larry S. Davis.
[University of Maryland. Computer Science Center. CS-TR-1381. 1984.
Also issued as CAR-TR-54, Center for Automation Research, University
of Maryland.]
100770 ARTIFICIAL INTELLIGENCE APPROACHES FOR AUTOMATED PROCESS PLANNING AND
CONTROL.
Dana S. Nau et al.
[University of Maryland. Computer Science Center. TR-1382. 1984.]
100771 TWO NEW IMAGE SMOOTHING OPERATORS.
Hannu Hakalahti and Ilkka Virtanen.
[University of Maryland. Computer Science Center. CS-TR-1383. 1984.
Also issued as CAR-TR-55, Center for Automation Research, University
of Maryland.]
100772 A TWO STAGE ITERATION FOR SOLVING NEARLY UNCOUPLED MARKOV CHAINS.
G. W. Stewart, W. J. Stewart, and D. F. McAllister.
[University of Maryland. Computer Science Center. TR-1384. 1984.]
100773 PROJECTED SECANT METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION.
Rodrigo Fontecilla.
[University of Maryland. Computer Science Center. TR-1386. 1984.]
100774 OBJECT RECOGNITION USING ORIENTED MODEL POINTS.
Teresa M. Silberberg, David Harwood, and Larry S. Davis.
[University of Maryland. Computer Science Center. CS-TR-1387. 1984.
Also issued as CAR-TR-56, Center for Automation Research, University
of Maryland.]
100775 DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.
I. V. Ramakrishnan and P. J. Varman.
[University of Maryland. Computer Science Center. CS-TR-1388. 1984.
Also issued as CAR-TR-57, Center for Automation Research, University
of Maryland.]
100776 A LESS COSTLY CONSTRAINTS CHECKING FOR JOIN DEPENDENCY.
K. P. Tan.
[University of Maryland. Computer Science Center. TR-1389. 1984.]
100777 THE INFORMATION TRANSFER LANGUAGE.
Carl Smith and Ashok Agrawala.
[University of Maryland. Computer Science Center. TR-1390. 1984.]
100778 TRIANGLE GRID SORT.
K. P. Tan.
[University of Maryland. Computer Science Center. TR-1391. 1984.]
100779 A TRANSIENT ANALYSIS OF COMPUTER COMMUNICATION NETWORKS.
Richard A. Upton.
[University of Maryland. Computer Science Center. TR-1393. 1984.
Thesis (Ph.D.).]
100780 A THEORY OF ERROR-BASED TESTING.
Larry Joe Morell.
[University of Maryland. Computer Science Center. TR-1395. 1984.]
100781 SYNCHRONIZATION TECHNIQUES IN DISTRIBUTED DATABASE SYSTEMS.
Mukesh Singhal and A. K. Agrawala.
[University of Maryland. Computer Science Center. TR-1396. 1984.]
100782 A NEW CLASS OF EDGE-PRESERVING SMOOTHING FILTERS.
David Harwood et al.
[University of Maryland. Computer Science Center. CS-TR-1397. 1984.
Also issued as CAR-TR-59, Center for Automation Research, University
of Maryland.]
100783 REAL-TIME ACQUISITION OF OBJECTS IN MOTION.
Sanjay Nagalia.
[University of Maryland. Computer Science Center. CS-TR-1398. 1984.
Also issued as CAR-TR-60, Center for Automation Research, University
of Maryland.]
100784 SIMULATION OF LARGE NETWORKS OF PROCESSORS BY SMALLER ONES.
S. K. Bhaskar, Azriel Rosenfeld, and Angela Y. Wu.
[University of Maryland. Computer Science Center. CS-TR-1401. 1984.
Also issued as CAR-TR-63, Center for Automation Research, University
of Maryland.]
100785 A GENERAL THEORETICAL MODEL FOR ABDUCTIVE DIAGNOSTIC EXPERT SYSTEMS.
Yun Peng.
[University of Maryland. Computer Science Center. TR-1402. 1984.]
100786 A QUANTITATIVE ANALYSIS OF A SOFTWARE DEVELOPMENT IN ADA.
Victor R. Basili et al.
[University of Maryland. Computer Science Center. TR-1403. 1984.]
100787 TRUE BELIEFS I (OR-CAN WE HAVE EVERYTHING IN FIRST-ORDER LOGIC?).
Donald Perlis.
[University of Maryland. Computer Science Center. TR-1404. 1984.]
100788 A STRUCTURE INDEPENDENT METHOD FOR SAVING AND RESTORING DYNAMICALLY
ALLOCATED DATA.
Avadis Tevanian Jr..
[University of Rochester. Department of Computer Science. TR 118.
1982.]
100789 DESIGN, TUNING AND PERFORMANCE EVALUATION OF AN AUTOMATED PULMONARY
NODULE DETECTION SYSTEM.
William Lampeter.
[University of Rochester. Department of Computer Science. TR 120.
1983. Thesis (M.S.). "This report reproduces a thesis submitted in
partial fulfillment of the requirements of the degree of Master of
Science in the School of Photographic Arts and Sciences...of the
Rochester Institute of Technology."]
100790 THREE IMAGE EXPERTS WHCH HELP DISTINGUISH LUNG TUMORS FROM NON-TUMORS.
William Lampeter.
[University of Rochester. Department of Computer Science. TR 123.
1984.]
100791 ROCHESTER CONNECTIONIST PAPERS: 1979-1984.
J. A. Feldman et al.
[University of Rochester. Department of Computer Science. TR 124.
1984.]
100792 HIERARCHICAL CACHE ACCUMULATORS FOR SEQUENTIAL MODE ESTIMATION.
Christopher M. Brown.
[University of Rochester. Department of Computer Science. TR 125.
1983.]
100793 THE HORNE REASONING SYSTEM.
James F. Allen, Mark Giuliano, and Alan M. Frisch.
[University of Rochester. Department of Computer Science. TR 126.
1984. Revised.]
100794 FINDING AXES OF SKEWED SYMMETRY.
Stuart A. Friedberg.
[University of Rochester. Department of Computer Science. TR 127.
1984.]
100795 IC LAYOUT GENERATION AND COMPACTION USING MATHEMATICAL OPTIMIZATION.
Hiroyuki Watanabe.
[University of Rochester. Department of Computer Science. TR 128.
1984. Thesis (Ph.D.).]
100796 EFFICIENT AND ELEGANT SUBWORD-TREE CONSTRUCTION.
M. T. Chen and J. I. Seiferas.
[University of Rochester. Department of Computer Science. TR 129.
1983.]
100797 DISCOURSE AND PROBLEM SOLVING.
Diane J. Litman.
[University of Rochester. Department of Computer Science. TR 130.
1983.]
100798 SEMANTIC NETWORKS AND NEURAL NETS.
Lokendra Shastri and Jerome A. Feldman.
[University of Rochester. Department of Computer Science. TR 131.
1984.]
100799 RELIABLE COMPUTATION WITH CELLULAR AUTOMATA.
Peter Gacs.
[University of Rochester. Department of Computer Science. TR 132.
1983.]
100800 CORTICAL CONNECTIONS: STRUCTURE AND FUNCTION.
Dana H. Ballard.
[University of Rochester. Department of Computer Science. TR 133.
1984.]
100801 OPTICAL PHENOMENA IN COMPUTER VISION.
Steven A. Shafer.
[University of Rochester. Department of Computer Science. TR 135.
1984.]
100802 USING COLOR TO SEPARATE REFLECTION COMPONENTS.
Steven A. Shafer.
[University of Rochester. Department of Computer Science. TR 136.
1984.]
100803 COMPUTER STRUCTURES FOR CURVE-SOLID CLASSIFICATION IN GEOMETRIC
MODELLING.
Gershon Kedem and John L. Ellis.
[University of Rochester. Department of Computer Science. TR 137.
1984.]
100804 MODE ESTIMATION WITH SMALL SAMPLES AND UNORDERED BINS.
Christopher M. Brown.
[University of Rochester. Department of Computer Science. TR 138.
1984.]
100805 BAYESIAN AND NON-BAYESIAN EVIDENTIAL UPDATING.
Henry E. Kyburg Jr..
[University of Rochester. Department of Computer Science. TR 139.
1984.]
100806 A PLAN RECOGNITION MODEL FOR SUBDIALOGUES IN CONVERSATIONS.
Diane J. Litman and James F. Allen.
[University of Rochester. Department of Computer Science. TR 141.
1984.]
100807 VISUAL RECOGNITION OF SIMPLE OBJECTS BY A CONNECTION NETWORK.
David C. Plaut.
[University of Rochester. Department of Computer Science. TR 143.
1984.]
100808 THE VOTE TALLYING CHIP: A CUSTOM INTEGRATED CIRCUIT.
David Sher and Avadis Tevanian.
[University of Rochester. Department of Computer Science. TR 144.
1984.]
100809 SILICON COMPILATION OF VERY HIGH LEVEL LANGUAGES.
Mark W. Kahrs.
[University of Rochester. Department of Computer Science. TR 145.
1984. Thesis (Ph.D.).]
100810 CONNECTIONIST MODELS AND PARALLELISM IN HIGH LEVEL VISION.
Jerome A. Feldman.
[University of Rochester. Department of Computer Science. TR 146.
1985.]
100811 ALGORITHMS AND HARDWARE FOR EFFICIENT IMAGE SMOOTHING.
Anup Basu and Christopher M. Brown.
[University of Rochester. Department of Computer Science. TR 149.
1984.]
100812 PORTRAY - AN IMAGE SYNTHESIS SYSTEM FOR REALISTIC COMPUTER GRAPHICS.
Darwyn R. Peachey.
[University of Saskatchewan. Department of Computational Science.
Report no. 84-18. 1984.]
100813 MEASUREMENT AND ANALYSIS OF LOCALITY PHASES IN FILE REFERENCING
BEHAVIOUR.
Shikharesh Majumdar and Richard B. Bunt.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-3. 1985.]
100814 SPELLING CORRECTION BASED ON USER ERROR PATTERNS.
B. R. Dobing and J. E. Cooke.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-4. 1985.]
100815 TIME-DEPENDENT COMMUNICATION PROTOCOLS.
A. Udaya Shankar and Simon S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-26. 1984.]
100816 PROVING LIVENESS AND TERMINATION OF SYSTOLIC ARRAYS USING
COMMUNICATING FINITE STATE MACHINES.
M. G. Gouda and H. S. Lee.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-27. 1984.]
100817 THE AUTOMATED PROOF OF A TRACE TRANSFORMATION FOR A BITONIC SORT.
Chua-Huang Huang and Christian Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-30. 1984.]
100818 PROTOCOL VALIDATION BY FAIR PROGRESS STATE EXPLORATION.
Mohamed G. Gouda and Ji-Yun Han.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-31. 1984.]
100819 MODELING AND VERIFICATION OF A BIT-STUFFING PROTOCOL USING
COMMUNICATING FINITE STATE MACHINES.
Mohamed G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-32. 1984.]
100820 FROM MENUS TO INTENTIONS IN MAN-MACHINE DIALOGUE.
Robert F. Simmons.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-33. 1984. Also issued as AI-TR-84-04, Artificial Intelligence
Laboratory, Department of Computer Sciences, University of Texas,
Austin.]
100821 A PARALLEL MULTI-STAGE I/O ARCHITECTURE WITH SELF-MANAGING DISK CACHE
FOR DATABASE MANAGEMENT APPLICATIONS.
J. C. Browne et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-34. 1984.]
100822 MODELING CONCEPTS FOR VLSI CAD OBJECTS.
D. S. Batory and Won Kim.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-35. 1984.]
100823 THEORY OF NON-FIRST-NORMAL-FORM RELATIONAL DATABASES.
Mark A. Roth, Henry F. Korth, and Abraham Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-84-36. 1984.]
100824 PARALLEL COMPLEXITY AND PERMUTATION GROUPS.
Pierre McKenzie.
[University of Toronto. Department of Computer Science. Technical
report 173/84. 1984. Thesis (Ph.D.).]
100825 THE PARALLEL COMPLEXITY OF SOME FLOW AND MATCHING PROBLEMS.
Thomas E. Feather.
[University of Toronto. Department of Computer Science. Technical
report 174/84. 1984. Thesis (M.S.).]
100826 IMPLICIT RUNGE-KUTTA METHODS FOR TWO-POINT BOUNDARY VALUE PROBLEMS.
Paul Muir.
[University of Toronto. Department of Computer Science. Technical
report 175/84. 1984. Thesis (Ph.D.).]
100827 THE ORDER PROPERTIES OF IMPLICIT MULTIVALUE METHODS FOR ORDINARY
DIFFERENTIAL EQUATIONS.
Kevin Burrage.
[University of Toronto. Department of Computer Science. Technical
report 176/84. 1984.]
100828 TOWARDS PRACTICAL FUNCTIONAL PROGRAMMING.
D. Hugh Redelmeier.
[University of Toronto. Computer Systems Research Group. CSRG-158.
1984. Thesis (Ph.D.).]
100829 DATA DESCRIPTORS: A COMPILE-TIME MODEL OF DATA AND ADDRESSING.
R. C. Holt.
[University of Toronto. Computer Systems Research Group. CSRG-159.
1984.]
100830 TAXIS '84: SELECTED PAPERS. EDITED BY BRIAN NIXON.
Brian Nixon.
[University of Toronto. Computer Systems Research Group. CSRG-160.
1984. "This report collects 16 papers from the (TAXIS) project, from
late 1982 to early 1984. About half of the papers have been
presented by project members at conferences. Some appear in this
report in revised form."]
100831 AN ANALYTICAL APPROACH TO MODELING IMS SYSTEMS.
Alaa Eldin Ismail Serry.
[University of Toronto. Computer Systems Research Group. CSRG-161.
1984. Thesis (Ph.D.).]
100832 IMPLEMENTING MULTI-SENSOR SYSTEMS IN A FUNCTIONAL LANGUAGE.
Esther Shilcrat, Prakash Panangaden, and Tom Henderson.
[University of Utah. Department of Computer Science. UUCS-84-001.
1984.]
100833 LOGICAL SENSOR SYSTEMS.
Tom Henderson and Esther Shilcrat.
[University of Utah. Department of Computer Science. UUCS-84-002.
1984.]
100834 COMPUTER AIDED DESIGN.
Richard F. Riesenfeld and Lee A. Hollaar.
[University of Utah. Department of Computer Science. UUCS-84-003.
1984.]
100835 SEMANTICS OF NETWORKS CONTAINING INDETERMINATE OPERATORS.
Robert M. Keller and Prakash Panangaden.
[University of Utah. Department of Computer Science. UUCS-84-004.
1984.]
100836 A CATEGORY THEORETIC FORMALISM FOR ABSTRACT INTERPRETATION.
Prakash Panangaden and Prateek Mishra.
[University of Utah. Department of Computer Science. UUCS-84-005.
1984.]
100837 ABSTRACT INTERPRETATION AND INDETERMINACY.
Prakash Panangaden and Prateek Mishra.
[University of Utah. Department of Computer Science. UUCS-84-006.
1984.]
100838 SIMULATION OF CELLS.
Forrest B. Pickett.
[University of Utah. Department of Computer Science. UUCS-84-007.
1984. "This is an appendix for the thesis entitled 'A Cell Set and
Library for the Design of Integrated Circuits' by F. B. Pickett."]
100839 A STREAM FUNCTIONAL APPROACH.
Sanjay Rajopadhye and Prakash Panangaden.
[University of Utah. Department of Computer Science. UUCS-85-001.
1985.]
100840 TOP-DOWN SEMANTICS OF FAIR COMPUTATIONS OF LOGIC PROGRAMS.
M. H. van Emden and M. A. Nait Abdallah.
[University of Waterloo. Department of Computer Science. CS-84-27.
1985.]
100841 A MODEL FOR REGISTER-TRANSFER LEVEL DESIGN SPECIFICATION: THE SDC
NOTATION.
Farhad Mavaddat.
[University of Waterloo. Department of Computer Science. CS-84-34.
1984.]
100842 ALGORITHMS FOR DRAWING ANTI-ALIASED CIRCLES AND ELLIPSES.
Dan Field.
[University of Waterloo. Department of Computer Science. CS-84-38.
1984.]
100843 TURTLE POLYGONS.
Joseph Culberson and Gregory Rawlins.
[University of Waterloo. Department of Computer Science. CS-84-41.
1984.]
100844 LOCAL CORRECTNESS IN ROBUST STORAGE STRUCTURES.
J. P. Black and D. J. Taylor.
[University of Waterloo. Department of Computer Science. CS-84-44.
1984.]
100845 A MODEL FOR STORAGE STRUCTURES, ENCODINGS, AND ROBUSTNESS.
J. P. Black and D. J. Taylor.
[University of Waterloo. Department of Computer Science. CS-84-45.
1984.]
100846 CONCURRENT PROLOG IN A MULTI-PROCESS ENVIRONMENT.
Rosanna K. S. Lee.
[University of Waterloo. Department of Computer Science. CS-84-46.
1984. Thesis (M.S.).]
100847 MADAME: A PLANNER FOR ISH.
J. A. N. Andre'Trudel.
[University of Waterloo. Department of Computer Science. CS-84-48.
1984. Thesis (M.S.).]
100848 A LOCALLY CORRECTABLE B-TREE IMPLEMENTATION.
D. J. Taylor and J. P. Black.
[University of Waterloo. Department of Computer Science. CS-84-51.
1984.]
100849 EXPERIMENTATION WITH DATA STRUCTURES.
D. J. Taylor and J. P. Black.
[University of Waterloo. Department of Computer Science. CS-84-52.
1984.]
100850 GUIDELINES FOR STORAGE STRUCTURE ERROR CORRECTION.
D. J. Taylor and J. P. Black.
[University of Waterloo. Department of Computer Science. CS-84-53.
1984.]
100851 A DISTRIBUTED FILE-SERVER FOR A PERSONAL COMPUTER NETWORK.
D. D. Cowan, F. D. Boswell, and T. R. Grove.
[University of Waterloo. Department of Computer Science. CS-84-54.
1984.]
100852 AN INVESTIGATION INTO BOUNDS ON NETWORK RELIABILITY.
Daryl D. Harms.
[University of Waterloo. Department of Computer Science. CS-84-55.
1984. Thesis (M.S.).]
100853 PERMUTATION GRAPHS: CONNECTED DOMINATION AND STEINER TREES.
Charles J. Colbourn and Lorna K. Stewart.
[University of Waterloo. Department of Computer Science. CS-85-02.
1985.]
100854 ITERATIVE TREE ARRAYS WITH LOGARITHMIC DEPTH.
Karel Culik II, Oscar H. Ibarra, and Sheng Yu.
[University of Waterloo. Department of Computer Science. CS-85-03.
1985.]
100855 PIECEWISE-LINEAR APPROXIMATION METHODS FOR NONSEPARABLE CONVEX
OPTIMIZATION.
B. Feijoo and R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 521. 1984.]
100856 MODELS FOR STUDYING CONCURRENCY CONTROL PERFORMANCE: ALTERNATIVES AND
IMPLICATIONS.
Rakesh Agrawal, Michael J. Carey, and Miron Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 567. 1984.]
100857 A VARIABLE COMPLEXITY NORM MAXIMIZATION PROBLEM.
O. L. Mangasarian and T.-H. Shiau.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 568. 1984.]
100858 COMPUTABLE NUMERICAL BOUNDS FOR LAGRANGE MULTIPLIERS OF STATIONARY
POINTS OF NONCONVEX DIFFERENTIABLE NONLINEAR PROGRAMS.
O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 569. 1984.]
100859 THE STUDY OF LOAD BALANCING ALGORITHMS FOR DECENTRALIZED DISTIBUTED
PROCESSING SYSTEMS.
Miron Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 570. 1984. Thesis (Ph.D.).]
100860 ON BENCHMARKS: DYNAMICALLY IMPROVING EXPERIMENTAL COMPARISONS.
Leonard Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 571. 1984.]
100861 CONSTRUCTING MULTI-LEVEL MULTI-COMPUTER NETWORKS.
Leonard Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Technical report 572. 1984.]
VOL. 7, NO. 4 05/28/85
100868 AN ALGEBRAIC APPROACH TO COMPUTATIONAL COMPLEXITY.
L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-02-84. 1984.]
100869 A THEORY OF THE LEARNABLE.
L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-03-84. 1984.]
100870 A MEAN VALUE PERFORMANCE MODEL FOR LOCKING IN DATABASES.
Y. C. Tay.
[Harvard University. Center for Research in Computing Technology.
TR-04-84. 1984. Thesis (Ph.D.).]
100871 PARALLEL TIME O(LOG N) ACCEPTANCE OF DETERMINISTIC CFLS.
Philip N. Klein and John H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-05-84. 1984.]
100872 DEDUCTIVE LEARNING.
L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-06-84. 1984.]
100873 EFFICIENT PARALLEL PSEUDO-RANDOM NUMBER GENERATION.
John H. Reif and Justin D. Tygar.
[Harvard University. Center for Research in Computing Technology.
TR-07-84. 1984.]
100874 OPTIMAL PARALLEL ALGORITHMS FOR GRAPH CONNECTIVITY.
John H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-08-84. 1984.]
100875 RECURSION THEORETIC VIEW OF VAN DER WAARDEN'S THEOREM.
W. Ian Gasarch.
[Harvard University. Center for Research in Computing Technology.
TR-10-84. 1984.]
100876 ISSUES OF FAULT TOLERANCE IN CONCURRENT COMPUTATIONS.
Vassos Hadzilacos.
[Harvard University. Center for Research in Computing Technology.
TR-11-84. 1984. Thesis (Ph.D.).]
100877 CONCURRENT ALGORITHMS FOR SEARCH STRUCTURES.
Dennis E. Shasha.
[Harvard University. Center for Research in Computing Technology.
TR-12-84. 1984. Thesis (Ph.D.).]
100878 HOW TO DESIGN A CONCURRENT ALGORITHM FOR YOUR FAVORITE SEARCH
STRUCTURE.
Dennis E. Shasha.
[Harvard University. Center for Research in Computing Technology.
TR-13-84. 1984.]
100879 NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS.
L. G. Valiant and V. V. Varizani.
[Harvard University. Center for Research in Computing Technology.
TR-14-84. 1984.]
100880 NEGATION IS POWERLESS FOR BOOLEAN SLICE FUNCTIONS.
L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-16-84. 1984.]
100881 PERFORMANCE EVALUATION OF LOCKING IN DATABASES: A SURVEY.
Y. C. Tay, Nathan Goodman, and Rajan Suri.
[Harvard University. Center for Research in Computing Technology.
TR-17-84. 1984.]
100882 EFFICIENT NETLIST COMPARISON USING HIERARCHY AND RANDOMIZATION.
J. D. Tygar and Ron Ellickson.
[Harvard University. Center for Research in Computing Technology.
TR-19-84. 1984.]
100883 COMPUTATIONAL COMPLEXITY OF LOGICAL PROBLEMS: FORMULAS, DEPENDENCIES,
AND CIRCUITS.
Lawrence A. Denenberg.
[Harvard University. Center for Research in Computing Technology.
TR-20-84. 1984. Thesis (Ph.D.).]
100959 ARTIFICIAL INTELLIGENCE AND HUMAN FACTORS.
John C. Thomas.
[International Business Machines Corporation (IBM). Research
Division. RC 10823. 1984.]
100960 ON THE MULTIVARIATE EULER FROBENIUS POLYNOMIALS.
Wolfgang Dahmen and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 10826. 1984.]
100961 ACORN: A LOCAL CUSTOMIZATION APPROACH TO DCVS PHYSICAL DESIGN.
Ellen J. Yoffa and Peter S. Hauge.
[International Business Machines Corporation (IBM). Research
Division. RC 10832. 1984.]
100962 LINE AVERAGE ALGORITHM: A METHOD FOR THE COMPUTER GENERATION OF
SMOOTH SURFACES.
W. Dahmen and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 10833. 1984.]
100963 CONSTANT PROPOGATION WITH CONDITIONAL BRANCHES.
Mark N. Wegman and Frank Kenneth Zadeck.
[International Business Machines Corporation (IBM). Research
Division. RC 10844. 1984.]
100964 THE GF11 SUPERCOMPUTER.
John Beetem, Monty Denneau, and Don Weingarten.
[International Business Machines Corporation (IBM). Research
Division. RC 10852. 1984.]
100965 DL*-TREES: A FILE ORGANIZATION EXPLOITING DIGITAL SEARCH.
David B. Lomet.
[International Business Machines Corporation (IBM). Research
Division. RC 10860. 1984.]
100966 ANNEALING: THE ALGORITHM.
Ralph H. J. M. Otten and Lukas P. P. P. van Ginneken.
[International Business Machines Corporation (IBM). Research
Division. RC 10861. 1984.]
100967 TIMING INFLUENCED LAYOUT DESIGN.
Michael Burstein and Mary N. Youssef.
[International Business Machines Corporation (IBM). Research
Division. RC 10862. 1984.]
100968 THE NIL DISTRIBUTED SYSTEMS PROGRAMMING LANGUAGE: A STATUS REPORT.
Rob Strom and Shaula Yemini.
[International Business Machines Corporation (IBM). Research
Division. RC 10864. 1984.]
100969 A LINEAR PROGRAMMING APPROACH TO MIX ALLOCATION FOR FLEXIBLE FLOW
LINES.
Robert J. Wittrock.
[International Business Machines Corporation (IBM). Research
Division. RC 10866. 1984.]
100970 DESIGN OF A ROBUST, PORTABLE NATURAL LANGUAGE INTERFACE GRAMMAR.
David E. Johnson.
[International Business Machines Corporation (IBM). Research
Division. RC 10867. 1984.]
100971 FLOOR PLAN DESIGN USING ANNEALING.
Ralph H. J. M. Otten and Lukas P. P. P. van Ginneken.
[International Business Machines Corporation (IBM). Research
Division. RC 10868. 1984.]
100972 BUILDING UNDO/REDO OPERATIONS INTO THE C PROGRAMMING LANGUAGE.
George B. Leeman Jr.
[International Business Machines Corporation (IBM). Research
Division. RC 10870. 1984.]
100973 PROBLEMS AND SOME SOLUTIONS IN CUSTOMIZATION OF NATURAL LANGUAGE DATA
BASE FRONT ENDS.
Fred J. Damerau.
[International Business Machines Corporation (IBM). Research
Division. RC 10872. 1984.]
100974 CAUSALITY IN ALGORITHMS AND ARCHITECTURES.
W. L. Miranker and A. M. Winkler.
[International Business Machines Corporation (IBM). Research
Division. RC 10874. 1984.]
100975 ACE: A CONGESTION ESTIMATOR FOR WIRING CUSTOM CHIPS.
Jerome M. Kurtzberg and Ellen J. Yoffa.
[International Business Machines Corporation (IBM). Research
Division. RC 10875. 1984.]
100976 COMPARATIVE ANALYSIS OF FAULT TOLERANT ARCHITECTURES FOR
MULTIPROCESSORS.
Balakrishna R. Iyer, Philip S. Yu, and Lorenzo Donatiello.
[International Business Machines Corporation (IBM). Research
Division. RC 10876. 1984.]
100977 OPTIMAL HOP-BY-HOP FLOW CONTROL IN COMPUTER NETWORKS.
Zvi Rosberg and Inder S. Gopal.
[International Business Machines Corporation (IBM). Research
Division. RC 10877. 1984.]
100978 LECTURES ON OPTIMAL RECOVERY.
C. A. Micchelli and T. J. Rivlin.
[International Business Machines Corporation (IBM). Research
Division. RC 10883. 1984.]
100979 PROCESS MODEL VS. DATA ABSTRACTION: COMPARING TWO APPROACHES TO
STRUCTURING LARGE SOFTWARE SYSTEMS.
Rob Strom, Shaula Yemini, and Peter Wegner.
[International Business Machines Corporation (IBM). Research
Division. RC 10884. 1984.]
100980 AN APPLICATION OF A HYBRID APPROACH TO MODELING A FLEXIBLE
MANUFACTURING SYSTEM.
Brenda L. Dietrich and Barbara M. March.
[International Business Machines Corporation (IBM). Research
Division. RC 10887. 1984.]
100981 FRICATIVES FOR ALL TONGUES.
Jonas N. A. Nartey.
[International Business Machines Corporation (IBM). Research
Division. RC 10888. 1984.]
100982 UNIVERSALS OF STOPS: A STUMBLING AFFAIR.
Jonas N. A. Nartey.
[International Business Machines Corporation (IBM). Research
Division. RC 10889. 1984.]
100983 LET THERE BE NASALS: A NEW LOOK AT AN OLD CONJURATION.
Jonas N. A. Nartey.
[International Business Machines Corporation (IBM). Research
Division. RC 10890. 1984.]
100984 A FAST GENERAL PURPOSE HARDWARE SYNCHRONIZATION MECHANISM.
John T. Robinson.
[International Business Machines Corporation (IBM). Research
Division. RC 10891. 1984.]
100985 IBM'S TOKEN RING NETWORK AND BELL'S FASNET - A COMPARISON.
Jeane Shu-Chun Chen.
[International Business Machines Corporation (IBM). Research
Division. 100898. 1984.]
100986 SCHEDULING ALGORITHMS FOR FLEXIBLE FLOW LINES.
Robert J. Wittrock.
[International Business Machines Corporation (IBM). Research
Division. RC 10899. 1984.]
100987 OPTIMAL MESSAGE SEGMENTATION FOR MULTIHOP ROUTES IN COMPUTER NETWORKS.
Inder S. Gopal and Bharath K. Kabada.
[International Business Machines Corporation (IBM). Research
Division. RC 10901. 1984.]
100988 SYNCHRONIZED DISK INTERLEAVING.
Michelle Y. Kim.
[International Business Machines Corporation (IBM). Research
Division. RC 10906. 1984.]
100989 A REAL TIME, ISOLATED WORD, SPEECH RECOGNITION SYSTEM FOR DICTATION
TRANSCRIPTION.
International Business Machines Corporation (IBM). Research Division.
Speech Recognition Group.
[International Business Machines Corporation (IBM). Research
Division. RC 10907. 1984.]
100990 USE OF THE ESTIMATED COVARIANCE STRUCTURE INSTEAD OF THE TRUE
COVARIANCE STRUCTURE IN GENERALIZED LINEAR MODELS.
Michael L. Stein.
[International Business Machines Corporation (IBM). Research
Division. RC 10911. 1985.]
100991 APPROXIMATING THE MEAN DELAY OF A MULTIPLE SERVER QUEUE USING
THRESHOLD SCHEDULING.
Randolph Nelson and Don Towsley.
[International Business Machines Corporation (IBM). Research
Division. RC 10912. 1984.]
100992 ARITHMETICALLY IMPROVED ALGORITHMIC PERFORMANCE.
M. Mescagni and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. RC 10913. 1984.]
100993 PROGRAM DEVELOPMENT BY QUERY.
Burt Leavenworth.
[International Business Machines Corporation (IBM). Research
Division. RC 10916. 1985.]
100994 AN EFFICIENT METHOD OF SAMPLING FOR STATISTICAL CIRCUIT DESIGN.
Michael L. Stein.
[International Business Machines Corporation (IBM). Research
Division. RC 10921. 1985.]
100995 AN INTERACTIVE GRAPHICS PROCEDURE (PROC) FOR SAS SOFTWARE.
H. M. Van Woerkom.
[International Business Machines Corporation (IBM). Research
Division. RC 10923. 1984.]
100996 ON LINEARIZING PARALLEL CODE.
Jeanne Ferrante and Mary Mace.
[International Business Machines Corporation (IBM). Research
Division. RC 10926. 1984.]
100997 ON THE SHAPE OF THE FUNDAMENTAL FUNCTION FOR CARDINAL L-SPLINE
INTERPOLATION.
Han-Lin Chen, Ying-Sheng Hu, and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 10928. 1985.]
100998 SHAPE PRESERVING PARAMETRIC REPRESENTATION OF CURVES WITH LOCAL
CONTROL FOR COMPUTER AIDED GEOMETRIC DESIGN.
Nira Dyn and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 10931. 1985.]
100999 MODULAR LOGIC GRAMMARS.
Michael C. McCord.
[International Business Machines Corporation (IBM). Research
Division. RC 10936. 1985.]
101000 ELECTRONICALLY COMMUTATED STEPPER MOTORS FOR DIRECT DRIVE ROBOTS.
Jehuda Ish-Shalom and Dennis G. Manzer.
[International Business Machines Corporation (IBM). Research
Division. RC 10945. 1985.]
101001 TOOLS FOR VERIFYING NETWORK PROTOCOLS.
Brent Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 10946. 1985.]
101002 SW2 - AN OBJECT BASED PROGRAMMING ENVIRONMENT.
Mark R. Laff and Brent Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 10947. 1985.]
101003 OBJECT BASED SYSTEM FOR THE NEBULA INSTRUCTION SET ARCHITECTURE.
Lee G. Friedman.
[International Business Machines Corporation (IBM). Research
Division. RC 10948. 1985.]
101004 TRANSACTION PROCESSING COSTS IN RELATIONAL DATABASE SYSTEMS.
Kyu-Young Whang.
[International Business Machines Corporation (IBM). Research
Division. RC 10952. 1985.]
101005 A STUDY OF WHERE USERS SPEND THEIR TIME USING VM/CMS.
Bucky Pope.
[International Business Machines Corporation (IBM). Research
Division. RC 10953. 1985.]
101006 A PLANAR XY ROBOTIC FINE POSITIONING DEVICE.
Ralph L. Hollis.
[International Business Machines Corporation (IBM). Research
Division. RC 10956. 1985.]
101007 THE AUTOMATIC INVERSION OF ATTRIBUTE GRAMMARS.
Daniel Yellin and Eva-Maria M. Mueckstein.
[International Business Machines Corporation (IBM). Research
Division. RC 10957. 1985.]
101008 ALAN: A (CIRCUIT SWITCHED) LOCAL AREA NETWORK.
Brent Hailpern et al.
[International Business Machines Corporation (IBM). Research
Division. RC 10960. 1985.]
101009 SEMANTIC INTERPRETATION OF A DATABASE QUERY LANGUAGE.
Eva-Maria M. Mueckstein and Galina Datskovsky.
[International Business Machines Corporation (IBM). Research
Division. RC 10961. 1985.]
101010 BROWSER: A VISUAL, INTERACTIVE DATABASE INTERFACE.
A. Malhotra, D. P. Pazel, and L. M. Burns.
[International Business Machines Corporation (IBM). Research
Division. RC 10964. 1985.]
101011 PROVING CORRECTNESS OF CONCURRENT PROGRAMS - A QUICK INTRODUCTION.
Krzysztof R. Apt.
[International Business Machines Corporation (IBM). Research
Division. RC 10969. 1985.]
101012 TWO NORMAL FORM THEOREMS FOR CSP PROGRAMS.
Krzysztof R. Apt and Philippe Clermont.
[International Business Machines Corporation (IBM). Research
Division. RC 10975. 1985.]
101013 MULTI-SYSTEM DATA SHARING ANALYSIS.
Philip S. Yu et al.
[International Business Machines Corporation (IBM). Research
Division. RC 10979. 1985.]
101014 SNA NETWORKS OF SMALL SYSTEMS.
A. E. Baratz et al.
[International Business Machines Corporation (IBM). Research
Division. RC 10980. 1985.]
101015 RECURSIVE RANDOM GAMES: A PROBABILISTIC MODEL FOR PERFECT INFORMATION
GAMES.
Gerard Michon.
[University of California, Los Angeles. Computer Science Department.
CSD-840029. 1984. Thesis (Ph.D.).]
101016 UPDATING REPLICATED FILES IN REAL TIME DISTRIBUTED PROCESSING SYSTEMS.
Joseph Hellerstein.
[University of California, Los Angeles. Computer Science Department.
CSD-840030. 1984. Thesis (Ph.D.).]
101017 SELF ADAPTIVE MESH IN STRESS ANALYSIS.
Paolo Roberti.
[University of California, Los Angeles. Computer Science Department.
CSD-840032. 1984. Thesis (Ph.D.).]
101018 INTEGRATED RESOURCE MANAGEMENT ALGORITHMS FOR COMPUTER SYSTEMS.
John Busch.
[University of California, Los Angeles. Computer Science Department.
CSD-840035. 1984. Thesis (Ph.D.).]
101019 DISTRIBUTED COMPUTER SIMULATION OF DATA COMMUNICATION NETWORKS:
PROJECT REPORT I.
Shun Cheung, Jack W. Carlyle, and Walter J. Karplus.
[University of California, Los Angeles. Computer Science Department.
CSD-840037. 1984.]
101020 A DISTRIBUTED EXPERT SYSTEM FOR SPACE SHUTTLE FLIGHT CONTROL.
John Joseph Helly Jr.
[University of California, Los Angeles. Computer Science Department.
CSD-840038. 1984. Thesis (Ph.D.).]
101021 CONCURRENCY IN PARALLEL PROCESSING SYSTEMS.
Kenneth Ching-Yu Kung.
[University of California, Los Angeles. Computer Science Department.
CSD-840039. 1984. Thesis (Ph.D.).]
101022 ALGORITHMS FOR QUEUEING NETWORK ANALYSIS OF DISTRIBUTED SYSTEMS.
Edmundo Albuquerque de Souza e Silva.
[University of California, Los Angeles. Computer Science Department.
CSD-840040. 1984. Thesis (Ph.D.).]
101023 FAST AND MESSAGE OPTIMAL SYNCHRONOUS ELECTION ALGORITHM FOR COMPLETE
NETWORKS.
Eli Gafni, Yehuda Afek, and Leonard Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-840041. 1984.]
101024 SIMPLE AND EFFICIENT DISTRIBUTED ALGORITHMS FOR ELECTION IN COMPLETE
NETWORKS.
Yehuda Afek and Eli Gafni.
[University of California, Los Angeles. Computer Science Department.
CSD-840042. 1984.]
101025 EXTRACTING GEOMETRY FROM FP FOR VLSI LAYOUT.
Martine Schlag.
[University of California, Los Angeles. Computer Science Department.
CSD-840043. 1984.]
101026 A DATAFLOW MULTIPROCESSOR: PROGRAMMING, SIMULATION AND PERFORMANCE
PREDICTION.
Pak Kuen Chan.
[University of California, Los Angeles. Computer Science Department.
CSD-840044. 1984. Thesis (M.S.).]
101027 A COMPILER FOR A FUNCTIONAL PROGRAMMING SYSTEM.
Shih-Lien Lu.
[University of California, Los Angeles. Computer Science Department.
CSD-840045. 1984. Thesis (M.S.).]
101028 ON SPECIFICATION AND DESIGN OF DIGITAL SYSTEMS USING AN APPLICATIVE
HARDWARE DESCRIPTION LANGUAGE.
Farshad Meshkinpour.
[University of California, Los Angeles. Computer Science Department.
CSD-840046. 1984. Thesis (M.S.).]
101029 A FUNCTIONAL LANGUAGE MACHINE BASED ON QUEUES.
Guang Liang Xiong.
[University of California, Los Angeles. Computer Science Department.
CSD-840047. 1984. Thesis (M.S.).]
101030 REQUIREMENTS ANALYSIS OF LARGE SOFTWARE SYSTEMS.
Meir D. Burstin.
[University of California, Los Angeles. Computer Science Department.
CSD-840048. 1984. Thesis (Ph.D.). "Thesis submitted for the degree
'Doctor of Philosophy'...to the Senate of Tel-Aviv University, July,
1984."]
101031 NON-UNIFORM STRUCTURES AND SYNCHRONIZATION PATTERNS IN SHARED CHANNEL
COMMUNICATION NETWORKS.
Hanoch Levy.
[University of California, Los Angeles. Computer Science Department.
CSD-840049. 1984. Thesis (Ph.D.).]
101032 ACCESS PROTOCOLS FOR HIGH SPEED FIBER OPTICS LOCAL NETWORKS.
Paulo Henrique de Aguiar Rodrigues.
[University of California, Los Angeles. Computer Science Department.
CSD-840050. 1984. Thesis (Ph.D.).]
101033 KOLGOMOROV INFORMATION AND VLSI LOWER BOUNDS.
Robert R. Cuykendall.
[University of California, Los Angeles. Computer Science Department.
CSD-840052. 1984. Thesis (Ph.D.).]
101034 ALGORITHMIC RECONSTRUCTION OF TREES.
Michael Tarsi and Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-840061. 1984.]
101035 PATTERN RECOGNITION APPROACH AND ARRAY PROCESSING FOR DISTRIBUTED
SOURCE IDENTIFICATION IN WATER POLLUTION SYSTEMS.
Yoshitaka Shibata.
[University of California, Los Angeles. Computer Science Department.
CSD-840062. 1984. Thesis (Ph.D.).]
101036 THE ANATOMY OF EASY PROBLEMS: A CONSTRAINT SATISFACTION FORMULATION.
Rina Dechter and Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-840063. 1984.]
101037 LISTENER MODEL FOR THE GENERATION OF META-TECHNICAL UTTERANCES IN
MATH TUTORING.
Ingrid Zukerman and Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-840064. 1984.]
101038 LEARNING HIDDEN CAUSES FROM EMPIRICAL DATA.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-840065. 1984.]
101039 FTSS: A FAULT TOLERANT STORAGE SYSTEM SUPPORTING HIGH AVAILABILITY
AND SECURITY IN A DISTRIBUTED SYSTEM.
Baron O. A. Grey.
[University of California, Los Angeles. Computer Science Department.
CSD-840066. 1984. Thesis (Ph.D.).]
101040 CONVINCE: A CONVERSATIONAL INFERENCE CONSOLIDATION ENGINE.
Jin Hyung Kim.
[University of California, Los Angeles. Computer Science Department.
CSD-840067. 1984. Thesis (Ph.D.).]
101041 GENERALIZED BEST FIRST SEARCH STRATEGIES AND THE OPTIMALITY OF A*.
Rina Dechter and Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-840068. 1984.]
101042 THE DESIGN AND IMPLEMENTATION OF NESTED TRANSACTIONS IN LOCUS.
Erik Mueller, Johanna Moore, and Gerald Popek.
[University of California, Los Angeles. Computer Science Department.
CSD-840214. 1984.]
101043 SHAPE MATCHING IN PYRAMIDS.
William I. Grosky and Ramesh Jain.
[University of Michigan. Computing Research Laboratory. CRL-TR-2-84.
1984.]
101044 TOWARD LOGIC TAILORED FOR COMPUTATIONAL COMPLEXITY.
Yuri Gurevich.
[University of Michigan. Computing Research Laboratory. CRL-TR-3-84.
1984.]
101045 ADAPTIVE GRAY SCALE MAPPING TO REMOVE REGISTRATION NOISE IN
DIFFERENCE PICTURES.
Edward J. Delp and Thomas F. Knoll.
[University of Michigan. Computing Research Laboratory. CRL-TR-5-84.
1984.]
101046 DYNAMIC SCENE ANALYSIS.
Ramesh Jain.
[University of Michigan. Computing Research Laboratory. CRL-TR-6-84.
1984.]
101047 PERFORMABILITY MODELS AND SOLUTIONS.
David G. Furchtgott.
[University of Michigan. Computing Research Laboratory. CRL-TR-8-84.
1984. Thesis (Ph.D.).]
101048 AN EFFICIENT ALGORITHM FOR CONTAINMENT PROBLEM.
Vaclav Rajlich.
[University of Michigan. Computing Research Laboratory. CRL-TR-9-84.
1984.]
101049 ESTABLISHING CORRESPONDENCE OF NON-RIGID OBJECTS USING SMOOTHNESS OF
MOTION.
Ramesh Jain and I. K. Sethi.
[University of Michigan. Computing Research Laboratory. CRL-TR-10-84.
1984.]
101050 AXIAL MOTION STEREO.
Nancy O'Brien and Ramesh Jain.
[University of Michigan. Computing Research Laboratory. CRL-TR-11-84.
1984.]
101051 ANALYSIS OF MULTIPLE BUS INTERCONNECTION NETWORKS.
T. N. Mudge et al.
[University of Michigan. Computing Research Laboratory. CRL-TR-12-84.
1984.]
101052 AUTOMATICALLY GENERATED UPDATABLE FORM SCREENS AS A DATABASE
INTERFACE LANGUAGE.
David Volk Beard and Toby J. Teorey.
[University of Michigan. Computing Research Laboratory. CRL-TR-13-84.
1984.]
101053 A SURVEY OF ALGORITHMS FOR REGISTER ALLOCATION IN STRAIGHT LINE
PROGRAMS.
Vaclav Rajlich and M. Drew Moshier.
[University of Michigan. Computing Research Laboratory. CRL-TR-14-84.
1984.]
101054 A PROBABILISTIC ALGORITHM FOR SCATTERING INFORMATION IN A
MULTICOMPUTER SYSTEM.
Zvi Drezner and Amnon Barak.
[University of Michigan. Computing Research Laboratory. CRL-TR-15-84.
1984.]
101055 MEMORY INTERFERENCE MODELS WITH VARIABLE CONNECTION TIME.
T. N. Mudge and Humoud B. Al-Sadoun.
[University of Michigan. Computing Research Laboratory. CRL-TR-16-84.
1984.]
101056 DISTRIBUTED ALGORITHM FOR THE AVERAGE LOAD OF A MULTICOMPUTER.
Amnon Barak and Zvi Drezner.
[University of Michigan. Computing Research Laboratory. CRL-TR-17-84.
1984.]
101057 THE DATABASE DESIGNER'S WORKBENCH.
Richard E. Cobb, James P. Fry, and Toby J. Teorey.
[University of Michigan. Computing Research Laboratory. CRL-TR-18-84.
1984.]
101058 QUANTITATIVE ANALYSIS OF A MOMENT BASED EDGE OPERATOR.
Paul H. Eichel and Edward J. Delp.
[University of Michigan. Computing Research Laboratory. CRL-TR-21-84.
1984.]
101059 THE ALLOCATION OF DATA AND PROGRAMS IN DISTRIBUTED DATA PROCESSING
ENVIRONMENTS.
Amjad Umar.
[University of Michigan. Computing Research Laboratory. CRL-TR-22-84.
1984. Thesis (Ph.D.).]
101060 A STOCHASTIC MODEL OF MULTIPROCESSING.
Brad Alan Makrucki.
[University of Michigan. Computing Research Laboratory. CRL-TR-23-84.
1984. Thesis (Ph.D.).]
101061 MINIMIZATION OF INTERPROCESSOR COMMUNICATION FOR PARALLEL
COMPUTATIONS ON AN SIMD MULTICOMPUTER.
William Sai-fong Wu.
[University of Michigan. Computing Research Laboratory. CRL-TR-24-84.
1984. Thesis (Ph.D.).]
101062 APPROXIMATING THE PERFORMANCE OF TWO PHASE LOCKING USING AN ITERATION
SOLUTION MODEL.
David D. Chen and Toby J. Teorey.
[University of Michigan. Computing Research Laboratory. CRL-TR-25-84.
1984.]
101063 A METHODOLOGY FOR THE DISTRIBUTION OF DATABASES.
Mourad Oulid-Aissa.
[University of Michigan. Computing Research Laboratory. CRL-TR-26-84.
1984. Thesis (Ph.D.).]
101064 DEMAND DRIVEN EVALUATION WITH EQUATIONS.
Satish Thatte.
[University of Michigan. Computing Research Laboratory. CRL-TR-34-84.
1984.]
101065 UNIFIED PERFORMANCE RELIABILITY EVALUATION.
J. F. Meyer.
[University of Michigan. Computing Research Laboratory. CRL-TR-27-84.
1984.]
101066 OPTIMAL DESIGN AND USE OF RETRY IN FAULT TOLERANT REAL TIME COMPUTER
SYSTEMS.
Yann-Hang Lee and Kang G. Shin.
[University of Michigan. Computing Research Laboratory. CRL-TR-28-84.
1984.]
101067 ENSURING FAULT TOLERANCE OF PHASE LOCKED CLOCKS.
Kang G. Shin, C. M. Krishna, and Ricky W. Butler.
[University of Michigan. Computing Research Laboratory. CRL-TR-29-84.
1984.]
101068 OPTIMAL GRAPH CLUSTERING PROBLEMS WITH APPLICATIONS TO INFORMATION
SYSTEM DESIGN.
Wan Ping Chiang.
[University of Michigan. Computing Research Laboratory. CRL-TR-30-84.
1984. Thesis (Ph.D.).]
101069 AN OPTIMAL DIGRAPH CLUSTERING APPROACH TO DATABASE RECORD CLUSTERING.
Wan P. Chiang and Toby J. Teorey.
[University of Michigan. Computing Research Laboratory. CRL-TR-31-84.
1984.]
101070 APPLICATIONS OF TOPOLOGY TO SEMANTICS OF COMMUNICATING PROCESSES.
William C. Rounds.
[University of Michigan. Computing Research Laboratory. CRL-TR-32-84.
1984.]
101071 PSEUDO-BOOLEAN LOGIC CIRCUITS.
John P. Hayes.
[University of Michigan. Computing Research Laboratory. CRL-TR-33-84.
1984.]
101072 A CLASS OF CELLULAR COMPUTER ARCHITECTURES TO SUPPORT PHYSICAL DESIGN
AUTOMATION.
Robin Arthur Rutenbar.
[University of Michigan. Computing Research Laboratory. CRL-TR-35-84.
1984. Thesis (Ph.D.).]
101073 RECONSIDERING TURING'S THESIS (TOWARD MORE REALISTIC SEMANTICS OF
PROGRAMS).
Yuri Gurevich.
[University of Michigan. Computing Research Laboratory. CRL-TR-36-84.
1984.]
101074 ON THE DESIGN AND ANALYSIS OF REAL TIME COMPUTERS.
C. M. Krishna.
[University of Michigan. Computing Research Laboratory. CRL-TR-37-84.
1984. Thesis (Ph.D.).]
101075 A ZERO-ONE LAW FOR LOGIC WITH A FIXED POINT OPERATOR.
Andreas Blass, Yuri Gurevich, and Dexter Kozen.
[University of Michigan. Computing Research Laboratory. CRL-TR-38-84.
1984.]
101076 HENKIN QUANTIFIERS AND COMPLETE PROBLEMS.
Andreas Blass and Yuri Gurevich.
[University of Michigan. Computing Research Laboratory. CRL-TR-39-84.
1984.]
101077 DEVELOPMENT AND ANALYSIS OF A GLOBAL COMPACTION TECHNIQUE FOR
MICROPROGRAMS.
Jehkwan Lah.
[University of Michigan. Computing Research Laboratory. CRL-TR-40-84.
1984. Thesis (Ph.D.).]
101078 OPTIMAL RECONFIGURATION STRATEGY FOR A DEGRADABLE MULTI-MODULE
COMPUTING SYSTEM.
Yann-Hang Lee and Kang G. Shin.
[University of Michigan. Computing Research Laboratory. CRL-TR-41-84.
1984.]
101079 TREE REBALANCING IN OPTIMAL TIME AND SPACE.
Quentin F. Stout and Bette L. Warren.
[University of Michigan. Computing Research Laboratory. CRL-TR-42-84.
1984.]
101082 USING SPREADING ACTIVATION TO IDENTIFY RELEVANT HELP.
Adele Howe and Timothy W. Finin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-01. 1984.]
101083 TEMPUS: A SYSTEM FOR THE DESIGN AND SIMULATION OF HUMAN FIGURES IN A
TASK ORIENTED ENVIRONMENT.
Norman I. Badler et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-03. 1984.]
101084 CONSISTENCY IN THE FACE OF PARTITION FAILURES: A SURVEY.
Susan B. Davidson and Hector Garcia-Molina.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-04. 1984.]
101085 PROGRESS WITH PERSISTENT PROGRAMMING.
M. P. Atkinson et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-05. 1984.]
101086 EXPANSION TREE PROOFS AND THEIR CONVERSION TO NATURAL DEDUCTION
PROOFS.
Dale A. Miller.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-06. 1984.]
101087 COMPUTATIONAL LINGUISTICS RESEARCH AT THE UNIVERSITY OF PENNSYLVANIA.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-08. 1984.]
101088 AN INTERACTIVE, INCREMENTAL CLASSIFIER.
David L. Silverman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-10. 1984.]
101089 A GEOMETRIC INVESTIGATION OF REACH.
James Urey Korein and Norman I. Badler.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-11. 1984.
Thesis (Ph.D.).]
101090 FOREST: AN EXPERT SYSTEM FOR AUTOMATIC TEST EQUIPMENT.
Timothy W. Finin, Pamela Kleinosky, and John McAdams.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-16. 1984.]
101091 INTERACTIVE CLASSIFICATION: A TECHNIQUE FOR THE AQUISITION AND
MAINTENANCE OF KNOWLEDGE BASES.
Timothy W. Finin and David L. Silverman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-17. 1984.]
101092 CORRECTING OBJECT RELATED MISCONCEPTIONS: HOW SHOULD THE SYSTEM
RESPOND?
Kathleen F. McCoy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-18. 1984.]
101093 USE OF PROGRAM GENERATION BY ACCOUNTANTS IN THE EVOLUTION OF
ACCOUNTING SYSTEMS: THE CASE OF FINANCIAL REPORTING OF CHANGING
PRICES.
Thomas T. Cheng, Evan D. Lock, and Noah S. Prywes.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-20. 1984.]
101094 EFFICIENT HANDLING OF DATA STRUCTURES IN DEFINITIONAL LANGUAGES.
Boleslaw Szymanski and Noah S. Prywes.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-23. 1984.]
101095 ON THE SCOPE OF STATIC CHECKING IN DEFINITIONAL LANGUAGES.
B. Szymanski, N. S. Prywes, and E. D. Lock.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-24. 1984.]
101096 AN ARGUMENT FOR NONPROCEDURAL LANGUAGES.
J. Baron, B. Szymanski, and E. Lock.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-26. 1984.]
101097 THE RECOGNITION AND REPRESENTATION OF 3D IMAGES FOR A NATURAL
LANGUAGE DRIVEN SCENE ANALYZER.
Amy Elizabeth Zwarico.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-29. 1984.
Thesis (M.S.). Also issued as GRASP LAB 20.]
101098 LINEAR TIME ALGORITHMS FOR TESTING THE SATISFIABILITY OF
PROPOSITIONAL HORN FORMULAE.
William F. Dowling and Jean H. Gallier.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-30. 1984.]
101099 GOOD ANSWERS TO BAD QUESTIONS: GOAL INFERENCE IN EXPERT ADVICE GIVING.
Martha E. Pollack.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-15. 1984.]
101100 LOCAL MATCHING OF SURFACES USING CRITICAL POINTS.
Gerald M. Radack and Norman I. Badler.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-13. 1984.]
101101 STEREO PROCESSING OF AERIAL IMAGES.
Ruzena Bajcsy and David L. Smitley.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-36. 1984.
Also issued as GRASP LAB 07.]
101102 AN ARCHITECTURE FOR THE REAL-TIME DISPLAY AND MANIPULATION OF
THREE-DIMENSIONAL OBJECTS.
Samuel M. Goldwasser and R. A. Reynolds.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-37. 1983.
Also issued as GRASP LAB 08.]
101103 A GENERALIZED OBJECT DISPLAY PROCESSOR ARCHITECTURE.
S. M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-38. 1984.
Also issued as GRASP LAB 10.]
101104 CONSTRUCTION OF A THREE DIMENSIONAL SURFACE MODEL.
Eric Paul Krotkov.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-40. 1984.
Also issued as GRASP LAB 12.]
101105 ACTIVE TOUCH AND ROBOT PERCEPTION.
Ruzena Bajcsy and Kenneth Y. Goldberg.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-42. 1984.
Also issued as GRASP LAB 14.]
101106 COMPUTATIONAL MODELS OF VISUAL HYPERACUITY.
Eric Paul Krotkov.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-43. 1984.
Thesis (M.S.). Also issued as GRASP LAB 15.]
101107 SPHERE PACKING ALGORITHM FOR SPARSE 3-D POINTS.
Ruzena Bajcsy and Franc Solina.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-44. 1984.
Also issued as GRASP LAB 16.]
101108 SURFACE DESCRIPTION FROM VISION AND TOUCH.
Peter Allen.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-35. 1983.
Also issued as GRASP LAB 06.]
101109 FEELING BY GRASPING.
Ruzena Bajcsy, Michael McCarthy, and Jeffrey C. Trinkle.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-34. 1983.
Also issued as GRASP LAB 05.]
101110 COMPUTER ARCHITECTURE FOR GRASPING.
Samuel M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-33. 1983.
Also issued as GRASP LAB 04.]
101111 ON GRASPING WITH A THREE FINGERED MECHANICAL HAND.
J. M. McCarthy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-32. 1983.
Also issued as GRASP LAB 03.]
101112 A NEW APPROACH TO ROBOTIC TACTILE PERCEPTION.
Ruzena Bajcsy and Kenneth Y. Goldberg.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-31. 1983.
Also issued as GRASP LAB 02.]
101113 LIVING UP TO EXPECTATIONS: COMPUTING EXPERT RESPONSES.
Aravind K. Joshi, Bonnie Lynn Webber, and Ralph Weischedel.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-60. 1984.]
101114 PREVENTING FALSE INFERENCES.
Aravind K. Joshi, Bonnie Lynn Webber, and Ralph Weischedel.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-59. 1984.]
101115 DEFAULT REASONING IN INTERACTION.
Aravind K. Joshi, Bonnie Lynn Webber, and Ralph Weischedel.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-58. 1984.]
101116 INTEGRATING VISION AND TOUCH FOR GRASPING OF AN OBJECT.
Ruzena Bajcsy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-57. 1984.
Also issued as GRASP LAB 29.]
101117 PENNSYLVANIA ARTICULATED MECHANICAL HAND - AN END EFFECTOR TO
DETERMINE SHAPE BY TOUCH.
Paul Abramowitz and Whitney Abramowitz.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-56. 1984.
Also issued as GRASP LAB 28.]
101118 A NEW DEVELOPMENT IN CAMERA CALIBRATION - CALIBRATING A PAIR OF
MOBILE CAMERAS.
Alberto Izaguirre, Pearl Pu, and John F. Summers.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-55. 1984.
Also issued as GRASP LAB 27.]
101119 CONVERGING DISPARATE SENSORY DATA.
Ruzena Bajcsy and Peter Allen.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-54. 1984.
Also issued as GRASP LAB 26.]
101120 FINAL REPORT: THE DESIGN AND CONSTRUCTION OF A FOUR DEGREE OF FREEDOM
CAMERA CONTROLLER.
John F. Summers.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-52. 1984.
Also issued as GRASP LAB 24.]
101121 A PROGRAMMING SYSTEM FOR DISTRIBUTED REAL TIME APPLICATIONS.
Insup Lee.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-51. 1984.
Also issued as GRASP LAB 23.]
101122 THE IMAGE PROCESSING OPTICAL NETWORK: ADVANCED ARCHITECTURE FOR IMAGE
PROCESSING.
Samuel M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-50. 1984.
Also issued as GRASP LAB 22.]
101123 ANGY: A RULE BASED EXPERT SYSTEM FOR IDENTIFYING AND ISOLATING
CORONARY VESSELS IN DIGITAL ANGIOGRAMS.
S. A. Stansfield.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-49. 1984.
Also issued as GRASP LAB 21.]
101124 QUARTERLY PROGRESS REPORT (THE GRASPLAB: GENERAL ROBOTICS AND ACTIVE
SENSORY PROCESSING GROUP...). VOLUME 2, NO. 3.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-48. 1984.
Also issued as GRASP LAB 33.]
101125 PAMH COORDINATE SYSTEM.
Jeffrey C. Trinkle.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-45. 1984.
Also issued as GRASP LAB 17.]
VOL. 7, NO. 5 06/10/85
101132 A VLSI ARCHITECTURE FOR SOUND SYNTHESIS.
John Wawrzynek and Carver Mead.
[California Institute of Technology. Computer Science Department.
Report no. 5158:TR:84. 1984.]
101133 CUSTOMIZING ONE'S OWN INTERFACE USING ENGLISH AS PRIMARY LANGUAGE.
Bozena Henisz Thompson and Frederick B. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5165:TR:84. 1984.]
101134 AN OBJECT ORIENTED ARCHITECTURE.
William J. Dally and James T. Kajiya.
[California Institute of Technology. Computer Science Department.
Report no. 5168:TR:84. 1984.]
101135 A COMBINED LOGICAL AND FUNCTIONAL PROGRAMMING LANGUAGE.
Michael O. Newton.
[California Institute of Technology. Computer Science Department.
Report no. 5172:TR:85. 1985.]
101136 THE BALANCED CUBE: A CONCURRENT DATA STRUCTURE.
William J. Dally and Charles L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5174:TR:85. 1985.]
101137 HOT CLOCK NMOS.
Charles L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5177:TR:85. 1985.]
101138 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 OCTOBER 1984 TO 15 MARCH 1985.
[California Institute of Technology. Computer Science Department.
Report no. 5178:TR:85. 1985.]
101139 PARALLELISM IN PRODUCTION SYSTEMS: THE SOURCES AND THE EXPECTED
SPEED-UP.
Anoop Gupta.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-169. 1984.]
101140 DEADLOCK ANALYSIS IN NETWORKS OF COMMUNICATING PROCESSES.
S. D. Brookes and A. W. Roscoe.
[Carnegie-Mellon University. Department of Computer Science. 1985.]
101141 AN IMPROVED FAILURES MODEL FOR COMMUNICATING PROCESSES.
S. D. Brookes and A. W. Roscoe.
[Carnegie-Mellon University. Department of Computer Science. 1985.]
101142 AUTOMATIC VERIFICATION OF SEQUENTIAL CIRCUITS USING TEMPORAL LOGIC.
M. Browne et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-100. 1984.]
101143 WHITE PEBBLES HELP.
Robert Wilber.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-101. 1984.]
101144 COMPILING PATH EXPRESSIONS INTO VSLI CIRCUITS.
T. S. Anantharaman et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-102. 1984.]
101145 REPRESENTATION AND INCREMENTAL CONSTRUCTION OF A THREE DIMENSIONAL
SCENE MODEL.
Martin Herman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-103. 1985.]
101146 ADA AS A HARDWARE DESCRIPTION LANGUAGE: AN INITIAL REPORT.
Mario R. Barbacci et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-104. 1984.]
101147 REPRESENTING TIME AND SPACE IN AN OBJECT ORIENTED HARDWARE
DESCRIPTION LANGUAGE.
Mario R. Barbacci et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-105. 1985.]
101148 ON THE AXIOMATIC TREATMENT OF CONCURRENCY.
Stephen D. Brookes.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-106. 1985.]
101149 PROFINITE SOLUTIONS FOR RECURSIVE DOMAIN EQUATIONS.
Carl Gunter.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-107. 1985. Thesis (Ph.D.).]
101150 ATOMICITY VS. AVAILABILITY: CONCURRENCY CONTROL FOR REPLICATED DATA.
Maurice Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-108. 1985.]
101151 SERIALIZABILITY IN DISTRIBUTED SYSTEMS WITH HANDSHAKING.
R. J. R. Back and R. Kurki-Suonio.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-109. 1985.]
101152 TWO SOAR STUDIES.
John E. Laird et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-110. 1985. (1) "Towards Chunking as a General Learning
Mechanism," by John E. Laird, Paul S. Rosenbloom and Allen Newell.
(2) "R1-Soar: an Experiment in Knowledge-Intensive Programming in a
Problem-Solving Architecture," by Paul S. Rosenbloom, John E. Laird,
John McDermott, Allen Newell & Edmund Orciuch.]
101153 IDENTIFYING SOLUTION PATHS IN COGNITIVE DIAGNOSIS.
Stellan Ohlsson and Pat Langley.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-2.
1985.]
101154 ROBOTIC INSPECTION BY DATABASE MATCHING.
Henry Thorne, F. B. Prinz, and H. O. K. Kirchner.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-4.
1985.]
101155 DEVELOPMENT OF CMU DIRECT-DRIVE ARM II.
Takeo Kanade and Donald Schmitz.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-5.
1985.]
101156 DATA STRUCTURES AND ALGORITHMS (BY N. WIRTH). ELEMENTARY PRINCIPLES
OF INFORMATICS (BY J. GUTKNECHT).
N. Wirth and J. Gutknecht.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 60. 1984. This report consists of two related
articles by different authors.]
101157 ARANEA: A FEDERATIVE DATABASE SERVER FOR THE PERSONAL COMPUTER LILITH.
R. Braegger, A. Diener, and A. Dudler.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 61. 1984.]
101158 RELATIONAL ALGEBRA OPERATIONS AND SIZES OF RELATIONS.
Daniele Gardy and Claude Puech.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 317. 1984.]
101159 EVALUATION OF PARALLEL EXECUTION OF PROGRAM TREE STRUCTURES.
Philippe Mussi and Philippe Nain.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 318. 1984.]
101160 LE_LISP, A PORTABLE AND EFFICIENT LISP SYSTEM.
Jerome Chailloux, Matthieu Devin, and Jean-Marie Hullot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 319. 1984.]
101161 SYSTEMES DE PROCESSUS COMMUNICANTS ET INTERPRETATION PARALLELE DE
LANGAGES FONCTIONNELS.
Boubakar Gamatie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 320. 1984.]
101162 MODELISATION AVEC PIVOT POUR UNE LOI GENERALE.
Jean Pellaumail.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 321. 1984.]
101163 PROOFS OF PARTIAL CORRECTNESS FOR ATTRIBUTE GRAMMARS AND RECURSIVE
PROCEDURES.
Bruno Courcelle and Pierre Deransart.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 322. 1984.]
101164 MODELLING DATA DEPENDENCIES IN LOGIC PROGRAMS BY ATTRIBUTE SCHEMATA.
Pierre Deransart and Jan Maluszynski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 323. 1984.]
101165 NOTE SUR LA FILE D'ATTENTE AVEC BOUCLAGE.
Philippe Robert.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 324. 1984.]
101166 ORDONNANCEMENT DE TACHES CONTRAINTES DANS LE CAS D'UN SERVEUR.
Najoua Dridi, Jean-Marie Proth, and Simone Sedillot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 325. 1984.]
101167 UN NOUVEAU RESEAU D'INTERCONNEXION ADAPTE AUX CALCULATEURS SIMD.
Andre Seznec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 329. 1984.]
101168 INFINITARY LANGUAGES AND FULLY ABSTRACT MODELS OF FAIR ASYNCHRONY.
Philippe Darondeau.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 330. 1984.]
101169 CONTRIBUTION D'UNE APPROCHE SYNTAXIQUE DANS LA SEGMENTATION D'IMAGE.
Jean Camillerapp and Ivan Leplumey.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 331. 1984.]
101170 SYSTOLIC ARCHITECTURES FOR CONNECTED SPEECH RECOGNITION.
Francois Charot, Patrice Frison, and Patrice Quinton.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 332. 1984.]
101171 ESTIMATING THE MULTIPLICITIES OF CONFLICTS IN MULTIPLE ACCESS
CHANNELS.
Albert Greenberg, Philippe Flajolet, and Richard E. Ladner.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 333. 1984.]
101172 Q-ARY COLLISION RESOLUTION ALGORITHMS IN RANDOM-ACCESS SYSTEMS WITH
FREE OR BLOCKED CHANNEL ACCESS.
Peter Mathys and Philippe Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 334. 1984.]
101173 APPROXIMATION OF A CIRCULAR CYLINDRICAL SHELL BY CLOUGH-JOHNSON FLAT
PLATE FINITE ELEMENTS.
Michel Bernadou and Yves Ducatel.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 335. 1984.]
101174 ARTIFICIAL MEMORY IN PRODUCTION MANAGEMENT.
Evelyne Bechler, Jean-Marie Proth, and Kosta Voyiatzis.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 336. 1984.]
101175 SELF-ADAPTIVE F.E.M. ALGORITHMS FOR THE EULER EQUATIONS.
Bernadette Palmerio.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 338. 1984.]
101176 DESIGN OF ONE-STEP AND MULTISTEP ADAPTIVE ALGORITHMS FOR THE TRACKING
OF TIME VARYING SYSTEMS.
Albert Benveniste.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 340. 1984.]
101177 DIAMOND SCHEMES: AN ORGANIZATION OF PARALLEL MEMORIES FOR EFFICIENT
ARRAY PROCESSING.
William Jalby, Jean-Marc Frailong, and Jacques Lenfant.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 342. 1984.]
101178 THE DESIGN AND BUILDING OF ENCHERE, A DISTRIBUTED ELECTRONIC
MARKETING SYSTEM.
Jean-Pierre Banatre et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 343. 1984.]
101179 ALGORITHME OPTIMAL DE DECISION POUR L'EQUIVALENCE DES GRAMMAIRES
SIMPLES.
Didier Caucal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 344. 1984.]
101180 OPTIMAL PRIORITY ASSIGNMENT WITH CONSTRAINT.
Philippe Nain and Keith W. Ross.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 346. 1984.]
101181 NON FIRST NORMAL FORM RELATIONS: AN ALGEBRA ALLOWING DATA
RESTRUCTURING.
Serge Abiteboul and Nicole Bidoit.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 347. 1984.]
101182 DETECTION AND DIAGNOSIS OF ABRUPT CHANGES IN MODAL CHARACTERISTICS OF
NONSTATIONARY DIGITAL SIGNALS.
Michele Basseville, Albert Benveniste, and Georges Moustakides.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 348. 1984.]
101183 UN ALGORITHME D'EXCLUSION MUTUELLE POUR UNE STRUCTURE LOGIQUE EN
ANNEAU.
Michel Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 350. 1984.]
101184 COMMANDE PAR RETOUR D'EFFORTS EN ROBOTIQUE.
Jean-Pierre Merlet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 351. 1984.]
101185 ON THE CONTROL OF STRONGLY NONLINEAR SYSTEMS.
Vilmos Komornik and Dan Tiba.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 352. 1984.]
101186 UNE METHODE D'ELEMENTS FINIS POUR LA SIMULATION DANS UN RESERVOIR DE
DEPLACEMENTS BIDIMENSIONNELS D'HUILE PAR DE L'EAU.
Guy Chavent et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 353. 1985.]
101187 LE SCHEMA G-K/2 POUR LES LOIS DE CONSERVATION SCALAIRES.
Bernardo Cockburn.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 354. 1984.]
101188 ON THE EQUICONVERGENCE OF EIGENFUNCTION EXPANSIONS ASSOCIATED WITH
ORDINARY LINEAR DIFFERENTIAL OPERATORS.
Vilmos Komornik.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 356. 1985.]
101189 FUNCTIONAL PROGRAMMING AND THE LOGICAL VARIABLE.
Gary Lindstrom.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 357. 1985.]
101190 RESOLUTION DES EQUATIONS D'EULER PAR UN SCHEMA DE VAN LEER EN
ELEMENTS FINIS.
Fatima Fezoui.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 358. 1985.]
101191 LEAST SQUARE METHOD TO SOLVE EULER EQUATIONS.
Francoise Angrand.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 359. 1985.]
101192 ON THE DISTRIBUTION OF STATEMENTS IN PASCAL PROGRAMS.
Anne Schroeder.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 39. 1984.]
041718 ZERO CROSSINGS ON LINES OF CURVATURE.
A. L. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 718. 1984.]
041739 DIAGNOSTIC REASONING BASED ON STRUCTURE AND BEHAVIOR.
Randall Davis.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 739. 1984.]
041752 A METHOD FOR COMPUTING SPECTRAL REFLECTANCE.
A. L. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 752. 1984.]
041763 THE COMBINATORICS OF LOCAL CONSTRAINTS IN MODEL BASED RECOGNITION AND
LOCALIZATION FROM SPARSE DATA.
W. Eric L. Grimson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 763. 1984.]
041764 COLOR VISION: REPRESENTING MATERIAL CATEGORIES.
John M. Rubin and W. A. Richards.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 764. 1984.]
041768 ON EDGE DETECTION.
V. Torre and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 768. 1984.]
041769 CODON CONSTRAINTS ON CLOSED 2D SHAPES.
Whitman A. Richards and Donald D. Hoffman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 769. 1984.]
041770 SELECTING ONE AMONG THE MANY: A SIMPLE NETWORK IMPLEMENTING SHIFTS IN
SELECTIVE VISUAL ATTENTION.
Christof Koch and Shimon Ullman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 770. 1984.]
041771 BASIC SOLID MECHANICS FOR TACTILE SENSING.
Ronald S. Fearing and John M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 771. 1984.]
041772 DETERMINING GRASP POINTS USING PHOTOMETRIC STEREO AND THE PRISM
BINOCULAR STEREO SYSTEM.
Katsushi Ikeuchi et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 772. 1984.]
041773 ILL-POSED PROBLEMS AND REGULARIZATION ANALYSIS IN EARLY VISION.
Tomaso Poggio and Vincent Torre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 773. 1984.]
041774 SOME SCIENTIFIC SUBROUTINES IN LISP.
Gerald Roylance.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 774. 1984.]
041776 VISION BY MAN AND MACHINE: HOW THE BRAIN PROCESSES VISUAL INFORMATION
MAY BE SUGGESTED BY STUDIES IN COMPUTER VISION (AND VICE VERSA).
Tomaso Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 776. 1984.]
041777 A GENERALIZED ORDERING CONSTRAINT FOR STEREO CORRESPONDENCE.
A. L. Yuille and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 777. 1984.]
041779 AN INFORMATION STORAGE MECHANISM: CALCIUM AND SPINES.
Hugh Robinson and Christof Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 779. 1984.]
041783 AN ANALOG MODEL OF COMPUTATION FOR THE ILL-POSED PROBLEMS OF EARLY
VISION.
Tomaso Poggio and Christof Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 783. 1984.]
041786 THE COORDINATION OF ARM MOVEMENTS: AN EXPERIMENTALLY CONFIRMED
MATHEMATICAL MODEL.
Tamar Flash and Neville Hogan.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 786. 1984. Also issued as C.B.I.P. paper 010, Center
for Biological Information Processing, Whitaker College.]
041787 A THEORETICAL ANALYSIS OF THE ELECTRICAL PROPERTIES OF A X-CELL IN
THE CAT'S LGN: DOES THE INTERNEURON GATE THE VISUAL INPUT TO THE
X-SYSTEM.
Christof Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 787. 1984. Also issued as C.B.I.P. paper 006, Center
for Biological Information Processing, Whitaker College.]
041788 TOWARD A PRINCIPLE BASED PARSER.
G. Edward Barton Jr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 788. 1984.]
041790 KINEMATIC FEATURES OF UNRESTRAINED ARM MOVEMENTS.
Christopher G. Atkeson and John M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 790. 1984. Also issued as C.B.I.P. paper 007, Center
for Biological Information Processing, Whitaker College.]
041792 SURFACE RECONSTRUCTION PRESERVING DISCONTINUITIES.
J. L. Marroquin.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 792. 1984.]
041796 WHAT A PARALLEL PROGRAMMING LANGUAGE HAS TO LET YOU SAY.
Alan Bawden and Philip E. Agre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 796. 1984.]
041803 MULTIGRID RELAXATION METHODS AND THE ANALYSIS OF LIGHTNESS, SHADING,
AND FLOW.
Demetri Terzopoulos.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 803. 1984.]
041804 PLANNING OF MINIMUM TIME TRAJECTORIES FOR ROBOT ARMS.
Gideon Sahar and John M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 804. 1984.]
041805 ANY DIMENSIONAL RECONSTRUCTION FROM HYPERPLANAR PROJECTIONS.
Michael A. Gennert.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 805. 1984.]
041806 COLLISION DETECTION FOR MOVING POLYHEDRA.
John Canny.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 806. 1984.]
041809 SIMPLIFIED GRASPING AND MANIPULATION WITH DEXTROUS ROBOT HANDS.
Ronald S. Fearing.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 809. 1984.]
041816 PP: A LISP PRETTY PRINTING SYSTEM.
Richard C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Memo 816. 1984.]
040767 QUALITATIVE ANALYSIS OF MOS CIRCUITS.
Brian C. Williams.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 767. 1984. Thesis (M.S.). "This report
is a revision of a thesis submitted to the Department of Electrical
Engineering and Computer Science in January, 1984 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040789 QUALITATIVE PROCESS THEORY.
Kenneth Dale Forbus.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 789. 1984. Thesis (Ph.D.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on July 4, 1984 in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy."]
040791 MOTION PLANNING WITH SIX DEGREES OF FREEDOM.
Bruce R. Donald.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 791. 1984. Thesis (M.S.). "This report
is a revised version of chapters 1-7 of 'Local and Global Techniques
for Motion Planning,' a thesis submitted...to the Department of
Electrical Engineering and Computer Science...for the degree of
Master of Science." "Chapters 8-11 may be obtained separately as
[Massachusetts Institute of Technology Artificial Intelligence
Laboratory] A.I. Memo 736, 'Hypothesizing Channels through Free-Space
in Solving the Findpath Problem.'"]
040793 SWITCHING BETWEEN DISCRETE AND CONTINUOUS PROCESS MODELS TO PREDICT
MOLECULAR GENETIC ACTIVITY.
Daniel Sabey Weld.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 793. 1984. Thesis (M.S.). "This report
is a revision of a thesis submitted to the Department of Electrical
Engineering and Computer Science on May 11, 1984 in partial
fulfillment of requirements for the degree of Master of Science."]
040794 PRESENTATION BASED USER INTERFACES.
Eugene C. Ciccarelli IV.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 794. 1984. Thesis (Ph.D.). "This is a
revised version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on August 27, 1984, in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy."]
040807 A CIRCUIT GRAMMAR FOR OPERATIONAL AMPLIFIER DESIGN.
Andrew Lewis Ressler.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 807. 1984. Thesis (Ph.D.).]
040810 ON MOTION PLANNING WITH UNCERTAINTY.
Michael Andreas Erdmann.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 810. 1984. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on August 17, 1984 in partial
fulfillment of the requirements for the degree of Master of
Science."]
095090 A HARDWARE ASSISTED METHODOLOGY FOR VLSI DESIGN RULE CHECKING.
Larry Dean Seiler.
[Massachusetts Institute of Technology. Department of Electrical
Engineering and Computer Science. 1985. Thesis (Ph.D.).]
099091 MASSACHUSETTS INSTITUTE OF TECHNOLOGY. DEPARTMENT OF ELECTRICAL
ENGINEERING AND COMPUTER SCIENCE.
VLSI MEMORANDA ("Memos in this series...are not considered to be
published merely by virtue of appearing in this series. References
to these works should be either to the published version, if any,
or in the form 'private communication'...."):
099091/216 A MIXED-INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY
SOLVABLE.
Charles E. Leiserson and James B. Saxe.
[1984]
099091/218 THE SYSTEMATIC EXPLORATION OF PIPELINED ARRAY MULTIPLIER
PERFORMANCE.
Charles E. Hauck, Cyrus S. Bamji, and Jonathan Allen.
[1985]
099091/233 A DESIGN BY EXAMPLE REGULAR STRUCTURE GENERATOR.
Cyrus S. Bamji.
[1985. Thesis (M.S.).]
099091/234 GENERALIZED PLANAR MATCHING.
Fran Berman et al.
[1985]
099091/235 EMBEDDING GRAPHS IN BOOKS: A LAYOUT PROBLEM WITH APPLICATIONS TO
VLSI DESIGN.
Fan R. K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg.
[1985]
099091/236 GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR.
Thang Nguyen Bui et al.
[1985]
101193 NAMING AND DIRECTORY ISSUES IN MESSAGE TRANSFER SYSTEMS.
Marvin A. Sirbu Jr. and Juliet B. Sutherland.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-263. 1984. "This paper appeared in the
proceedings of the IFIP Working Group 6.5 International Working
Conference on Computer Message Systems, May, 1984, Nottingham,
England."]
101194 SOFTWARE FOR INTERACTIVE ON-LINE CONFERENCES.
Sunil K. Sarin and Irene Greif.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-264. 1984.]
101195 A NEW FAULT TOLERANT ALGORITHM FOR CLOCK SYNCHRONIZATION.
Jennifer Lundelius and Nancy A. Lynch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-265. 1984.]
101196 A SIMPLE AND EFFICIENT RANDOMIZED BYZANTINE AGREEMENT ALGORITHM.
Benny Chor and Brian A. Coan.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-266. 1984.]
101197 PROPOSAL FOR A SMALL SCHEME IMPLEMENTATION.
Richard Schooler and James W. Stamos.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-267. 1984.]
101198 COMPLEXITY OF NETWORK SYNCHRONIZATION.
Baruch Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-268. 1985.]
101199 THE COLORED TICKET ALGORITHM.
Michael Fischer et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-269. 1983.]
101200 CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY (PRELIMINARY VERSION).
Cynthia Dwork, Nancy A. Lynch, and Larry Stockmeyer.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-270. 1984.]
101201 PATTERNS IN TREES.
Nachum Dershowitz and Shmuel Zaks.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-271. 1985.]
020326 ORPHAN DETECTION IN THE ARGUS SYSTEM.
Edward Franklin Walker.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-326. 1984. Thesis (M. S.).]
020327 DEBUGGING DISTRIBUTED COMPUTATIONS IN A NESTED ATOMIC ACTION SYSTEM.
Sheng Yang Chiu.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-327. 1984. Thesis (Ph.D.).]
101206 STUDIES IN D-OPTIMAL EXPERIMENTAL DESIGN.
Demetre Betsis.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8501. 1985.]
101207 IMPLEMENTATION OF SET AND RELATIONAL OPERATORS IN PROLOG.
Habib Ahrabian.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8502. 1985.]
101208 AN ALGORITHM FOR SIMULATION OF THE PRESSURE DISTRIBUTION IN A
BUILDING.
Bengt Lindberg.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8503. 1985.]
101209 AN ABSTRACT MACHINE FOR LPLO. PART I AND PART II.
Seif Haridi and Dan Sahlin.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. Computer Systems Architecture
Laboratory. CSALAB 1984-10-04. 1984.]
101210 AUTOMATIC VALIDATION OF COMMUNICATION PROTOCOL SPECIFICATIONS IN HORN
CLAUSE LOGIC.
Manuel E. Guzman.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8307. 1983.]
101211 IMPLEMENTATIONS OF COMMUNICATION PROTOCOLS FOR A LOCAL NETWORK: A
CASE STUDY.
Manuel E. Guzman.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8308. 1984.]
101212 TOWARDS A COMPUTER ARCHITECTURE FOR OR-PARALLEL EXECUTION OF LOGIC
PROGRAMS.
Andrzej Ciepielewski.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8401. 1984.
"Academic dissertation." 2 volumes.]
101214 PROPOSAL FOR A LOW LEVEL OBJECT ORIENTED ARCHITECTURE.
L.-E. Thorelli.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8402. 1984.]
101215 LOGIC PROGRAMMING WITH LPLO: AN INTRODUCTORY GUIDE.
Thomas Sjoeland.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8404. 1984.]
101216 TRANSFORMING LPLO PROGRAMS USING LPLO.
Thomas Sjoeland.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8405. 1984.]
101217 OBJECT-ORIENTED STORAGE MANAGEMENT AND GARBAGE COLLECTION IN
DISTRIBUTED PROCESSING SYSTEMS.
Khayri Abdel-Hamid Mohamed Ali.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. TRITA-CS-8406. 1984.
"Academic dissertation." 2 volumes.]
101219 APPLYING LOGIC PROGRAMMING IN SCENE INTERPRETATION.
Mohammad Hossein Movahhedi.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. 1984. Thesis (Licentiate of
Engineering).]
101220 COMMUNICATION NETWORK MEASUREMENT TOOLS AND TECHNIQUES OF MEASUREMENT.
Sulaiman Yusuf.
[Royal Institute of Technology, Stockholm. Department of
Telecommunication and Computer Systems. 1984.]
101221 ALGORITHMS AND COMPLEXITY FOR A STATISTICAL PROBLEM. MINIMUM RESIDUAL
FITTING.
J. M. Steele and W. L. Steiger.
[Rutgers. Department of Computer Science. DCS-TR-149. 1984.]
101222 MODULAR VERIFICATION OF COMMUNICATING SEQUENTIAL PROCESSES.
E. A. Akkoyunlu and R. M. Nemas.
[Rutgers. Department of Computer Science. DCS-TR-150. 1984.]
101223 LOCALIZATION PROBLEMS AND EXPERT SYSTEMS.
Allen Ginsberg.
[Rutgers. Laboratory for Computer Science Research. CBM-TR-139. 1984.]
101224 SHIFT OF BIAS FOR INDUCTIVE CONCEPT LEARNING.
Paul E. Utgoff.
[Rutgers. Laboratory for Computer Science Research. CBM-TR-145. 1984.
Thesis (Ph.D.).]
101225 ARTIFICIAL INTELLIGENCE AND THE SOCIAL SCIENCES: A PRELIMINARY REPORT.
Saul Amarel.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-60. 1984.]
101226 KNOWLEDGE REPRESENTATION AS THE BASIS FOR REQUIREMENTS.
Alexander Borgida, Sol Greenspan, and John Mylopoulos.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-61. 1984.]
101227 INTRODUCTION TO THE COMTEX MICROFICHE EDITION OF THE RUTGERS
UNIVERSITY ARTIFICIAL INTELLIGENCE RESEARCH REPORTS. (THE HISTORY OF
AI AT RUTGERS).
Saul Amarel.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-62. 1984.]
101228 CONTROLLING THE EVOLUTION OF LARGE SCALE SOFTWARE SYSTEMS.
Naftaly H. Minsky.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-63. 1985.]
101229 LEAP: A LEARNING APPRENTICE FOR VLSI DESIGN.
T. M. Mitchell, S. Mahadevan, and L. I. Steinberg.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-64. 1985.
Also issued as Working paper 18, AI/VLSI Project, Department of
Computer Science, Rutgers.]
101230 A KNOWLEDGE BASED APPROACH TO DESIGN.
T. M. Mitchell, L. I. Steinberg, and J. S. Shulman.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-65. 1985.
Also issued as Working paper 17, AI/VLSI Project, Department of
Computer Science, Rutgers.]
101231 A GENERALIZATION STRATEGY FOR INFERRING PROBLEM DECOMPOSITION METHODS.
Sridhar Mahadevan.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-66. 1985.]
101232 IMPLEMENTATION ASSESSMENT OF THE OSI NETWORK SERVICE: THE TEST
DEFINITION LANGUAGE. EDITED BY P. W. HOBSON.
P. W. Hobson.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 52/84. 1984.]
101233 A GUIDE TO THE STATISTICAL ANALYSIS OF THE RESULTS OF LINEAR AND
NONLINEAR LEAST-SQUARES DATA FITTING.
Helen M. Jones.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 53/84. 1984.]
101234 A PROTOTYPE PASCAL PROGRAM VALIDATION SYSTEM, BY B. A. WICHMANN, ET
AL.
B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 57/85. 1985.]
101235 A DESCRIPTION AND USER'S GUIDE FOR CLUSTER/2: A PROGRAM FOR
CONJUNCTIVE CONCEPTUAL CLUSTERING.
Robert Stepp.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1084. 1984.]
101236 PROBLEMS IN SORTING AND GRAPH ALGORITHMS.
Dana Scott Richards.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1186. 1984. Thesis (Ph.D.).]
101237 PROCESSOR ARRAYS FOR PROBLEMS IN COMPUTATIONAL PHYSICS.
Efstratios Gallopoulos.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1193. 1985. Thesis (Ph.D.).]
101238 HCL - A SYSTEM FOR HIERARCHICAL LAYOUT.
Forrest Duane Brewer.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1194. 1984. Thesis (M.S.).]
101239 RELIABLE CLOCK DRIVEN PROCESS SYNCHRONIZATION ALGORITHMS.
Satoshi Hasegawa et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1195. 1985.]
101240 FILE MIGRATION IN A UNIX ENVIRONMENT.
Gordon George Free.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1196. 1984. Thesis (M.S.).]
101241 SUBSTANTIAL CONSTRUCTIVE INDUCTION USING LAYERED INFORMATION
COMPRESSION: TRACTABLE FEATURE FORMATION IN SEARCH.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1198. 1985.]
101242 PORTING THE NEWCASTLE CONNECTION TO 4.2 BERKELEY UNIX.
Jeffrey M. Donnelly.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1199. 1985. Thesis (M.S.).]
101243 REPRESENTING AND EFFECTING PARALLELISM IN PROGRAMS FOR CONTROL-FLOW
MULTIPROCESSORS: PROGRAM GRAPHS AND A PROGRAM GRAPH INTERPRETER.
Jonathan Posner Harris.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1200. 1985. Thesis (M.S.).]
101244 FONT STORAGE, COMPRESSION, AND SCALING FOR NETWORKED PROFESSIONAL
WORKSTATIONS.
Willard Lee Wong.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1201. 1985. Thesis (M.S.).]
101245 CHEBYCODE: A FORTRAN IMPLEMENTATION OF MANTEUFFEL'S ADAPTIVE
CHEBYSHEV ALGORITHM.
Steven F. Ashby.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1203. 1985.]
101246 IMPLEMENTING LINEAR MULTISTEP FORMULAS FOR SOLVING DAES.
G. K. Gupta, C. W. Gear, and B. Leimkuhler.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1205. 1985.]
101247 UTILITY PATTERNS AS CRITERIA FOR EFFICIENT GENERALIZATION LEARNING.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1206. 1985.]
101248 EXPLICITLY VECTORIZED FRONTAL ROUTINE FOR HYDRODYNAMIC STABILITY AND
BIFURCATION ANALYSIS BY GALERKIN FINITE ELEMENT METHODS.
A. G. Boudouvis and L. E. Scriven.
[University of Minnesota. Supercomputer Institute. UMSI 84/1. 1984.]
101249 RESEARCH AND EDUCATIONAL PROGRAM.
T. F. Walsh.
[University of Minnesota. Supercomputer Institute. UMSI 84/2. 1984.]
101250 LARGE-SCALE QUANTUM MECHANICAL SCATTERING CALCULATIONS ON VECTOR
COMPUTERS.
David W. Schwenke and Donald G. Truhlar.
[University of Minnesota. Supercomputer Institute. UMSI 85/1. 1985.]
101251 AN ALTERNATING DIRECTION METHOD FOR THE DEFLECTION OF A PLATE.
Mitchell Luskin.
[University of Minnesota. Supercomputer Institute. UMSI 85/2. 1985.]
101252 AURORAL ELECTRODYNAMICS WITH CURRENT AND VOLTAGE GENERATORS.
Robert L. Lysak.
[University of Minnesota. Supercomputer Institute. UMSI 85/3. 1985.]
101253 THE CONTRIBUTION OF NUCLEAR INELASTIC EXCITATION TO THE OPTICAL
POTENTIAL FOR HEAVY IONS.
Z. El-Itaoui, P. J. Ellis, and B. Mughrabi.
[University of Minnesota. Supercomputer Institute. UMSI 85/4. 1985.]
101254 LARGE-SCALE CALCULATIONS ON THE QUANTUM MECHANICAL DESCRIPTION OF
ENERGY TRANSFER IN MOLECULAR COLLISIONS.
David W. Schwenke and Donald G. Truhlar.
[University of Minnesota. Supercomputer Institute. UMSI 85/5. 1985.]
101255 MAKING THE OSLO ALGORITHM MORE EFFICIENT.
T. Lyche and K. Morken.
[University of Oslo. Institute for Informatics. Report no. 87. 1984.]
101256 KNOT LINE REFINEMENT ALGORITHMS FOR TENSOR PRODUCT B-SPLINE SURFACES.
E. Cohen, T. Lyche, and K. Morken.
[University of Oslo. Institute for Informatics. Report no. 88. 1984.]
101257 TOP DOWN VLSI DESIGN EXPERIMENTS ON A PICTURE DATABASE COMPUTER.
Kazunori Yamaguchi and Tosiyasu L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 84-01. 1984.]
101258 DISJOINT SHORTEST PATHS IN GRAPHS.
Akira Saito and Hikoe Enomoto.
[University of Tokyo. Department of Information Science. Technical
report 84-02. 1984.]
101259 TOUGHNESS AND N-FACTORS OF FINITE GRAPHS.
Hikoe Enomoto and Akira Saito.
[University of Tokyo. Department of Information Science. Technical
report 84-03. 1984.]
101260 THEORY OF SYMBOLIC EXPRESSIONS, II.
Masahiko Sato.
[University of Tokyo. Department of Information Science. Technical
report 84-04. 1984.]
101261 A CEREBRAL VIEW OF TASK OPTIMALITY IN JAPANESE TEXT TYPING.
Takeshi Okadome et al.
[University of Tokyo. Department of Information Science. Technical
report 84-05. 1984.]
101262 ON THE POSSIBILITY OF MEMORY ENHANCEMENT BY COLORING THE ARRAY
CORRESPONDENCE CODE TABLE OF KANZI [IN JAPANESE].
Yamada-Hisao..
[University of Tokyo. Department of Information Science. Technical
report 84-06. 1984.]
101263 A THEORY OF COLOR CODING IN THE ARRAY CORRESPONDENCE CODE TABLE FOR
KANZI INPUT [IN JAPANESE].
Yamada-Hisao..
[University of Tokyo. Department of Information Science. Technical
report 84-07. 1984.]
101264 TOUGHNESS AND THE EXISTENCE OF K-FACTORS, II.
Hikoe Enomoto.
[University of Tokyo. Department of Information Science. Technical
report 84-08. 1984.]
101265 QUTE: A FUNCTIONAL LANGUAGE BASED ON UNIFICATION.
Masahiko Sato and Takafumi Sakurai.
[University of Tokyo. Department of Information Science. Technical
report 84-09. 1984.]
101266 GRAPHICS FOR VIEW DEPENDENT ASPECT DETERMINATION.
Tomihisa Kamada and Satoru Kawai.
[University of Tokyo. Department of Information Science. Technical
report 84-10. 1984.]
101267 A BRAIN WAVE STUDY OF CEREBRAL HEMISPHERICITY IN ENGLISH TYPISTS.
Takeshi Okadome et al.
[University of Tokyo. Department of Information Science. Technical
report 84-11. 1984.]
101268 TOUGHNESS AND THE EXISTENCE OF K-FACTORS, III.
Hikoe Enomoto.
[University of Tokyo. Department of Information Science. Technical
report 84-12. 1984.]
101269 A SUMMARY OF RESEARCH ON JAPANESE INPUT METHODS FOR SKILLED TYPISTS
[IN JAPANESE].
Yamada-Hisao..
[University of Tokyo. Department of Information Science. Technical
report 84-13. 1984.]
VOL. 7, NO. 6 06/28/85
101270 ANOTHER TRY AT UUCP.
Robert T. Morris.
[AT&T Bell Laboratories. Computer science technical report 111. 1984.]
101271 BASIC POLYMORPHIC TYPECHECKING.
Luca Cardelli.
[AT&T Bell Laboratories. Computer science technical report 112. 1984.]
101272 A C++ TUTORIAL.
Bjarne Stroustrup.
[AT&T Bell Laboratories. Computer science technical report 113. 1984.]
101273 GRAP - A LANGUAGE FOR TYPESETTING GRAPHS: TUTORIAL AND USER MANUAL.
Jon L. Bentley and Brian W. Kernighan.
[AT&T Bell Laboratories. Computer science technical report 114. 1984.]
101274 PARTIAL DIFFERENTIAL EQUATIONS IN ONE SPACE VARIABLE.
N. L. Schryer.
[AT&T Bell Laboratories. Computer science technical report 115. 1984.]
101275 PIC - A GRAPHICS LANGUAGE FOR TYPESETTING: REVISED USER MANUAL.
Brian W. Kernighan.
[AT&T Bell Laboratories. Computer science technical report 116. 1984.]
101276 VARIATION DIMINISHING SPLINES IN SIMULATION.
William M. Coughran Jr., Eric H. Grosse, and Donald J. Rose.
[AT&T Bell Laboratories. Numerical analysis manuscript 84-3. 1984.]
101277 NON-OBTUSE TRIANGULATION OF A POLYGON.
Brenda S. Baker, Eric H. Grosse, and Conor S. Rafferty.
[AT&T Bell Laboratories. Numerical analysis manuscript 84-4. 1985.]
101278 AUTOMATIC CHOICE OF COLORS FOR LEVEL PLOTS.
Eric H. Grosse.
[AT&T Bell Laboratories. Numerical analysis manuscript 85-1. 1985.]
101279 DISTRIBUTION OF MATHEMATICAL SOFTWARE VIA ELECTRONIC MAIL.
Jack J. Dongarra and Eric H. Grosse.
[AT&T Bell Laboratories. Numerical analysis manuscript 85-2. 1985.]
101280 THE GROVE EDITOR.
William M. Coughran Jr. and Eric H. Grosse.
[Bell Laboratories. Computing Mathematics Research Department. 1983.]
101281 THE PINE PROGRAMMING LANGUAGE.
Eric H. Grosse and William M. Coughran Jr.
[Bell Laboratories. Computing Mathematics Research Department. 1983.]
101282 A LOGIC FOR THE RUSSELL PROGRAMMING LANGUAGE.
Hans-Juergen Boehm.
[Cornell University. Department of Computer Science. TR 84-593. 1984.
Thesis (Ph.D.).]
101283 IMPLEMENTING FAULT TOLERANT DISTRIBUTED OBJECTS.
Kenneth P. Birman et al.
[Cornell University. Department of Computer Science. TR 84-594. 1984.
Revised, October 1984.]
101284 RANDOMIZED BYZANTINE AGREEMENT.
Kenneth J. Perry.
[Cornell University. Department of Computer Science. TR 84-595. 1984.]
101285 A USER'S GUIDE TO THE FACTORY MODELLING SYSTEM: A PLANNING AND DESIGN
TOOL FOR MANUFACTURING ENGINEERING.
Richard Conway.
[Cornell University. Department of Computer Science. TR 84-596. 1984.]
101286 AUTOMATIC CONSTRUCTION OF CSP PROGRAMS FROM SEQUENTIAL
NONDETERMINISTIC PROGRAMS.
Abha Moitra.
[Cornell University. Department of Computer Science. TR 84-597. 1984.]
101287 THE SPARSE NULL SPACE BASIS PROBLEM.
Thomas F. Coleman and Alex Pothen.
[Cornell University. Department of Computer Science. TR 84-598. 1984.]
101288 A USER'S GUIDE TO THE COPE PROGRAMMING ENVIRONMENT.
Richard Conway, Dan DeJohn, and Steve Worona.
[Cornell University. Department of Computer Science. TR 84-599. 1984.]
101289 BUFFER MANAGEMENT AS INVENTORY CONTROL.
Oezalp Babaoglu.
[Cornell University. Department of Computer Science. TR 84-600. 1984.]
101290 A TAXONOMY OF PARALLEL SORTING.
Dina Bitton et al.
[Cornell University. Department of Computer Science. TR 84-601. 1984.]
101291 ON THE MOTION OF OBJECTS IN CONTACT.
John E. Hopcroft and Gordon Wilfong.
[Cornell University. Department of Computer Science. TR 84-602. 1984.]
101292 INDEPENDENCE RESULTS ABOUT CONTEXT FREE LANGUAGES AND LOWER BOUNDS.
Juris Hartmanis.
[Cornell University. Department of Computer Science. TR 84-606. 1984.]
101293 REDUCIBILITY AMONG GEOMETRIC LOCATION ALLOCATION OPTIMIZATION
PROBLEMS.
Chanderjit Bajaj.
[Cornell University. Department of Computer Science. TR 84-607. 1984.]
101294 SOME NOTIONS ABOUT INFORMATION RETRIEVAL IN AUTOMATED OFFICE
ENVIRONMENTS.
Gerard Salton.
[Cornell University. Department of Computer Science. TR 84-609. 1984.]
101295 THE BYZANTINE MONKEYS PROBLEM.
Kenneth J. Perry and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-610. 1984.]
101296 PATTERNS OF COMMUNICATION IN CONSENSUS PROTOCOLS.
Cynthia Dwork and Dale Skeen.
[Cornell University. Department of Computer Science. TR 84-611. 1984.]
101297 STREETS OF BYZANTIUM: NETWORK ARCHITECTURES FOR FAST RELIABLE
BROADCASTS.
Oezalp Babaoglu and Rogerio Drummond.
[Cornell University. Department of Computer Science. TR 85-613. 1984.
Revised, February 1985.]
101298 THRIFTY EXECUTION OF TASK PIPELINES.
Fred B. Schneider, Richard Conway, and Dale Skeen.
[Cornell University. Department of Computer Science. TR 84-615. 1984.]
101299 REDUCING MULTIPLE OBJECT MOTION PLANNING TO GRAPH SEARCHING.
John E. Hopcroft and Gordon Wilfong.
[Cornell University. Department of Computer Science. TR 84-616. 1984.]
101300 CONSISTENCY IN A PARTITIONED NETWORK: A SURVEY.
Susan B. Davidson, Hector Garcia-Molina, and Dale Skeen.
[Cornell University. Department of Computer Science. TR 84-617. 1984.]
101301 ALGEBRAIC SPECIFICATION OF A COMMUNICATION SCHEDULER.
Joseph Mathai and Abha Moitra.
[Cornell University. Department of Computer Science. TR 84-618. 1984.]
101302 AN AUTHENTICATED BYZANTINE GENERALS ALGORITHM WITH EARLY STOPPING.
Kenneth J. Perry and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-620. 1984.]
101303 FAST DISTRIBUTED AGREEMENT.
Sam Toueg, Kenneth J. Perry, and T. K. Srikanth.
[Cornell University. Department of Computer Science. TR 84-621. 1984.
Revised, December 1984.]
101304 CONCURRENCY CONTROL IN RESILIENT OBJECTS.
Kenneth P. Birman, Thomas A. Joseph, and Thomas Raeuchle.
[Cornell University. Department of Computer Science. TR 84-622. 1984.]
101305 BYZANTINE AGREEMENT MADE SIMPLE: SIMULATING AUTHENTICATION WITHOUT
SIGNATURES.
T. K. Srikanth and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-623. 1984.]
101306 DISTRIBUTED SNAPSHOTS IN SPITE OF FAILURES.
Amitabh Shah and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-624. 1984.
Revised, February 1985.]
101307 A TRIANGULAR PROCESSOR ARRAY FOR COMPUTING THE SINGULAR VALUE
DECOMPOSITION.
Franklin T. Luk.
[Cornell University. Department of Computer Science. TR 84-625. 1984.]
101308 THE SOLUTION OF SINGULAR VALUE PROBLEMS USING SYSTOLIC ARRAYS.
Richard P. Brent and Franklin T. Luk.
[Cornell University. Department of Computer Science. TR 84-626. 1984.]
101309 DISAMBIGUATION, CORRECTNESS AND FLOW ANALYSIS ISSUES FOR TRACE
SCHEDULING COMPILERS.
Alexandru Nicolau.
[Cornell University. Department of Computer Science. TR 84-627. 1984.]
101310 INTERSECTION GRAPH ALGORITHMS.
Paul F. Dietz.
[Cornell University. Department of Computer Science. TR 84-628. 1984.
Thesis (Ph.D.).]
101311 GEOMETRIC OPTIMIZATION AND COMPUTATIONAL COMPLEXITY.
Chanderjit Bajaj.
[Cornell University. Department of Computer Science. TR 84-629. 1984.
Thesis (Ph.D.).]
101312 SUBLINEAR SPACE EVALUATION ALGORITHMS FOR ATTRIBUTED GRAMMARS.
Thomas Reps and Alan Demers.
[Cornell University. Department of Computer Science. TR 84-630. 1984.]
101313 THE CYCLIC COLORING PROBLEM AND ESTIMATION OF SPARSE HESSIAN MATRICES.
Thomas F. Coleman and Jin-yi Cai.
[Cornell University. Department of Computer Science. TR 84-646. 1984.]
101314 ON COMPUTING THE CS DECOMPOSITION WITH SYSTOLIC ARRAYS.
I. M. Kaplan and C. Van Loan.
[Cornell University. Department of Computer Science. TR 84-647. 1984.]
101315 SIGNAL PROCESSING COMPUTATIONS USING THE GENERALIZED SINGULAR VALUE
DECOMPOSITION.
J. M. Speiser and C. Van Loan.
[Cornell University. Department of Computer Science. TR 84-648. 1984.]
101316 HOW NEAR IS A STABLE MATRIX TO AN UNSTABLE MATRIX?
C. Van Loan.
[Cornell University. Department of Computer Science. TR 84-649. 1984.]
101317 DEFINING LIVENESS.
Bowen Alpern and Fred B. Schneider.
[Cornell University. Department of Computer Science. TR 85-650. 1984.
Revised, February 1985.]
101318 STATE MACHINES AND ASSERTIONS (AN INTEGRATED APPROACH TO MODELING AND
VERIFICATION OF DISTRIBUTED SYSTEMS).
Thomas A. Joseph, Thomas Raeuchle, and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-652. 1984.]
101319 RESILIENT COMMUNICATION STRUCTURES FOR LOCAL AREA NETWORKS.
Amr El Abbadi and Thomas Raeuchle.
[Cornell University. Department of Computer Science. TR 84-653. 1984.]
101320 QUOTIENT TREE PARTITIONING OF UNDIRECTED GRAPHS.
Anders Edenbrandt.
[Cornell University. Department of Computer Science. TR 84-654. 1984.]
101321 AN APPROACH TO THE FUNCTIONAL DESCRIPTION OF AN INFORMATION RETRIEVAL
SYSTEM BASED ON A GENERALIZED MODEL.
Carolyn J. Crouch and Richard E. Nance.
[Cornell University. Department of Computer Science. TR 84-655. 1984.]
101322 CLOCK SYNCHRONIZATION.
T. K. Srikanth and Sam Toueg.
[Cornell University. Department of Computer Science. TR 84-656. 1984.
Preliminary version, December 1984.]
101323 RANDOMIZED AGREEMENT PROTOCOLS AND DISTRIBUTED DEADLOCK DETECTION
ALGORITHMS.
Gabriel Bracha.
[Cornell University. Department of Computer Science. TR 85-657. 1985.
Thesis (Ph.D.).]
101324 THE CLUSTER HYPOTHESIS REVISITED.
Ellen M. Voorhees.
[Cornell University. Department of Computer Science. TR 85-658. 1985.]
101325 RECURSIVE DEFINITIONS IN TYPE THEORY.
R. L. Constable and N. P. Mendler.
[Cornell University. Department of Computer Science. TR 85-659. 1985.]
101326 A COMPLETE INFERENCE SYSTEM FOR REGULAR PROCESSES WITH SILENT MOVES.
J. A. Bergstra and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8420. 1984.]
101327 TOWARDS A UNIFORM TOPOLOGICAL TREATMENT OF STREAMS AND FUNCTIONS ON
STREAMS.
J. W. de Bakker and J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8422. 1984.]
101328 COUNTING IS EASY.
J. Seiferas and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8423. 1984. Preliminary version, December 1984.]
101329 DISTRIBUTED MATCH MAKING FOR PROCESSES IN COMPUTER NETWORKS.
S. J. Mullender and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8424. 1984. Preliminary version, December 1984.]
101330 PARTIAL EVALUATION AND OMEGA-COMPLETENESS OF ALGEBRAIC SPECIFICATIONS.
J. Heering.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8501. 1985.]
101331 A PROGRAM FOR SOLVING FIRST KIND FREDHOLM INTEGRAL EQUATIONS BY MEANS
OF REGULARIZATION.
H. J. J. te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8416. 1984.]
101332 SYMMETRIC LINEAR MULTISTEP METHODS FOR SECOND ORDER DIFFERENTIAL
EQUATIONS WITH PERIODIC SOLUTIONS.
B. P. Sommeijer, P. J. van der Houwen, and B. Neta.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8501. 1985.]
052014C ASPECTUAL CLASSES IN SITUATION SEMANTICS.
Robin Cooper.
[Stanford University. Center for the Study of Language and
Information. CSLI-84-14C. 1985.]
052023 QUERYING LOGICAL DATABASES.
Moshe Vardi.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-23. 1985.]
025036 LEARNING CONTROL HEURISTICS IN BB1.
Barbara Hayes-Roth and Michael Hewett.
[Stanford University. Department of Computer Science.
STAN-CS-85-1036. 1985. Also issued as HPP-85-2, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
025037 EXPRESSIVENESS AND LANGUAGE CHOICE.
Jock MacKinlay and Michael R. Genesereth.
[Stanford University. Department of Computer Science.
STAN-CS-85-1037. 1985. Also issued as HPP-84-4, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
025038 UNIFORM HASHING IS OPTIMAL.
Andrew C. Yao.
[Stanford University. Department of Computer Science.
STAN-CS-85-1038. 1985.]
025039 A POLYNOMIAL TIME ALGORITHM FOR FINDING THE PRIME FACTORS OF
CARTESIAN-PRODUCT GRAPHS.
Joan Feigenbaum, John Hershberger, and Alejandro A. Schaeffer.
[Stanford University. Department of Computer Science.
STAN-CS-85-1039. 1985.]
025040 UPDATING RELATIONAL DATABASES THROUGH VIEWS.
Arthur M. Keller.
[Stanford University. Department of Computer Science.
STAN-CS-85-1040. 1985. Thesis (Ph.D.).]
025041 EDGE DETECTION AND GEOMETRIC METHODS IN COMPUTER VISION.
A. Peter Blicher.
[Stanford University. Department of Computer Science.
STAN-CS-85-1041. 1985. Thesis (Ph.D.). Also issued as AIM-352,
Artificial Intelligence Laboratory, Department of Computer Science,
Stanford University.]
025042 DEALS AMONG RATIONAL AGENTS.
Jeffrey S. Rosenschein and Michael R. Genesereth.
[Stanford University. Department of Computer Science.
STAN-CS-85-1042. 1985. Also issued as HPP-84-44, Heuristic
Programming Project, Department of Computer Science, Stanford
University.]
025043 CONSTRUCTING A PERFECT MATCHING IS IN RANDOM NC.
Richard M. Karp, Eli Upfal, and Avi Wigderson.
[Stanford University. Department of Computer Science.
STAN-CS-85-1043. 1985.]
025044 THE ORIGIN OF THE BINARY-SEARCH PARADIGM.
Zohar Manna and Richard Waldinger.
[Stanford University. Department of Computer Science.
STAN-CS-85-1044. 1985.]
025045 AN ARTIFICIAL INTELLIGENCE APPROACH TO LEGAL REASONING.
Anne von der Lieth Gardner.
[Stanford University. Department of Computer Science.
STAN-CS-85-1045. 1984. Thesis (Ph.D.).]
025046 TESTING APPLICABILITY OF TOP-DOWN CAPTURE RULES.
Jeffrey D. Ullman and Allen Van Gelder.
[Stanford University. Department of Computer Science.
STAN-CS-85-1046. 1985.]
025047 SMOOTH, EASY TO COMPUTE INTERPOLATING SPLINES.
John D. Hobby.
[Stanford University. Department of Computer Science.
STAN-CS-85-1047. 1985.]
025048 SOME CONSTRUCTIONS FOR ORDER-THEORETIC MODELS OF CONCURRENCY.
Vaughan Pratt.
[Stanford University. Department of Computer Science.
STAN-CS-85-1048. 1985.]
025049 THE POMSET MODEL OF PARALLEL PROCESSES: UNIFYING THE TEMPORAL AND THE
SPATIAL.
Vaughan Pratt.
[Stanford University. Department of Computer Science.
STAN-CS-85-1049. 1985.]
025050 FAST SEQUENTIAL ALGORITHMS TO FIND SHUFFLE-MINIMIZING AND SHORTEST
PATHS IN A SHUFFLE-EXCHANGE NETWORK.
John Hershberger and Ernst Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-85-1050. 1985.]
025051 SPECIAL RELATIONS IN AUTOMATED DEDUCTION.
Zohar Manna and Richard Waldinger.
[Stanford University. Department of Computer Science.
STAN-CS-85-1051. 1985.]
054166 COMBINING GRAPHICS AND PROCEDURES IN A VLSI LAYOUT TOOL: THE TPACK
SYSTEM.
Robert N. Mayo.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/166. 1984.]
054167 HIGH PERFORMANCE STORAGE RECLAMATION IN AN OBJECT BASED MEMORY SYSTEM.
Scott B. Baden.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/167. 1982.]
054168 MONTE CARLO METHODS FOR ESTIMATING SYSTEM RELIABILITY.
Michael G. Luby.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/168. 1983. Thesis (Ph.D.).]
054169 DISCRETE CHARACTERIZATION OF PROGRAM REFERENCING DYNAMICS.
Philippe De Smedt.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/169. 1984. Also issued as PROGRES report 84.1.]
054170 THEORETICAL ISSUES CONCERNING PROTECTION IN OPERATING SYSTEMS.
Michael A. Harrison.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/170. 1984.]
054171 FINDING A MAXIMUM DENSITY SUBGRAPH.
A. V. Goldberg.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/171. 1984.]
054172 HIDDEN FEATURE ELIMINATION AND VISIBLE POLYGON RETURN IN UNIGRAFIX 2.
Paul Wensley.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/172. 1984.]
054173 PROCESSOR DESIGN TRADEOFFS IN VLSI.
Robert Warren Sherburne Jr.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/173. 1984. Thesis (Ph.D.).]
054174 A NAME SERVER DATABASE.
David W. Riggle.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/174. 1984. Also issued as PROGRES report 84.2.]
054175 EXPERIMENTAL EVALUATION OF ON-CHIP MICROPROCESSOR CACHE MEMORIES.
Mark D. Hill and Alan Jay Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/175. 1984. Also issued as PROGRES report 84.3.]
054176 THE DESIGN AND IMPLEMENTATION OF A "DOMAIN NAMES" RESOLVER.
Mark Painter.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/176. 1984. Also issued as PROGRES report 84.4.]
054177 THE DESIGN AND IMPLEMENTATION OF THE BERKELEY INTERNET NAME DOMAIN
(BIND) SERVERS.
Songnian Zhou.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/177. 1984. Also issued as PROGRES report 84.5.]
054178 MULTI-VERSION STRUCTURES IN PROLOG.
Shimon Cohen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/178. 1984.]
054179 THE APPLOG LANGUAGE: PROLOG VS. LISP -- IF YOU CAN'T FIGHT THEM JOIN
THEM.
Shimon Cohen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/179. 1984.]
054180 A DECOMPOSITION SOLUTION TO A QUEUEING NETWORK MODEL OF A DISTRIBUTED
FILE SYSTEM WITH DYNAMIC LOCKING.
Anna Hac.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/180. 1984. Also issued as PROGRES report 84.6.]
054181 A COMPARISON OF TILE BASED WIRE REPRESENTATIONS FOR INTERACTIVE IC
LAYOUT TOOLS.
David Wallace.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/181. 1984.]
054182 THE BERKELEY INTERNET NAME DOMAIN SERVER.
Douglas B. Terry et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/182. 1984. Also issued as PROGRES report 84.7.]
054183 CONFIGURING LOCAL NETWORK BASED DISTRIBUTED SYSTEMS.
Tzong-yu Paul Lee.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/183. 1984. Thesis (Ph.D.). Also issued as PROGRES report
84.8.]
054184 GRAHAM-GLANVILLE CODE GENERATORS.
Robert Rettig Henry.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/184. 1984. Thesis (Ph.D.).]
054185 SIMULATION OF HIERARCHICAL ROUTING ALGORITHMS.
C. V. Ramamoorthy, O. Nishiguchi, and W.-T. Tsai.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/185. 1984.]
054186 DISCRETE LOGARITHMS AND FACTORING.
Eric Bach.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/186. 1984.]
054187 MATCHING MODULO DIVISORS, AND A SIMPLE N SUPERSCRIPT 1/4 FACTORING
ALGORITHM.
Eric Bach.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/187. 1984.]
054190 THE CRYPTOGRAPHIC SECURITY OF THE SUM OF BITS.
Richard Berger, Howard J. Karloff, and David B. Shmoys.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/190. 1984.]
054191 TUTORIAL EXAMPLES OF INTERPROCESS COMMUNICATION IN BERKELEY UNIX
4.2BSD.
Stuart Sechrest.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/191. 1984. Also issued as PROGRES report 84.9.]
054192 USER INTERFACE CONSIDERATIONS FOR ALGEBRAIC MANIPULATION SYSTEMS.
Gregg Foster.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/192. 1984.]
054193 DREAMS: DISPLAY REPRESENTATION FOR ALGEBRAIC MANIPULATION SYSTEMS.
Gregg Foster.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/193. 1984.]
054194 PREDICTING PERFORMANCE IN UNIX SYSTEMS FROM PORTABLE WORKLOAD
ESTIMATORS BASED ON THE TERMINAL PROBE METHOD.
Luis Felipe Cabrera and German Rodriguez-Galant.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/194. 1984. Also issued as PROGRES report 84.10.]
054195 REPLICATED PROCEDURE CALL.
Eric C. Cooper.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/195. 1984. Also issued as PROGRES report 84.11.]
054196 CIRCUS: A REPLICATED PROCEDURE CALL FACILITY.
Eric C. Cooper.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/196. 1984. Also issued as PROGRES report 84.12.]
054197 PERFORMANCE CHARACTERIZATION OF DISTRIBUTED PROGRAMS.
Barton Paul Miller.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/197. 1984. Thesis (Ph.D.). Also issued as PROGRES report
84.13.]
054198 PHRED: A GENERATOR FOR NATURAL LANGUAGE INTERFACES.
Paul S. Jacobs.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/198. 1985.]
054199 DESIGN AND IMPLEMENTATION OF AN INTEGRATED SNOOPING DATA CACHE.
Gaetano Borriello et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/199. 1984.]
054200 ON THE STRUCTURE OF F-INDISTINGUISHABILITY OPERATORS.
L. Valverde.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/200. 1984.]
054201 NEW RESULTS IN FUZZY CLUSTERING BASED ON THE CONCEPT OF
INDISTINGUISHABILITY RELATION.
R. Lopez de Mantaras and L. Valverde.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/201. 1984.]
054202 RANDOMIZED ROUTING IN GATE ARRAYS.
Prabhakar Raghavan and Clark D. Thompson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/202. 1984.]
054203 A PROLOG COMPILER FOR THE PLM.
Peter Van Roy.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/203. 1984.]
054204 ISSUES IN CACHING PROLOG GOALS.
Barry Fagin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/204. 1984.]
054205 GEOMETRIC CONTINUITY OF PARAMETRIC CURVES.
Brian A. Barsky and Tony D. DeRose.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/205. 1984.]
054206 A DISTRIBUTED PROGRAMS MONITOR FOR BERKELEY UNIX.
Barton P. Miller, Cathryn Macrander, and Stuart Sechrest.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/206. 1984. Also issued as PROGRES report 84.14.]
054207 IMPLEMENTING A CACHE CONSISTENCY PROTOCOL.
R. H. Katz et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/207. 1984.]
054208 WELL SOLVED SPECIAL CASES OF THE TRAVELING SALESMAN PROBLEM.
P. C. Gilmore, E. L. Lawler, and D. B. Shmoys.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/208. 1984.]
054209 CONSIDERATIONS ON THE INSULARITY OF PERFORMANCE EVALUATION.
Domenico Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/209. 1984. Also issued as PROGRES report 84.15.]
054210 PLA DRIVER SELECTION: AN ANALYTIC APPROACH.
Fred W. Obermeier and Randy H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/210. 1984.]
054211 PROCESS CONTROL IN A DISTRIBUTED BERKELEY UNIX ENVIRONMENT.
Ramon Caceres.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/211. 1984. Also issued as PROGRES report 84.16.]
054212 THE TRAVELING SALESMAN PROBLEM: THE DEVELOPMENT OF A DISTRIBUTED
COMPUTATION.
Nick Lai and Barton P. Miller.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/212. 1984. Also issued as PROGRES report 84.17.]
054213 AUTOMATED DISCOVERY OF MACHINE-SPECIFIC CODE IMPROVEMENTS.
Peter Bernard Kessler.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/213. 1984. Thesis (Ph.D.).]
054214 REGISTER ALLOCATION AND DATA CONVERSION IN MACHINE INDEPENDENT CODE
GENERATORS.
Marshall Kirk McKusick.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/214. 1984. Thesis (Ph.D.).]
054215 COLAB, TOOLS FOR COMPUTER BASED COOPERATION: A PROPOSED RESEARCH
PROGRAM.
Gregg Foster.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/215. 1984.]
054216 DEVELOPMENT OF A CONTROL PROCESS FOR THE BERKELEY UNIX DISTRIBUTED
PROGRAMS MONITOR.
Cathryn Marcia Macrander.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/216. 1984. Also issued as PROGRES report 84.18.]
054217 A USER PROCESS ORIENTED PERFORMANCE STUDY OF ETHERNET NETWORKING
UNDER BERKELEY UNIX 4.2BSD.
Luis Felipe Cabrera et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/217. 1984. Also issued as PROGRES report 84.19.]
054218 MEASURING AND IMPROVING THE PERFORMANCE OF 4.2BSD.
Sam Leffler, Mike Karels, and Marshall Kirk McKusick.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/218. 1984. Also issued as PROGRES report 84.20.]
054219 TRENDS AND PROSPECTS IN COMPUTER SYSTEM DESIGN.
Alan Jay Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/219. 1984.]
054220 PROBLEMS, DIRECTIONS AND ISSUES IN MEMORY HIERARCHIES.
Alan Jay Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 84/220. 1984.]
101333 HEURISTIC SEARCH IN DATA BASE SYSTEMS.
Ru-Mei Kung et al.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M84/58. 1984.]
101334 SQL-LIKE AND QUEL-LIKE CORRELATION QUERIES WITH AGGREGATES REVISITED.
Werner Kiessling.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M84/75. 1984.]
101335 PROBLEMS IN SUPPORTING DATA BASE TRANSACTIONS IN AN OPERATING SYSTEM
TRANSACTION MANAGER.
Michael Stonebraker.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M84/87. 1984.]
101336 OPTIMIZATION OF EXTENDED DATABASE QUERY LANGUAGES.
Timos K. Sellis and Leonard Shapiro.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M85/1. 1985.]
101337 TRIGGERS AND INFERENCE IN DATA BASE SYSTEMS.
Michael Stonebraker.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M85/46. 1985.]
101338 VERIFYING THE UNIFICATION ALGORITHM IN LCF.
Lawrence C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 50.
1984.]
101339 USING INFORMATION SYSTEMS TO SOLVE RECURSIVE DOMAIN EQUATIONS
EFFECTIVELY.
Glynn Winskel and Kim Guldstrand Larsen.
[University of Cambridge. Computer Laboratory. Technical report 51.
n.d.]
101340 THE DESIGN OF A RING COMMUNICATION NETWORK.
Steven Temple.
[University of Cambridge. Computer Laboratory. Technical report 52.
1984. Thesis (Ph.D.).]
101341 A NEW TYPE CHECKER FOR A FUNCTIONAL LANGUAGE.
Jon Fairbairn.
[University of Cambridge. Computer Laboratory. Technical report 53.
n.d.]
101342 LESSONS LEARNED FROM LCF.
Lawrence C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 54.
1984.]
101343 A NEW SCHEME FOR WRITING FUNCTIONAL OPERATING SYSTEMS.
William Stoye.
[University of Cambridge. Computer Laboratory. Technical report 56.
n.d.]
101344 CONSTRUCTING RECURSION OPERATORS IN INTUITIONISTIC TYPE THEORY.
Lawrence C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 57.
1984.]
101345 CATEGORIES OF MODELS FOR CONCURRENCY.
Glynn Winskel.
[University of Cambridge. Computer Laboratory. Technical report 58.
n.d.]
101346 ON THE COMPOSITION AND DECOMPOSITION OF ASSERTIONS.
Glynn Winskel.
[University of Cambridge. Computer Laboratory. Technical report 59.
n.d.]
101347 MEMORY AND CONTEXT MECHANISMS FOR AUTOMATIC TEXT PROCESSING.
Hiyan Alshawi.
[University of Cambridge. Computer Laboratory. Technical report 60.
1983. Thesis (Ph.D.).]
101348 USER MODELS AND EXPERT SYSTEMS.
Karen Sparck Jones.
[University of Cambridge. Computer Laboratory. Technical report 61.
1984.]
101349 CONSTRAINT ENFORCEMENT IN A RELATIONAL DATABASE MANAGEMENT SYSTEM.
Michael Robson.
[University of Cambridge. Computer Laboratory. Technical report 62.
1984. Thesis (Ph.D.).]
101350 POLY MANUAL.
David C. J. Matthews.
[University of Cambridge. Computer Laboratory. Technical report 63.
1985.]
101351 CHOOSING TENSE IN ENGLISH.
Christian Matthiessen.
[University of Southern California. Information Sciences Institute.
ISI/RR-84-143. 1984.]
101352 EGP GATEWAY UNDER BERKELEY UNIX 4.2.
Paul Kirton.
[University of Southern California. Information Sciences Institute.
ISI/RR-84-145. 1984.]
101353 RESEARCH ON KNOWLEDGE DELIVERY. CONTRACT FINAL REPORT OF RESEARCH IN
THE PERIOD AUGUST 15, 1979 TO AUGUST 14, 1984.
William C. Mann.
[University of Southern California. Information Sciences Institute.
ISI/SR-84-148. 1984.]
101354 A PERSPECTIVE ON NAME SYSTEM DESIGN.
P. Mockapetris and J. Postel.
[University of Southern California. Information Sciences Institute.
ISI/RS-85-152. 1985.]
101355 TRANSPORTABILITY IN THE CONSUL SYSTEM: MODEL MODULARITY AND
ACQUISITION.
David Wilczynski and Norman Sondheimer.
[University of Southern California. Information Sciences Institute.
ISI/RR-85-154. 1985.]
101356 ARTIFICIAL INTELLIGENCE PROJECT AT THE UNIVERSITY OF TEXAS AT AUSTIN.
PROPOSAL TO ARMY RESEARCH OFFICE, 22 NOVEMBER 1983. PRINCIPAL
INVESTIGATORS: GORDON S. NOVAK JR. AND ROBERT L. CAUSEY.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-84-1. 1983.]
101357 COMPUTING DISCOURSE CONCEPTUAL COHERENCE: A MEANS TO CONTEXTUAL
REFERENCE RESOLUTION.
Ezat Karimi.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-84-2. 1984. Thesis (M.A.). Also issued as TR-84-28, Department
of Computer Sciences, University of Texas, Austin.]
101358 TRANSLATING HORN CLAUSES FROM ENGLISH.
Yeong-Ho Yu.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-84-3. 1984. Thesis (M.A.). Also issued as TR-84-29, Department
of Computer Sciences, University of Texas, Austin.]
101359 KNOWLEDGE BASED CONTEXTUAL REFERENCE RESOLUTION FOR TEXT
UNDERSTANDING.
Michael Kavanagh Smith.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-02. 1985.]
101360 LEARNING PROBLEM SOLVING: A PROPOSAL FOR CONTINUED RESEARCH.
Bruce W. Porter.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-03. 1985.]
101361 TOWARDS MECHANICAL METAMATHEMATICS.
N. Shankar.
[University of Texas, Austin. Institute for Computing Science.
Technical report 43. 1984.]
101362 A MECHANICAL PROOF OF THE CHURCH ROSSER THEOREM.
N. Shankar.
[University of Texas, Austin. Institute for Computing Science.
Technical report 45. 1985.]
101363 PARALLEL BLOCK JACOBI EIGENVALUE ALGORITHMS USING SYSTOLIC ARRAYS.
David Scott and Robert C. Ward.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-01. 1985.]
101364 A PARADIGM FOR DETECTING QUIESCENT PROPERTIES IN DISTRIBUTED
COMPUTATIONS.
K. Mani Chandy and Jayadev Misra.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-02. 1985.]
101365 A MULTIPARAMETER ANALYSIS OF THE BOUNDEDNESS PROBLEM FOR VECTOR
ADDITION SYSTEMS.
Louis E. Rosier and Hsu-Chun Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-03. 1985.]
101366 AUTOMATED DEDUCTION IN PROGRAMMING LANGUAGE SEMANTICS: THE MECHANICAL
CERTIFICATION OF PROGRAM TRANSFORMATIONS TO DERIVE CONCURRENCY.
Christian Lengauer and Chua-Huang Huang.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-04. 1985.]
101367 GENERATING UNIQUE IDENTIFIERS IN A DISTRIBUTED SYSTEM.
Gad J. Dafni.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-05. 1985.]
101368 A MODEL OF CAD TRANSACTIONS.
Francois Bancilhon, Won Kim, and Henry F. Korth.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-06. 1985.]
101369 BIASED B-TREES.
Hans-Juergen Boehm and Norman Hutchinson.
[University of Washington. Department of Computer Science. Technical
report 83-12-05. 1983.]
101370 ESTIMATING THE MULTIPLICITIES OF CONFLICTS IN MULTIPLE ACCESS
CHANNELS.
Albert G. Greenberg, Philippe Flajolet, and Richard E. Ladner.
[University of Washington. Department of Computer Science. Technical
report 84-09-02. 1984.]
101371 DYNAMIC LOAD SHARING IN HOMOGENOUS DISTRIBUTED SYSTEMS.
Derek L. Eager, Edward D. Lazowska, and John Zahorjan.
[University of Washington. Department of Computer Science. Technical
report 84-10-01. 1984.]
101372 HETEROGENEOUS MICROREGISTER ALLOCATION IN TUNING MICROPROGRAMMABLE
MACHINES.
Robert Lewis Tomlinson Jr.
[University of Washington. Department of Computer Science. Technical
report 84-12-01. 1984. Thesis (Ph.D.).]
101373 PICT: EXPERIMENTS IN THE DESIGN OF INTERACTIVE, GRAPHICAL PROGRAMMING
ENVIRONMENTS.
Ephraim Philip Glinert.
[University of Washington. Department of Computer Science. Technical
report 85-01-01. 1985. Thesis (Ph.D.).]
101374 EFFICIENT ALGORITHMS FOR COMPUTING GEOMETRIC INTERSECTIONS.
Garret Frederick Swart.
[University of Washington. Department of Computer Science. Technical
report 85-01-02. 1985. Thesis (Ph.D.).]
101375 PARALLEL TAG DISTRIBUTION SORT.
J.-L. Baer et al.
[University of Washington. Department of Computer Science. Technical
report 85-01-03. 1985.]
101376 SUPPORTING DISTRIBUTED APPLICATIONS: EXPERIENCE WITH EDEN.
Andrew P. Black.
[University of Washington. Department of Computer Science. Technical
report 85-03-02. 1985.]
101377 THE PARALLEL COMPLEXITY OF EXPONENTIATING POLYNOMIALS OVER FINITE
FIELDS.
Faith E. Fich and Martin Tompa.
[University of Washington. Department of Computer Science. Technical
report 85-03-01. 1985.]
101378 AN ANNOTATED BIBLIOGRAPHY ON COMPUTER RELIABILITY AND NUCLEAR WAR.
Alan Borning.
[University of Washington. Department of Computer Science. Technical
report 85-03-03. 1985.]
VOL. 7, NO. 7 07/18/85
101379 A COMPUTATIONAL THEORY OF METAPHOR COMPREHENSION AND ANALOGICAL
REASONING.
Bipin Indurkhya.
[Boston University. Department of Computer Science. Technical report
85/001. 1985. Thesis (Ph.D.). Thesis performed for the University of
Massachusetts, Amherst.]
101380 A SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.
Peter Gacs and John H. Reif.
[Boston University. Department of Computer Science. Technical report
85/002. 1985.]
101381 NONERGODIC ONE DIMENSIONAL MEDIA AND RELIABLE COMPUTATION (AN
INFORMAL OVERVIEW).
Peter Gacs.
[Boston University. Department of Computer Science. Technical report
85/003. 1985.]
101382 EVERY SEQUENCE IS REDUCIBLE TO A RANDOM ONE.
Peter Gacs.
[Boston University. Department of Computer Science. Technical report
85/004. 1985.]
101383 (1) AVERAGE CASE COMPLETE PROBLEMS. (2) ONE WAY FUNCTIONS AND
PSEUDORANDOM GENERATORS. (3) COMPUTATIONAL COMPLEXITY OF FUNCTIONS.
Leonid A. Levin.
[Boston University. Department of Computer Science. Technical report
85/005. 1985.]
101384 AUTOMATIC CONSTRAINT GENERATION FOR SEMANTIC QUERY OPTIMIZATION.
Michael Siegel and Edward Sciore.
[Boston University. Department of Computer Science. Technical report
85/006. 1985.]
101385 PLACEMENT OF COMMUNICATING PROCESSES ON MULTIPROCESSOR NETWORKS.
Craig S. Steele.
[California Institute of Technology. Computer Science Department.
Report no. 5184:TR:85. 1985. Thesis (Ph.D.).]
101386 AN INVERSE LIMIT CONSTRUCTION OF A DOMAIN OF INFINITE LISTS.
Young-il Choo.
[California Institute of Technology. Computer Science Department.
Report no. 5188:TR:85. 1985.]
101387 CONCURRENCY ALGEBRA AND PETRI NETS.
Young-il Choo.
[California Institute of Technology. Computer Science Department.
Report no. 5190:TR:85. 1985.]
101388 A COMPUTER PACKAGE FOR CALCULATING TEMPERATURE DISTRIBUTIONS IN
MACHINING FROM FORCE, SHEAR ANGLE AND CONTACT LENGTH MEASUREMENTS.
M. G. Stevenson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-3.
1985.]
101389 REACHABLE GRASPS ON A POLYGON: THE CONVEX ROPE ALGORITHM.
M. A. Peshkin and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-6.
1985.]
101390 PSRL: AN SRL-BASED PRODUCTION RULE SYSTEM REFERENCE MANUAL FOR PSRL
VERSION 1.2.
Michael D. Rychener.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-7.
1985.]
101391 A PERTURBATION APPROACH TO ROBOT CALIBRATION.
H. O. K. Kirchner, B. Gurumoorthy, and F. B. Prinz.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-9.
1985.]
101400 ORDERING ACTIONS FOR VISIBILITY.
Martin S. McHendry.
[Georgia Institute of Technology. School of Information and Computer
Science. GIT-ICS-84/05. 1984.]
101401 DESIGN OF A HYBRID BUS AND RING LOCAL AREA NETWORK.
Oliver C. Ibe and Pin-Yee Chen.
[Georgia Institute of Technology. School of Information and Computer
Science. GIT-ICS-84/06. 1984.]
101402 ARCHITECTURE FOR CONCURRENT PROCESSING IN RASTER GRAPHICS SYSTEMS.
Bruce F. Naylor and Pin-Yee Chen.
[Georgia Institute of Technology. School of Information and Computer
Science. GIT-ICS-84/08. 1984.]
101403 CHANNEL ROUTING.
Michael Burnstein.
[International Business Machines Corporation (IBM). Research
Division. RC 10973. 1985.]
101404 THE RESEARCH QUEUEING PACKAGE: SUBMODELS AND ARRAYS.
Edward A. MacNair.
[International Business Machines Corporation (IBM). Research
Division. RC 10983. 1985.]
101405 DISCRETE LOGARITHMS IN GF(P).
Don Coppersmith, Andrew M. Odlyzko, and Richard Schroeppel.
[International Business Machines Corporation (IBM). Research
Division. RC 10985. 1985.]
101406 A PRACTICAL PROCEDURE FOR COMPUTING EIGENVALUES OF LARGE SPARE
NONSYMETRIC MATRICES.
Jane Cullum and Ralph A. Willoughby.
[International Business Machines Corporation (IBM). Research
Division. RC 10988. 1985.]
101407 DISTRIBUTED PROCESSING INVOLVING PERSONAL COMPUTERS AND MAINFRAME
HOSTS.
Francis N. Parr, Joshua S. Auerbach, and Barry C. Goldstein.
[International Business Machines Corporation (IBM). Research
Division. RC 10990. 1985.]
101408 BOUNDED DISORDER ACCESS METHOD.
Witold Litwin and David B. Lomet.
[International Business Machines Corporation (IBM). Research
Division. RC 10992. 1985.]
101409 ON TURING'S FORMULA FOR WORD PROBABILITIES.
Arthur Nadas.
[International Business Machines Corporation (IBM). Research
Division. RC 11006. 1985.]
101410 A RANKING ALGORITHM FOR MOS CIRCUIT LAYOUTS.
C. Andrew Neff and Ravi Nair.
[International Business Machines Corporation (IBM). Research
Division. RC 11018. 1985.]
101411 DESIGN-PERFORMANCE TRADE-OFFS IN CMOS DOMINO LOGIC.
Vojin G. Oklobdzija and Robert K. Montoye.
[International Business Machines Corporation (IBM). Research
Division. RC 11020. 1985.]
101412 BEHAVIORAL ISSUES IN SPEECH-BASED REMOTE INFORMATION RETRIEVAL.
Mary Beth Rosson and Nicholas M. Mellen.
[International Business Machines Corporation (IBM). Research
Division. RC 11028. 1985.]
101413 LISTENER TRAINING FOR SPEECH-OUTPUT APPLICATIONS.
Mary Beth Rosson.
[International Business Machines Corporation (IBM). Research
Division. RC 11029. 1985.]
101414 A METHODOLOGY FOR PREDICTING MULTIPROCESSOR PERFORMANCE.
Alan Norton and Gregory F. Pfister.
[International Business Machines Corporation (IBM). Research
Division. RC 11030. 1985.]
101415 OPTIMAL SAMPLING OF HOLOMORPHIC FUNCTIONS: II.
Stephen D. Fisher and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 11035. 1985.]
101416 ON OPTIMALLY COMBINING PIECES OF INFORMATION, WITH APPLICATION TO
ESTIMATING 3-D COMPLEX OBJECT-POSITION FROM RANGE DATA.
Ruud M. Bolle and David B. Cooper.
[International Business Machines Corporation (IBM). Research
Division. RC 11037. 1985.]
101417 RECTILINEAR SHORTEST PATHS AND MINIMUM SPANNING TREES IN THE PRESENCE
OF RECTILINEAR OBSTACLES.
Y. F. Wu et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11037. 1985.]
101418 ON SOME UNION AND INTERSECTION PROBLEMS FOR POLYGONS WITH FIXED
ORIENTATIONS.
P. Widmayer et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11040. 1985.]
101419 A FASTER APPROXIMATION ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS.
Y. F. Wu, P. Widmayer, and C. K. Wong.
[International Business Machines Corporation (IBM). Research
Division. RC 11041. 1985.]
101420 DISTANCE PROBLEMS IN COMPUTATIONAL GEOMETRY FOR FIXED ORIENTATIONS.
P. Widmayer, Y. F. Wu, and C. K. Wong.
[International Business Machines Corporation (IBM). Research
Division. RC 11042. 1985.]
101421 SOME OPTIMAL SCHEMES FOR ALU IMPLEMENTATION IN VSLI TECHNOLOGY.
Vojin G. Oklobdzija and Earl R. Barnes.
[International Business Machines Corporation (IBM). Research
Division. RC 11044. 1985.]
101422 THE IBM RESEARCH PARALLEL PROCESSOR PROTOTYPE (RP3): INTRODUCTION AND
ARCHITECTURE.
G. F. Pfister et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11060. 1985.]
101423 "HOT SPOT" CONTENTION AND COMBINING IN MULTISTAGE INTERCONNECTION
NETWORKS.
G. F. Pfister and V. A. Norton.
[International Business Machines Corporation (IBM). Research
Division. RC 11061. 1985.]
101424 FAST FAULT SIMULATION USING THE YORKTOWN SIMULATION ENGINE.
Z. Barzilai, L. Huisman, and P. Vrance.
[International Business Machines Corporation (IBM). Research
Division. RC 11068. 1985.]
101425 HIGH-SPEED I/O IN A MULTIPROSSESING ENVIRONMENT.
Ron Cytron and Harlan Husmann.
[International Business Machines Corporation (IBM). Research
Division. RC 11069. 1985.]
101426 PROBABILISTIC MODELING OF COMPUTER SYSTEM AVAILABILITY.
Ambuj Goyal and Stephen S. Lavenberg.
[International Business Machines Corporation (IBM). Research
Division. RC 11076. 1985.]
101427 FAST HOUGH TRANSFORM.
Hungwen Li, Mark A. Lavin, and Ronald J. LeMaster.
[International Business Machines Corporation (IBM). Research
Division. RC 11080. 1985.]
101428 GLOBAL GARBAGE COLLECTION FOR DISTRIBUTED HEAP STORAGE SYSTEMS.
Khayri M. Ali and Seif Haridi.
[International Business Machines Corporation (IBM). Research
Division. RC 11082. 1985.]
101429 NUMERICAL EVALUATION OF GUARANTEED AVAILABILITY.
Ambuj Goyal and Asser N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 11083. 1985.]
101430 RESOURCE ALLOCATION IN A LARGE DECENTRALIZED ENTERPRISE.
Denos C. Gazis.
[International Business Machines Corporation (IBM). Research
Division. RC 11085. 1985.]
101431 A FUTURE DIRECTION IN STOCHASTIC MODELING: THE APPLICATION OF
INTERACTIVE ANALYSIS AND COMPUTER GRAPHICS.
Philip Heidelberger, Randolph D. Nelson, and Peter D. Welch.
[International Business Machines Corporation (IBM). Research
Division. RC 11088. 1985.]
101432 HOW TO CONTROL BENCHMARKS OF LARGE SYSTEMS.
Martin G. Kienzle.
[International Business Machines Corporation (IBM). Research
Division. RC 11093. 1985.]
101433 THE RELATIONSHIP OF PEAK TO SUSTAINED PERFORMANCE IN HIGHLY
CONCURRENT VECTOR MACHINE ORGANIZATIONS.
James J. Hack.
[International Business Machines Corporation (IBM). Research
Division. RC 11094. 1985.]
101434 LIMITS FOR AUTOMATIC PROGRAM VERIFICATION.
Krzystog R. Apt and Dexter C. Kozen.
[International Business Machines Corporation (IBM). Research
Division. RC 11095. 1985.]
101435 BOXER - A DESIGN-TO-BUILD SYSTEM. SYSTEM ARCHITECTURE STUDY.
Timothy Patrick Daly.
[International Business Machines Corporation (IBM). Research
Division. RC 11096. 1985.]
101436 PUSH DISTRIBUTION STRATEGIES AS VIEWED AT THE FACTORY.
D. H. Withers.
[International Business Machines Corporation (IBM). Research
Division. RC 11101. 1985.]
101437 COMBINATORICAL ASPECTS OF MULTIVARIATE SPLINES.
Wolfgang Dahmen and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 11105. 1985.]
101438 PCAUDIO - A DIGITAL AUDIO RECORDING AND PLAYOUT SUSTEM.
David L. Reich.
[International Business Machines Corporation (IBM). Research
Division. RC 11107. 1985.]
101439 ATTRIBUTE PROPAGATION BY MESSAGE PASSING.
Alan Demers and Anne Rogers.
[International Business Machines Corporation (IBM). Research
Division. RC 11109. 1985.]
101440 ON THE USE OF COMPUTER GENERATED SYMMETRIZED DOT-PATTERNS FOR THE
VISUAL CHARACTERIZATION OF SPEECH WAVEFORMS AND OTHER SAMPLED DATA.
Clifford A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 11110. 1985.]
101441 A PRACTICAL METHOD FOR LR AND LL SYNTACTIC ERROR DIAGNOSIS AND
RECOVERY.
Michael G. Burke and Gerald A. Fisher.
[International Business Machines Corporation (IBM). Research
Division. RC 11111. 1985.]
101442 THE GROTHENDIECK CONJECTURE AND PADE APPROXIMATIONS.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. RC 11120. 1985.]
101443 APPLICATIONS OF PADE APPROXIMATIONS TO THE GROTHENDIECK CONJECTURE ON
LINEAR DIFFERENTIAL EQUATIONS.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. RC 11121. 1985.]
101444 APPLICATIONS OF PADE APPROXIMATIONS TO DIOPHANTINE INEQUALITIES IN
VALUES OF G-FUNCTION.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. RC 11122. 1985.]
101445 STRUCTURED PROCESS: A NEW LANGUAGE ATTRIBUTE FOR BETTER INTERACTION
OF PARALLEL ARCHITECTURE AND ALGORITHM.
Hungwen Li, Ching-Chy Wang, and Mark A. Lavin.
[International Business Machines Corporation (IBM). Research
Division. RC 11124. 1985.]
101446 THE 1984 OLYMPIC MESSAGE SYSTEM -- A CASE STUDY IN SYSTEM DESIGN.
Stephen J. Boies et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11138. 1985.]
101447 A GRAPHICAL SYSTEM FOR WORK-CELL LAYOUT EVALUATION.
Rangarajan Jayaraman.
[International Business Machines Corporation (IBM). Research
Division. RC 11148. 1985.]
101448 FINITE GRAPHS WITH TWO INEQUIVALENT FACTORIZATIONS UNDER THE
COMPOSITION OPERATOR.
Don Coppersmith.
[International Business Machines Corporation (IBM). Research
Division. RC 11149. 1985.]
101449 COMPUTING MINIMA AND MAXIMA OF DIGITAL IMAGES IN THE IBM 7350 AND
OTHER IMAGE PROCESSING SYSTEMS WITHOUT HARDWARE COMPARATORS.
Jorge L. C. Sanz and Myron D. Flickner.
[International Business Machines Corporation (IBM). Research
Division. RJ 4354. 1985.]
101450 PLACING TILES IN THE PLANE.
Andrei Broder and Barbara Simons.
[International Business Machines Corporation (IBM). Research
Division. RJ 4602. 1985.]
101451 THE BLOCK-PROCESSING FTF ADAPTIVE ALGORITHM.
John M. Cioffi.
[International Business Machines Corporation (IBM). Research
Division. RJ 4613. 1985.]
101452 COMPUTING PROJECTIONS OF DIGITAL IMAGES IN GENERAL PURPOSE IMAGE
PROCESSING PIPELINE ARCHITECTURES.
Jorge L. C. Sanz and Eric Hinkle.
[International Business Machines Corporation (IBM). Research
Division. RJ 4617. 1985.]
101453 AN INTERNATIONAL SEMANTICS FOR MODAL LOGIC: PRELIMINARY REPORT.
Ronald Fagin and Moshe Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. RJ 4656. 1985.]
101454 BELIEF, AWARENESS, AND LIMITED REASONING: PRELIMINARY REPORT.
Ronald Fagin and Joseph Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. RJ 4657. 1985.]
101455 RECURRENCE AND REGENERATION IN NON-MARKOVIAN NETWORKS OF QUEUES.
Peter J. Haas and Gerald S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 4671. 1985.]
101456 R*: A DISTRIBUTED DATA SHARING SYSTEM.
Robert A. Yost and Laura M. Haas.
[International Business Machines Corporation (IBM). Research
Division. RJ 4676. 1985.]
101457 A REVIEW OF DIGITAL IMAGE PROCESSING TECHNIQUES FOR DOCUMENT HANDLING
AND OTHER APPLICATIONS.
Kwan Y. Wong and Jorge L. C. Sanz.
[International Business Machines Corporation (IBM). Research
Division. RJ 4681. 1985.]
101458 OBJECT-ORIENTED DATABASE CONCEPTS FOR ENGINEERING APPLICATIONS.
Klaus R. Dittrich and Raymond A. Lorie.
[International Business Machines Corporation (IBM). Research
Division. RJ 4691. 1985.]
101459 SIMULATING PROBABILISTIC BY DETERMINISTIC ALGEBRAIC COMPUTATION TREES.
Friedhelm Meyer auf der Heide.
[International Business Machines Corporation (IBM). Research
Division. RJ 4694. 1985.]
101460 NONDETERMINISTIC VERSUS PROBABILISTIC LINEAR SEARCH ALGORITHMS.
Friedhelm Meyer auf der Heide.
[International Business Machines Corporation (IBM). Research
Division. RJ 4695. 1985.]
101461 ANALYSIS OF ARQ PROTOCOLS IN A MULTIPROCESS ENVIRONMENT.
P. S. Kritzinger.
[International Business Machines Corporation (IBM). Research
Division. RZ 1367. 1985.]
101462 HIGHER-LEVEL SYNCHRONIZING DEVICES IN MEIJE-SCCS.
Robert de Simone.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 360. 1985.]
101463 ON A GENERALIZATION OF THE PRE-EMPTIVE RESUME PRIORITY.
Philippe Nain.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 361. 1985.]
101464 ALGEBRAIC CALCULI OF PROCESSES AND NET EXPRESSIONS.
Georges Gonthier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 367. 1985.]
101465 LE SYSTEM KB: PRESENTATION ET BIBLIOGRAPHIE, MISE EN OEUVRE.
Francois Fages.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 368. 1985.]
101466 ANALYSIS OF GRID FILE ALGORITHMS.
Mireille Regnier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 369. 1985.]
101467 LORIC: UN SIMULATEUR RESEAU DE PETRI ECRIT EN MACLISP.
Vrassidas-Ioannis Leopoulos.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 371. 1985.]
101468 RECAL: A NEW EFFICIENT ALGORITHM FOR THE EXACT ANALYSIS OF
MULTIPLE-CHAIN CLOSED QUEUEING NETWORKS.
A. E. Conway and N. D. Georganas.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 373. 1985.]
101469 AN OVERVIEW OF THE MULTIDATABASE SYSTEM NRDSM.
Witold Litwin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 374. 1985.]
101470 ERROR DIAGNOSIS IN LOGIC PROGRAMMING, AN ADAPTATION OF E.Y. SHAPIRO'S
METHOD.
Gerard Ferrand.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 375. 1985.]
101471 DIALOGUE CONTROL STRATEGIES IN ORAL COMMUNICATION.
Pierre Falzon, Rene Amalberti, and Noelle Carbonell.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 377. 1985.]
101472 SIGNAL: A DATA FLOW ORIENTED LANGUAGE FOR SIGNAL PROCESSING.
Albert Benveniste et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 378. 1985.]
101473 ITERATIVE METHODS FOR THE NUMERICAL SOLUTION OF MIXED FINITE ELEMENT
APPROXIMATIONS OF THE STOKES PROBLEM.
Rudiger Verfurth.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 379. 1985.]
101474 CEYX - VERSION 15. I: UNE INITIATION.
Jean-Marie Hullot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 44. 1985.]
101475 CEYX - VERSION 15. II: PROGRAMMER EN CEYX.
Jean-Marie Hullot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 45. 1985.]
101476 CEYX - VERSION 15. III: VPRINT, LE COMPOSEUR CEYX.
Gerard Berry and Jean-Marie Hullot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 46. 1985.]
101477 TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING.
Frank Thomson Leighton.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-272. 1985.]
101478 GENERALIZED PLANAR MATCHING.
Fran Berman et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-273. 1985.]
101479 QUALITATIVE SIMULATION OF MECHANICS.
Benjamin Kuipers.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-274. 1985.]
101480 THE BYZANTINE FIRING SQUAD PROBLEM.
James E. Burns and Nancy A. Lynch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-275. 1985.]
101481 REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTS.
Danny Dolev et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-276. 1985.]
101482 A GENERAL LOWER BOUND FOR ELECTING A LEADER IN A RING.
Nancy A. Lynch and Greg N. Frederickson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-277. 1985.]
020328 MULTIPLE INHERITANCE IN CONTEMPORARY PROGRAMMING LANGUAGES.
Daniel J. Carnese.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-328. 1984. Thesis (Ph.D.).]
020329 QUALITATIVE MATHEMATICAL REASONING.
Elisha Sacks.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-329. 1984.]
020330 INTERACTIVE ON-LINE CONFERENCES.
Sunil Kumar Sarin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-330. 1984. Thesis (Ph.D.). "This report is a
minor revision of a thesis with the same title submitted to the
Department of Electrical Engineering and Computer Science on June 15,
1984, in partial fulfillment of the requirements for the Degree of
Doctor of Philosophy. Substantive changes were made in sections
5.3.2 and 7.1 only."]
020331 DISTRIBUTED NAME MANAGEMENT.
Karen Rosin Sollins.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-331. 1985. Thesis (Ph.D.). "Submitted to the
Department of Electrical Engineering and Computer Science on February
14, 1985 in partial fulfillment of the requirements for the degree of
Doctor of Philosophy."]
020332 RESOURCE MANAGEMENT FOR THE TAGGED TOKEN DATAFLOW ARCHITECTURE.
David E. Culler.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-332. 1985. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on January
18, 1985 in partial fulfillment of the requirements for the Degree of
Master of Science."]
020333 PARALLEL SIMULATION OF DIGITAL LSI CIRCUITS.
Jeffrey M. Arnold.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-333. 1985. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on February
8, 1985 in partial fulfillment of the requirements for the Degree of
Master of Science."]
020334 AN APPROACH TO FUNCTIONAL OFFICE AUTOMATION.
Craig L. Zarmer.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-334. 1984. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on April
30, 1984, in partial fulfillment of the requirements for the Degree
of Master of Science."]
020335 SYNCHRONIZING CLOCKS IN A DISTRIBUTED SYSTEM.
Jennifer Lundelius.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-335. 1984. Thesis (M.S.). Submitted to the
Department of Electrical Engineering and Computer Science on August
17, 1984 in partial fulfillment of the requirements for the Degree of
Master of Science.]
020336 SOME IMPLICATIONS OF COMPLEXITY THEORY ON PSEUDO-RANDOM BIT
GENERATION.
Stephen Trilling.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-336. 1985. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on January
18, 1985 in partial fulfillment of the requirements for the Degree of
Master of Science."]
020337 A HARDWARE ASSISTED METHODOLOGY FOR VLSI DESIGN RULE CHECKING.
Larry Dean Seiler.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-337. 1985. Thesis (Ph.D.). "Submitted to the
Department of Electrical Engineering and Computer Science on
February 1, 1985 in partial fulfillment of the requirements for the
Degree of Doctor of Philosophy."]
101483 A PARALLEL MEDIAN ALGORITHM.
Richard Cole and Chee K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 126. 1984.]
101484 CONFORMAL MAPPING SOLUTION OF LAPLACE'S EQUATION ON A POLYGON WITH
OBLIQUE DERIVATIVE BOUNDARY CONDITIONS.
Lloyd N. Trefethen and Williams Ruth J..
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 127. 1984.]
101485 A SEMANTIC APPROACH TO CORRECTNESS OF CONCURRENT TRANSACTION
EXECUTIONS.
Paul G. Spirakis and Alexander Tuzhilin.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 130. 1984.]
101486 DECISION PROCEDURES FOR ELEMENTARY SUB-LANGUAGES OF SET THEORY: V.
MULTI-LEVEL SYLLOGISTIC EXTENDED BY THE GENERAL UNION OPERATOR.
Cantone D., A. Ferro, and J. T. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 131. 1984.]
101487 THE RECTILINEAR CONVEX SKULL PROBLEM.
Derick Wood and Chee K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 132. 1984. Also issued
as Robotics report 30.]
101488 THE VOLUME OF THE UNION OF MANY SPHERES AND POINT INCLUSION PROBLEMS.
Paul G. Spirakis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 133. 1984. Also issued
as Robotics report 35.]
101489 FINDING EULER TOURS IN PARALLEL.
Mikhail Atallah and Uzi Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 134. 1984. Also issued
as Ultracomputer note 73.]
101490 OPTIMAL PARALLEL PATTERN MATCHING IN STRINGS.
Uzi Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 135. 1984. Also issued
as Ultracomputer note 74.]
101491 SHAPE AND FUNCTION OF SOLID OBJECTS: SOME EXAMPLES.
Ernest Davis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 137. 1984.]
101492 ON SHORTEST PATHS IN POLYHEDRAL SPACES.
Micha Sharir and Amir Schorr.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 138. 1984. Also issued
as Robotics report 31.]
101493 GENERALIZED VORONOI DIAGRAMS FOR MOVING A LADDER: I. TOPOLOGICAL
ANALYSIS.
C. O'Dunlaing, M. Sharir, and C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 139. 1984. Also issued
as Robotics report 32.]
101494 GENERALIZED VORONOI DIAGRAMS FOR A LADDER: II. EFFICIENT CONSTRUCTION
OF THE DIAGRAM.
C. O'Dunlaing, M. Sharir, and C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 140. 1984. Also issued
as Robotics report 33.]
101495 LOOK-UP TABLE COMPUTATION FOR RATIO IMAGE DEPTH SENSOR.
C. Marc Bastuscheck.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 141. 1984. Also issued
as Robotics report 34.]
101496 PARTITIONING POINT SETS IN 4 DIMENSIONS.
Richard Cole.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 142. 1984.]
101497 BYZANTINE AGREEMENT BY DISTRIBUTED RANDOMIZATION IN O(LOG N) ROUNDS.
John H. Reif and Paul G. Spirakis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 143. 1984. Revised.]
101498 A HIGH LEVEL REAL-TIME PROGRAMMING LANGUAGE.
Ernest Davis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 145. 1984. Also issued
as Robotics report 36.]
101499 A TIME-INDEPENDENT DEFINITION OF SOFTWARE RELIABILITY.
Stewart N. Weiss and Elaine J. Weyuker.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 146. 1985.]
101500 A SELF-ORGANIZING DATABASE SYSTEM: A DIFFERENT APPROACH TO QUERY
OPTIMIZATION.
Gregory Piatetsky-Shapiro.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 147. 1984. Thesis
(Ph.D).]
101501 ASSET: A SYSTEM TO SELECT AND EVALUATE TESTS.
Phyllis Frankl, Stewart N. Weiss, and Elaine J. Weyuker.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 148. 1985.]
101502 EVALUATING SOFTWARE COMPLEXITY MEASURES.
Elaine J. Weyuker.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 149. 1985.]
101503 DYNAMIC GRID EMBEDDING: OPTIMIZING THE COMPRESSION OF PARTIAL GRIDS.
John Ellis et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 151. 1985.]
101504 THE DESIGN AND ANALYSIS OF A DISTRIBUTED PROCESSING SYSTEM.
Andrew Green.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 152. 1985. Thesis
(M.S.).]
101505 ON INTERSECTION OF PLANAR JORDAN CURVES.
Ron Livne and Micha Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 153. 1985. Also issued
as Robotics report 37.]
101506 POLYNOMIAL MINIMUM ROOT SEPARATION (NOTE TO A PAPER OF S.M. RUMP).
J. T. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 155. 1985. Also issued
as Robotics report 39.]
101507 DECISION PROCEDURES FOR ELEMENTARY SUB-LANGUAGES OF SET THEORY. VI.
MULTI-LEVEL SYLLOGISTIC EXTENDED BY THE POWERSET OPERATOR.
D. Cantone, A. Ferro, and J. T. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 156. 1985.]
101508 JOIN PROCESSING IN A SYMMETRIC PARALLEL ENVIRONMENT.
Dennis Shasha and Paul G. Spirakis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 158. 1985.]
101509 FINDING MINIMAL CONVEX NESTED POLYGONS.
Alok Aggarwal et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 159. 1985. Also issued
as Robotics report 41.]
101510 A TAXONOMIC TABLE OF PARALLEL COMPUTERS, BASED ON 55 DESIGNS.
J. T. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 69. 1983.]
101511 SIMULATING SHARED-MEMORY PARALLEL COMPUTERS.
Seth Abraham, Allan Gottieb, and Clyde Kruskal.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 70. 1984.]
101512 SYNCHRONOUS COMBINING OF FETCH-AND-ADD OPERATIONS.
Malcolm Harrison.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 71. 1984.]
101513 IMAGE PROCESSING ON THE NYU ULTRACOMPUTER.
Robert A. Hummel.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 72. 1984.]
101514 PLISP USERS' MANUAL.
Arzit Yannai.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 75. 1984.]
101515 DESIGN ALTERNATIVES FOR ULTRAPERFORMANCE PARALLEL COMPUTERS.
J. T. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 76. 1984.]
101516 A REMARK ON "A VARIABLE LENGTH SHIFT REGISTER."
Allan Gottieb.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 77. 1985.]
101517 HIGHLY PARALLEL ADA - ADA ON AN ULTRACOMPUTER.
Edith Schonberg and Edmond Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 81. 1985.]
101518 OPERATING SYSTEM CONSIDERATION FOR LARGE-SCALE MIMD MACHINES.
Jan Edler, Allan Gottieb, and Jim Lipkis.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 82. 1985.]
101519 KNOWLEDGE REPRESENTATION SYSTEM IN MEDICAL DIAGNOSIS.
Joanna Tyrcha.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 541. 1984.]
101520 REASONING ABOUT DATABASE CONSTRAINTS.
Ewa Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 543. 1984.]
101521 LOGIC OF NONDETERMINISTIC INFORMATION.
Ewa Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 545. 1984.]
101522 LOGIC OF INDISCERNIBILITY RELATIONS.
Ewa Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 546. 1985.]
101523 SEMANTICAL ANALYSIS OF INDUCTIVE REASONING.
Ewa Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 547. 1984.]
101524 THE MONTAGUE FORMALIZATION OF NATURAL LANGUAGE.
Ewa Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 548. 1984.]
101525 ON CERTAIN PROBLEM OF RESOURCE ALLOCATION IN SYSTEMS OF CONCURRENT
PROGRAMS.
Zbigniew Suraj.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 549. 1984.]
101526 DECISION-MAKING WITH UPPER AND LOWER PROBABILITIES.
Slawomir Wierzchon.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 550. 1984.]
101527 MECHANICAL REASONING IN FUZZY LOGICS.
Ewa Orlowska and Slawomir Wierzchon.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 551. 1984.]
101528 CK-LOG, A CALCULUS FOR KNOWLEDGE PROCESSING IN LOGIC.
C. V. Srinivasan.
[Rutgers. Department of Computer Science. DCS-TR-153. 1984.]
101529 INTEGRITY CHECKING FOR MULTIPLE UPDATES.
A. Hsu and T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-155. 1985.]
101530 PIECEWISE-POLYNOMIAL QUADRATURES FOR CAUCHY SINGULAR INTEGRALS.
A. Gerasoulis.
[Rutgers. Department of Computer Science. DCS-TR-156. 1985.]
101531 COMMUNICATION DENIAL IN CSP.
Richard M. Nemes.
[Rutgers. Department of Computer Science. DCS-TR-157. 1985.]
101532 SOME RESULTS ON THE PEBBLE COMPLEXITY OF SETS OF STRINGS.
A. Yasuhara.
[Rutgers. Laboratory for Computer Science Research. CTA-TR-7. 1984.]
101533 EXTENDING AUTHORIZATION BY ADDING OBLIGATIONS TO PERMISSIONS.
N. H. Minsky and A. Lockman.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-67. 1985.]
101534 UNIFYING THE USE AND EVOLUTION OF DATABASE SYSTEMS: A CASE STUDY IN
PROLOG.
N. H. Minsky, D. Rozenshtein, and J. Chomicki.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-68. 1985.]
101535 A LOWER BOUND TO THE COMPLEXITY OF EUCLIDEAN AND RECTILINEAR MATCHING
ALGORITHMS.
M. D. Grigoriadis and B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-69. 1985.]
101536 LANGUAGE FEATURES FOR FLEXIBLE HANDLING OF EXCEPTIONS IN INFORMATION
SYSTEMS.
A. Borgida.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-70. 1985.]
101537 REASONING IN MULTIPLE BELIEF SPACES.
Joao P. Martins.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 203. 1983. Thesis (Ph.D.).]
101538 DEFAULT REASONING IN A.I. SYSTEMS.
Jane Terry Nutter.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 204. 1983. Thesis (M.S.).]
101539 CONTROL FLOW, DATA FLOW AND PROGRAM COMPLEXITY.
Enrique I. Oviedo.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 205. 1983. Thesis (Ph.D.).]
101540 NAIVE PHYSICS AND THE PHYSICS OF DIFFUSION, OR: WHEN INTUITION FAILS.
Shoshana L. Hardt.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 211. 1984.]
101541 KNOWLEDGE BASED PARSING.
Jeanette G. Neal and Stuart C. Shapiro.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 213. 1984.]
101542 OPTICAL CHARACTER RECOGNITION TECHNIQUES IN MAIL SORTING: A REVIEW OF
ALGORITHMS.
Jonathan J. Hull et al.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 214. 1984.]
101543 BELIEF REPRESENTATION AND QUASI-INDICATORS.
William J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 215. 1984. Thesis (M.S.).]
101544 SEARLE'S EXPERIMENTS WITH THOUGHT.
William J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 216. 1984.]
101545 REVIEW OF LAMBERT'S "MEINONG AND THE PRINCIPLE OF INDEPENDENCE."
William J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 217. 1984.]
101546 ON THE GENERAL GRAPH EMBEDDING PROBLEM WITH APPLICATIONS TO CIRCUIT
LAYOUT.
Jonathan S. Turner.
[Washington University, Saint Louis. Department of Computer Science.
WUCS-84-1. 1984.]
101547 ON THE PROBABLE PERFORMANCE OF HEURISTICS FOR BANDWIDTH MINIMIZATION.
Jonathan S. Turner.
[Washington University, Saint Louis. Department of Computer Science.
WUCS-84-2. 1984.]
101548 FUNCTIONAL DESCRIPTION OF CONNECTOR-SWITCH-ATTENUATOR NETWORKS.
Eduard Cerny and Jan Gecsei.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 479. 1983.]
101549 LOGICON: AN INTEGRATION OF PROLOG INTO ICON.
Guy Lapalme and Suzanne Chapleau.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 516. 1985.]
101550 TESTING COLLAPSIBILITY IN CONTINGENCY TABLES.
Gilles R. Ducharme and Yves Lapage.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 519. 1985.]
101551 SIMULATION OF MOS CIRCUITS BY DECISION DIAGRAMS.
Eduard Cerny and Jan Gecsei.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 520. 1984.]
101552 GENERALIZED UNIFICATION IN PROLOG.
Michel Boyer and Guy Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 521. 1985.]
101553 GENERATING PARAPHRASES FROM MEANING-TEXT SEMANTIC NETWORKS.
Michel Boyer and Guy Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 522. 1985.]
101554 A HIGHLY PRECISE TAYLOR SERIES METHOD FOR STIFF O.D.E.'S.
F. Jalbert and R. V. M. Zahar.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 523. 1985.]
101555 USE OF PROLOG FOR BUILDING PROTOCOL DESIGN TOOLS.
G. V. Bochmann et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 524. 1985.]
101556 A TEST DESIGN METHODOLOGY FOR PROTOCOL TESTING.
B. Sarikaya, G. V. Bochmann, and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 525. 1985.]
101557 LES SYSTEMES EXPERTS DANS LA SYNTHESE ET L'ANIMATION DES IMAGES.
N. Magnenat-Thalmann and D. Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 526. 1985.]
101558 A NEW TOOL FOR BUSINESS GRAPHICS: THE ANIMATED DATA SYSTEM.
N. Magnenat-Thalmann and D. Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 527. 1985.]
101559 SUBACTOR DATA TYPES AS HIERARCHICAL PROCEDURAL MODEL FOR COMPUTER
ANIMATION.
N. Magnenat-Thalmann and D. Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 528. 1985.]
101560 3D COMPUTER ANIMATION: MORE AN EVOLUTION PROBLEM THAN A MOTION
PROBLEM.
Magnenat-Thalmann. N. and D. Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 529. 1985.]
101561 SINGLE AND MULTIPLE VIRTUAL MOVIE-CAMERAS FOR SPECIAL CINEMATOGRAPHIC
EFFECTS.
N. Magnenat-Thalmann and D. Thalmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 530. 1985.]
VOL. 7, NO. 8 08/23/85
025052 FRED TERMAN, THE FATHER OF SILICON VALLEY.
Carolyn E. Tajnai.
[Stanford University. Department of Computer Science.
STAN-CS-85-1052. 1985. Also issued as Technical report 85-276,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
025053 TRANSACTION CLASSIFICATION TO SURVIVE A NETWORK PARTITION.
Peter M. G. Apers and Gio Wiederhold.
[Stanford University. Department of Computer Science.
STAN-CS-85-1053. 1985.]
025054 WEIGHTED RANDOM MAPPINGS: PROPERTIES AND APPLICATIONS.
Andrei Zary Broder.
[Stanford University. Department of Computer Science.
STAN-CS-85-1054. 1985. Thesis (Ph.D.).]
101562 A GENERAL MODEL OF PRODUCTION: THEORY AND APPLICATION.
Steven T. Hackman.
[University of California, Berkeley. Operations Research Center. ORC
84-2. 1984. Thesis (Ph.D.).]
101563 A CRITIQUE OF DEMING'S DISCUSSION OF ACCEPTANCE SAMPLING PROCEDURES.
Richard E. Barlow and Xiang Zhang.
[University of California, Berkeley. Operations Research Center. ORC
85-1. 1985.]
101564 AN ADAPTIVE RESPONSE RATE TO MONITOR EXPONENTIAL SMOOTHING.
Duk Bin Jun and Robert M. Oliver.
[University of California, Berkeley. Operations Research Center. ORC
85-2. 1985.]
101565 STATISTICAL ESTIMATION OF SOFTWARE RELIABILITY.
Sheldon M. Ross.
[University of California, Berkeley. Operations Research Center. ORC
85-3. 1985.]
101566 A NOTE ON THE PROBLEM OF ELECTING A LEADER IN A SYNCHRONOUS RING.
Eli Gafni.
[University of California, Los Angeles. Computer Science Department.
CSD-850001. 1985.]
101567 SORTING AND SELECTION IN MULTI-CHANNEL BROADCAST NETWORKS.
John M. Marberg and Eli Gafni.
[University of California, Los Angeles. Computer Science Department.
CSD-850002. 1985.]
101568 TIME AND MESSAGE BOUNDS FOR ELECTION IN SYNCHRONOUS AND ASYNCHRONOUS
COMPLETE NETWORKS.
Yehuda Afek.
[University of California, Los Angeles. Computer Science Department.
CSD-850003. 1985.]
101569 A DENOTATIONAL SEMANTICS FOR SHARED-MEMORY PARALLELISM AND
NONDETERMINISM.
Daniel M. Berry.
[University of California, Los Angeles. Computer Science Department.
CSD-850004. 1985.]
101570 A TUTORIAL ON THE ANALYSIS OF POLLING SYSTEMS.
Hideaki Takagi and Leonard Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-850005. 1985.]
101571 DISTRIBUTED SIMULATION, ALGORITHMS AND PERFORMANCE ANALYSIS.
Behrokh Samadi.
[University of California, Los Angeles. Computer Science Department.
CSD-850006. 1985. Thesis (Ph.D.).]
101572 PRIOR PROBABILITIES REVISITED.
Norman Dalkey.
[University of California, Los Angeles. Computer Science Department.
CSD-850007. 1985.]
101573 ELECTION AND TRAVERSAL IN UNIDIRECTIONAL NETWORKS.
Eli Gafni and Yehuda Afek.
[University of California, Los Angeles. Computer Science Department.
CSD-850008. 1985.]
101574 ON THE THEORY OF DISTRIBUTED SYSTEMS.
Leonard Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-850009. 1985.]
101575 MEMORY BASED PROCESSING FOR CROSS CONTEXTUAL REASONING: REMINDING AND
ANALOGY USING THEMATIC STRUCTURES.
Charles Dolan.
[University of California, Los Angeles. Computer Science Department.
CSD-850010. 1985. Thesis (M.S.).]
101576 CHARACTERIZATION OF INTERMODULE COMMUNICATIONS AND HEURISTIC TALK
ALLOCATION FOR DISTRIBUTED REAL-TIME ANALYSIS.
Lance Min-Tsung Lan.
[University of California, Los Angeles. Computer Science Department.
CSD-850012. 1985. Thesis (Ph.D.).]
101577 SINGLE LEADER ELECTION PROTOCOLS USING NONUNIFORM MERITS.
Malcolm R. Railey and Jane W. S. Liu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1197. 1985.]
101578 SUBSTANTIAL CONSTRUCTIVE INDUCTION USING LAYERED INFORMATION
COMPRESSION: TRACTABLE FEATURE FORMATION IN SEARCH.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1198. 1985. Revised.]
101579 POLYLITH, THE EARLY GOALS.
James M. Purtilo.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1208. 1985.]
101580 A NUMERICAL METHOD TO SOLVE PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS
BY SEMIDISCRETIZATION IN TIME.
Hon Wah Tam.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1210. 1985. Thesis (M.S.).]
101581 A SCIENTIFIC APPROACH TO PARTIAL INDUCTION.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1211. 1985.]
101582 PERFORMANCE STUDY OF TWO PHASE LOCKING IN SINGLE-SITE AND DISTRIBUTED
DATABASE SYSTEMS.
Kwok Hung Pun.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1212. 1985. Thesis (Ph.D.).]
101583 AN IMPLEMENTATION OF PATH PASCAL.
Dirk Claus Grunwald.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1213. 1985. Thesis (M.S.).]
101584 AN INDUCTIVE APPROACH FOR PROGRAM EVALUATION, OR (A MATHEMATICAL
APPROACH FOR SEMANTIC ANALYSIS).
Teodor Rus.
[University of Iowa. Department of Computer Science. Technical report
85-02. 1985.]
101585 EXTENSIONS TO THE IOWA LOGIC SPECIFICATION LANGUAGE.
George Sophocles Singer.
[University of Iowa. Department of Computer Science. Technical report
85-03. 1985. Thesis (M.S.).]
101586 BABBLE REFERENCE MANUAL.
A. C. Fleck.
[University of Iowa. Department of Computer Science. Technical report
85-04. 1985.]
101587 CONTOUR EVOLUTION, NEIGHBORHOOD DEFORMATION AND GLOBAL IMAGE FLOW:
PLANAR SURFACES IN MOTION.
Allen M. Waxman and Kwangyoen Wohn.
[University of Maryland. Computer Science Center. CS-TR-1349. 1984.
Also issued as CAR-TR-58, Center for Automation Research, University
of Maryland.]
101588 EXPERIMENTS IN RECOVERING SURFACE ORIENTATION FROM TEXTURE.
Stanley M. Dunn, Larry S. Davis, and Hannu A. Hakalahti.
[University of Maryland. Computer Science Center. CS-TR-1399. 1984.
Also issued as CAR-TR-61, Center for Automation Research, University
of Maryland.]
101589 DECOMPOSING STACKS OF 2D ARRAYS INTO ELLIPSOID-LIKE OBJECTS.
Tsaiyun Phillips and Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1400. 1984.
Also issued as CAR-TR-62, Center for Automation Research, University
of Maryland.]
101590 PARALLEL SEARCHING AND MERGING ON ZMOB.
Simon Kasif.
[University of Maryland. Computer Science Center. CS-TR-1405. 1984.
Also issued as CAR-TR-64, Center for Automation Research, University
of Maryland.]
101591 CIRCULAR SHUFFLE NETWORK: A LARGE SCALE MULTIPROCESSOR
INTERCONNECTION NETWORK.
Satish K. Tripathi and Shing-Tsaan Huang.
[University of Maryland. Computer Science Center. TR-1406. 1984.]
101592 FINITE STATE MODEL AND COMPATIBILITY THEORY: NEW ANALYSIS TOOLS FOR
PERMUTATION NETWORKS.
Shing-Tsaan Huang and Satish K. Tripathi.
[University of Maryland. Computer Science Center. TR-1407. 1984.]
101593 PASSIVE RANGING TO KNOWN PLANAR POINT SETS.
Yubin Hung, Pen-Shu Yeh, and David Harwood.
[University of Maryland. Computer Science Center. CS-TR-1408. 1984.
Also issued as CAR-TR-65, Center for Automation Research, University
of Maryland.]
101594 A FAST PARALLEL ALGORITHM FOR DOT LINKING IN GLASS PATTERNS.
Ari Gross, Ralph Hartley, and Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1410. 1984.
Also issued as CAR-TR-67, Center for Automation Research, University
of Maryland.]
101595 THE FRANZ LISP - C INTERFACE.
Fred P. Andresen.
[University of Maryland. Computer Science Center. CS-TR-1411. 1984.
Also issued as CAR-TR-68, Center for Automation Research, University
of Maryland.]
101596 SEMANTICS USAGE AND QUERY OPTIMIZATION IN DEDUCTIVE DATABASES.
U. S. Chakravarthy, D. H. Fishman, and J. Minker.
[University of Maryland. Computer Science Center. TR-1413. 1984.]
101597 THE INTELLIGENT CHANNEL: A SCHEME FOR AND/OR PARALLELISM IN LOGIC
PROGRAMS.
Simon Kasif and Jack Minker.
[University of Maryland. Computer Science Center. TR-1414. 1984.]
101598 THE PRISM MACHINE: AN ALTERNATIVE TO THE PYRAMID.
Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1416. 1984.
Also issued as CAR-TR-70, Center for Automation Research, University
of Maryland.]
101599 AN IMAGE FLOW SIMULATOR.
Sarvajit S. Sinha and Allen M. Waxman.
[University of Maryland. Computer Science Center. CS-TR-1417. 1984.
Also issued as CAR-TR-71, Center for Automation Research, University
of Maryland.]
101600 A GAUSSIAN-WEIGHTED MULTI-RESOLUTION EDGE DETECTOR.
Ralph Hartley.
[University of Maryland. Computer Science Center. CS-TR-1418. 1984.
Also issued as CAR-TR-72, Center for Automation Research, University
of Maryland.]
101601 STUDY OF A HIGH-LEVEL-LANGUAGE COMPUTER SYSTEM FOR ADA.
Bernard Lecussan.
[University of Maryland. Computer Science Center. TR-1419. 1984.]
101602 DYNAMIC STEREO: PASSIVE RANGING TO MOVING OBJECTS FROM RELATIVE IMAGE
FLOWS.
Allan M. Waxman and Sarvajit S. Sinha.
[University of Maryland. Computer Science Center. CS-TR-1421. 1984.
Also issued as CAR-TR-74, Center for Automation Research, University
of Maryland.]
101603 ON THE INFERENCE OF APPROXIMATION PROGRAMS.
Carl H. Smith and Mahendran Velauthapillai.
[University of Maryland. Computer Science Center. TR-1427. 1984.]
101604 PROBLEM SOLVING METHODS FOR PATTERN RECOGNITION.
Laveen N. Kanal and G. R. Dattatreya.
[University of Maryland. Computer Science Center. TR-1428. 1984.]
101605 DECISION TREES IN PATTERN RECOGNITION.
G. R. Dattatreya and Laveen N. Kanal.
[University of Maryland. Computer Science Center. TR-1429. 1984.]
101606 IN THREE-DIMENSIONAL SPACE, THE TIME REQUIRED TO ADD N NUMBERS IS O(N
SUPERSCRIPT 1/4).
David C. Fisher.
[University of Maryland. Computer Science Center. TR-1431. 1984.]
101607 A MODEL FOR THE ANALYSIS OF NEIGHBOR FINDING IN POINTER-BASED
QUADTREES.
Hanan Samet and Clifford A. Shaffer.
[University of Maryland. Computer Science Center. CS-TR-1432. 1984.
Also issued as CAR-TR-84, Center for Automation Research, University
of Maryland.]
101608 YOU CAN (SOMETIMES) TELL AN IMAGE BY ITS COVER.
Robert A. Melter.
[University of Maryland. Computer Science Center. CS-TR-1433. 1984.
Also issued as CAR-TR-85, Center for Automation Research, University
of Maryland.]
101609 A DESIGN LANGUAGE WITH UNIFIED CONTROL/DATA/FUNCTION ABSTRACTION.
Qian Cui and Raymond T. Yeh.
[University of Maryland. Computer Science Center. TR-1434. 1984.]
101610 SEGMENTATION OF OPTICAL FLOW FIELDS BY PYRAMID LINKING.
Ralph Hartley.
[University of Maryland. Computer Science Center. CS-TR-1435. 1984.
Also issued as CAR-TR-86, Center for Automation Research, University
of Maryland.]
101611 COMPUTATION OF MINIMAL ISOVIST SETS.
Mark F. Doherty.
[University of Maryland. Computer Science Center. CS-TR-1436. 1984.
Also issued as CAR-TR-87, Center for Automation Research, University
of Maryland.]
101612 TARGET TRACKING BASED SCENE ANALYSIS.
Nader Kazor.
[University of Maryland. Computer Science Center. CS-TR-1437. 1984.
Also issued as CAR-TR-88, Center for Automation Research, University
of Maryland.]
101613 BIPARTITE GRAPH MATCHING FOR POINTS ON A LINE OR A CIRCLE.
Michael Werman, Shmuel Peleg, and Robert A. Melter.
[University of Maryland. Computer Science Center. CS-TR-1440. 1984.
Also issued as CAR-TR-89, Center for Automation Research, University
of Maryland.]
101614 A DISTANCE METRIC FOR MULTIDIMENSIONAL HISTOGRAMS.
Michael Werman, Shmuel Peleg, and Azriel Rosenfeld.
[University of Maryland. Computer Science Center. CS-TR-1441. 1984.
Also issued as CAR-TR-90, Center for Automation Research, University
of Maryland.]
101615 STRUCTURAL COVERAGE OF FUNCTIONAL TESTING.
Victor R. Basili and James Ramsey.
[University of Maryland. Computer Science Center. TR-1442. 1984.]
101616 THE OBJECT MODEL: A HISTORICAL PERSPECTIVE.
Larry Koved.
[University of Maryland. Computer Science Center. TR-1443. 1984.]
101617 THREE WINDOW SYSTEMS.
Mark Weiser, Chris Torek, and Richard J. Wood.
[University of Maryland. Computer Science Center. TR-1444. 1983.]
101618 A COMPLEXITY MEASURE FOR DATA FLOW MODELS.
Howard E. Motteler and Carl H. Smith.
[University of Maryland. Computer Science Center. TR-1445. 1984.]
101619 PARADIGMS FOR DESIGN AND IMPLEMENTATION IN ADA.
Vaclav Rajlich.
[University of Michigan. Computing Research Laboratory. CRL-TR-43-84.
1984.]
101620 A SEMI-MARKOV MODEL FOR MEMORY INTERFERENCE IN MULTIPROCESSORS.
T. N. Mudge, H. B. Al-Sadoun, and B. A. Makrucki.
[University of Michigan. Computing Research Laboratory. CRL-TR-44-84.
1984.]
101621 MEASUREMENT OF FAULT LATENCY: METHODOLOGY AND EXPERIMENTAL RESULTS.
K. G. Shin and Y. H. Lee.
[University of Michigan. Computing Research Laboratory. CRL-TR-45-84.
1984.]
101622 PERFORMANCE MODELING OF REAL-TIME MULTIPROCESSORS WITH TIME-SHARED
BUSES.
Michael H. Woodbury and Kang G. Shin.
[University of Michigan. Computing Research Laboratory. CRL-TR-46-84.
1984.]
101623 C-NET: A COST-EFFECTIVE MULTISTAGE INTERCONNECTION NETWORK.
Kang G. Shin and Jyh-Charn Liu.
[University of Michigan. Computing Research Laboratory. CRL-TR-47-84.
1984.]
101624 CHARACTERIZATION OF FAILURE HANDLING IN FAULT-TOLERANT MULTIPROCESSOR
SYSTEMS.
Yann-Hang Lee.
[University of Michigan. Computing Research Laboratory. CRL-TR-48-84.
1984. Thesis (Ph.D.).]
101625 MARKOVIAN QUEUEING NETWORK MODELS FOR PERFORMANCE EVALUATION OF
MULTIPLE-BUS MULTIPROCESSOR SYSTEMS.
I. H. Onyuksel.
[University of Michigan. Computing Research Laboratory. CRL-TR-49-84.
1984.]
101626 EXPECTED COMPUTATION TIME FOR HAMILTONIAN PATH PROBLEM AND CLIQUE
PROBLEM.
Y. Gurevich and S. Shelah.
[University of Michigan. Computing Research Laboratory. CRL-TR-50-84.
1984.]
101627 SOME METHODS FOR COMPUTING COMPONENT DISTRIBUTION PROBABILITIES IN
RELATIONAL STRUCTURES.
K. Compton.
[University of Michigan. Computing Research Laboratory. CRL-TR-51-84.
1984.]
101628 TWO-DIMENSIONAL SYSTOLIC ARRAYS: CHARACTERIZATIONS AND APPLICATIONS.
Oscar H. Ibarra and Michael A. Palis.
[University of Minnesota. Computer Science Department. Technical
report 85-1. 1985.]
101629 VLSI ARCHITECTURE FOR LU DECOMPOSITION.
Kam Hoi Cheng and Sartaj Sahni.
[University of Minnesota. Computer Science Department. Technical
report 85-2. 1985.]
101630 ON EFFICIENT SIMULATION OF SYSTOLIC ARRAYS BY SEQUENTIAL MACHINES.
Oscar H. Ibarra and Michael A. Palis.
[University of Minnesota. Computer Science Department. Technical
report 85-3. 1985.]
101631 EFFICIENT ALGORITHMS FOR LAYER ASSIGNMENT PROBLEMS.
K. C. Chang and H. C. Du.
[University of Minnesota. Computer Science Department. Technical
report 85-4. 1985.]
101632 VLSI ALGORITHMS FOR SOME PATTERN RECOGNITION AND SEQUENCE COMPARISON
PROBLEMS.
Oscar H. Ibarra and Michael A. Palis.
[University of Minnesota. Computer Science Department. Technical
report 85-5. 1985.]
101633 SOME COMPLEXITY RESULTS ON SORTING AND RELATED NETWORKS.
Moon Jung Chung and B. Ravikumar.
[University of Minnesota. Computer Science Department. Technical
report 85-8. 1985.]
101634 A NEW VLSI SYSTEM FOR ADAPTIVE RECURSIVE FILTERING.
Kam Hoi Cheng and Sartaj Sahni.
[University of Minnesota. Computer Science Department. Technical
report 85-9. 1985.]
101635 ON SOME DECISION QUESTIONS CONCERNING REGULAR AND CONTEXT-FREE
LANGUAGES.
Oscar H. Ibarra and B. Ravikumar.
[University of Minnesota. Computer Science Department. Technical
report 85-10. 1985.]
101636 DYNAMIC FILE ORGANIZATIONS FOR PARTIAL MATCH RETRIEVAL BASED ON
LINEAR HASHING.
T. S. Yuen and H. C. Du.
[University of Minnesota. Computer Science Department. Technical
report 85-11. 1985.]
101637 GARDEN PATH ERRORS IN MEDICAL DIAGNOSIS.
Paul E. Johnson and James B. Moen.
[University of Minnesota. Computer Science Department. Technical
report 85-12. 1985.]
101638 A CRASH RESISTANT UNIX FILE SYSTEM.
J. A. Anyanwu and L. F. Marshall.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 195. 1985.]
101639 CAN DESIGN FAULTS BE TOLERATED.
T. Anderson.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 196. 1985.]
101640 DESIGN AND DEVELOPMENT OF COMMUNICATION PROTOCOLS FOR LOCAL AREA
NETWORKS.
F. Panzieri.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 197. 1985. Thesis (Ph.D.).]
101641 AN APPROACH TO PROGRAM REASONING BASED ON A FIRST ORDER LOGIC FOR
PARTIAL FUNCTIONS.
Olaf Owe.
[University of Oslo. Institute for Informatics. Report no. 89. 1985.
Revised, February 1985. "This report is a revised version of computer
science technical report number CS-081, Dept. of Electrical
Engineering and Computer Sciences, University of San Diego...June
1984."]
101642 A PRESENTATION OF THE SPECIFICATION AND VERIFICATION PROJECT "ABEL."
Ole-Johan Dahl and Olaf Owe.
[University of Oslo. Institute for Informatics. Report no. 90. 1984.]
101643 INFORMATION PROCESSES VS. DATA PROCESSES.
Jens Kaasboll.
[University of Oslo. Institute for Informatics. Report no. 91. 1985.]
101644 PROGRAMMER'S GUIDE TO THE PROVER SYSTEM. THORALF - A THEOREM PROVER.
Rolf Nossum.
[University of Oslo. Institute for Informatics. Report no. 92. 1985.]
101645 A TAXONOMY OF USER-ORIENTED FUNCTIONS.
James A. Carter.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-1. 1985.]
101646 IS THE FACT THAT THE EMPEROR HAS NO CLOTHES A SUBJECT WORTHY OF
PUBLICATION.
W. K. Grassmann.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-2. 1985.]
101647 A COMPARISON OF RECEIVER-INITIATED AND SENDER-INITIATED DYNAMIC LOAD
SHARING.
D. L. Eager, Edward D. Lazowska, and John Zahorjan.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-5. 1985.]
101648 SURVEY OF META SYSTEMS FOR INFORMATION PROCESSING SYSTEM
SPECIFICATION ENVIRONMENTS.
J. M. Dedourek, P. G. Sorenson, and J. P. Tremblay.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-6. 1985.]
101649 THE ASYMPTOTIC VARIANCE OF THE TIME AVERAGE IN A BIRTH-DEATH PROCESS.
W. K. Grassmann.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-7. 1985.]
101650 NUMERICAL SOLUTIONS OF THE WAITING TIME OF THE GI/G/1 QUEUE.
W. K. Grassmann and Joti L. Jain.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-8. 1985.]
101651 THE PH(TO THE X)/M/C QUEUE.
W. K. Grassmann.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-9. 1985.]
101652 SEMANTIC AND SYNTACTIC PROPERTIES OF UNIVERSAL RELATION SCHEME DATA
BASES.
Kent Laver.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-163. 1985. Thesis (Ph.D.).]
101653 QUERY ANSWERING AND SCHEMA ANALYSIS UNDER THE WEAK INSTANCE MODEL.
Edward P. F. Chan.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-164. 1984. Thesis (Ph.D.).]
101654 MESSAGE FLOW ANALYSIS.
Oscar Marius Nierstrasz.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-165. 1984. Thesis (Ph.D.).]
101655 ITERATIVE ANALYSIS OF NETWORK QUEUES: METHODS OF SOLUTION USING
DECOMPOSITION AND THE PRINCIPLE OF MAXIMUM ENTROPY.
Berend Robbe Jouke Walstra.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-166. 1984. Thesis (Ph.D.).]
101656 VERY FAST PARALLEL MATRIX AND POLYNOMIAL ARITHMETIC.
Wayne Eberly.
[University of Toronto. Department of Computer Science. Technical
report 178/85. 1985. Thesis (M.S.).]
101657 RELATIVIZED CIRCUIT SIZE AND DEPTH.
Christopher B. Wilson.
[University of Toronto. Department of Computer Science. Technical
report 179/85. 1985. Thesis (Ph.D.).]
101658 INTERPOLANTS FOR RUNGE-KUTTA FORMULAS.
W. H. Enright, K. R. Jackson, and S. P. Norsett.
[University of Toronto. Department of Computer Science. Technical
report 180/85. 1985.]
101659 THE PARALLEL COMPLEXITY OF ABELIAN PERMUTATION GROUP PROBLEMS.
Pierre McKenzie and Stephen A. Cook.
[University of Toronto. Department of Computer Science. Technical
report 181/85. 1985.]
101660 A FAST PARALLEL ALGORITHM FOR RECOGNITION OF PARENTHESIS LANGUAGES.
Arvind Gupta.
[University of Toronto. Department of Computer Science. Technical
report 182/85. 1985. Thesis (M.S.).]
101661 LOW ORDER RUNGE-KUTTA-NYSTROM METHODS WITH INTERPOLANTS.
J. M. Fine.
[University of Toronto. Department of Computer Science. Technical
report 183/85. 1985.]
101662 MAPLE: A SAMPLE INTERACTIVE SESSION.
Bruce W. Char, Keith O. Geddes, and Gaston H. Gonnet.
[University of Waterloo. Department of Computer Science. Research
report CS-85-01. 1985.]
101663 REASSEMBLING POLYGONS FROM EDGES.
Richard I. Hartley.
[University of Waterloo. Department of Computer Science. Research
report CS-85-04. 1985.]
101664 THE DECIDABILITY OF THE DTOL SEQUENCE EQUIVALENCE PROBLEM AND RELATED
DECISION PROBLEMS.
Karel Culik II and Juhani Karhumaki.
[University of Waterloo. Department of Computer Science. Research
report CS-85-05. 1985.]
101665 TRANSLATION OF SYSTOLIC ALGORITHMS BETWEEN SYSTEMS OF DIFFERENT
TOPOLOGY.
Karel Culik II and Sheng Yu.
[University of Waterloo. Department of Computer Science. Research
report CS-85-06. 1985.]
101666 INTERPRETING DESCRIPTIONS IN A PROLOG-BASED KNOWLEDGE REPRESENTATION
SYSTEM.
Randy Goebel.
[University of Waterloo. Department of Computer Science. Research
report CS-85-08. 1985.]
101667 CONCURRENT PROLOG IN A MULTI-PROCESS ENVIRONMENT.
Rosanna K. S. Lee and Randy Goebel.
[University of Waterloo. Department of Computer Science. Research
report CS-85-09. 1985.]
101668 STUDENT MODELS: THE GENETIC GRAPH APPROACH.
Barbara Jane Wasson.
[University of Waterloo. Department of Computer Science. Research
report CS-85-10. 1985. Thesis (Master of Mathematics in Computer
Science).]
101669 A COMPARATIVE STUDY OF PATTERN RECOGNITION AND ARTIFICIAL
INTELLIGENCE TECHNIQUES OR THE DEVELOPMENT OF INTELLIGENT SYSTEMS.
Sheila A. McIlraith.
[University of Waterloo. Department of Computer Science. Research
report CS-85-11. 1985.]
101670 INDUCTIVE CONCEPT LEARNING USING THE ARTIFICIAL INTELLIGENCE APPROACH.
Bruce F. Cockburn.
[University of Waterloo. Department of Computer Science. Research
report CS-85-12. 1985.]
101671 STATEGIES FOR TEACHING UNDERGRADUATE PROGRAMMING.
Guy Tremblay.
[University of Waterloo. Department of Computer Science. Research
report CS-85-13. 1985.]
101672 AUTOMATED DISCOVERY.
Paul R. VanArragon.
[University of Waterloo. Department of Computer Science. Research
report CS-85-14. 1985.]
101673 WHEREOF ONE CANNOT SPEAK...OR, WHAT'S REALLY IN YOUR MIND?
PRESIDENTIAL ADDRESS, SOCIETY FOR PHILOSOPHY AND PSYCHOLOGY.
Zenon W. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Technical memorandum (COGMEM) 13. 1983. "Based on the presidential
address delivered to the Eighth Annual Meeting of the Society for
Philosophy and Psychology held in London, Ontario, May 1982."]
101674 CONSTITUENT-GAP DEPENDENCIES IN NORWEGIAN: AN ACCEPTABILITY STUDY.
Chet A. Creider.
[University of Western Ontario. Centre for Cognitive Science.
Technical memorandum (COGMEM) 14. 1984.]
101675 THE SEMANTIC ROLE OF NOUN CLASSIFIERS.
J. Peter Denny.
[University of Western Ontario. Centre for Cognitive Science.
Technical memorandum (COGMEM) 16. 1984.]
101676 LARGE ADJUSTMENTS IN VISUALLY GUIDED REACHING DO NOT DEPEND ON VISION
OF THE HAND OR PERCEPTION OF TARGET DISPLACEMENT.
M. A. Goodale, D. Pelisson, and C. Prablanc.
[University of Western Ontario. Centre for Cognitive Science.
Technical memorandum (COGMEM) 18. 1985.]
101677 RECOVERY ARCHITECTURES FOR MULTIPROCESSOR DATABASE MACHINES.
Rakesh Agrawal and David J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 573. 1985.]
101678 PARALLELISM IN DISTRIBUTED PROGRAMS: MEASUREMENT AND PREDICTION.
Barton P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 574. 1985.]
101679 ON MGR[V] MULTIGRID METHODS.
David Kamowitz and Seymour V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 575. 1985.]
101680 OBJECT RECOGNITION USING HOUGH PYRAMIDS.
Charles F. Neveu, Charles R. Dyer, and Roland T. Chin.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 576. 1985.]
101681 MULTIGRID AND MGR[V] METHODS FOR DIFFUSION EQUATIONS.
Seymour V. Parter and David Kamowitz.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 577. 1985.]
101682 CODE SCHEDULING METHODS FOR SOME ARCHITECTURAL FEATURES IN PIPE.
James R. Goodman and Honesty C. Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 579. 1985.]
101683 CACHE MEMORY OPTIMIZATION TO REDUCE PROCESSOR/MEMORY TRAFFIC.
James R. Goodman.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 580. 1985.]
101684 SHIFT ARITHMETIC ON A TOKEN RING NETWORK.
Miron Livny and Udi Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 581. 1985.]
101685 EFFICIENT SUPPORT OF STATISTICAL OPERATIONS.
Setrag N. Khoshafian, Douglas M. Bates, and David J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 582. 1985.]
101686 MULTIPROCESSOR HASH-BASED JOIN ALGORITHMS.
David J. DeWitt and Robert Gerber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 583. 1985.]
101687 AN EVALUATION OF BUFFER MANAGEMENT STATEGIES FOR RELATIONAL DATABASE
SYSTEMS.
Hong-Tai Chou and David J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 584. 1985.]
101688 EXTENSIBLE DATABASE SYSTEMS.
Michael J. Carey and David J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 585. 1985.]
101689 ON THE COMPLEXITY OF REACHABILITY AND MOTION PLANNING QUESTIONS.
Deborah A. Joseph and W. Harry Plantinga.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 586. 1985.]
101690 SOME EXPERIMENTAL RESULTS ON DISTRIBUTED JOIN ALGORITHMS IN A LOCAL
NETWORK.
Michael J. Carey and Hongjun Lu.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 587. 1985.]
101691 DIB - A DISTRIBUTED IMPLEMENTATION OF BACKTRACKING.
Raphael Finkel and Udi Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 588. 1985.]
101692 PERFORMANCE EVALUATION OF A PIPELINED VLSI ARCHITECTURE USING THE
GRAPH MODEL OF BEHAVIOR (GMB).
J. T. Hsieh, A. R. Pleszkun, and M. K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 589. 1985.]
101693 THE PERFORMANCE OF ALTERNATIVE STATEGIES FOR DEALING WITH DEADLOCKS
IN DATABASE MANAGEMENT SYSTEMS.
Rakesh Agrawal, Michael J. Carey, and Larry W. McVoy.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 590. 1985.]
101694 A PYRAMIDAL APPROACH FOR THE RECOGNITION OF NEURONS USING KEY
FEATURES.
Ze-nian Li and Leonard Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 591. 1985.]
101695 DPM: A MEASUREMENT SYSTEM FOR DISTRIBUTED PROGRAMS.
Barton P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 592. 1985.]
101696 A GENERALIZED TIMED PETRI NET MODEL FOR PERFORMANCE ANALYSIS.
Mark A. Holliday and Mary K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 593. 1985.]
101697 EXACT PERFORMANCE ESTIMATES FOR MULTIPROCESSOR MEMORY AND BUS
INTERFERENCE.
Mark A. Holliday and Mary K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 594. 1985.]
101698 NETWORK OPTIMIZATION.
R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 595. 1985.]
101699 DESIGN AND IMPLEMENTATION OF A DISTRIBUTED SYSTEMS LANGUAGE.
Michael Lee Scott.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 596. 1985. Thesis (Ph.D.).]
101700 BUFFER MANAGEMENT OF DATABASE SYSTEMS.
Hong-Tai Chou.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 597. 1985. Thesis (Ph.D.).]
101701 LIPSCHITZ CONTINUITY OF SOLUTIONS OF LINEAR INEQUALITIES, PROGRAMS
AND COMPLEMENTARITY PROBLEMS.
O. L. Mangasarian and T.-H. Shiau.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 599. 1985.]
101702 C SUPERSCRIPT INFINITY-REGULARITY FOR THE POROUS MEDIUM EQUATION.
K. Hollig and H.-O. Kreiss.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 600. 1985.]
101703 A PYRAMID IMPLEMENTATION USING A RECONFIGURABLE ARRAY OF PROCESSORS.
Peter A. Sandon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 601. 1985.]
101704 3-D MULTIVIEW OBJECT REPRESENTATIONS FOR MODEL-BASED OBJECT
RECOGNITION.
Matthew R. Korn and Charles R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 602. 1985.]
101705 A TREATMENT OF COLLECTION DATA AS CONSTRUCTOR ALGEBRAS.
Harold Boley.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI Project.
Memo SEKI-84-06. 1984.]
101706 INTERIM 3-LISP REFERENCE MANUAL.
Brian Cantwell Smith and Jim des Rivieres.
[Xerox Corporation. Palo Alto Research Center. Intelligent Systems
Laboratory. ISL-1. 1984.]
101707 A FINITE NUMBER SYSTEM FOR DIGITAL COMPUTERS WHICH GIVES EXACT
RESULTS WITH RATIONAL OPERANDS.
R. T. Gregory.
[University of Tennessee. Computer Science Department. CS-84-57.
1984.]
101708 A PYRAMID-BASED APPROACH TO SEGMENTATION APPLIED TO REGION MATCHING.
William I. Grosky and Ramesh Jain.
[Wayne State University. Department of Computer Science. CS-85-002.
1985.]
101709 LOGIC PROGRAMMING AND INDUCTIVE DEFINITION.
Masami Hagiya.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-420. 1983.]
101710 A THEORY OF SCHEMA LABELLING.
William Havens.
[University of British Columbia. Department of Computer Science.
Technical report 84-16. 1985. Revised, June 1985.]
101711 STABILITY OF TWO DIMENSIONAL IMMISCIBLE FLOW TO VISCOUS FINGERING.
Michael J. King, W. B. Lindquist, and L. Reyna.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-244. 1985.]
101712 KNOWLEDGE-BASED COMPILATION.
Gordon Kotik.
[Kestrel Institute. KES.U.83.5. 1984.]
101713 IMPROVING AVAILABILITY OF SOFTWARE SUBSYSTEMS THROUGH ON-LINE ERROR
DETECTION.
Larry Koved and Gerald Waldbaum.
[International Business Machines Corporation (IBM). Research
Division. RC 11141. 1985.]
101714 INTEGRATED INTERACTIVE INCREMENTAL PROGRAMMING ENVIRONMENT BASED ON
COMPILATION.
Boris Magnusson and Sten Minor.
[1985.]
101715 A FORMAL DEFINITION OF PROLOG.
R. A. O'Keefe.
[University of Auckland. Department of Computer Science. Auckland
computer science report 36. 1985.]
101716 MAXIMUM MATCHINGS IN GENERAL GRAPHS THROUGH RANDOMIZATION.
Michael O. Rabin and Vijay V. Vazirani.
[Harvard University. Center for Research in Computing Technology.
TR-15-84. 1984.]
101717 AN EXPERIMENTAL SYSTEM FOR COMPUTER AIDED GEOMETRIC DESIGN.
Richard F. Riesenfeld and Kent F. Smith.
[University of Utah. Department of Computer Science. UUCS-84-008.
1984.]
101718 BEWERTUNGSFUNKTIONEN IN SCHACHPROGRAMMEN.
Dieter Steinwender.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 1 09. 1984.]
101719 TRIGGERS AND INFERENCE IN DATA BASE SYSTEMS.
M. Stonebraker.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL M85/46. 1985.]
101720 A STUDY OF DIFFERENT METHODS FOR SOLVING BAND FORMED LINEAR-SYSTEMS
ON THE CDC CYBER 205.
Per Wahlund.
[University of Uppsala. Department of Computer Science. Report no.
98. 1985.]
101721 THE GAUSSIAN DERIVATIVE THEORY OF SPATIAL VISION: ANALYSIS OF
CORTICAL CELL RECEPTIVE FIELD LINE-WEIGHTING PROFILES.
Richard A. Young.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-4920. 1985.]
101722 OLD IDEAS AND NEW VIEWPOINTS IN ARTIFICIAL INTELLIGENCE: THE BIRTH OF
EXPERT SYSTEMS.
Richard Stanley Zemel.
[Harvard University. 1984. Thesis (B.A.). "A thesis presented...to
the Committee on History and Science in partial fulfillment of the
requirements for the degree of Bachelor of Arts, Harvard
University,..., March 1984."]
VOL. 7, NO. 9 09/20/85
101723 NEW UPPER BOUNDS FOR NEIGHBOR SEARCHING.
B. Chazelle et al.
[Brown University. Computer Science Department. Technical report
CS-84-11. 1984.]
101724 ON A CIRCLE PLACEMENT PROBLEM.
B. Chazelle and D. T. Lee.
[Brown University. Computer Science Department. Technical report
CS-84-12. 1984.]
101725 FAST SEARCHING IN A REAL ALGEBRAIC MANIFOLD WITH APPLICATIONS TO
GEOMETRIC COMPLEXITY.
B. Chazelle.
[Brown University. Computer Science Department. Technical report
CS-84-13. 1984.]
101726 AN EFFICIENT I/O INTERFACE FOR OPTICAL DISKS.
Jeffrey Scott Vitter.
[Brown University. Computer Science Department. Technical report
CS-84-15. 1985.]
101727 OPTIMAL SOLUTIONS FOR A CLASS OF POINT RETRIEVAL PROBLEMS.
B. Chazelle and H. Edelsbrunner.
[Brown University. Computer Science Department. Technical report
CS-84-16. 1984.]
101728 ALGEBRAIC DEFINITIONS IN PROGRAMMING ENVIRONMENTS.
Alessandro Giacalone.
[Brown University. Computer Science Department. Technical report
CS-84-17. 1984. Thesis (Ph.D.).]
101729 BROWN UNIVERSITY'S COMPUTERIZED CLASSROOM: AN EXPERIMENT IN THE
PRINCIPLES OF COURSEWARE DESIGN.
Karen E. Smith and Elisabeth A. Waymire.
[Brown University. Computer Science Department. Technical report
CS-84-18. 1984.]
101730 PARALLELISM IN SPACE-TIME TRADEOFFS.
John E. Savage and Jeffrey Scott Vitter.
[Brown University. Computer Science Department. Technical report
CS-84-19. 1984.]
101731 DELETION ALGORITHMS FOR COALESCED HASHING.
Wen-Chin Chen and Jeffrey Scott Vitter.
[Brown University. Computer Science Department. Technical report
CS-84-20. 1984.]
101732 SHORTEST PATHS IN EUCLIDEAN GRAPHS.
Robert Sedgewick and Jeffrey Scott Vitter.
[Brown University. Computer Science Department. Technical report
CS-84-21. 1984.]
101733 THE DESIGN AND ANALYSIS OF COALESCED HASHING.
Wen-Chin Chen.
[Brown University. Computer Science Department. Technical report
CS-84-22. 1985. Thesis (Ph.D.).]
101734 KNOWLEDGE REPRESENTATION AND THE 1/PLAN-RECOGNITION-AS-PLANNING
THEORY.
Eugene Charniak.
[Brown University. Computer Science Department. Technical report
CS-85-01. 1985.]
101735 SAS - A SYSTOLIC ARRAY SIMULATOR.
Mark E. Sommer and John E. Savage.
[Brown University. Computer Science Department. Technical report
CS-85-02. 1985.]
101736 DEVELOPING AND EVALUATING A COMPUTER-ASSISTED INSTRUCTION DIALOGUE ON
PARAMETERS.
Karen E. Smith.
[Brown University. Computer Science Department. Technical report
CS-85-04. 1985.]
101737 THE COMPLEXITY OF HASHING WITH LAZY DELETION.
Christopher J. Van Wyk and Jeffrey Scott Vitter.
[Brown University. Computer Science Department. Technical report
CS-85-05. 1985.]
101738 AN IDEOGRAPHIC SYSTEM BUILD AND EXECUTE FACILITY.
Russell Lee Ellsworth.
[Brown University. Computer Science Department. Technical report
CS-85-06. 1985.]
101739 INTEGRATING MARKER-PASSING AND PROBLEM-SOLVING.
James A. Hendler.
[Brown University. Computer Science Department. Technical report
CS-85-08. 1985.]
101740 A THREE DIMENSIONAL GRAPHICS SYSTEM FOR THE STEREOTACTIC PLACEMENT OF
HEAVY-ION BEAMS.
Grace Meejoong Kim.
[Brown University. Computer Science Department. Technical report
CS-85-09. 1985.]
101741 A DATABASE APPROACH TO LANGUAGES, LIBRARIES AND ENVIRONMENTS.
Stanley B. Zdonik and Peter Wegner.
[Brown University. Computer Science Department. Technical report
CS-85-10. 1985.]
101742 RESEARCH REQUIREMENT SUMMARIES FOR THE COMPREHENSIVE EXAM (1985).
[Brown University. Computer Science Department. Technical report
CS-85-11. 1985.]
101743 DEXEC - A DISTRIBUTED EXEC SYSTEM.
George Lipsker.
[Brown University. Computer Science Department. Technical report
CS-85-12. 1985.]
101744 IMPLEMENTATION ISSUES FOR ALGORITHMIC VLSI PROCESSOR ARRAYS.
Allan L. Fisher.
[Carnegie-Mellon University. Department of Computer Science. 1984.
Thesis (Ph.D.).]
101745 DISTRIBUTED REPRESENTATIONS.
Geoffrey E. Hinton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-157. 1984.]
101746 SYSTOLIC ARRAYS FOR RAPID PROCESSING OF SIMPLE DATABASE TRANSACTIONS.
Philip L. Lehman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-84-160. 1984. Thesis (Ph.D.).]
101747 MODULAR CONCURRENCY CONTROL AND FAILURE RECOVERY - CONSISTENCY,
CORRECTNESS AND OPTIMALITY.
Lui Sha.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-114. 1985. Thesis (Ph.D.).]
101748 DERIVATIONAL ANALOGY: A THEORY OF RECONSTRUCTIVE PROBLEM SOLVING AND
EXPERTISE ACQUISITION.
Jaime G. Carbonell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-115. 1985.]
101749 MUD: A DRILLING FLUIDS CONSULTANT.
Gary Kahn and John McDermott.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-116. 1985.]
101750 CAUSALITY IN DEVICE BEHAVIOR.
Yumi Iwasaki and Herbert A. Simon.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-118. 1985.]
101751 USING TYPE INFORMATION TO ENHANCE THE AVAILABILITY OF PARTITIONED
DATA.
Maurice Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-119. 1985.]
101752 SYMBOLIC VERIFICATION OF MOS CIRCUITS.
Randal E. Bryant.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-120. 1985.]
101753 REASONED ASSUMPTIONS AND PARETO OPTIMALITY.
Jon Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-121. 1985.]
101754 ALIGNMENT AND CONNECTION OF FRAGMENTED LINEAR FEATURES IN AERIAL
IMAGERY.
David M. McKeown Jr. and John F. Pane.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-122. 1985.]
101755 COMPARING HOW ATOMICITY MECHANISMS SUPPORT REPLICATION.
Maurice Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-123. 1985.]
101756 AUTOMATIC VERIFICATION OF ASYNCHRONOUS CIRCUITS USING TEMPORAL LOGIC.
David L. Dill and Edmund M. Clarke.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-125. 1985.]
101757 THE IMPLEMENTATION OF A PRODUCTION SYSTEM MACHINE.
Theodore F. Lehr.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-126. 1985.]
101758 DEBUGGING ADA.
Bernd Bruegge.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-127. 1985.]
101759 PIE - A PROGRAMMING AND INSTRUMENTATION ENVIRONMENT FOR PARALLEL
PROCESSING.
Zary Segall and Larry Rudolph.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-128. 1985.]
101760 FLEXIBLE UNPARSING IN A STRUCTURE EDITING ENVIRONMENT.
David Garlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-129. 1985.]
101761 A GAME-PLAYING PROGRAM THAT LEARNS BY ANALYZING EXAMPLES.
Steven Minton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-130. 1985.]
101762 A MODELESS CONVEX HULL ALGORITHM FOR SIMPLE POLYGONS.
M. A. Peshkin and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-8.
1985.]
101763 EXPERIENCES WITH SRL: AN ANALYSIS OF A FRAME-BASED KNOWLEDGE
REPRESENTATION.
Mark S. Fox, J. Mark Wright, and David Adam.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-10.
1985.]
101764 THE USE OF MULTIPLE PROBLEM DECOMPOSITIONS IN TIME CONSTRAINED
PLANNING TASKS.
Stephen F. Smith and Peng Si Ow.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-11.
1985.]
101765 PLANNING ROBOT GRASPING MOTIONS IN THE PRESENCE OF UNCERTAINTY.
Randy C. Brost.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-12.
1985.]
101766 ANALYSIS OF THE DYNAMIC WINDOW CONGESTION CONTROL PROTOCOL IN
HETEROGENEOUS ENVIRONMENTS INCLUDING SATELLITE LINKS.
K. K. Ramakrishnan.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-284. 1984.]
101767 ELECTROMAGNETIC RADIATION FROM A SYSTEM OF INTERCONNECTED COMPUTER
EQUIPMENT IN THE PRESENCE OF A GROUND PLANE.
Manuel Costa.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-292. 1984.]
101768 THE P(SQUARE) ALGORITHM FOR DYNAMIC CALCULATION OF QUANTILES AND
HISTOGRAMS WITHOUT STORING OBSERVATIONS.
Rajendra Jain and Imrich Chlamtac.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-300. 1985.]
101769 A QUANTITATIVE MEASURE OF FAIRNESS AND DISCRIMINATION FOR RESOURCE
ALLOCATION IN SHARED COMPUTER SYSTEM.
Rajendra Jain, Dah-Ming Chiu, and William R. Hawe.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-301. 1984.]
101770 EMI CAD TOOLS-I: COMPUTER CODE FOR THE INSIDE FIELDS PROBLEM.
Manuel Costa.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-312. 1984.]
101771 EMI CAD TOOLS-II: COMPUTER CODE FOR THE OUTSIDE FIELDS PROBLEM.
Manuel Costa.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-313. 1984.]
101772 THE IMPACT, DESIGN AND USE OF ETHERBRIDGE.
Dah-Ming Chiu et al.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-316. 1983. "This report contains three reports that address
the impact, design and use of bridges."]
101773 AN ARCHITECTURE FOR TRANSPARENTLY INTERCONNECTING IEEE 802 LOCAL AREA
NETWORKS.
William R. Hawe, Alan Kirby, and Anthony Lauck.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-322. 1984.]
101774 EXTENDED LOCAL AREA NETWORK MANAGEMENT PRINCIPLES.
William R. Hawe and George Varghese.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-324. 1984.]
101775 SIMPLE MODELS OF PACKET ARRIVAL CONTROL.
Dah-Ming Chiu.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-326. 1984.]
101776 DIVERGENCE OF TIMEOUT ALGORITHMS FOR PACKET RETRANSMISSIONS.
Rajendra Jain.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-329. 1984.]
101777 ON CATCHING OUT-OF-ORDER PACKETS IN WINDOW FLOW CONTROLLED NETWORK.
Rajendra Jain.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-342. 1985.]
101778 PERFORMANCE OF AN EXTENDED LOCAL AREA NETWORK FOR IMAGE APPLICATIONS.
K. K. Ramakrishnan and William R. Hawe.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-343. 1985.]
101779 CUTE: A TIMEOUT BASED CONGESTION CONTROL SCHEME FOR DIGITAL NETWORK
ARCHITECTURE.
Rajendra Jain.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-353. 1985.]
101780 USING SIMULATION TO DESIGN A COMPUTER NETWORK CONGESTION CONTROL
PROTOCOL.
Rajendra Jain.
[Digital Equipment Corporation (DEC). Eastern Research Laboratory.
DEC-TR-358. 1985.]
101781 ON EXTENDING MODULA-2 FOR BUILDING LARGE, INTEGRATED SYSTEMS.
Paul Rovner, Roy Levin, and John Wick.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 3. 1985.]
101782 ELIMINATING GO TO'S WHILE PROSERVING PROGRAM STRUCTURE.
Lyle Ramshaw.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 4. 1985.]
101783 THE UNIFICATION OF FUNCTIONAL AND LOGIC LANGUAGES.
J. Darlington, A. J. Field, and H. Pull.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 85/3. 1985.]
101784 AN APPROACH TO MECHANISED VERIFICATION OF BEHAVIOURS OF CONCURRENT
SYSTEMS.
Leszek Holenderski.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 85/5. 1984.]
101785 PARLOG FOR SPECIFICATION, VERIFICATION AND SIMULATION.
Steve Gregory, Rob Neely, and Graem Ringwood.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 85/7. 1985.]
101786 A DATABASE MODEL FOR DISTRIBUTED REALTIME SYSTEMS.
X. Andriopoulos and M. Sloman.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 85/8. 1985.]
101787 CRIQUET VERSION 2: UN OUTIL DE BASE POUR CONSTRUIRE DES SYSTEMES
EXPERTS.
Philippe Vignard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 380. 1985.]
101788 ON SYNTAX AND SEMANTICS OF ADJECTIVE PHRASES IN LOGIC PROGRAMMING.
Patrick Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 381. 1985.]
101789 VECTORIZING FINITE ELEMENT METHODS.
Jocelyne Erhel, Alain Lichnewsky, and Francois Thomasset.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 383. 1985.]
101790 ABSORBING BOUNDARY CONDITIONS FOR RAYLEIGH WAVES.
Alain Bamberger et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 384. 1985.]
101791 NODAL SCHEMES, MIXED-HYBRID FINITE ELEMENTS AND BLOCK-CENTERED FINITE
DIFFERENCES.
Jean-Pierre Hennart.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 386. 1985.]
101792 AUTOMATIC MORPHOLOGICAL DESCRIPTION OF GALAXIES AND CLASSIFICATION BY
AN EXPERT SYSTEM.
Monique Thonnat.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 387. 1985.]
101793 AN APPROACH TO NATURAL LANGUAGE SEMANTICS IN LOGIC PROGRAMMING.
Patrick Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 389. 1985.]
101794 A BCMP EXTENSION TO MULTISERVER STATIONS WITH CONCURRENT CLASSES OF
CUSTOMERS.
Jean-Yves Le Boudec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 390. 1985.]
101795 RELATING LOGIC PROGRAMS AND ATTRIBUTE GRAMMARS.
Pierre Deransart and Jan Maluszynski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 393. 1985.]
101796 SIMPLE COMPUTABLE BOUNDS FOR THE FORK-JOIN QUEUE.
Francois Baccelli and Armand M. Makowski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 394. 1985.]
101797 NOTES ON ALGEBRAIC CALCULI OF PROCESSES.
Gerard Boudol.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 395. 1985.]
101798 A COMPLETION OF SOME COXETER GROUPS.
Philippe Le Chenadec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 396. 1985.]
101799 AMBIGUITY AND TRANSCENDENCE.
Philippe Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 397. 1985.]
101800 SOME USES OF THE MELLIN INTEGRAL TRANSFORM IN THE ANALYSIS OF
ALGORITHMS.
Philippe Flajolet, Mireille Regnier, and Robert Sedgewick.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 398. 1985.]
052024 COMPUTATIONALLY RELEVANT PROPERTIES OF NATURAL LANGUAGES AND THEIR
GRAMMARS.
Gerald Gazdar and Geoffrey K. Pullum.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-24. 1985.]
052025 AN INTERNAL SEMANTICS FOR MODAL LOGIC: PRELIMINARY REPORT.
Ronald Fagin and Moshe Vardi.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-25. 1985.]
052026 THE SITUATION IN LOGIC - III: SIMULATION, SETS AND THE AXIOM OF
FOUNDATION.
Jon Barwise.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-26. 1985.]
052027 SEMANTIC AUTOMATA.
Johan van Benthem.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-27. 1985.]
052028 RESTRICTIVE AND NON-RESTRICTIVE MODIFICATION.
Peter Sells.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-28. 1985.]
025055 A PROGRAMMING AND PROBLEM-SOLVING SEMINAR.
Ramsey W. Haddad and Donald E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-85-1055. 1985. "This report contains edited transcripts of
the discussions held in Stanford's course, CS204, Problem Seminar,
during Winter Quarter 1985."]
025056 NONCLAUSAL TEMPORAL DEDUCTION.
Martin Abadi and Zohar Manna.
[Stanford University. Department of Computer Science.
STAN-CS-85-1056. 1985.]
025057 MEMORIES OF S-EXPRESSIONS: PROVING PROPERTIES OF LISP-LIKE PROGRAMS
THAT DESTRUCTIVELY ALTER MEMORY.
Ian A. Mason and Carolyn L. Talcott.
[Stanford University. Department of Computer Science.
STAN-CS-85-1057. 1985.]
101801 GENERALIZED CONVEX FUNCTIONS -- PROPERTIES, OPTIMALITY AND DUALITY.
R. N. Kaul and S. Kaur.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 84-4. 1984.]
101802 DIRECT SECANT UPDATES OF SPARSE MATRIX FACTORS.
Floyd F. Chadee.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 84-5. 1984.]
101803 SOFTWARE AND ITS RELATIONSHIP TO METHODS.
Philip E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 84-10. 1984.]
101804 PROPERTIES OF A REPRESENTATION OF A BASIS FOR THE NULL SPACE.
Philip E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-1. 1985.]
101805 MODEL BUILDING AND PRACTICAL ASPECTS OF NONLINEAR PROGRAMMING.
Philip E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-2. 1985.]
101806 A DYNAMIC PROGRAMMING APPROACH TO TIME-STAGED CONVEX PROGRAMS.
Dan A. Scott.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-3. 1985.]
101807 A PRACTICAL APPROACH TO KARMARKAR'S ALGORITHM.
Irvin J. Lustig.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-5. 1985.]
101808 IMPACT OF LINEAR PROGRAMMING ON COMPUTER DEVELOPMENT.
George B. Dantzig.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-7. 1985.]
101809 SPARSE QUASI-NEWTON METHODS AND THE CONTINUATION PROBLEM.
Floyd F. Chadee.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-8. 1985. Thesis
(Ph.D.).]
035255 CODE OPTIMIZATION OF PIPELINE CONSTRAINTS.
Thomas R. Gross.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 83-255. 1983. Thesis (Ph.D.).]
035256 INSTRUCTION SELECTION BY ATTRIBUTED PARSING.
Mahadevan Ganapathi and Charles N. Fischer.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-256. 1984.]
035257 REVERSE SYNTHESIS COMPILATION FOR ARCHITECTURAL RESEARCH.
Mahadevan Ganapathi, John L. Hennessy, and Vivek Sarkar.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-257. 1984.]
035258 A STRONGLY TYPED LANGUAGE FOR SPECIFYING PROGRAMS.
Friedrich W. von Henke.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-258. 1984. Also issued as
Report no. 23, Program Analysis and Verification Group, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
035259 ORGANIZATION AND VSLI IMPLEMENTATION OF MIPS.
Steven A. Przybylski et al.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-259. 1984.]
035260 MEMORY HIERARCHIES FOR DIRECTLY EXECUTED LANGUAGE MICROPROCESSORS.
Donald Alpert.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-260. 1984. Thesis (Ph.D.).]
035261 ANNA: A LANGUAGE FOR ANNOTATING ADA PROGRAMS. PRELIMINARY REFERENCE
MANUAL.
David C. Luckham et al.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-261. 1984. Also issued as
Report no. 24, Program Analysis and Verification Group, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
035262 DEBUGGING ADA TASKING PROGRAMS.
David Helmbold and David C. Luckham.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-262. 1984. Also issued as
Report no. 25, Program Analysis and Verification Group, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
035265 AN OVERVIEW OF ANNA: A SPECIFICATION LANGUAGE FOR ADA.
David C. Luckham and Friedrich W. von Henke.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-265. 1984. Also issued as
Report no. 26, Program Analysis and Verification Group, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
035266 TIMING VERIFICATION AND PERFORMANCE IMPROVEMENT OF MOS VLSI DESIGNS.
Norman P. Jouppi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-266. 1984. Thesis (Ph.D.).]
035267 THE INSTRUCTION BANDWIDTH OF DIRECT CORRESPONDENCE ARCHITECTURES.
Chad Leland Mitchell.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 84-267. 1984.]
035268 FABRIC: A PACKAGE FOR MANAGING INTERWOVEN DATA.
Mark A. Linton.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-268. 1985.]
035269 A METHODOLOGY FOR THE DESIGN OF ADA TRANSFORMATION TOOLS IN A DIANA
ENVIRONMENT.
David S. Rosenblum.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-269. 1985. Also issued as
Report no. 27, Program Analysis and Verification Group, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
035271 TOPOLOGICAL DESIGN OF FIBER OPTICS LOCAL AREA NETWORKS WITH
APPLICATION TO EXPRESSNET.
M. Mehdi Nassehi, Fouad A. Tobagi, and Michel E. Marhic.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-271. 1985.]
035272 BIBLIOGRAPHY OF THE COMPUTER SYSTEMS LABORATORY, 1968-1985. EDITED BY
NAOMI SCHULMAN.
Naomi Schulman.
[Stanford University. Department of Computer Science. Technical
report 85-272. 1985.]
035273 THEORETICAL RESULTS ON DISTRIBUTED PROCESSING WITH LIMITED COMPUTING
RESOURCES.
Hemant Kanakia and Fouad A. Tobagi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-273. 1985.]
035274 CONDITIONS FOR PRODUCT FORM SOLUTIONS IN MULTIHOP PACKET RADIO
NETWORK MODELS.
Jose M. Brazio and Fouad A. Tobagi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-274. 1985.]
035275 PACKET VOICE ON A LOCAL AREA NETWORK WITH ROUND ROBIN SERVICE.
Michael Fine and Fouad A. Tobagi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-275. 1985.]
038238 INCREASED FAULT COVERAGE THROUGH MULTIPLE SIGNATURES.
Syed Zahoor Hassan and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 83-238. 1983. Also issued as
Report no. 83-17, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038243 TESTING VHSIC DEVICES.
Edward J. McCluskey et al.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-243. 1984. "This report is
composed of visual aids presented in a video tape titled 'Testing
VHSIC Devices.'" Also issued as Report no. 84-1, Center for Reliable
Computing, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
038244 PREPRINTS OF THE FOURTEENTH IEEE INTERNATIONAL CONFERENCE ON
FAULT-TOLERANT COMPUTING.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-2.
1984. "Contains preprints of [five] papers accepted for presentation
at the Fourteenth IEEE International Conference on Fault-Tolerant
Computing, Orlando, Florida, June 20-22, 1984." Also issued as
Technical note 84-244, Computer Systems Laboratory, Stanford
Electronics Laboratories, Stanford University.]
038245 INCREASING EFFECTIVE FAULT COVERAGE OF PARALLEL SIGNATURE ANALYZERS.
Syed Zahoor Hassan and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-245. 1984. Also issued as
Report no. 84-3, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038246 VSLI DESIGN FOR TESTABILITY.
Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-246. 1984. "This report is a
preprint of a paper to be presented at the 1984 Symposium on VLSI
Technology, San Diego, California, September 10-12, 1984." Also
issued as Report no. 84-4, Center for Reliable Computing, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
038247 TUNING, CLOCK DISTRIBUTION AND COMMUNICATION IN VLSI HIGH-SPEED CHIPS.
Kenneth D. Wagner and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-247. 1984. Also issued as
Report no. 84-5, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038248 PSEUDO-EXHAUSTIVE TESTING FOR VLSI DEVICES.
Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-248. 1984. Also issued as
Report no. 84-6, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038249 WEIGHTED PATTERN GENERATION FOR BUILT-IN SELF-TEST.
Gary K. Chin and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-249. 1984. Also issued as
Report no. 84-7, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038250 PREPRINTS OF THE INTERNATIONAL TEST CONFERENCE 1984.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-8.
1984. "Contains preprints of [six] papers presented at the
International Test Conference 1984, Philadelphia, Pennsylvania,
October 15-18, 1984." Also issued as Technical note 84-250, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
038251 TESTING SEMI-CUSTOM LOGIC.
Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-251. 1984. Also issued as
Report no. 84-9, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038252 PREPRINTS OF THE 1984 IEEE INTERNATIONAL CONFERENCE ON COMPUTER-AIDED
DESIGN.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-10.
1984. "Contains preprints of [three] papers accepted for presentation
at the 1984 IEEE International Conference on Computer-Aided Design,
Santa Clara, California, November 12-15, 1984." Also issued as
Technical note 84-252, Computer Systems Laboratory, Stanford
Electronics Laboratories, Stanford University.]
038253 PREPRINTS OF THE AIAA/IEEE DIGITAL AVIONICS SYSTEMS CONFERENCE.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-11.
1984. "Contains preprints of [two] papers accepted for presentation
at the AIAA/IEEE Digital Avionics Systems Conference, Baltimore,
Maryland, December 3-6, 1984." Also issued as Technical note 84-253,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
038254 PREPRINTS OF THE EIGHTEENTH ANNUAL HAWAII INTERNATIONAL CONFERENCE ON
SYSTEM SCIENCES.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-12.
1984. "Contains preprints of [two] papers accepted to presentation at
the Eighteenth Annual Hawaii International Conference on System
Sciences, Honolulu, Hawaii, January 2-4, 1985." Also issued as
Technical note 84-254, Computer Systems Laboratory, Stanford
Electronics Laboratories, Stanford University.]
038255 SPRING COMPCON 85 PREPRINTS.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 84-13.
1984. "Contains preprints of [two] papers accepted for presentation
at Spring COMPCON 85, San Francisco, CA, February 25-29, 1985." Also
issued as Technical note 84-255, Computer Systems Laboratory,
Stanford Electronics Laboratories, Stanford University.]
038256 WRITING EXECUTABLE ASSERTIONS TO TEST FLIGHT SOFTWARE.
Aamer Mahmood, Dorothy M. Andrews, and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-256. 1984. Also issued as
Report no. 84-14, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038257 WATCHDOG PROCESSORS: ERROR COVERAGE AND OVERHEAD.
Aamer Mahmood and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-257. 1984. Also issued as
Report no. 84-15, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038258 EXECUTABLE ASSERTIONS AND FLIGHT SOFTWARE.
Aamer Mahmood, Dorothy M. Andrews, and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 84-258. 1984. Also issued as
Report no. 84-16, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038260 BIBLIOGRAPHY OF 1976-1984 CRC PUBLICATIONS.
Joseph McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-260. 1985. Also issued as
Report no. 85-0, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038262 PREPRINTS OF THE IEEE INTERNATIONAL CONFERENCE ON FAULT-TOLERANT
COMPUTING.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Center for Reliable Computing. Report no. 85-3.
1985. "Contains preprints of [two] papers accepted for presentation
at the [Fifteenth] IEEE International Conference on Fault-Tolerant
Computing, Ann Arbor, Michigan, June 19-21, 1985." Also issued as
Technical note 85-262, Computer Systems Laboratory, Stanford
Electronics Laboratories, Stanford University.]
038263 A METHODOLOGY FOR ANALYSIS OF FAILURE PREDICTION DATA.
Fares A. Nassar and Dorothy M. Andrews.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-263. 1985. Also issued as
Report no. 85-4, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
038264 BUILT-IN TEST FOR RANDOM LOGIC.
Laung-Terng Wang and Edward J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-264. 1985. Also issued as
Report no. 85-5, Center for Reliable Computing, Computer Systems
Laboratory, Stanford Electronics Laboratories, Stanford University.]
101810 SENDING CERTIFIED MAIL USING OBLIVIOUS TRANSFER AND A THRESHOLD
SCHEME.
O. Goldreich.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 325. 1984.]
101811 ON THE EXPRESSIVE POWER OF DATA DEPENDENCIES.
J. A. Makowsky and M. Y. Vardi.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 326. 1984.]
101812 COOPERATIVE DISTRIBUTED ALGORITHMS FOR DYNAMIC CYCLE PREVENTION.
S. Katz and O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 330. 1984.]
101813 A RANDOMIZED PROTOCOL FOR SIGNING CONTRACTS.
S. Even, O. Goldreich, and A. Lempel.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 331. 1984.]
101814 PROOF RULES FOR COMMUNICATION ABSTRACTIONS.
G. Taubenfeld and N. Francez.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 332. 1984.]
101815 AN IMPROVED MAXIMAL MATCHING PARALLEL ALGORITHM.
A. Israeli and Y. Shiloach.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 333. 1984.]
101816 THE OPTIMALITY OF DISTRIBUTED CONSTRUCTIONS OF MINIMUM WEIGHT AND
DEGREE RESTRICTED SPANNING TREES IN A COMPLETE NETWORK OF PROCESSORS.
E. Korach, S. Moran, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 334. 1984.]
101817 A FAST AND SIMPLE RANDOMIZED PARALLEL ALGORITHM FOR MAXIMAL MATCHING.
A. Israeli and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 335. 1984.]
101818 RULE SUPPORTING IN PROLOG.
O. Shmueli, S. Tsur, and H. Zfira.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 337. 1984.]
101819 AN IMPROVEMENT OF AN ALGORITHM FOR CONSTRUCTION OF EDGE DISJOINT
BRANCHINGS.
S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 341. 1984.]
101820 APPLICATIONS OF RAMSEY'S THEOREM TO DECISION TREES COMPLEXITY.
S. Moran, M. Snir, and U. Manber.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 345. 1984.]
101821 EXTREMAL PROBLEMS ON PERMUTATIONS UNDER CYCLIC EQUIVALENCE.
P. Erdos, N. Linial, and S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 349. 1984.]
101839 PROVING PRECEDENCE PROPERTIES: THE TEMPORAL WAY.
Zohar Manna and Amir Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-04. 1984.]
101840 STATECHARTS: A VISUAL APPROACH TO COMPLEX SYSTEMS.
David Harel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-05. 1984.]
101841 FAIR, BIASED, AND SELF-BALANCING MERGE OPERATORS: THEIR SPECIFICATION
AND IMPLEMENTATION IN CONCURRENT PROLOG.
Ehud Y. Shapiro and Colin Mierowsky.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-07. 1984.]
101842 HOW TO CONTROL THE USE OF SOFTWARE.
A. Fiat, A. Shamir, and Y. Tulpan.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-08. 1984.]
101843 NOW YOU MAY COMPOSE TEMPORAL LOGIC SPECIFICATIONS.
Howard Barringer, Ruurd Kuiper, and Amir Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-09. 1984.]
101844 THE BAGEL: A SYSTOLIC CONCURRENT PROLOG MACHINE (LECTURE NOTES).
Ehud Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-10. 1984.]
101845 A HARDWARE IMPLEMENTATION OF THE CSP PRIMITIVES AND ITS VERIFICATION.
Dorit Ron, Flavia Rosemberg, and Amir Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-11. 1984.]
101846 PSPACE-HARDNESS OF SOME COMBINATORIAL GAMES.
Aviezri S. Fraenkel and Elisheva Goldschmidt.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-12. 1984.]
101847 LIRSORT - LINKED RADIX SORT.
Irit Cohen and Aviezri S. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-13. 1984.]
101848 CONCURRENT DYNAMIC LOGIC.
David Peleg.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-14. 1984.]
101849 VERIFICATION OF MULTIPROCESS PROBABILISTIC PROTOCOLS.
Amir Pnueli and Lenore Zuck.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-18. 1984.]
101850 DESIGN AND IMPLEMENTATION OF FLAT CONCURRENT PROLOG.
Colin Mierowsky.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-21. 1984. Thesis (M.S.).]
101851 SOURCE-TO-SOURCE TRANSFORMATIONS OF LOGIC PROGRAMS.
Charlene Bloch.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-22. 1984. Thesis (M.S.).]
101852 DISTRIBUTED CONSTRAINT PROPAGATION.
Omri Viner.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-24. 1984.]
101853 CONCURRENT PROGRAM SCHEMES AND THEIR LOGICS.
David Peleg.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-25. 1984.]
101854 CHECKING THAT FINITE STATE CONCURRENT PROGRAMS SATISFY THEIR LINEAR
SPECIFICATION.
Orna Lichtenstein and Amir Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-26. 1984.]
101855 PYTHON: A BRIDGE EXPERT ON SQUEEZES.
Yossi Nygate.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-27. 1984.]
101856 FAST MULTIWAY MERGE USING DESTRUCTIVE OPERATIONS.
Ehud Y. Shapiro and Muli Safra.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-01. 1985.]
101857 ON THE DEVELOPMENT OF REACTIVE SYSTEMS.
David Harel and Amir Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-02. 1985.]
101858 THE GLORY OF THE PAST.
Orna Lichtenstein, Amir Pnueli, and Lenore Zuck.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-04. 1985.]
101859 PARTITIONING PROGRAMMABLE LOGIC ARRAYS.
Murray I. Cole.
[University of Edinburgh. Department of Computer Science. CSR-166-84.
1984.]
101860 WEAK AND STRONG FAIRNESS IN CCS.
Gerardo Costa and Colin Stirling.
[University of Edinburgh. Department of Computer Science. CSR-167-85.
1985.]
101861 THE STANDARD ML CORE LANGUAGE.
Robin Milner.
[University of Edinburgh. Department of Computer Science. CSR-168-84.
1984.]
101862 A METRIC CHARACTERIZATION OF FAIR COMPUTATIONS IN CCS.
Gerardo Costa.
[University of Edinburgh. Department of Computer Science. CSR-169-84.
1984.]
101863 I.F.: AN IDIOMATIC FLOORPLANNER.
I. M. Nixon.
[University of Edinburgh. Department of Computer Science. CSR-170-84.
1984.]
101864 AN ALGEBRAIC THEORY OF FAIR ASYNCHRONOUS COMMUNICATION PROCESSES.
Matthew Hennessy.
[University of Edinburgh. Department of Computer Science. CSR-171-84.
1984.]
101865 ON OBSERVATIONAL EQUIVALENCE AND ALGEBRAIC SPECIFICATION.
Donald Sannella and Andrzej Tarlecki.
[University of Edinburgh. Department of Computer Science. CSR-172-84.
1984.]
101866 QUASI-VARIETIES IN ABSTRACT ALGEBRAIC INSTITUTIONS.
Andrzej Tarlecki.
[University of Edinburgh. Department of Computer Science. CSR-173-84.
1984.]
101867 SIMULATION AND VERIFICATION: RELATED TECHNIQUES FOR HARDWARE ANALYSIS.
George J. Milne.
[University of Edinburgh. Department of Computer Science. CSR-174-84.
1984.]
101868 RECURSIVELY DEFINED DOMAINS AND THEIR INDUCTION PRINCIPLES.
Finn V. Jensen and Kim G. Larsen.
[University of Edinburgh. Department of Computer Science. CSR-176-84.
1984.]
101869 ON PROVING LIMITING COMPLETENESS.
Peter D. Mosses and Gordon D. Plotkin.
[University of Edinburgh. Department of Computer Science. CSR-177-84.
1984.]
101870 SPECIFICATION AND PROOF OF A SIMPLE FAULT TOLERANT SYSTEM IN CCS.
K. V. S. Prasad.
[University of Edinburgh. Department of Computer Science. CSR-178-84.
1984.]
101871 INFERRING SURFACE SHAPE BY SPECULAR STEREO.
Andrew Blake.
[University of Edinburgh. Department of Computer Science. CSR-179-84.
1984.]
101872 AN INVESTIGATION INTO STRETCHABLE CELLS FOR SCALE.
Roderick Widdowson.
[University of Edinburgh. Department of Computer Science. CSR-181-85.
1985.]
101873 SPECIFICATIONS IN AN ARBITRARY INSTITUTION.
Donald Sannella and Andrzej Tarlecki.
[University of Edinburgh. Department of Computer Science. CSR-184-85.
1985.]
101874 MEMORY BASED PROCESSING FOR CROSS CONTEXTUAL REASONING: REMINDING AND
ANALOGY USING THEMATIC STRUCTURES.
Charles Dolan.
[University of California, Los Angeles. Computer Science Department.
CSD-850010. 1985. Thesis (M.S.).]
101875 AN APPLICATION OF KNOWLEDGE-BASED SYSTEMS TO ELECTRONIC
COMPUTER-AIDED ENGINEERING, DESIGN, AND MANUFACTURING DATA BASE
TRANSPORT.
Richard Hooper.
[University of California, Los Angeles. Computer Science Department.
CSD-850011. 1985. Thesis (Ph.D.).]
101876 DISTRIBUTED COMPUTER SIMULATION OF DATA COMMUNICATION NETWORKS:
PROJECT REPORT 2.
Shun Cheung, Jack W. Carlyle, and Walter J. Karplus.
[University of California, Los Angeles. Computer Science Department.
CSD-850013. 1985.]
101877 A PROBLEM SIMPLIFICATION APPROACH THAT GENERATES HEURISTICS FOR
CONTRAINT-SATISFACTION PROBLEMS.
Rina Dechter and Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850014. 1985.]
101878 AN OPTIMAL SHOUT-ECHO ALGORITHM FOR SELECTION IN DISTRIBUTED SETS.
John M. Marberg and Eli Gafni.
[University of California, Los Angeles. Computer Science Department.
CSD-850015. 1985.]
101879 BAYESIAN NETWORKS: A MODEL OF SELF-ACTIVATED MEMORY FOR EVIDENTIAL
REASONING.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850017. 1985.]
101880 A C-ORIENTED REGISTER SET DESIGN.
Miquel Huguet.
[University of California, Los Angeles. Computer Science Department.
CSD-850019. 1985. Thesis (M.S.).]
101881 OUTPUT PARTITIONING OF PROGRAMMABLE LOGIC ARRAYS.
John Matthew Bach.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-84-1187. 1984. Thesis (M.S.).]
101882 AN APPROACH TO OPERATING SYSTEM TESTING WITH APPLICATION TO THE IBM
SYSTEM 9000.
Robert N. Sum Jr..
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1202. 1985. Thesis (M.S.).]
101883 TOPICS IN COMBINATORIAL ALGORITHMS.
Prakash V. Ramanan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1204. 1985. Thesis (Ph.D.).]
101884 INDUCTION, OF AND BY PROBABILITY.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1209. 1985.]
101885 DESIGN OF A PLA MODULE GENERATOR FOR VLSI HIERARCHICAL SYNTHESIS.
Kou-Rey David Hwang.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1214. 1985. Thesis (M.S.).]
101886 AN EVALUATION OF TWO DATA DICTIONARY DIRECTORIES.
James Leo.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1215. 1985.]
101887 THE USE OF COLOR IN TEXT PRESENTATION.
Fred Bertram III.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1216. 1985. Thesis (M.S.).]
101888 GENETIC PLANS AND THE PROBABILISTIC LEARNING SYSTEM: SYNTHESIS AND
RESULTS.
Larry Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1217. 1985.]
101889 AN OPTIMUM SEMI-ITERATIVE METHOD FOR SOLVING ANY LINEAR SET WITH A
SQUARE MATRIX.
Dennis C. Smolarski and Paul E. Saylor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1218. 1985.]
101890 A MODULA-2 COMPILER FOR THE IBM S9000 XENIX SYSTEM.
Robert Edward McGrath.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1219. 1985. Thesis (Master of Computer
Science).]
VOL. 7, NO. 10 10/21/85
101891 C-POREL -- A DISTRIBUTED RELATIONAL DATA BASE MANAGEMENT SYSTEM ON
MICROCOMPUTER NETWORK.
Long-Xiang Zhou.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
No. 1. 1985.]
101892 FROZEN TOKEN - A WAY TO TEST DISTRIBUTED SYSTEMS MODELED BY PETRI
NETS.
W. M. Lu and A. Merceron.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
No. 2. 1985.]
101893 CALIBAN: ITS USER-INTERFACE AND RETRIEVAL ALGORITHM.
H. P. Frei, M. Bartschi, and J.-F. Jauslin.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 62. 1985.]
101894 MODULA-PROLOG. USER MANUAL.
Carlo Muller.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 63. 1985.]
101895 A FAST AND COMPACT COMPILER FOR MODULA-2, BY N. WIRTH. COMPILATION OF
DATA STRUCTURES: A NEW APROACH TO EFFICIENT MODULA-2 SYMBOL FILES, BY
J. GUTKNECHT.
N. Wirth and J. Gutknecht.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 64. 1985. This report consists of two papers
on Modula-2.]
101896 AN OVERVIEW OF THE COMPUTATIONAL ENVIRONMENTS OFFERED BY CURRENT AND
FUTURE SUPERCOMPUTERS.
Myron Ginsberg.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-4980R. 1985.]
101897 PERFORMANCE OF THE 3880 MODEL 23 CACHE CONTROLLER.
David A. DeNardis and Gail M. White.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-5123. 1985.]
101898 THE GAUSSIAN DERIVATIVE MODEL FOR MACHINE AND BIOLOGICAL IMAGE
PROCESSING.
Richard A. Young.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-5128. 1985.]
101899 PARAMETRIC ESTIMATION OF SPATIAL VARIOGRAMS WITH LARGE DATA SETS.
Michael L. Stein.
[International Business Machines Corporation (IBM). Research
Division. RC 11184. 1985.]
101900 ERROR-CORRECTING CODES FOR INTERLEAVED DISKS WITH MINIMAL REDUNDANCY.
M. Y. Kim and A. M. Patel.
[International Business Machines Corporation (IBM). Research
Division. RC 11185. 1985.]
101901 PROJECTION OF NATURAL QUADRICS.
Michael A. O'Connor.
[International Business Machines Corporation (IBM). Research
Division. RC 11188. 1985.]
101902 PC PROTOCOL CARD: AN INTERFACE TO THE ALAN NETWORK SWITCH (USER
GUIDE).
Yannick Thefaine et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11189. 1985.]
101903 RELOCATING PROCESSES IN A DISTRIBUTED COMPUTER SYSTEM.
Donald F. Ferguson and Gerald Leitner.
[International Business Machines Corporation (IBM). Research
Division. RC 11190. 1985.]
101904 DOES VISUAL ANGLE AFFECT READING SPEED?
John D. Gould and Nancy Grischkowsky.
[International Business Machines Corporation (IBM). Research
Division. RC 11191. 1985.]
101905 CHARACTER GENERATION USING CONIC SPLINES.
Takafumi Saito.
[International Business Machines Corporation (IBM). Research
Division. RC 11193. 1985.]
101906 POSITIVE POWERS OF CERTAIN CONDITIONALLY NEGATIVE DEFINITE MATRICES.
Nira Dyn, Timothy Goodman, and Charles A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 11202. 1985.]
101907 A EXPERIMENT IN PARTITIONING COMMUNICATIONS FUNCTION IN MULTIPROCESOR
SYSTEMS.
M. Y. Kim and J. Unger.
[International Business Machines Corporation (IBM). Research
Division. RC 11203. 1985.]
101908 EAS-E: A NEW APPLICATION DEVELOPMENT TECHNOLOGY.
Donald P. Pazel and Ashok Malhotra.
[International Business Machines Corporation (IBM). Research
Division. RC 11208. 1985.]
101909 THE ARCHITECTURE OF THE IBM RESEARCH PARALLEL PROCESSOR PROTOTYPE
(RP3).
G. F. Pfister.
[International Business Machines Corporation (IBM). Research
Division. RC 11210. 1985.]
101910 DISTRIBUTED AGREEMENT IN THE PRESENCE OF PROCESSOR AND COMMUNICATION
FAULTS.
Kenneth J. Perry and Sam Toueg.
[International Business Machines Corporation (IBM). Research
Division. RC 11218. 1985.]
101911 THE SHADING ENGINE - A LOW COST PARALLEL PROCESSOR FOR RENDERING HIGH
QUALITY COLOR IMAGES IN GRAPHICS WORKSTATIONS.
K. C. Nunan, A. G. Lean, and C. P. Wang.
[International Business Machines Corporation (IBM). Research
Division. RC 11222. 1985.]
101912 A VM PARALLEL ENVIRONMENT.
F. Darema-Rogers et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11225. 1985.]
101913 RAPID METHODS FOR THE CONFORMAL MAPPING OF MULTIPLY CONNECTED REGIONS.
Anita Mayo.
[International Business Machines Corporation (IBM). Research
Division. RC 11231. 1985.]
101914 FAST DISTRIBUTED AGREEMENT.
Sam Toueg, Kenneth J. Perry, and T. K. Srikanth.
[International Business Machines Corporation (IBM). Research
Division. RC 11233. 1985.]
101915 ADVANCES IN ROBOTIC MANIPULATION: BUILDING A BETTER MOUSETRAP.
R. L. Hollis.
[International Business Machines Corporation (IBM). Research
Division. RC 11234. 1985.]
101916 PARALLELIZATION AND PERFORMANCE PREDICTION OF THE COOLEY-TUKEY FFT
ALGORITHM FOR SHARED-MEMORY ARCHITECTURES.
Alan Norton and Allan Silberger.
[International Business Machines Corporation (IBM). Research
Division. RC 11237. 1985.]
101917 AN EXECUTION ARCHITECTURE FOR FP.
Tien Huynh, Lee W. Hoevel, and Brent Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 11238. 1985.]
101918 PARTIAL EXPANSIONS FOR FILE ORGANIZATION WITH AN INDEX.
David B. Lomet.
[International Business Machines Corporation (IBM). Research
Division. RC 11240. 1985.]
101919 CANONICAL CONSTRAINTS FOR PARAMETERIZED DATA TYPES.
E. G. Wagner and H. Ehrig.
[International Business Machines Corporation (IBM). Research
Division. RC 11248. 1985.]
101920 A MANUAL FOR AN INFINITE HEIRARCHY OF FUNCTIONAL PROGRAMMING
LANGUAGES.
E. G. Wagner.
[International Business Machines Corporation (IBM). Research
Division. RC 11249. 1985.]
101921 ON MAXIMIZING THE NUMBER OF DEPARTURES BEFORE A DEADLINE ON MULTIPLE
PROCESSORS.
Randolph Nelson and Don Towsley.
[International Business Machines Corporation (IBM). Research
Division. RC 11255. 1985.]
101922 COMPARISON OF THRESHOLD SCHEDULING POLICIES FOR MULTIPLE SERVER
SYSTEMS.
Randolph Nelson and Don Towsley.
[International Business Machines Corporation (IBM). Research
Division. RC 11256. 1985.]
101923 USEFUL PARALLELISM IN A MULTIPROCESSING ENVIRONMENT.
Ron Cryton.
[International Business Machines Corporation (IBM). Research
Division. RC 11258. 1985.]
101924 SEQUENCES OF NUMBERS GENERATED BY ADDITION IN FORMAL GROUPS AND NEW
PRIMALITY AND FACTORIZATION TESTS.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. RC 11262. 1985.]
101925 ACCURATE FAULT MODELS AND EFFICIENT SIMULATION OF CASCODE VOLTAGE
SWITCH CIRCUITS.
Z. Barzilai et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11263. 1985.]
101926 A CONSTRAINT LANGUAGE AND ITS INTERPRETER.
Hans P. Zima.
[International Business Machines Corporation (IBM). Research
Division. RJ 4714. 1985.]
101927 STATISTICAL DATA REDUCTION FOR MANUFACTURING TESTING.
Sakti P. Ghosh.
[International Business Machines Corporation (IBM). Research
Division. RJ 4715. 1985.]
101928 A NUMERICAL STUDY OF UNSTABLE FLOW BETWEEN ROTATING DISKS.
Jacob E. Fromm.
[International Business Machines Corporation (IBM). Research
Division. RJ 4734. 1985.]
101929 RELIABILITY OF DUPLEX SYSTEMS.
Spencer W. Ng.
[International Business Machines Corporation (IBM). Research
Division. RJ 4737. 1985.]
101930 REGENERATION AND NETWORKS OF QUEUES.
Gerald S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 4742. 1985.]
101931 A KNOWLEDGE-BASED PRODUCTION SYSTEM FOR VERIFYING ENGINEERING
SPECIFICATIONS IN INDUSTRIAL INSPECTION APPLICATIONS.
D. Petkovic and E. Hinkle.
[International Business Machines Corporation (IBM). Research
Division. RJ 4743. 1985.]
101932 A GUIDE TO THE MODAL LOGICS OF KNOWLEDGE AND BELIEF.
Joseph Y. Halpern and Yoram Moses.
[International Business Machines Corporation (IBM). Research
Division. RJ 4753. 1985. Preliminary draft.]
101933 SIMPLE SYMBOLIC AND NUMERIC COMPUTATIONS BASED ON EQUATIONS AND
INEQUALITIES.
Bo S. Hansen and Michael R. Hansen.
[International Business Machines Corporation (IBM). Research
Division. RJ 4754. 1985.]
101934 PREDICTING PROTOCOL PERFORMANCE FROM A META-IMPLEMENTATION.
Jan R. Engelbrecht, Pieter S. Kritzinger, and Harry Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1381. 1985.]
101935 ARCHITECTURE AND USAGE OF A HOST-COUPLED WORKSTATION.
Dieter Gantenbein and Alistair Cockburn.
[International Business Machines Corporation (IBM). Research
Division. RZ 1382. 1985.]
101936 ENGINEERING ASPECTS FOR TOKEN-RING DESIGN.
H. Keller and H. R. Muller.
[International Business Machines Corporation (IBM). Research
Division. RZ 1383. 1985.]
101937 S/370-BASED COLOR IMAGE AQUISITION AND PROCESSING.
A. P. J. Engbersen.
[International Business Machines Corporation (IBM). Research
Division. RZ 1390. 1985.]
099091 MASSACHUSETTS INSTITUTE OF TECHNOLOGY. DEPARTMENT OF ELECTRICAL
ENGINEERING AND COMPUTER SCIENCE.
VLSI MEMORANDA ("Memos in this series...are not considered to be
published merely by virtue of appearing in this series. References
to these works should be either to the published version, if any,
or in the form 'private communication'...."):
099091/242 COMMUNICATION DENSITY CONSIDERATIONS IN MULTIPROCESSORS.
Lance A. Glasser and Charles A. Zukowski.
[1985]
099091/245 ULTRA-FINE GRAIN PROCESSING ARCHITECTURES.
Donald Scott Wills.
[1985. Thesis (Master of Science and Electrical Engineer).]
099091/249 BOUNDING ENHANCEMENTS FOR VLSI CIRCUIT SIMULATION.
Charles Albert Zukowski.
[1985. Thesis (Ph.D.).]
099091/250 A DIGITAL GAUSSIAN CONSOLVER FOR VISUAL IMAGES.
Andrew A. Berlin.
[1985. Thesis (B.S.).]
101938 CONDITIONAL AXIOMS AND ALPHA/BETA CALCULUS IN PROCESS ALGEBRA.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8502. 1985.]
101939 SYNTAX AND DEFINING EQUATIONS FOR AN INTERRUPT MECHANISM IN PROCESS
ALGEBRA.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8503. 1985.]
101940 ALGEBRAIC DEFINITION OF A SIMPLE PROGRAMMING LANGUAGE.
J. A. Bergstra, J. Heering, and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8504. 1985.]
101941 IMPLEMENTATION OF A NEW PRIMALITY TEST.
H. Cohen and A. K. Lenstra.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8505. 1985.]
101942 A DISTRIBUTED FILE SERVICE BASED ON OPTIMISTIC CONCURRENCY CONTROL.
S. J. Mullender and A. S. Tanenbaum.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8507. 1985.]
101943 INFINITE STREAMS AND FINITE OBSERVATIONS IN THE SEMANTICS OF UNIFORM
CONCURRENCY.
J. W. de Bakker, J. J. Ch Meyer, and E. R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8508. 1985. Preliminary version.]
101944 THE EFFICIENCY OF THE EQUATION INTERPRETER COMPARED WITH THE UNH
PROLOG INTERPRETER.
J. Heering and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8509. 1985.]
101945 TIME-DRIVEN ALGORITHMS FOR DISTRIBUTED CONTROL.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8510. 1985.]
101946 ON THE CONSISTENCY OF KOOMEN'S FAIR ABSTRACTION RULE.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8511. 1985.]
101947 NUMERICAL INTEGRATION OF RETARDED DIFFERENTIAL EQUATIONS WITH
PERIODIC SOLUTIONS.
H. Arndt, P. J. van der Houwen, and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8502. 1985.]
101948 COMPUTATION OF ALL THE AMICABLE PAIRS BELOW 10 TO THE 10TH.
H. J. J. Te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8503. 1985.]
101949 EXPLICIT RUNGE-KUTTA (-NYSTROM) METHODS WITH REDUCED PHASE ERRORS FOR
COMPUTING OSCILLATING SOLUTIONS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8504. 1985.]
101950 MULTIGRID SOLUTION OF THE STEADY EULER EQUATIONS.
P. W. Hemker and S. P. Spekreijse.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8505. 1985.]
101951 CONVERGENCE AND ORDER REDUCTION OF DIAGONALLY IMPLICIT RUNGE-KUTTA
SCHEMES IN THE METHOD OF LINES.
J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8506. 1985.]
101952 PREDICTOR-CORRECTOR METHODS FOR PERIODIC SECOND-ORDER INITIAL VALUE
PROBLEMS.
P. J. van der Houwen and Sommeijer. B. P..
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8509. 1985.]
101953 DISCRETIZATION OF HYPERBOLIC DIFFERENTIAL EQUATIONS WITH PERIODIC
SOLUTIONS.
P. J. van der Houwen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8510. 1985.]
101954 ON THE ROLE OF ADDITIVITY AND LINEARITY IN MATHEMATICAL SYSTEMS
THEORY.
Paulo A. S. Veloso.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 16/83. 1983.]
101955 ON THE CONCEPT OF PROBLEM SOLVING METHOD.
Paulo A. S. Veloso.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 1/85. 1985.]
101956 WHAT DO YOU MEAN BY "HERE IS A PROBLEM RELATED TO YOURS..."?
Paulo A. S. Veloso.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 2/85. 1985.]
101957 PROGAMME DEVELOPMENT AS THEORY MANIPULATIONS.
Paulo A. S. Veloso.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 4/85. 1985.]
101958 A NEW THEORETICAL APPROACH TO RUNGE-KUTTA METHODS.
Peter Albrecht.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 5/85. 1985.]
101959 USING AUXILARY FILES IN DOCUMENT PREPARATION.
David Alex Lamb.
[Queen's University. Department of Computing and Information Science.
Technical report 85-170. 1985.]
101960 MULTIPLICATION-PERMUTATION ENCRYPTION NETWORKS.
Henk Meijer.
[Queen's University. Department of Computing and Information Science.
Technical report 85-171. 1985.]
101961 A TWO-LEVEL SECURITY MODEL FOR SECURE NETWORKS.
Janice I. Glasgow and Glenn H. MacEwen.
[Queen's University. Department of Computing and Information Science.
Technical report 85-172. 1985.]
101962 ACE: THE ARRAY-THEORETIC COMPUTATIONAL ENGINE.
Carl McCrosky.
[Queen's University. Department of Computing and Information Science.
Technical report 85-173. 1985.]
101963 APPROXIMATION ERRORS AND PERCIEVED SIMILARITY BETWEEN APPROXIMATED
POLYGONS.
Hans Marmolin.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8505. 1985. Also issued as
INTEGRAL-35, Integral Project, Department of Numerical Analysis and
Computing Science, Royal Institute of Technology, Stockholm.]
101964 HARDWARE SYNTHESIS FROM SPECIFICATION WITH POLYNOMIALS.
Bjorn Lisper.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8506. 1985.]
101965 ALGORITHM FOR LARGE-SCALE GLOBAL MINIMIZATION OF LINEARLY CONSTRAINED
CONCAVE QUADRATIC FUNCTIONS.
B. Kalantari and J. B. Rosen.
[Rutgers. Department of Computer Science. DCS-TR-147. 1985. Revised,
August 1985.]
101966 PROVING RELATIVE LOWER BOUNDS FOR INCREMENTAL ALGORITHMS.
A. M. Berman, M. C. Paull, and B. G. Ryder.
[Rutgers. Department of Computer Science. DCS-TR-154. 1985.]
101967 INCREMENTAL ALGORITHMS FOR SOFTWARE SYSTEMS.
B. G. Ryder.
[Rutgers. Department of Computer Science. DCS-TR-158. 1985.]
101968 APPLICABILITY OF INCREMENTAL ITERATIVE ALGORITHMS.
T. Marlowe, M. C. Paull, and B. G. Ryder.
[Rutgers. Department of Computer Science. DCS-TR-159. 1985.]
101969 A FRAMEWORK FOR REPRESENTATION OF EXPERTISE IN EXPERIMENTAL DESIGN
FOR ENZYME KINETICS.
V. W. Soo, C. A. Kulikowski, and D. Garfinkel.
[Rutgers. Laboratory for Computer Science Research. CBM-TR-146. 1985.]
101970 TOWARDS A PROGRAMMING ENVIRONMENT FOR LARGE PROLOG PROGRAMS.
Jan Chomicki and Naftaly H. Minsky.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-71. 1985.]
101971 THE CRITTER SYSTEM - AN ARTIFICIAL INTELLIGENCE APPROACH TO DIGITAL
CIRCUIT DESIGN CRITIQUING.
Van E. Kelly.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-72. 1985.
Thesis (Ph.D.).]
101972 QUADRATIC FUNCTIONS WITH EXPONENTIAL NUMBER OF LOCAL MAXIMA.
B. Kalanatari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-73. 1985.]
101973 A GOOD HEURISTIC FOR THE CHINESE POSTMAN PROBLEM.
M. D. Grigoriadis and B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-74. 1985.]
101974 PURPOSE-DIRECTED ANALOGY.
Smadar Kedar-Cabelli.
[Rutgers. Laboratory for Computer Science Research. ML-TR-1. 1985.]
052029 EQUATIONS, SCHEMATA AND SITUATIONS: A FRAMEWORK FOR LINGUISTIC
SEMANTICS.
Jens Erik Fenstad et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-29. 1985.]
052030 INSTITUTIONS: ABSTRACT MODEL THEORY FOR COMPUTER SCIENCE.
J. A. Goguen and R. M. Burstall.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-30. 1985.]
052031 A FORMAL THEORY OF KNOWLEDGE AND ACTION.
Robert C. Moore.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-31. 1985.]
052032 FINITE STATE MORPHOLOGY: A REVIEW OF KOSKENNIEMI (1983).
Gerald Gazdar.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-32. 1985. Review of "Two-Level Morphology: a
General Computational Model for Word-form Recognition and Production,
by Kimmo Koskiennemi (University of Helsinki, Department of
Linguistics, Publication II)."]
101975 DIFFERENZENVERFAHREN HOHER ORDUNG FUER ELLIPTISCHE RANDWERTPROBLEME
MIT GEKRUEMMTEN RANDERN.
Reinhard Fossmeier.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8411. 1984.]
101976 CODE GENERATION PHASE MODELS BASED ON ABSTRACT MACHINE DESCRIPTIONS.
Robert Giegerich.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8412. 1984.]
101977 RELATIONAL ALGEBRAIC SEMANTICS OF FUNCTIONAL PROGRAMS.
R. Berghammer and H. Zierer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8501. 1985.]
101978 ON A CLASS OF BCMP CONSISTENT INTEGRATED PERFORMANCE/RELIABILITY
MODELS.
Eike Jessen and Olaf Schoen.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8502. 1985.]
101979 DIE EXPLIZITE LOESUNG DER KINEMATISCHEN GLEICHUNG FOR EINE KLASSE VON
INDUSTRIEROBOTERN.
Hermann Heiss.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8504. 1985.]
101980 ITS - EIN PROGRAMMSYSTEM ZUR SIMULATION DES VERHALTENS VON
BETRIEBSSYSTEMEN. EINFUEHRUNG FUER DEN ANWENDER.
Stefan Eichholz, Bernhard Hoferer, and Helma Schneider.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8505. 1985.]
101981 THE TREATMENT OF MACRO EXPANSIONS IN THE TEMPORAL LOGIC OF PARALLEL
PROGRAMS.
A. Kausche and F. Kroger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8506. 1985.]
101982 EINE ADAPTIVE KOLLOKATIONS-LINIENMETHODE ZUR NUMERISCHEN LOESUNG
PARABOLISCHER DIFFERENTIALGLEICHUNGEN MIT ANWENDUNG AUF ROHRENMODELLE
AUS DER BIOLGIE.
Albert Gilg.
[Technische Universitaet Muenchen (TUM). Institut fuer Mathematik.
TUM-M8407. 1984.]
101983 EIN SEMI-KOLLOKATIONSVERFAHREN ZUR NUMERISCHEN LOESUNG VON
NIERENMODELLEN.
Peter Lory.
[Technische Universitaet Muenchen (TUM). Institut fuer Mathematik.
TUM-M8501. 1985.]
101984 AN ENVELOPE OF HOLOMORPHY FOR CERTAIN NORMAL COMPLEX SPACES.
Sandra Hayes and Genevieve Pourcin.
[Technische Universitaet Muenchen (TUM). Institut fuer Mathematik.
TUM-M8503. 1985.]
101985 AN IMPROVED STARTING STEP OF THE G-B-S-METHOD FOR THE SOLUTION OF
ORDINARY DIFFERENTIAL EQUATIONS.
Martin Kiehl and Christoph Zenger.
[Technische Universitaet Muenchen (TUM). Institut fuer Mathematik.
TUM-M8504. 1985.]
101986 SYSTEMS PROGRAMMING IN CONCURRENT PROLOG.
Ehud Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-01. 1984.]
101987 DISTRIBUTED PROGRAMMING IN CONCURRENT PROLOG.
A. Shafrir and Ehud Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-02. 1984.]
101988 COMMUNICATION IN CONCURRENT DYNAMIC LOGIC.
David Peleg.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-15. 1984.]
101989 EXPERT SYSTEM = KNOWLEDGE + META-INTERPRETER.
Leon Sterling.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-17. 1984.]
101990 QUADTREES IN CONCURRENT PROLOG.
Shimon Edelman and Ehud Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS84-19. 1985. Revised, January 1985.]
101991 PROBABILISTIC BOUNDS FOR DUAL BIN-PACKING.
John L. Bruno and Peter J. Downey.
[University of Arizona. Department of Computer Science. TR 84-19.
1984.]
101992 AN APPLICATIVE EDITOR FOR VERSION CONTROL.
Christopher W. Fraser and Eugene W. Myers.
[University of Arizona. Department of Computer Science. TR 84-20.
1984.]
101993 EXPECTED PERFORMANCE OF A HEURISTIC FOR THE MINIMUM SUM OF SQUARES
PROBLEM.
Torben Noerup Nielsen.
[University of Arizona. Department of Computer Science. TR 84-22.
1984.]
101994 EXPECTED PERFORMANCE OF AN IMPROVED HEURISTIC FOR THE MINIMUM SUM OF
SQUARES PROBLEM.
Torben Noerup Nielsen.
[University of Arizona. Department of Computer Science. TR 84-23.
1984.]
101995 A LITTLE SMALLTALK USER MANUAL.
Timothy A. Budd.
[University of Arizona. Department of Computer Science. TR 85-1.
1985.]
101996 SEQUE: A LANGUAGE FOR PROGRAMMING WITH STREAMS.
Ralph E. Griswold and Janalee O'Bagy.
[University of Arizona. Department of Computer Science. TR 85-2.
1985.]
101997 CREATION AND REFLEXIVE RIGHTS IN GRAMMATICAL PROTECTION SYSTEMS.
Timothy A. Budd.
[University of Arizona. Department of Computer Science. TR 85-3.
1985.]
101998 REFERENCE MANUAL FOR THE SEQUE PROGRAMMING LANGUAGE.
Ralph E. Griswold and Janalee O'Bagy.
[University of Arizona. Department of Computer Science. TR 85-4.
1985.]
101999 BOUNDS ON PREFIX ALGORITHMS FOR DUAL BIN-PACKING.
Peter J. Downey.
[University of Arizona. Department of Computer Science. TR 85-5.
1985.]
102000 AN O(ND) DIFFERENCE ALGORITHM AND ITS VARIATIONS.
Eugene W. Myers.
[University of Arizona. Department of Computer Science. TR 85-6.
1985.]
102001 AN ASYMPTOTICALLY OPTIMAL HEURISTIC FOR THE DOUBLY RANDOMIZED
KNAPSACK PROBLEM.
Tourben Noerup Nielsen.
[University of Arizona. Department of Computer Science. TR 85-7.
1985.]
102002 THE SAGUARO DISTRIBUTED OPERATING SYSTEM.
Gregory R. Andrews et al.
[University of Arizona. Department of Computer Science. TR 85-9.
1985.]
102003 DERIVING AN ALGORITHM FOR PARTITIONING RECTANGLES.
Richard D. Schlichting.
[University of Arizona. Department of Computer Science. TR 85-10.
1985.]
102004 FACILITATING MIXED LANGUAGE PROGRAMMING IN DISTRIBUTED SYSTEMS.
Roger Hayes and Richard D. Schlichting.
[University of Arizona. Department of Computer Science. TR 85-11.
1985.]
102005 SIDE-EFFECTS IN AUTOMATIC FILE UPDATING.
Webb Miller and Eugene W. Myers.
[University of Arizona. Department of Computer Science. TR 85-12.
1985.]
102006 EXTENDING A DATA BASE SYSTEM WITH PROCEDURES.
Michael Stonebraker, Jeff Anton, and Eric Hanson.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M85/59. 1985.]
102007 INCLUSION OF NEW TYPES IN RELATIONAL DATA BASE SYSTEMS.
Michael Stonebraker.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M85/67. 1985.]
102008 REFERENCE MANUAL OF FORTRAN PROGRAM ILLOD-(NOR-B) FOR OPTIMAL NOR
NETWORKS.
Tomoyasu-Taguti Nakagawa and Hung-Chi Lai.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1129. 1985. Revised.]
102009 TERMINATION OF REWRITING.
Nachum Dershowitz.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1220. 1985.]
102110 A REVIEW OF SEVERAL CLOSURE PROPERTIES IN UNIVERSAL ALGEBRA AND FIRST
ORDER LOGIC.
Jean-Luc Remy.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1221. 1985.]
102111 VIEW MANAGER: A GRAPHICAL WINDOWING SYSTEM.
Michael Bruce Hohulin.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1222. 1985. Thesis (M.S.).]
102112 NETWORK QUERY OPTIMIZATION MADE EASY.
Sharon McCure Kuck.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1226. 1985.]
102113 COMPUTER SLEEP STORAGE SCORING -- AN EXPERT SYSTEM APPROACH.
S. R. Ray et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1228. 1985.]
102114 MEDIATORS: A SYNCHRONIZATION MECHANISM.
J. E. Grass and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1230. 1985.]
102115 COMPUTING PARENT NODES IN THREADED BINARY TREES.
Keith Brink.
[University of Iowa. Department of Computer Science. Technical report
85-05. 1985.]
102116 THE AMORTIZED COMPLEXITY OF HENRIKSEN'S ALGORITHM.
Jeffrey H. Kingston.
[University of Iowa. Department of Computer Science. Technical report
85-06. 1985.]
102220 A MONTE CARLO STUDY OF THE NEMATIC TO SMECTIC-A TRANSITION.
Chandan Dasgupta.
[University of Minnesota. Supercomputer Institute. UMSI 85/9. 1985.]
102221 GLOBAL OPTIMIZATION APPROACH TO THE LINEAR COMPLEMENTARITY PROBLEM.
P. M. Pardalos and J. B. Rosen.
[University of Minnesota. Supercomputer Institute. UMSI 85/10. 1985.]
102222 SYSTEM DESIGN AND STRUCTURING.
B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 198. 1985.]
102223 NETWORKING ISSUES IN THE NEWCASTLE CONNECTION.
A. Linton.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 199. 1985.]
102224 RAJDOOT: A REMOTE PROCEDURE CALL MECHANISM SUPPORTING ORPHAN
DETECTION AND KILLING.
F. Panzieri and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 200. 1985.]
102225 RELIABLE COMPUTING IN A UNIX UNITED ENVIRONMENT.
K. H. Bennett, L. F. Marshall, and B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 201. 1985.]
102226 SOFTWARE FAULT TOLERANCE: AN EVALUATION.
T. Anderson et al.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 202. 1985.]
102227 THE MANY DIMENSIONS OF LOGICAL FORM.
Nick Cercone, Gordon McCalla, and Paul McFetridge.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-10. 1985.]
102228 STATIONING THE MINIMUM NUMBER OF GUARDS IN AN ORTHOGONAL ART GALLERY.
J. Mark Keil.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-11. 1985.]
102229 CHARACTERIZING SHORT TERM FILE REFERENCING BEHAVIOR.
Carey L. Williamson and Richard B. Bunt.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-12. 1985.]
102230 DEFINITION AND IMPLEMENTATION OF CONTEXT CONDITIONS FOR PROGRAMMING
LANGUAGES.
Alan Rosselet.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRG-162. 1984. Thesis (Ph.D.).]
102231 UNDERSTANDING ADJECTIVES.
Yawar Ali.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-167. 1985. Thesis (M.S.).]
102232 INTERMISSION -- ACTORS IN PROLOG.
Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 1. 1981.]
102233 UNIFORM -- A LANGUAGE BASED UPON UNIFICATION WHICH UNIFIES (MUCH OF)
LISP, PROLOG, AND ACT 1.
Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 2. 1981.]
102234 NATDED, A DERIVATION EDITOR.
Agneta Eriksson and Anna-Lena Johansson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 3. 1981.]
102235 DEDUCTIVE MODELING OF HUMAN COGNITION.
Goran Hagert and Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 4. 1981.]
102236 ON IMPLEMENTING PROLOG IN FUNCTIONAL PROGRAMMING.
Mats Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 5. 1983. Revised, December 8, 1983.]
102237 A PROGRAMMING LANGUAGE BASED ON A NATURAL DEDUCTION SYSTEM.
Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 6. 1981.]
102238 PROGRAM TRANSFORMATION BY DATA STRUCTURE MAPPING.
Ake Hansson and Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 7. 1981.]
102239 PROPERTIES OF A LOGIC PROGRAMMING LANGUAGE.
Ake Hansson, S. Haridi, and Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 8. 1981.]
102240 THE IMPLEMENTATION OF UNIFORM: A KNOWLEDGE-REPRESENTATION/PROGRAMMING
LANGUAGE BASED UPON EQUIVALENCE OF DESCRIPTIONS.
Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 9. 1982.]
102241 ON THE AUTOMATED LEARNING OF PROBLEM SOLVING RULES.
Stellan Ohlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 10. 1982.]
102242 TOWARDS A DERIVATION EDITOR.
Agneta Eriksson, Anna-Lena Johansson, and Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 11. 1983.]
102243 CONPUTER-BASED SYNTHESIS OF LOGIC PROGRAMS.
Agneta Eriksson and Anna-Lena Johansson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 12. 1982.]
102244 TRANSFER OF TRAINING IN PROCEDURAL LEARNING: A MATTER OF CONJECTURES
AND REFUTATIONS.
Stellan Ohlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 13. 1982.]
102245 A GRAMMER KIT IN PROLOG.
Kenneth M. Kahn and Mats Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 14C. 1985.]
102246 UNIQUE FEATURES OF LISP MACHINE PROLOG.
Kenneth M. Kahn and Mats Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 15B. 1985.]
102248 A PARTIAL EVALUATOR OF LISP WRITTEN IN PROLOG.
Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 17. 1983.]
102249 MECHANIZATION OF AN ORACLE IN A DEBUGGGING SYSTEM.
Anneli Edman and Sten-Ake Tarnlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 18. 1983.]
102250 A LOGICAL MODEL OF KNOWLEDGE.
Martin Nilsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 19. 1983.]
102251 FOOLOG - A SMALL AND EFFICIENT PROLOG INTERPRETER.
Martin Nilsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 20. 1983.]
102252 LOGIC MODELLING OF COGNITIVE REASONING.
Goran Hagert and Ake Hansson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 21. 1983.]
102253 SYNTHESIS OF A UNIFICATION ALGORITHM IN A LOGIC PROGRAMMING CALCULUS.
Lars-Henrik Eriksson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 22B. 1984.]
102254 PARTIAL EVALUATION AS AN EXAMPLE OF THE RELATIONSHIPS BETWEN
PROGRAMMING METHODOLOGY AND ARTIFICIAL INTELLIGENCE.
Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 23. 1983.]
102255 LM-PROLOG USER MANUAL.
Mats Carlsson and Kenneth M. Kahn.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 24. 1983.]
102256 REASONING MODELS WITHIN A LOGICAL FRAMEWORK.
Goran Hagert and Ake Hansson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 25. 1984.]
102257 DECLARATIVE DETERMINISM IN PROLOG IMPLEMENTATIONS.
Martin Nilsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 26. 1984.]
102258 THE COMPILATION OF PROLOG PROGRAMS WITHOUT THE USE OF A PROLOG
COMPILER.
Kenneth M. Kahn and Mats Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 27. 1984.]
102259 PROLOG AS A TOOL FOR OPTIMIZING PROLOG UNIFIERS.
Martin Nilsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 28. 1984.]
102260 A LOGICAL MODEL OF KNOWLEDGE AND BELIEF.
Martin Nilsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 29. 1984.]
102261 LM-PROLOG: THE LANGUAGE AND ITS IMPLEMENTATION.
Mats Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 30. 1984.]
102262 A COMPARISON OF RECEIVER-INITIATED AND SENDER-INITIATED DYNAMIC LOAD
SHARING.
Derek L. Eager, Edward D. Lazowska, and John Zahorjan.
[University of Washington. Department of Computer Science. Technical
report 85-04-01. 1985.]
102263 REGENERATION OF REPLICATED OBJECTS: A TECHNIQUE FOR INCREASED
AVAILABILITY.
Calton Pu, Jerre D. Noe, and Andy Proudfoot.
[University of Washington. Department of Computer Science. Technical
report 85-04-02. 1985.]
102264 A CLASSIFICATION OF DISTRIBUTED OPERATING SYSTEMS.
Eric Jul.
[University of Washington. Department of Computer Science. Technical
report 85-05-01. 1985.]
102265 IMPLEMENTING ADA EXCEPTIONS.
T. P. Baker and G. A. Riccardi.
[University of Washington. Department of Computer Science. Technical
report 85-06-01. 1985.]
102266 VIRTUALLY ADDRESSED CACHES FOR MULTIPROGRAMMING AND MULTIPROCESSING
ENVIRONMENTS.
Verna Knapp.
[University of Washington. Department of Computer Science. Technical
report 85-06-02. 1985. Thesis (Ph.D.).]
102267 AN INQUIRY INTO THE BENEFITS OF MULTIGAUGE PARALLEL COMPUTATION.
L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 85-06-03. 1985.]
102268 REAL-TIME SOFTWARE SYSTEMS.
T. P. Baker and Greg Scallon.
[University of Washington. Department of Computer Science. Technical
report 85-06-04. 1985.]
102269 AN ADA RUNTIME SYSTEM INTERFACE.
T. P. Baker.
[University of Washington. Department of Computer Science. Technical
report 85-06-05. 1985.]
102270 A THREE-DIMENSIONAL GRAPHICAL PARADIGM FOR REPRESENTING PROGRAMS.
E. P. Glinert, M. D. Tang, and S. L. Tanimoto.
[University of Washington. Department of Computer Science. Technical
report 85-07-01. 1985.]
102271 A MODEL AND NOTATION FOR SPECIFYING USER INTERFACES.
Uli H. Chi.
[University of Washington. Department of Computer Science. Technical
report 85-07-02. 1985. Thesis (Ph.D.).]
102272 VLSI DESIGN TOOLS: REFERENCE MANUAL.
[University of Washington. Department of Computer Science. Technical
report 85-07-03. 1985.]
102273 THE QUARTER HORSE: A CASE STUDY IN RAPID PROTOTYPING OF A 32-BIT
MICROPROCESSOR CHIP.
S. Ho et al.
[University of Washington. Department of Computer Science. Technical
report 85-07-04. 1985.]
102274 DESIGNING ICONIC PROGRAMMING SYSTEMS: REPRESENTATION AND LEARNABILITY.
S. L. Tanimoto and E. P. Glinert.
[University of Washington. Department of Computer Science. Technical
report 85-07-05. 1985.]
102275 QUANTITATIVE DEDUCTION AND ITS FIXPOINT THEORY.
M. H. van Emden.
[University of Waterloo. Department of Computer Science. Research
report CS-85-15. 1985.]
102276 A DATA STRUCTURE FOR SPARSE QR AND LU FACTORIZATIONS.
Alan George, Joseph Liu, and Esmond Ng.
[University of Waterloo. Department of Computer Science. Research
report CS-85-16. 1985.]
102277 ROBUST STORAGE STRUCTURES FOR CRASH RECOVERY.
D. J. Taylor and C.-J. Seger.
[University of Waterloo. Department of Computer Science. Research
report CS-85-18. 1985.]
102278 CONCURRENCY AND FORWARD RECOVERY IN ATOMIC ACTIONS.
D. J. Taylor.
[University of Waterloo. Department of Computer Science. Research
report CS-85-19. 1985.]
102279 HOW BIG CAN AN ATOMIC ACTION BE?
D. J. Taylor.
[University of Waterloo. Department of Computer Science. Research
report CS-85-20. 1985.]
102280 A SURVEY OF SYSTOLIC SYSTEMS FOR SOLVING THE ALGEBRAIC PATH PROBLEM.
Faron Moller.
[University of Waterloo. Department of Computer Science. Research
report CS-85-22. 1985.]
102281 THE EQUIVALENCE PROBLEM FOR SINGLE-VALUED TWO-WAY TRANSDUCERS IS
DECIDABLE.
Karel Culik II and Juhani Karhumaki.
[University of Waterloo. Department of Computer Science. Research
report CS-85-24. 1985.]
102282 A LOWER BOUND FOR PROBABILISTIC DISTRIBUTED ALGORITHMS.
Jan K. Pachl.
[University of Waterloo. Department of Computer Science. Research
report CS-85-25. 1985.]
102283 THE POTENTIAL ROLE OF CANADA IN THE EUROPEAN COMMUNITIES ESPRIT
PROJECT.
Randy Goebel.
[University of Waterloo. Department of Computer Science. Research
report CS-85-26. 1985.]
102284 ON ELIMINATING LOOPS IN PROLOG.
David Poole and Randy Goebel.
[University of Waterloo. Department of Computer Science. Research
report CS-85-27. 1985.]
102285 A VLSI CIRCUIT FOR ANTI-ALIASED LINE SCAN CONVERSION.
Dan Field.
[University of Waterloo. Department of Computer Science. Research
report CS-85-28. 1985.]
102286 A NEW PROOF FOR THE DOL SEQUENCE EQUIVALENCE PROBLEM AND ITS
IMPLICATIONS.
Karel Culik II and Juhani Karhumaki.
[University of Waterloo. Department of Computer Science. Research
report CS-85-30. 1985.]
102287 THE MARATOS EFFECT IN SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHMS
USING THE L1 EXACT PENALTY FUNCTION.
I. D. Coope.
[University of Waterloo. Department of Computer Science. Research
report CS-85-32. 1985.]
102288 HANDLING DEGENERACY IN A NONLINEAR L1 ALGORITHM.
Senad Buscovaca.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-34. 1985. Thesis (Ph.D.).]
102289 VISIBILITY OF A SIMPLE POLYGON FROM A POINT.
B. Joe and R. B. Simpson.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-38. 1985.]
102290 THE DESIGN AND IMPLEMENTATION OF A PACKAGE FOR SPARSE CONSTRAINED
LEAST SQUARES PROBLEMS.
Alan George and Esmond Ng.
[University of Waterloo. Department of Computer Science. Research
report CS-85-39. 1985.]
102291 EVALUATION OF A DECOUPLED COMPUTER ARCHITECTURE AND THE DESIGN OF A
VECTOR EXTENSION.
Honesty Cheng Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 603. 1985. Thesis (Ph.D.).]
102292 CONVERGENCE OF CARDINAL SERIES.
Carl de Boor, Klaus Hollig, and Sherman Riemenschneider.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 604. 1985.]
102293 A STUDY OF INDEX STRUCTURES FOR MAIN MEMORY DATABASE MANAGEMENT
SYSTEMS.
Tobin J. Lehman and Michael J. Carey.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 605. 1985.]
102294 ITERATIVE METHODS OF SOLUTION FOR COMPLEMENTARITY PROBLEMS.
Pudukkottai K. Subramanian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 607. 1985. Thesis (Ph.D.).]
102295 A GRAMMAR BASED METHODOLOGY FOR PROTOCOL SPECIFICATION AND
IMPLEMENTATION.
David P. Anderson and Lawrence H. Landweber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 608. 1985.]
102296 ON THE DISTRIBUTION OF THE SINGULAR VALUES OF TOEPLITZ MATRICES.
Seymour V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 609. 1985.]
102297 A COMPUTATIONAL MODEL FOR INTERFACES.
J. Glimm and O. A. McBryan.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-265. 1985.]
102298 LARCH IN FIVE EASY PIECES.
J. V. Guttag, J. J. Horning, and J. M. Wing.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 5. 1985.]
102299 ASSERTIONS FROM DISCOURSE STRUCTURE.
William C. Mann and Sandra A. Thompson.
[University of Southern California. Information Sciences Institute.
ISI/RS-85-155. 1985.]
102300 A NEW APPROACH TO THE DESIGN AND CONSTRUCTION OF PROTOCOL TESTERS.
J. R. Pavel.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 54/85. 1985.]
102301 EVOLVE III: A DISCRETE EVENTS MODEL OF AN EVOLUTIONARY ECOSYSTEM.
Mateen M. Rizki and Michael Conrad.
[Wayne State University. Department of Computer Science. CSC-85-004.
1985.]
VOL. 7, NO. 11 11/20/85
102010 HIERARCHICAL COMPOSITION OF VLSI CIRCUITS.
Telle Elizabeth Whitney.
[California Institute of Technology. Computer Science Department.
Report no. 5189:TR:85. 1985. Thesis (Ph.D.).]
102011 THE SNEPTREE - A VERSATILE INTERCONNECTION NETWORK.
Pey-yun Peggy Li and Alain J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5194:TR:85. 1985.]
102012 SEQUENTIAL THRESHOLD CIRCUITS.
John C. Platt.
[California Institute of Technology. Computer Science Department.
Report no. 5197:TR:85. 1985.]
102013 NEURAL NETWORKS, PATTERN RECOGNITION, AND FINGERPRINT HALLUCINATION.
Eric Mjolsness.
[California Institute of Technology. Computer Science Department.
Report no. 5198:TR:85. 1985. Thesis (Ph.D.).]
102014 SYNTAX AND SEMANTICS IN NATURAL LANGUAGE PARSERS.
Robert E. Frederking.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-133. 1985.]
102015 GRAPH-BASED ALGORITHMS FOR BOOLEAN FUNCTION MANIPULATION.
Randal E. Bryant.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-135. 1985.]
102016 LEARNING TO RECOGNIZE SPEECH SOUNDS: A THEORY AND A MODEL.
Gary L. Bradshaw.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-136. 1985. Thesis (Ph.D.).]
102017 AUTOMATIC DISTRIBUTION OF PROGRAMS AND DATA IN A DISTRIBUTED
ENVIRONMENT.
Michael L. Kazar.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-137. 1985. Thesis (Ph.D.).]
102018 TIME-DRIVEN ORPHAN ELIMINATION.
Martin S. McKendry and Maurice Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-138. 1985.]
102019 FEASIBILITY STUDY OF PERSONAL/INTERACTIVE MACHINE TRANSLATION SYSTEMS.
Masaru Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-140. 1985.]
102020 COMPARING CATEGORIES OF DOMAINS.
Carl A. Gunter.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-141. 1985.]
102021 A UNIVERSAL DOMAIN TECHNIQUE FOR PROFINITE POSETS.
Carl A. Gunter.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-142. 1985.]
102022 NEW APPROACHES TO MACHINE TRANSLATION.
Jaime G. Carbonell and Masaru Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-143. 1985.]
102023 GEOMETRIC REASONING: A NEW PARADIGM FOR PROCESSING GEOMETRIC
INFORMATION.
Jeannette M. Wing and Farhad Arabab.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-144. 1985.]
102024 VALIDATION OF A FAULT-TOLERANT MULTIPROCESSOR: BASELINE EXPERIMENTS
AND WORKLOAD IMPLEMENTATION.
Frank Feather, Daniel Siewiorek, and Zary Segall.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-145. 1985.]
102025 ADDING TEMPORAL LOGIC TO INA JO.
Jeannette M. Wing and Mark R. Nixon.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-146. 1985.]
102026 COMPILE-TIME EVALUATION AND CODE GENERATION FOR SEMANTICS-DIRECTED
COMPILERS.
Andrew W. Appel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-147. 1985. Thesis (Ph.D.).]
102027 FULL ABSTRACTION AND SEMANTIC EQUIVALENCE.
Ketan Mulmuley.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-148. 1985. Thesis (Ph.D.).]
102028 A MECHANIZABLE THEORY FOR EXISTENCE PROOFS OF INCLUSIVE PREDICATES.
Ketan Mulmuley.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-149. 1985.]
102029 ESCHER -- A GEOMETRICAL LAYOUT SYSTEM FOR RECURSIVELY DEFINED
CIRCUITS.
Edmund Clarke and Yulin Feng.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-150. 1985.]
102030 NATURAL LANGUAGE FOR EXPERT SYSTEMS: COMPARISONS WITH DATABASE
SYSTEMS.
Kathleen R. McKeown.
[Columbia University. Department of Computer Science. CUCS-91-84.
1984.]
102031 RELATIONAL QUERY PROCESSING ON THE NON-VON SUPERCOMPUTER.
David Elliot Shaw.
[Columbia University. Department of Computer Science. CUCS-95-84.
1984.]
102032 UNIFICATION IN A PARALLEL ENVIRONMENT.
Stephen Taylor, Daphne Tzoar, and Salvatore J. Stolfo.
[Columbia University. Department of Computer Science.
CUCS-97-84. 1984.]
102033 PUTTING PIECES TOGETHER: UNDERSTANDING PATENT ABSTRACTS.
Michael Lebowitz.
[Columbia University. Department of Computer Science. CUCS-98-84.
1984.]
102034 CREATING CHARACTERS IN A STORY-TELLING UNIVERSE.
Michael Lebowitz.
[Columbia University. Department of Computer Science. CUCS-99-84.
1984.]
102035 AN O(EV LOG V) ALGORITHM FOR FINDING MAXIMAL WEIGHTED MATCHING IN
GENERAL GRAPHS.
Zvi Galil, Silvio Micali, and Harold N. Gabow.
[Columbia University. Department of Computer Science. CUCS-100-84.
1984.]
102036 ILL-FORMED TEXT AND CONCEPTUAL PROCESSING.
Michael Lebowitz.
[Columbia University. Department of Computer Science. CUCS-101-84.
1984.]
102037 SIMD AND MSIMD VARIANTS OF THE NON-VON SUPERCOMPUTER.
David Elliot Shaw.
[Columbia University. Department of Computer Science. CUCS-103-84.
1984.]
102038 BETA-TREES, GAMMA-SYSTEMS, AND THEOREM ON F-HEAPS.
Zvi Galil and Thomas Spencer.
[Columbia University. Department of Computer Science. CUCS-105-84.
1984.]
102039 LINEAR PROBLEMS (WITH EXTENDED RANGE) HAVE LINEAR OPTIMAL ALGORITHMS.
Edward W. Packel.
[Columbia University. Department of Computer Science. CUCS-106-84.
1984.]
102040 SIMULTANEOUS FIRING OF PRODUCTION RULES ON TREE STRUCTURED MACHINES.
Toru Ishada and Salvatore J. Stolfo.
[Columbia University. Department of Computer Science. CUCS-109-84.
1984.]
102041 INTEREST AND PREDICTABILITY: DECIDING WHAT TO LEARN, WHEN TO LEARN.
Michael Lebowitz.
[Columbia University. Department of Computer Science. CUCS-110-84.
1984.]
102042 CONCEPT LEARNING IN A RICH INPUT DOMAIN: GENERALIZATION-BASED MEMORY.
Michael Lebowitz.
[Columbia University. Department of Computer Science. CUCS-111-84.
1984.]
102043 LPS ALGORITHMS: A DETAILED EXAMINATION.
Andy Lowry, Stephen Taylor, and Salvatore J. Stolfo.
[Columbia University. Department of Computer Science. CUCS-112-84.
1984.]
102044 LPS ALGORITHMS: A CRITICAL ANALYSIS.
Andy Lowry, Stephen Taylor, and Salvatore J. Stolfo.
[Columbia University. Department of Computer Science. CUCS-113-84.
1984.]
102045 PERFORMANCE ESTIMATES FOR THE DADO MACHINE: A COMPARISON OF TREAT AND
RETE.
Daniel P. Miranker.
[Columbia University. Department of Computer Science. CUCS-118-84.
1984.]
102046 IMAGE UNDERSTANDING ALGORITHMS ON FINE-GRAINED TREE-STRUCTURED SIMD
MACHINES.
Hussein A. H. Ibrahim.
[Columbia University. Department of Computer Science. CUCS-139-84.
1984.]
102047 A STATISTICAL MECHANICS OF SOME INTERCONNECTION NETWORKS.
Eugene Pinsky and Yechiam Yemini.
[Columbia University. Department of Computer Science. CUCS-139-84.
1984.]
102048 CAN WE APPROXIMATE ZEROS OF FUNCTIONS WITH NON-ZERO TOPOLOGICAL
DEGREE?
T. Boult and K. Sikorski.
[Columbia University. Department of Computer Science. CUCS-142-84.
1984.]
102049 SOFTWARE FOR ESTIMATING SPARSE HESSIAN MATRICES.
Thomas F. Coleman, Burton S. Garbow, and Jorge J. More.
[Cornell University. Department of Computer Science. Technical report
85-660. 1985.]
102050 AUTOMATIC SURFACE GENERATION IN COMPUTER AIDED DESIGN.
Christoph Hoffman and John Hopcroft.
[Cornell University. Department of Computer Science. Technical report
85-661. 1985.]
102051 EARLY STOPPING PROTOCOLS FOR FAULT-TOLERANT DISTRIBUTED AGREEMENT.
Kenneth Jay Perry.
[Cornell University. Department of Computer Science. Technical report
85-662. 1985. Thesis (Ph.D.).]
102052 LOWER BOUNDS IN COMPUTATIONAL COMPLEXITY.
Ming Li.
[Cornell University. Department of Computer Science. Technical report
85-663. 1985. Thesis (Ph.D.).]
102053 REPRESENTING CONSTRUCTIVE THEORIES IN HIGH-LEVEL PROGRAMMING
LANGUAGES.
Ryan Stansifer.
[Cornell University. Department of Computer Science. Technical report
85-664. 1985. Thesis (Ph.D.).]
102054 DESIGN BY EXAMPLE: AN APPLICATION OF ARMSTRONG RELATIONS.
Heikki Mannila.
[Cornell University. Department of Computer Science. Technical report
85-665. 1985.]
102055 LOWER BOUNDS BY KOLMOGOROV-COMPLEXITY.
Ming Li.
[Cornell University. Department of Computer Science. Technical report
85-666. 1985.]
102056 SIMULATING TWO PUSHDOWN STORES BY ONE TAPE IN O(N SUPERSCRIPT
1.5*SQRT(LOGN)) TIME.
Ming Li.
[Cornell University. Department of Computer Science. Technical report
85-667. 1985.]
102057 REPLICATION AND FAULT-TOLERANCE IN THE ISIS SYSTEM.
Kenneth P. Birman.
[Cornell University. Department of Computer Science. Technical report
85-668. 1985. Revised, September 1985.]
102058 VORONOI DIAGRAMS AND ARRANGEMENTS.
Herbert Edelsbrunner and Raimund Seidel.
[Cornell University. Department of Computer Science. Technical report
85-669. 1985.]
102059 ON COMPLETE PROBLEMS FOR THE INTERSECTION OF NP AND CONP.
Juris Hartmanis and Neil Immerman.
[Cornell University. Department of Computer Science. Technical report
85-670. 1985.]
102060 A BETTER TOOL FOR QUERY OPTIMIZATION.
Dina Bitton and Bradley Vander Zanden.
[Cornell University. Department of Computer Science. Technical report
85-671. 1985.]
102061 THE HOMOGENEOUS CAPTURE OF RANDOM STRINGS.
B. Natarajan.
[Cornell University. Department of Computer Science. Technical report
85-672. 1985.]
102062 WIDE QUOTIENT TREES FOR FINITE ELEMENT PROBLEMS.
Earl Zmijewski and John R. Gilbert.
[Cornell University. Department of Computer Science. Technical report
85-673. 1985.]
102063 QUADRATIC BLENDING SURFACES.
Christoph Hoffman and John Hopcroft.
[Cornell University. Department of Computer Science. Technical report
85-674. 1985. Revised, September 1985.]
102064 ASPECTS OF THE IMPLEMENTATION OF TYPE THEORY.
Robert W. Harper.
[Cornell University. Department of Computer Science. Technical report
85-675. 1985. Thesis (Ph.D.).]
102065 SPARSE NULL BASES AND MARRIAGE THEOREMS.
Alex Pothen.
[Cornell University. Department of Computer Science. Technical report
85-676. 1984. Thesis (Ph.D.).]
102066 SYMMETRY AND SIMILARITY IN DISTRIBUTED SYSTEMS.
Ralph E. Johnson and Fred B. Schneider.
[Cornell University. Department of Computer Science. Technical report
85-677. 1984.]
102067 PERCOLATION SCHEDULING: A PARALLEL COMPILATION TECHNIQUE.
Alexandru Nicolau.
[Cornell University. Department of Computer Science. Technical report
85-678. 1985.]
102068 MULTILEVEL DATA STRUCTURES: MODELS AND PERFORMANCE.
A. Moitra, S. Iyengar, and F. Bastani.
[Cornell University. Department of Computer Science. Technical report
85-679. 1985.]
102069 THE BLOCK JACOBI METHOD FOR COMPUTING THE SINGULAR VALUE
DECOMPOSITION.
Charles Van Loan.
[Cornell University. Department of Computer Science. Technical report
85-680. 1985.]
102070 CHARACTERIZATIONS FOR ACYCLIC DATABASE SCHEMES.
Goesta Grahne and Kari-Jouko Raeihae.
[Cornell University. Department of Computer Science. Technical report
85-682. 1985.]
102071 INEXACT AGREEMENT: ACCURACY, PRECISION, AND GRACEFUL DEGRADATION.
Stephen R. Mahaney and Fred B. Schneider.
[Cornell University. Department of Computer Science. Technical report
85-683. 1985.]
102072 THE SEMANTICS OF EVIDENCE.
Robert L. Constable.
[Cornell University. Department of Computer Science. Technical report
85-684. 1985.]
102073 FRESH: A HIGHER-ORDER LANGUAGE WITH UNIFICATION AND MULTIPLE RESULTS.
Gert Smolka and Prakash Panangaden.
[Cornell University. Department of Computer Science. Technical report
85-685. 1985.]
102074 IMPLEMENTATION OF THE SMART INFORMATION RETRIEVAL SYSTEM.
Chris Buckley.
[Cornell University. Department of Computer Science. Technical report
85-686. 1985.]
102075 TIME-COMMUNICATION TRADEOFFS FOR RELIABLE BROADCAST PROTOCOLS.
Ozalp Babaoglu and Rogerio Drummond.
[Cornell University. Department of Computer Science. Technical report
85-687. 1985.]
102076 GRAPH MINIMAL UNCOLORABILITY IS D SUBSCRIPT P-COMPLETE.
Jin-yi Cai and Gabriele E. Meyer.
[Cornell University. Department of Computer Science. Technical report
85-688. 1985.]
102077 ON THE SCHUR DECOMPOSITION OF A MATRIX FOR PARALLEL COMPUTATION.
Patricia J. Eberlein.
[Cornell University. Department of Computer Science. Technical report
85-689. 1985.]
102078 A MODEL AND TEMPORAL PROOF SYSTEM FOR NETWORKS OF PROCESSES.
Van Long Nguyen et al.
[Cornell University. Department of Computer Science. Technical report
85-690. 1985.]
102079 A THEORY OF PROCESSES.
Van Long Nguyen.
[Cornell University. Department of Computer Science. Technical report
85-691. 1985. Thesis (Ph.D.).]
102080 DESIGN-BY-EXAMPLE: A DESIGN TOOL FOR RELATIONAL DATABASES.
Dina Bitton, Heikki Mannila, and Kari-Jouko Raeihae.
[Cornell University. Department of Computer Science. Technical report
85-692. 1985.]
102081 A CACHING FILE SYSTEM FOR A PROGRAMMER'S WORKSTATION.
Michael D. Schroeder, David K. Gifford, and Roger M. Needham.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 6. 1985.]
102082 A MOVING COMPUTATION FRONT APPROACH FOR VECTORIZING ICCG CALCULATIONS.
C. Cleveland Ashcraft.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-5174. 1985.]
102083 CAN A FAST SIGNATURE SCHEME WITHOUT SECRET KEY BE SECURE.
Paul Camion.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 399. 1985.]
102084 MATHEMATICAL METHODS IN THE ANALYSIS OF ALGORITHMS AND DATA
STRUCTURES.
Philippe Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 400. 1985.]
102085 CONSTRUCTIONS: A HIGHER ORDER PROOF SYSTEM FOR MECHANIZING
MATHEMATICS.
Thierry Coqaund and Gerard Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 401. 1985.]
102086 NONLINEAR FILTERING ON ONE-DIMENSIONAL DIFFUSIONS IN THE CASE OF A
HIGH SIGNAL-TO-NOISE RATIO.
Jean Picard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 402. 1985.]
102087 ASYMPTOTIC BEHAVIOR OF VISCOSITY SOLUTIONS OF FIRST-ORDER HAMILTON
JACOBI EQUATIONS.
Guy Barles.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 403. 1985.]
102088 ETUDE EXPLORATOIRE DE LA PROGRAMMATION D'AUTOMATES INDUSTRIELS CHEZ
DES ELEVES DE L'ENSEIGNEMENT TECHNIQUE.
Alexandre Morais and Willemina Visser.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 404. 1985.]
102089 ORDONNANCEMENT DE TRANSMISSIONS PERIODIQUES.
Najoua Dridi and Mario Teixeira.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 407. 1985.]
102090 ANALYSIS OF MULTI-SYSTEM FUNCTION REQUEST SHIPPING.
Douglas W. Cornell, Daniel M. Dias, and Philip Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 11154. 1985.]
102091 AN ALGEBRAIC APPROACH TO UNIFICATION UNDER ASSOCIATIVITY AND
COMMUTATIVITY.
Albrecht Fortenbacher.
[International Business Machines Corporation (IBM). Research
Division. RC 11158. 1985.]
102092 APPLICATION INTERFACE DEVELOPMENT ENVIRONMENT.
Robert F. Gordon and Barry E. Willner.
[International Business Machines Corporation (IBM). Research
Division. RC 11160. 1985.]
102093 ROBOTIC CIRCUIT BOARD TESTING USING FINE POSITIONERS WITH FIBER-OPTIC
SENSING.
R. L. Hollis et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11164. 1985.]
102094 WORK STATIONS AND MAINFRAMES WORKING TOGETHER.
J. K. Kravitz, D. Lieber, and F. H. Robbins.
[International Business Machines Corporation (IBM). Research
Division. RC 11167. 1985.]
102095 CLOSED-FORM SOLUTION FOR SYSTEM AVAILABILITY DISTRIBUTION.
Lorenzo Donatiello and Balakrishna R. Iyer.
[International Business Machines Corporation (IBM). Research
Division. RC 11169. 1985.]
102095 AN ADAPTIVE SYSTEM FOR HANDWRITING RECOGNITION.
C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. RC 11175. 1985.]
102097 COMPUTERS FOR COMPOSITION: A STAGE MODEL APPROACH TO HELPING.
Lance A. Miller.
[International Business Machines Corporation (IBM). Research
Division. RC 11261. 1985.]
102098 ANOTHER BIRTHDAY ATTACK.
Don Coppersmith.
[International Business Machines Corporation (IBM). Research
Division. RC 11264. 1985.]
102099 CHEATING AT MENTAL POKER.
Don Coppersmith.
[International Business Machines Corporation (IBM). Research
Division. RC 11265. 1985.]
102100 HUMAN FACTORS IN IBM.
John C. Thomas.
[International Business Machines Corporation (IBM). Research
Division. RC 11267. 1985.]
102101 RESTRUCTURING TEXTUAL INFORMATION ONLINE RETRIEVAL.
Larry Koved.
[International Business Machines Corporation (IBM). Research
Division. RC 11278. 1985.]
102102 CONCURRENCY AND RECOVERY IN DATA BASE SYSTEMS.
C. Mohan.
[International Business Machines Corporation (IBM). Research
Division. RJ 4700. 1985.]
102103 THE COMPLEXITY OF PARALLEL SORTING.
Friedhelm Meyer auf der Heide and Avi Wigderson.
[International Business Machines Corporation (IBM). Research
Division. RJ 4706. 1985.]
102104 THE POWER OF YOUR EDITOR.
Robert A. Stegwee, Leen Torenvliet, and Peter van Emde Boas.
[International Business Machines Corporation (IBM). Research
Division. RJ 4711. 1985.]
102105 RECURRENCE AND REGENERATION IN GENERALIZED SEMI-MARKOV PROCESSES.
Peter J. Haas and Gerald S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 4713. 1985.]
102106 CHEATING HUSBANDS AND OTHER STORIES: A CASE STUDY OF KNOWLEDGE,
ACTION AND COMMUNICATION.
Yoram Moses, Danny Dolev, and Joseph Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. RJ 4756. 1985.]
102107 TRANSITION SYSTEMS, INFINITARY LANGUAGES AND THE SEMANTICS OF UNIFORM
CONCURRENCY.
J. W. de Bakker et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8506. 1985.]
102108 ASSOCIATIVE PROCESSING IN BRAIN THEORY AND ARTIFICIAL INTELLIGENCE.
Anders Lansner.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8508. 1985. Also issued as
INTEGRAL-37, Integral Project, Department of Numerical Analysis and
Computing Science, Royal Institute of Technology, Stockholm.]
102109 THE CVAP-PROJECT PROGRESS REPORT 1984.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8509. 1985. Also issued as
INTEGRAL-43, Integral Project, Department of Numerical Analysis and
Computing Science, Royal Institute of Technology, Stockholm.]
052033 THE ROLE OF LOGIC IN ARTIFICIAL INTELLIGENCE.
Robert C. Moore.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-33. 1985.]
052035 COMMONSENSE SUMMER: FINAL REPORT.
Jerry R. Hobbs et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-35. 1985. Report of a Workshop, called
"Commonsense Summer," held during the summer of 1984 at the Arificial
Intelligence Center, SRI International.]
052037 ON THE COHERENCE AND STRUCTURE OF DISCOURSE.
Jerry R. Hobbs.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-37. 1985.]
052038 THE COHERENCE OF INCOHERENT DISCOURSE.
Jerry R. Hobbs and Michael H. Agar.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-38. 1985.]
025058 HOST GROUPS: A MULTICAST EXTENSION FOR DATAGRAM INTERNETWORKS.
David R. Cheriton and Stephen E. Deering.
[Stanford University. Department of Computer Science.
STAN-CS-85-1058. 1985. Also issued as Technical report 85-280,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
025059 COMPILING PASCAL PROGRAMS INTO SILICON.
Howard Trickey.
[Stanford University. Department of Computer Science.
STAN-CS-85-1059. 1985. Thesis (Ph.D.).]
025060 THE ESSENCE OF RUM: A THEORY OF THE INTENSIONAL AND EXTENSIONAL
ASPECTS OF LISP-TYPE COMPUTATION.
Carolyn L. Talcott.
[Stanford University. Department of Computer Science.
STAN-CS-85-1060. 1985. Thesis (Ph.D.).]
025061 THEORY AND PRACTICE.
Donald E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-85-1061. 1985. "This is the text of an invited lecture given
in the ancient Greek theatre of Epidaurus on July 16, 1985, as part
of the 12th International Colloquium on Automata, Languages, and
Programming."]
025062 COMPUTER SCIENCE COMPREHENSIVE EXAMINATIONS, 1981/82 - 1984/85.
Arthur M. Keller.
[Stanford University. Department of Computer Science.
STAN-CS-85-1062. 1985. "This report is a collection of the eight
comprehensive examinations from Winter 1982 through Spring 1985
prepared by the faculty and students of Stanford's Computer Science
Department, together with solutions to the problems posed." Edited by
Arthur M. Keller.]
025063 CONTROLLING RECURSIVE INFERENCE.
David E. Smith, Michael R. Genesereth, and Matthew L. Ginsberg.
[Stanford University. Department of Computer Science.
STAN-CS-85-1063. 1985. Also issued as HPP-84-6, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
025064 DECISION PROCEDURES.
Matthew L. Ginsberg.
[Stanford University. Department of Computer Science.
STAN-CS-85-1064. 1985. Also issued as KSL-85-25, Knowledge Systems
Laboratory, Department of Computer Science, Stanford University.]
102120 THE SCENARIO TEST DRIVER FOR THE ISO NETWORK CONVERGENCE PROTOCOL
OVER X.25 (1980).
G. W. Cowin.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 55/85. 1985.]
102121 IMPLEMENTATION ASSESSMENT OF THE OSI NETWORK SERVICE: THE TEST
RESPONDER SPECIFICATION.
A. J. W. Carmichael, P. W. Hobson, and A. A. Sweetman.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 56/85. 1985. Edited by A.J.W.
Carmichael, P.W. Hobson, and A.A. Sweetman of the NPL Protocol
Standards Group.]
102122 A PASCAL IMPLEMENTATION OF THE DES ENCRYPTION ALGORITHM INCLUDING
CIPHER BLOCK CHAINING.
A. A. Aruliah, G. I. Parkin, and B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 61/85. 1985.]
102123 PIECEWISE CHEBYSHEV SERIES.
M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 63/85. 1985.]
102124 SEVENTH ANNOTATED BIBLIOGRAPHY OF RECENT PUBLICATIONS ON DATA
SECURITY AND CRYPTOGRAPHY.
W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 64/85. 1985.]
102125 A PASCAL IMPLEMENTATION OF THE RSA ALGORITHM.
A. A. Aruliah.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 66/85. 1985.]
102126 ASPEKTE WISSENSGESTUETZTER PLANUNG.
Kai v Luck.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 110. 1985.]
102127 SEMI-FORMAL GRAPHIC MODELLING OF DIALOG SYSTEMS.
Horst Oberquelle.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 113. 1985.]
102128 A CONSTRAINT-PROPAGATION APPROACH TO PROBABILISTIC REASONING.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850020. 1985.]
102129 BAYESIAN NETWORKS: A MODEL OF SELF-ACTIVATED MEMORY FOR EVIDENTIAL
REASONING.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850021. 1985.]
102130 FUSION, PROPAGATION, AND STRUCTURING IN BAYESIAN NETWORKS.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850022. 1985.]
102131 BAYES DECISION METHODS.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850023. 1985.]
102132 COMPARISON OF DYNAMICALLY AND STATICALLY SCOPED LISP.
Asya Campbell.
[University of California, Los Angeles. Computer Science Department.
CSD-850024. 1985.]
102133 PARALLEL ALGORITHMS FOR MULTIPROCESSORS USING BROADCAST CHANNEL.
Rina Dechter and Leonard Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-850025. 1985. Formerly working paper no. 81002, November 30,
1981.]
102134 ON THE FLY CONVERSION OF REDUNDANT INTO CONVENTIONAL REPRESENTATIONS.
Milos Ercegovac and Tomas Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-850026. 1985.]
102135 ANALYSIS OF THE NUMBER OF OCCUPIED PROCESSORS IN A MULTI-PROCESSING
SYSTEM.
Abdelfettah Belghith and Leonard Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-850027. 1985.]
102136 NETWORK TRANSPARENCY IN AN INTERNET ENVIRONMENT.
Alan Brian Sheltzer.
[University of California, Los Angeles. Computer Science Department.
CSD-850028. 1985. Thesis (Ph.D.).]
102137 STRUCTURING CAUSAL TREES.
Judea Pearl and Michael Tarsi.
[University of California, Los Angeles. Computer Science Department.
CSD-850029. 1985.]
102138 DISTRIBUTED BELIEF MAINTENANCE FOR REASONING ABOUT LIKELIHOOD.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850030. 1985.]
102139 HOW TO DO WITH PROBABILITIES WHAT PEOPLE SAY YOU CAN'T.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850031. 1985.]
102140 ON EVIDENTIAL REASONING IN A HIERARCHY OF HYPOTHESIS.
Judea Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-850032. 1985.]
102141 STUDIES IN THE USE AND GENERATION OF HEURISTICS.
Rina Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-850033. 1985. Thesis (Ph.D.).]
102142 TOPICS FOR CIRCUMSCRIPTION.
Mary-Angela Papalaskaris and Alan Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 219. 1984.]
102143 PRECONDITION ANALYSIS - LEARNING CONTROL INFORMATION.
Bernard Silver.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 220. 1984.]
102144 PLANNING IN EXPERT SYSTEMS.
Austin Tate.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 221. 1984.]
102145 FORGING TOOLS: KNOWLEDGE REPRESENTATION FOR EXPERT SYSTEMS.
Peter Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 224. 1984.]
102146 INTELLIGENT FRONT ENDS.
Alan Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 227. 1984.]
102147 PROGRAMMING ICONS.
Marlene Kliman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 229. 1984.]
102148 THE DESIGN OF A USER-FRIENDLY SYSTEM.
Mike Sharples.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 230. 1984.]
102149 PATTERNS OF WORDS.
Mike Sharples.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 231. 1984.]
102150 AUTOMATED SPEECH RECOGNITION: A FRAMEWORK FOR RESEARCH.
Anne Johnstone and Gerry Altmann.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 233. 1984.]
102151 A HEURISTIC FOR RULE LEARNING.
Maarten W. van Someren.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 234. 1984.]
102152 TOWARDS A COMPUTATIONAL METHOD FOR GENERATING TEXT.
Terry Patten.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 235. 1984.]
102153 MATHEMATICAL STRATEGIES AND CONCEPTS THROUGH TURTLE GEOMETRY.
Helen M. Finlayson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 236. 1984.]
102154 WHAT DO CHILDREN LEARN THROUGH USING LOGO?
Helen M. Finlayson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 237. 1984.]
102155 THE TRANSFER OF MATHEMATICAL PROBLEM SOLVING SKILLS FROM LOGO
EXPERIENCE.
Helen M. Finlayson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 238. 1984.]
102156 LFG AND PSYCHOLOGICAL EXPLANATION.
Mark Steedman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 239. 1984.]
102157 SPRITE LOGO FOR EDUCATIONAL SIMULATIONS.
Marlene Kliman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 240. 1984.]
102158 A NEW APPROACH TO INFANT AND EARLY PRIMARY MATHEMATICS.
Marlene Kliman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 241. 1984.]
102159 CONCURRENT LOGO: A LANGUAGE FOR TEACHING CONTROL APPLICATIONS.
P. W. H. Chung.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 243. 1984.]
102160 REASONING ABOUT CONTROL IN THE CONTEXT OF ADVICE-GIVING SYSTEMS.
Peter Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 244. 1984.]
102161 A FLEXIBLE TOOLKIT FOR BUILDING EXPERT SYSTEMS.
Peter Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 245. 1984.]
102162 REASONING ABOUT BELIEF IN THE CONTEXT OF ADVICE-GIVING SYSTEMS.
Peter Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 246. 1985.]
102163 COMBINING VISION VERIFICATION WITH A HIGH LEVEL ROBOT PROGRAMMING
LANGUAGE.
Baolin Yin, A. P. Ambler, and R. J. Popplestone.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 247. 1984.]
102164 ARTIFICIAL INTELLIGENCE.
J. A. M. Howe.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 250. 1984.]
102165 NON-LINEAR PLANNING IN TERMS OF CAUSE AND EFFECT.
Mark E. Drummond.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 251. 1985.]
102166 MICROCOMPUTERS IN SECONDARY SCHOOLS: POWER TO THE PUPIL.
J. A. M. Howe.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 252. 1985.]
102167 ADVANCED LOGO PROGRAMMING.
Peter Ross.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 253. 1984.]
102168 LOGO AND COMPUTER SCIENCE.
Ken Johnson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 254. 1983.]
102169 IDENTIFICATION OF UNASPIRATED PLOSIVES USING INTEGRATED TEMPORAL AND
SPECTRAL FEATURES IN DYNAMIC REPRESENTATION AS ACOUSTIC CUES.
D. Y. Yeung and C. Chan.
[University of Hong Kong. Centre of Computer Studies and
Applications. Computer studies publication TR-11-84. 1984.]
102170 THE DESIGN AND PROGRAMMING OF A POWERFUL SHORT WORDLENGTH PROCESSOR
USING CONTEXT-DEPENDENT MACHINE INSTRUCTIONS.
T. M. Hor and C. K. Yuen.
[University of Hong Kong. Centre of Computer Studies and
Applications. Computer studies publication TR-12-84. 1984.]
102171 AN ALGEBRAIC FORMULATION FOR STRUCTURED ANALYSIS AND DESIGN MODELS.
T. H. Tse.
[University of Hong Kong. Centre of Computer Studies and
Applications. Computer studies publication TR-A2-85. 1985.]
102172 TOWARDS A UNIFIED ALGEBRAIC VIEW OF THE STRUCTURED ANALYSIS AND
DESIGN MODELS.
T. H. Tse.
[University of Hong Kong. Centre of Computer Studies and
Applications. Computer studies publication TR-A6-85. 1985.]
102173 VERIFICATION OF RECURSIVE PROGRAMS: A TEMPORAL PROOF APPROACH.
Simon M. Kaplan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1207. 1985.]
102174 ATOMIC ACTIONS IN CONCURRENT SYSTEMS.
Pankaj Jalote.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1223. 1985. Thesis (Ph.D.).]
102175 FRED: A PROGRAM DEVELOPMENT TOOL.
John Shilling.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1224. 1985.]
102176 INITIAL REPORT ON ISADORE: A REFERENCE LIBRARIAN GENERATOR.
John Shilling.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1225. 1985.]
102177 SUPPLEMENTAL DOCUMENTS FOR MODULA-2 ON THE IBM S9000 XENIX SYSTEM.
Robert Edward McGrath.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1227. 1985.]
102178 PLEASE: PREDICATE LOGIC BASED EXECUTABLE SPECIFICATIONS.
Robert B. Terwilliger and Roy H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1231. 1985.]
102179 PROBLEMS IN QUERY INFERENCE.
J. A. Wald.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-13. 1985. Thesis (Ph.D.).]
102180 LOCALITY-BASED APPROACHES TO DYNAMIC FILE SYSTEM MANAGEMENT.
M. B. Deshpande.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-14. 1985. Thesis (M.S.).]
102181 PDS - A PROTOCOL DESIGN SYSTEM.
R. J. Koenderink and Y. H. Yang.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-15. 1985.]
102182 POLLING IN TREE NETWORKS.
Grant A. Cheston and S. T. Hedetniemi.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-16. 1985.]
102183 AN EXTENSION OF THE RULE-BASED APPROACH FOR PROTOCOL SYNTHESIS.
R. J. Koenderink.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-17. 1985. Thesis (M.S.).]
102184 CORRECTNESS OF QUEUE MANIPULATION OPERATIONS.
P. A. Collier.
[University of Tasmania. Department of Information Sciences. R85-1.
1985.]
102185 A THEORY OF SYNTACTIC SUBSTITUTION IN THE PREDICATE CALCULUS.
P. A. Collier.
[University of Tasmania. Department of Information Sciences. R85-2.
1985.]
102186 SIMPLE COMPILER CORRECTNESS - A TUTORIAL ON THE ALGEBRAIC APPROACH.
P. A. Collier.
[University of Tasmania. Department of Information Sciences. R85-3.
1985.]
102187 THE RFP REFERENCE MANUAL.
P. A. Collier.
[University of Tasmania. Department of Information Sciences. R85-4.
1985.]
102188 A DISCIPLINE FOR CONSTRUCTING MULTIPHASE COMMUNICATION PROTOCOLS.
Ching-Hua Chow, Mohamed G. Gouda, and Simon S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-233. 1983. Revised, March 1985.]
102189 A CLASS OF TERMINATION DETECTION ALGORITHMS FOR DISTRIBUTED
COMPUTATIONS.
Devendra Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-07. 1985.]
102190 LOGSPACE HIERARCHIES, POLYNOMIAL TIME AND THE COMPLEXITY OF FAIRNESS
PROBLEMS CONCERNING OMEGA-MACHINES.
Louis E. Rosier and Hsu-Chun Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-08. 1985.]
102191 TWO CLASSES OF PERFORMANCE BOUNDS FOR CLOSED QUEUEING NETWORKS.
Ching-Tarng Hsieh and Simon S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-09. 1985.]
102192 HEURISTIC AND FORMAL METHODS IN AUTOMATIC PROGRAM DEBUGGING.
William R. Murray.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-10. 1985.]
102193 EXPRESSING PROGRAMMING LANGUAGE SYNTAX USING TEMPLATES.
Jeffrey A. Brumfield.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-11. 1985.]
102194 HSS: A TOOL FOR EVALUATING THE PERFORMANCE OF OFFICE SYSTEMS.
Richard L. Gimarc and K. Mani Chandy.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-12. 1985.]
102195 TEACHING OPERATING SYSTEMS WITH MODULA-2.
Jeffrey A. Brumfield.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-13. 1985.]
102196 A NOVEL APPROACH TO SEQUENTIAL SIMULATION.
Devendra Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-14. 1985.]
102197 ON COMPONENT FACTORS.
Yoshimi Egawa, Hikoe Enomoto, and Akira Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-01. 1985.]
102198 FACTORS AND INDUCED SUBGRAPHS.
Yoshimi Egawa, Hikoe Enomoto, and Akira Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-02. 1985.]
102199 CONTRACTIBLE EDGES IN 3-CONNECTED GRAPHS.
Kiyoshi Ando, Hikoe Enomoto, and Akira Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-03. 1985.]
102200 IN THE FIELD OF JAPANESE WRITING SYSTEM.
Yamada-Hisao..
[University of Tokyo. Department of Information Science. Technical
report 85-04. 1985. "This is a collection of...three papers, two
essays, and four short columns."]
102201 A SIMPLE BUT SYSTEMATIC CSG SYSTEM.
Tosiyasu L. Kunii and Geoff Wyvill.
[University of Tokyo. Department of Information Science. Technical
report 85-05. 1985.]
102202 ANIMENGINE: AN ENGINEERING ANIMATION SYSTEM.
Tsukasa Noma and Tosiyasu L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 85-06. 1985.]
102203 A FORMALIZATION FOR THE SPECIFICATION AND SYSTEMATIC GENERATION OF
COMPUTER GRAPHICS SYSTEMS.
Tamiya Onodera and Satoru Kawai.
[University of Tokyo. Department of Information Science. Technical
report 85-07. 1985.]
102204 TOUGHNESS AND THE EXISTENCE OF K-FACTORS. IV.
Hikoe Enomoto.
[University of Tokyo. Department of Information Science. Technical
report 85-08. 1985.]
102205 CONTRACTIBLE EDGES IN TRIANGLE-FREE GRAPHS.
Yoshimi Egawa, Hikoe Enomoto, and Akiro Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-09. 1985.]
102206 DEVELOPMENT OF TRON CHIP: A SINGLE CHIP VLSI COMPUTER ARCHITECTURE IN
THE 1990'S.
Ken Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 85-10. 1985.]
102207 AUTOMATIC TUNING OF MULTI-TASK PROGRAM FOR REAL-TIME EMBEDDED SYSTEM.
Toru Shimizu and Ken Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 85-11. 1985.]
102208 NON-SEPARATING INDUCED CYCLES IN 3-CONNECTED GRAPHS.
Katsuhiro Ota and Akira Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-12. 1985.]
102209 DISCRETIZATION OF SINGULAR PERTURBATION PROBLEMS BY BDF METHODS.
Per Lotstedt.
[University of Uppsala. Department of Computer Science. Report no.
99. 1985.]
102210 ON THE RELATION BETWEEN SINGULAR PERTURBATION PROBLEMS AND
DIFFERENTIAL-ALGEBRA EQUATIONS.
Per Lotstedt.
[University of Uppsala. Department of Computer Science. Report no.
100. 1985.]
102211 BACKWARD DIFFERENCE APPROXIMATIONS OF NONLINEAR
DIFFERENTIAL-ALGEBRAIC EQUATIONS.
K. E. Brenan and B. E. Engquist.
[University of Uppsala. Department of Computer Science. Report no.
101. 1985.]
102212 ARC AND PATH CONSISTENCY REVISITED.
Roger Mohr and Thomas C. Henderson.
[University of Utah. Department of Computer Science. UUCS-85-101.
1985.]
102213 THE SYNTHESIS OF VISUAL RECOGNITION STRATEGIES.
Thomas C. Henderson et al.
[University of Utah. Department of Computer Science. UUCS-85-102.
1985.]
102214 A PROJECTED NEWTON METHOD FOR L SUBSCRIPT P NORM LOCATION PROBLEMS.
P. H. Calamai and A. R. Conn.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-07. 1985.]
102215 USING COLOUR AS A TOOL IN DISCRETE DATA ANALYSIS.
Colin Ware and John C. Beatty.
[University of Waterloo. Department of Computer Science. CS-85-21.
1985.]
102216 TESTABILITY OF CMOS CELLS.
J. A. Brzozowski.
[University of Waterloo. Department of Computer Science. CS-85-31.
1985.]
102217 SPLINES AND THE NOTION OF GEOMETRIC CONTINUITY IN DIFFERENTIAL
GEOMETRY.
John J. Jezioranski.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-36. 1985.]
102218 SOLVING BACKTRACKING PROBLEMS WITH STRUCTURE DIAGRAMS.
E. S. H. Bulman and D. D. Cowan.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-40. 1985.]
102219 COMPACT STRUCTURAL REPRESENTATION OF SPARSE CHOLESKY, QR AND LU
FACTORS.
Alan George and Joseph Liu.
[University of Waterloo. Department of Computer Science. CS-85-41.
1985.]
VOL. 7, NO. 12 12/27/85
102306 EXPERT SYSTEMS AND TECHNOLOGICAL PROBLEMS.
P. E. Hart.
[Fairchild Camera and Instrument Corporation. Laboratory for
Artificial Intelligence Research. FLAIR technical report 18. 1983.
Also issued as Report no. 641, Fairchild Camera and Instrument
Corporation.]
102308 EFFICIENT IMPLEMENTATION OF THE SMALLTALK-80 SYSTEM.
L. P. Deutsch and A. M. Schiffman.
[Fairchild Camera and Instrument Corporation. Laboratory for
Artificial Intelligence Research. FLAIR technical report 28. 1984.
Also issued as Report no. 651, Fairchild Camera and Instrument
Corporation.]
102309 ARGON: KNOWLEDGE REPRESENTATION MEETS INFORMATION RETRIEVAL.
P. F. Patel-Schneider, R. J. Brachman, and H. J. Levesque.
[Fairchild Camera and Instrument Corporation. Laboratory for
Artificial Intelligence Research. FLAIR technical report 29. 1984.
Also issued as Report no. 654, Fairchild Camera and Instrument
Corporation.]
102310 A FUNDAMENTAL TRADEOFF IN KNOWLEDGE REPRESENTATION AND REASONING.
H. J. Levesque.
[Fairchild Camera and Instrument Corporation. Laboratory for
Artificial Intelligence Research. FLAIR technical report 35. 1984.
Also issued as Report no. 658, Fairchild Camera and Instrument
Corporation.]
102311 SMALL CAN BE BEAUTIFUL IN KNOWLEDGE REPRESENTATION.
P. F. Patel-Schneider.
[Schlumberger Computer Aided Systems. AI technical report 37. 1984.]
102312 SEMANTIC RETRIEVAL AND LEVELS OF ABSTRACTION.
F. Corella.
[Schlumberger Computer Aided Systems. AI technical report 39. 1984.]
102313 A NOTE ON PROFINITE COMPLETIONS.
S. L. Bloom and J. B. Wright.
[International Business Machines Corporation (IBM). Research
Division. RC 11156. 1985.]
102314 THE USE OF LATIN HYPERCUBE SAMPLING FOR VARIANCE REDUCTION IN
SIMULATIONS WITH MANY RANDOM PARAMETERS.
M. Stein.
[International Business Machines Corporation (IBM). Research
Division. RC 11166. 1985.]
102315 A CONTINUOUS FUNCTION WHOSE DIVIDED DIFFERENCES AT THE CHEBYSHEV
EXTREMA ARE ALL ZERO.
D. J. Newman and T. J. Rivlin.
[International Business Machines Corporation (IBM). Research
Division. RC 11168. 1985.]
102316 REGRESSION ANALYSIS IN GRAFSTAT.
M. Schatzoff and T. P. Lane.
[International Business Machines Corporation (IBM). Research
Division. RC 11174. 1985.]
102317 CONVEXITY OF MULTIVARIATE BERNSTEIN POLYNOMIALS AND BOX SPLINE
SURFACES.
W. Dahmen and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 11176. 1985.]
102318 MONOTONE VERSUS POSITIVE.
M. Ajtai and Yuri Gurevich.
[International Business Machines Corporation (IBM). Research
Division. RJ 4697. 1985.]
102319 FIRST-ORDER DEFINABILITY ON FINITE STRUCTURES.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. RJ 4705. 1985.]
041751 ANALOG "NEURONAL" NETWORKS IN EARLY VISION.
C. Koch, J. Marroquin, and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 751. 1985. Also issued as C.B.I.P. paper 011,
Center for Biological Information Processing, Whitaker College.]
041795 BIOPHYSICS OF COMPUTATION: NEURONS, SYNAPSES AND MEMBRANES.
C. Koch and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 795. 1984. Also issued as C.B.I.P. paper 008,
Center for Biological Information Processing, Whitaker College.]
041800 COMPUTING VISIBLE-SURFACE REPRESENTATIONS.
D. Terzopoulos.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 800. 1985.]
041801 THE DESCRIPTION OF LARGE SYSTEMS.
K. M. Pitman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 801. 1984.]
041811 HYPOTHESIZING AND REFINING CAUSAL MODELS.
R. J. Doyle.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 811. 1984.]
041812 ON THE COMPLEXITY OF ID/LP PARSING.
G. E. Barton Jr..
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 812. 1984.]
041815 TENSE, ASPECT AND THE COGNITIVE REPRESENTATION OF TIME.
K. M. Yip.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 815. 1984.]
041817 SPOTLIGHT ON ATTENTION.
A. Hurlbert and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 817. 1985. Also issued as C.B.I.P. paper 012,
Center for Biological Information Processing, Whitaker College.]
041820 SHAPE AND SOURCE FROM SHADING.
M. J. Brooks and B. K. P. Horn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 820. 1985.]
041821 DIRECT PASSIVE NAVIGATION.
S. Negahdaripour and B. K. P. Horn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 821. 1985.]
041822 DESCRIBING SURFACES.
M. Brady et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 822. 1985.]
041823 GENERATING AND GENERALIZING MODELS OF VISUAL OBJECTS.
J. H. Connell and M. Brady.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 823. 1985.]
041824 TOWARD A SURFACE PRIMAL SKETCH.
J. Ponce and M. Brady.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 824. 1985.]
041825 THE ANATOMY AND PHYSIOLOGY OF GATING RETINAL SIGNALS IN THE MAMMALIAN
LATERAL GENICULATE NUCLEUS.
S. M. Sherman and C. Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 825. 1985. Also issued as C.B.I.P. paper 009,
Center for Biological Information Processing, Whitaker College.]
041826 MOBILE ROBOT LOCALIZATION USING SONAR.
M. Drumheller.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 826. 1985.]
041828 ROUTINES.
P. E. Agre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 828. 1985.]
041829 CREF: AN EDITING FACILITY FOR MANAGING STRUCTURED TEXT.
K. M. Pitman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 829. 1985.]
041833 A REGULARIZED SOLUTION TO EDGE DETECTION.
T. Poggio, H. Voorhees, and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 833. 1985.]
041835 BOUNDARIES OF VISUAL MOTION.
J. M. Rubin and W. A. Richards.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 835. 1985.]
041836 DETERMINISTIC PARSING AND LINGUISTIC EXPLANATION.
R. C. Berwick and A. S. Weinberg.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 836. 1985. Revised: June, 1985.]
041837 GPSG-RECOGNITION IS NP-HARD.
E. S. Ristad.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 837. 1985.]
041838 PRISM TREES: AN EFFICIENT REPRESENTATION FOR MANIPULATING AND
DISPLAYING POLYHEDRA WITH MANY FACES.
J. Ponce.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 838. 1985.]
041839 OPTIMAL BAYESIAN ESTIMATORS FOR IMAGE SEGMENTATION AND SURFACE
RECONSTRUCTION.
J. L. Marroquin.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 839. 1985.]
041840 INFERRING 3D SHAPES FROM 2D CODONS.
W. Richards, J. J. Koenderink, and D. D. Hoffman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 840. 1985.]
041841 RECOGNITION AND LOCALIZATION OF OVERLAPPING PARTS FROM SPARSE DATA.
W. E. L. Grimson and T. Lozano-Perez.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 841. 1985.]
041842 AN APPROACH TO AUTOMATIC ROBOT PROGRAMMING.
T. Lozano-Perez and R. A. Brooks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 842. 1985.]
041848 THE REVISED REVISED REPORT ON SCHEME OR AN UNCOMMON LISP.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 848. 1985.]
041849 CHARACTERIZATION OF JOINT-INTERPOLATED ARM MOVEMENTS.
J. M. Hollerbach and C. G. Atkeson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 849. 1985. Also issued as C.B.I.P. paper 013,
Center for Biological Information Processing, Whitaker College.]
041858 EDGE DETECTION.
E. C. Hildreth.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 858. 1985.]
041863 DIRECT PASSIVE NAVIGATION: ANALYTICAL SOLUTION FOR PLANES.
S. Negahdaripour.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 863. 1985.]
041865 CONCURRENT PROGRAMMING USING ACTORS: EXPLOITING LARGE-SCALE
PARALLELISM.
G. A. Agha and C. Hewitt.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 865. 1985.]
040753 KBEMACS: A STEP TOWARD THE PROGRAMMER'S APPRENTICE.
R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 753. 1985.]
040834 JUSTIFIED GENERALIZATION: ACQUIRING PROCEDURES FROM EXAMPLES.
P. M. Andreae.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 834. 1985. Thesis (Ph.D.).]
040844 ACTORS: A MODEL OF CONCURRENT COMPUTATION IN DISTRIBUTED SYSTEMS.
G. A. Agha.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 844. 1985. Thesis (Ph.D.). "This
dissertation was submitted to the University of Michigan in partial
fulfillment of the requirements of the degree of Doctor of Philosophy
in Computer and Communication Science."]
040852 LOCAL ROTATIONAL SYMMETRIES.
M. M. Fleck.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 852. 1985. Thesis (M.S.).]
040860 PROBABILISTIC SOLUTION OF INVERSE PROBLEMS.
J. L. Marroquin.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 860. 1985. Thesis (Ph.D.).]
102330 PROBABILISTIC ANALYSIS OF A NETWORK RESOURCE ALLOCATION ALGORITHM.
M. J. Fischer et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-278. 1985.]
102331 EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS.
M. J. Fischer, N. A. Lynch, and M. Merritt.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-279. 1985.]
102332 QUALITATIVE SIMULATION IN MEDICAL PHYSIOLOGY: A PROGRESS REPORT.
B. Kuipers.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-280. 1985.]
102333 WHAT PRICE FOR ELIMINATING EXPRESSION SIDE-EFFECTS?
M. Hailperin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-281. 1985.]
102334 COMPUTER-BASED REAL-TIME CONFERENCES.
S. Sarin and I. Greif.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-282. 1985.]
020338 TOWARDS A PROBLEM SOLVING SYSTEM FOR MOLECULAR GENETICS.
P. Koton.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-338. 1985. "The work described in this report is
based in part on [the author's] SM Thesis."]
020339 GENERIC SOFTWARE FOR EMULATING MULTIPROCESOR ARCHITECTURES.
R. M. Soley.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-339. 1985.]
020340 REASONING ABOUT PREFERENCE MODELS.
M. P. Wellman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-340. 1985. Thesis (M.S.).]
020341 ROUTING NETWORKS FOR PACKET COMMUNICATION SYSTEMS.
G. A. Boughton.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-341. 1985. Thesis (Ph.D.).]
020342 FOUNDATIONS OF A THEORY OF SPECIFICATION FOR DISTRIBUTED SYSTEMS.
E. W. Stark.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-342. 1985. Thesis (Ph.D.).]
020343 A PROGRAM FOR GENERATING AND ANALYZING TERM REWRITING SYSTEMS.
R. Forgaard.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-343. 1985. Thesis (M.S.).]
102320 MULTIPLE GRID AND OSHER'S SCHEME FOR THE EFFICIENT SOLUTION OF THE
STEADY EULER EQUATIONS.
P. W. Hemker and S. P. Spekrejise.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8507. 1985.]
102321 ON THE ECONOMIZATION OF EXPLICIT RUNGE-KUTTA METHODS.
B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8508. 1985.]
102322 PERFORMANCE EVALUATION OF EXPLICIT SHALLOW-WATER EQUATIONS SOLVER ON
THE CYBER 205.
F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8511. 1985.]
102323 TWO ADA MATHEMATICAL FUNCTIONS PACKAGES FOR USE IN REAL TIME.
J. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8512. 1985.]
102324 ON THE ODD-EVEN HOPSCOTCH SCHEME FOR THE NUMERICAL INTEGRATION OF
TIME-DEPENDENT PARTIAL DIFFERENTIAL EQUATIONS.
J. H. M. ten Thije Boonkkamp and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8513. 1985.]
102325 SPATIAL DISCRETIZATION OF HYPERBOLIC EQUATIONS WITH PERIODIC
SOLUTIONS.
P. J. van der Houwen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8514. 1985.]
102326 ON THE ZEROS OF THE RIEMANN ZETA FUNCTION IN THE CRITICAL STRIP IV.
J. van der Lune, H. J. J. Te Reile, and D. T. Winter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8515. 1985.]
102327 STABILITY AND B-COVERAGE OF LINEARLY IMPLICIT RUNGE-KUTTA METHODS.
W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8516. 1985.]
102328 A STUDY OF B-COVERAGE OF RUNGE-KUTTA METHODS.
K. Burrage, W. H. Hundsdorfer, and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8517. 1985.]
102329 NUMVEC FORTRAN LIBRARY MANUAL. CHAPTER: ELLIPTIC PDES. ROUTINE: MGZEB.
W. M. Lioen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8518. 1985.]
052020 ON THE AXIOMATIZATION OF "IF-THEN-ELSE."
I. Guessarian and J. Meseguer.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-20. 1985.]
052036 LIMITS OF CORRECTNESS IN COMPUTERS.
B. C. Smith.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-36. 1985.]
025065 REVIEW OF SOWA'S "CONCEPTUAL STRUCTURES."
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-85-1065. 1985. Also issued as KSL-85-31, Knowledge Systems
Laboratory, Department of Computer Science, Stanford University.]
025066 HEURISTIC CLASSIFICATION.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-85-1066. 1985. Also issued as KSL-85-5, Knowledge Systems
Laboratory, Department of Computer Science, Stanford University.]
025067 ACQUIRING, REPRESENTING, AND EVALUATING A COMPETENCE MODEL OF
DIAGNOSTIC STRATEGY.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-85-1067. 1985. Also issued as HPP-84-2, Heuristic Programming
Project, Department of Computer Science, Stanford University.]
025068 GUIDON-WATCH: A GRAPHIC INTERFACE FOR VIEWING A KNOWLEDGE-BASED
SYSTEM.
M. H. Richer and W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-85-1068. 1985. Also issued as KSL-85-20, Knowledge Systems
Laboratory, Department of Computer Science, Stanford University.]
025069 THE LOGICAL DATA MODEL: A NEW APPROACH TO DATABASE LOGIC.
G. M. Kuper.
[Stanford University. Department of Computer Science.
STAN-CS-85-1069. 1985. Thesis (Ph.D.).]
025070 DIGITIZED BRUSH TRAJECTORIES.
J. D. Hobby.
[Stanford University. Department of Computer Science.
STAN-CS-85-1070. 1985. Thesis (Ph.D.).]
102335 OVERVIEW OF A TEST SUITE FOR THE ISO NETWORK CONVERGENCE PROTOCOL
OVER X.25 (1980).
G. W. Cowin.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 59/85. 1985.]
102336 VISUALISATIONS OF SPEECH BASED ON A MODEL OF THE PERIPHERAL AUDITORY
SYSTEM.
D. Schofield.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 62/85. 1985.]
102337 NOTES ON LOGIC.
D. J. Clapp.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 65/85. 1985.]
102338 REPRAESENTATION VON POSITIONELLEM SCHACHWISSEN MIT TECHNIKEN DER
KUENSTLICHEN INTELLIGENZ.
B. Owsnicki.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 111. 1985.]
102339 EIN TESTVERFAHREN FUER DATENBANKPRAEDIKATE.
S. Boettcher.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 114. 1985.]
102340 AN ALGORITHM FOR CONSTRUCTING CONFIGURATIONS OF KNOTS FOR BIVARIATE
B-SPLINES.
R. H. J. Gmelig Meyling.
[University of Amsterdam. Department of Mathematics. Report no.
85-06. 1985.]
102341 GAUSSIAN ELIMINATION ALGORITHMS ON A VECTOR COMPUTER.
W. Hoffman.
[University of Amsterdam. Department of Mathematics. Report no.
85-10. 1985.]
102342 PRIMALITY TESTING USING ELLIPTIC CURVES.
W. Bosma.
[University of Amsterdam. Department of Mathematics. Report no.
85-12. 1985.]
102343 CIRCUMSCRIPTION - A SOUND AND COMPLETE FORM OF NON-MONOTONIC
REASONING.
M. P. Morreau.
[University of Amsterdam. Department of Mathematics. Report no.
85-15. 1985.]
102344 A FRAMEWORK FOR INFERENCE IN NATURAL LANGUAGE FRONT ENDS TO DATABASES.
B. K. Boguraev and K. S. Jones.
[University of Cambridge. Computer Laboratory. Technical report 64.
1985.]
102345 INTRODUCTION TO THE FUNCTIONAL PROGRAMMING LANGUAGE "PONDER."
M. Tillotson.
[University of Cambridge. Computer Laboratory. Technical report 65.
1985.]
102346 A FORMAL HARDWARE VERIFICATION METHODOLOGY AND ITS APPLICATION TO A
NETWORK INTERFACE CHIP.
M. J. C. Gordon and J. Herbert.
[University of Cambridge. Computer Laboratory. Technical report 66.
n.d.]
102347 NATURAL DEDUCTION THEOREM PROVING VIA HIGHER-ORDER RESOLUTION.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 67.
1985.]
102348 HOL: A MACHINE ORIENTED FORMULATION OF HIGHER ORDER LOGIC.
M. J. C. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 68.
1985. Revised version: July 16, 1985.]
102349 PROVING TERMINATION OF NORMALIZATION FUNCTIONS FOR CONDITIONAL
EXPRESSIONS.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 69.
1985.]
102350 A REMOTE PROCEDURE CALL SYSTEM.
K. G. Hamilton.
[University of Cambridge. Computer Laboratory. Technical report 70.
1984. Thesis (Ph.D.).]
102351 EXECUTING TEMPORAL LOGIC PROGRAMS.
B. Moszkowski.
[University of Cambridge. Computer Laboratory. Technical report 71.
1985. Full version ("an earlier version of this [paper] is scheduled
to appear in the Proceedings of the NSF/SERC Workshop on the
Semantics of Concurrency, Carnegie-Mellon University, Pittsburgh,
July 9-11, 1984").]
102352 LOGIC PROGRAMMING AND THE SPECIFICATION OF CIRCUITS.
W. F. Clocksin.
[University of Cambridge. Computer Laboratory. Technical report 72.
n.d.]
102353 RESOURCE MANAGEMENT IN A DISTRIBUTED COMPUTING SYSTEM.
D. H. Craft.
[University of Cambridge. Computer Laboratory. Technical report 73.
1985. Thesis (Ph.D.).]
102354 HARDWARE VERIFICATION BY FORMAL PROOF.
M. J. C. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 74.
1985.]
102355 DESIGN AND IMPLEMENTATION OF A SIMPLE TYPED LANGUAGE BASED ON THE
LAMBDA-CALCULUS.
J. Fairbairn.
[University of Cambridge. Computer Laboratory. Technical report 75.
1985. Thesis (Ph.D.). "Dissertation submitted...in...December 1984."]
102356 PRESERVING ABSTRACTION IN CONCURRENT PROGRAMMING.
R. C. B. Cooper and K. G. Hamilton.
[University of Cambridge. Computer Laboratory. Technical report 76.
1985.]
102357 RULE-BASED PROCESSING IN A CONNECTIONIST SYSTEM FOR NATURAL LANGUAGE
UNDERSTANDING.
B. Selman.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-168. 1985. Thesis (M.S.).]
102358 ASPN: A HYBRID SYSTEM FOR REPRESENTING BELIEF AND KNOWLEDGE.
G. McArthur.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-169. 1985. Thesis (M.S.).]
102359 THE DESIGN OF GRAPHICAL USER INTERFACES.
M. W. Green.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-170. 1985. Thesis (Ph.D.).]
102360 THEORY AND PARSING OF THE COORDINATE CONJUNCTION "AND."
V. L. Snarr.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-171. 1985. Thesis (M.S.).]
102361 OPTIMAL SOLUTION OF NONLINEAR EQUATIONS.
K. Sikorski.
[University of Utah. Department of Computer Science. Technical report
UUCS-85-103. 1985.]
102362 SEGMENTATION OF COMPLEX OUTDOOR SCENES.
B. A. Parvin and B. Bhanu.
[University of Utah. Department of Computer Science. Technical report
UUCS-85-110. 1985.]
102363 RECOGNITION OF 2-D OCCLUDED OBJECTS AND THE MANIPULATION OF PUMA 560
ROBOT.
B. Bhanu and J. C. Ming.
[University of Utah. Department of Computer Science. Technical report
UUCS-85-111. 1985.]
102364 3-D MODEL BUILDING FOR COMPUTER VISION.
B. Bhanu, C. C. Ho, and T. Henderson.
[University of Utah. Department of Computer Science. Technical report
UUCS-85-112. 1985.]
102365 ON SOME FUNDAMENTAL DISTINCTIONS OF COMPUTATIONALISM.
W. Demopoulos.
[University of Western Ontario. Centre for Cognitive Science.
Technical memorandum (COGMEM) 15. 1984.]
102366 INTELLIGENT DATABASE INTERFACES: A SURVEY OF SOME ARTIFICIAL
INTELLIGENCE APPLICATIONS.
Z. W. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 17. 1985.]
102367 THE ORIGIN OF HUMAN COMMUNICATION.
D. Kimura.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 19. 1985.]
102368 THE NATURAL COMPUTATION OF MOTION CORRESPONDENCE.
M. Dawson and Z. W. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 20. 1985.]
102369 A GOVERNMENT AND BINDING APPROACH TO THE SYNTAX OF THE NILOTIC
LANGUAGES: TWO STUDIES.
C. A. Creider.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 21. 1985.]
102371 ERROR BOUNDS FOR MONOTONE LINEAR COMPLEMENTARITY PROBLEMS.
O. L. Mangasarian and T.-H. Shiau.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 606. 1985.]
102372 ON AN ESTIMATE FOR THE THREE-GRID MGR MULTIGRID METHOD.
S. V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 610. 1985.]
102373 ORDERING ERRORS IN DISTRIBUTED PROGRAMS.
A. J. Gordon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 611. 1985. Thesis (Ph.D.).]
102374 MEASURING DISTRIBUTED PROGRAMS: A HIERARCHICAL AND INTERACTIVE
APPROACH.
B. P. Miller and C. Yang.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 613. 1985.]
102375 PERFORMANCE MODELING AND OPTIMIZATION OF PARING.
Y. Qu, L. H. Landweber, and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 614. 1985.]
102376 DIVIDED DIFFERENCES, HYPERBOLIC EQUATIONS AND LIFTING DISTRIBUTIONS.
K. Hoellig and C. A. Micchelli.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 615. 1985.]
102377 PARING: A TOKEN RING LOCAL AREA NETWORK WITH CONCURRENCY.
Y. Qu, L. H. Landweber, and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 616. 1985.]
102378 DESIGN OF PIPELINED MEMORY SYSTEMS FOR DECOUPLED ARCHITECTURES.
K. Liou.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 617. 1985. Thesis (Ph.D.).]
102386 MEMORY CONNECTIONS BETWEEN THEMATICALLY SIMILAR EPISODES.
C. M. Seifert et al.
[Yale University. Cognitive Science Program. Cognitive science
technical report 27. 1984.]
102388 USING KNOWLEDGE OF ACTIVITIES TO UNDERSTAND AND ANSWER QUESTIONS.
J. Galambos and J. B. Black.
[Yale University. Cognitive Science Program. Cognitive science
technical report 29. 1984.]
102389 PRIMALITY AND CRYPTOGRAPHY.
E. Kranakis.
[Yale University. Department of Computer Science. n.d.]
102390 AUTOMATIC EVALUATION OF DESIGN CHOICES IN DIGITAL CONTROLLER
SYNTHESIS.
D. Baldwin.
[Yale University. Department of Computer Science. YALEU/DCS/RR-344.
1984. Thesis (Ph.D.).]
102391 ON THE CHOICE OF COORDINATES FOR SEMICONDUCTOR SIMULATION.
T. Kerkhoven.
[Yale University. Department of Computer Science. YALEU/DCS/RR-350.
1984.]
102392 HIGH RE SEPARATED FLOW SOLUTIONS USING THE NAVIER-STOKES AND
APPROXIMATE EQUATIONS.
M. Napolitano.
[Yale University. Department of Computer Science. YALEU/DCS/RR-358.
1985.]
102393 A NEW LIST COMPACTION METHOD.
K. Li and P. Hudak.
[Yale University. Department of Computer Science. YALEU/DCS/RR-362.
1985.]
102394 BULLDOG: A COMPILER FOR VLIW ARCHITECTURES.
J. R. Ellis.
[Yale University. Department of Computer Science. YALEU/DCS/RR-364.
1985. Thesis (Ph.D.).]
102395 A STABILITY ANALYSIS OF INCOMPLETE LU FACTORIZATIONS.
H. C. Elman.
[Yale University. Department of Computer Science. YALEU/DCS/RR-365.
1985.]
102396 ON THE DEPENDENCE OF THE CONVERGENCE OF GUMMEL'S ALGORITHM ON THE
REGULARITY OF THE SOLUTION.
T. Kerkhoven.
[Yale University. Department of Computer Science. YALEU/DCS/RR-366.
1985.]
102397 DATA PERMUTATIONS AND BASIC LINEAR ALGEBRA COMPUTATIONS ON ENSEMBLE
ARCHITECTURES.
S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-367.
1985.]
102398 MULTIGRID ALGORITHMS ON THE HYPERCUBE MULTIPROCESSOR.
T. F. Chan and Y. Saad.
[Yale University. Department of Computer Science. YALEU/DCS/RR-368.
1985.]
102399 REASONING ABOUT ACCESS TO EQUIPMENT.
E. G. Urdang.
[Yale University. Department of Computer Science. YALEU/DCS/RR-369.
1985.]
102400 EFFICIENT SYSTOLIC ARRAYS FOR THE SOLUTION OF TOEPLITZ SYSTEMS: AN
ILLUSTRATION OF A METHODOLOGY FOR THE CONSTRUCTION OF SYSTOLIC
ARCHITECTURES IN VLSI.
J.-M. Delosme and I. C. F. Ipsen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-370.
1985.]
102401 FAIRING OF BIASED COINS IN BOUNDED TIME.
J. D. Cohen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-372.
1985.]
102402 SOLVING ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS ON THE HYPERCUBE
MULTIPROCESSOR.
T. F. Chan, Y. Saad, and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-373.
1985.]
102403 PARALLELISM, MEMORY ANTI-ALIASING AND CORRECTNESS FOR
TRACE-SCHEDULING COMPILERS.
A. Nicholau.
[Yale University. Department of Computer Science. YALEU/DCS/RR-374.
1985. Thesis (Ph.D.). "A dissertation presented...in...December
1984."]
102404 DENSE MATRIX OPERATIONS ON A TORUS AND A BOOLEAN CUBE.
S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-377.
1985.]
102405 GENERATION OF LAYOUTS FROM CIRCUIT SCHEMATICS: A GRAPH THEORETIC
APPROACH.
T. Ng and S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-378.
1985.]
102406 FAST BANDED SYSTEMS SOLVERS FOR ENSEMBLE ARCHITECTURES.
S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-379.
1985.]
102407 POLYNOMIAL ITERATION FOR NONSYMMETRIC INDEFINITE LINEAR SYSTEMS.
H. C. Elman and R. L. Streit.
[Yale University. Department of Computer Science. YALEU/DCS/RR-380.
1985.]
102408 ALTERNATING DIRECTION METHODS ON MULTIPROCESSORS: AN EXTENDED
ABSTRACT.
Y. Saad and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-381.
1985.]
102409 ALTERNATING DIRECTION METHODS ON MULTIPROCESSORS.
S. L. Johnsson, Y. Saad, and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-382.
1985.]
102410 THE S/NET'S LINDA KERNEL.
N. Carriero and D. Gelernter.
[Yale University. Department of Computer Science. YALEU/DCS/RR-383.
1985.]
102411 EXPLANATION: A SECOND PASS.
R. C. Schank and C. Riesbeck.
[Yale University. Department of Computer Science. YALEU/DCS/RR-384.
1985.]
102412 QUESTIONS AND THOUGHT.
R. C. Schank.
[Yale University. Department of Computer Science. YALEU/CSD/RR-385.
1985.]
102413 BUG CATALOGUE: II, III, IV.
J. C. Spohrer et al.
[Yale University. Department of Computer Science. YALEU/CSD/RR-386.
1985.]
102414 PARALLEL DIRECT METHODS FOR SOLVING BANDED LINEAR SYSTEMS.
Y. Saad and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-387.
1985.]
102415 BAND MATRIX SYSTEMS SOLVERS ON ENSEMBLE ARCHITECTURES.
S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-388.
1985.]
102416 TOPOLOGICAL PROPERTIES OF HYPERCUBES.
Y. Saad and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-389.
1985.]
102417 PARA-FUNCTIONAL PROGRAMMING: A PARADIGM FOR PROGRAMMING
MULTIPROCESSOR SYSTEMS.
P. Hudak and L. Smith.
[Yale University. Department of Computer Science. YALEU/DCS/RR-390.
1985. Revised: June 1985.]
102418 A GOAL/PLAN ANALYSIS OF BUGGY PASCAL PROGRAMS.
J. C. Spohrer, E. Soloway, and E. Pope.
[Yale University. Department of Computer Science. YALEU/CSD/RR-392.
1985.]
102419 RELATIONAL QUERIES COMPUTABLE IN POLYNOMIAL TIME.
N. Immerman.
[Yale University. Department of Computer Science. YALEU/DCS/TR-393.
1985.]
102420 INTENTION-BASED DIAGNOSIS OF ERRORS IN NOVICE PROGRAMS.
W. L. Johnson.
[Yale University. Department of Computer Science. YALEU/CSD/RR-395.
1985. Thesis (Ph.D.).]
102421 ON THE LANCZOS METHOD FOR SOLVING SYMMETRIC LINEAR SYSTEMS WITH
SEVERAL RIGHT-HAND-SIDES.
Y. Saad.
[Yale University. Department of Computer Science. YALEU/DCS/RR-396.
1985.]
102422 PARTIAL EIGENSOLUTIONS OF LARGE NONSYMMETRIC MATRICES.
Y. Saad.
[Yale University. Department of Computer Science. YALEU/DCS/RR-397.
1985.]
102423 RANK REVEALING QR-FACTORIZATIONS.
T. F. Chan.
[Yale University. Department of Computer Science. YALEU/DCS/RR-398.
1985.]
102424 THE DUCK MANUAL.
D. McDermott.
[Yale University. Department of Computer Science. YALEU/CSD/RR-399.
1985.]
102425 PROBABILISTIC INDUCTIVE INFERENCE.
L. B. Pitt.
[Yale University. Department of Computer Science. YALEU/DCS/TR-400.
1985. Thesis (Ph.D.).]
102426 ON THE SOLUTION OF CIRCULANT LINEAR SYSTEMS.
M. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-401.
1985.]
102427 MICRO-PROUST.
W. L. Johnson and E. Soloway.
[Yale University. Department of Computer Science. YALEU/CSD/RR-402.
1985.]
102428 DEFLATED LANCZOS PROCEDURES FOR SOLVING NEARLY SINGULAR SYSTEMS.
T. F. Chan and Y. Saad.
[Yale University. Department of Computer Science. YALEU/DCS/RR-403.
1985.]
102429 A SIMPLE PROBABILISTIC APPROXIMATION ALGORITHM FOR VERTEX COVER.
L. B. Pitt.
[Yale University. Department of Computer Science. YALEU/DCS/TR-404.
1985.]
102431 THE GENERATION OF A CLASS OF MULTIPLIERS: A SYNTHESIS APPROACH TO THE
DESIGN OF HIGHLY PARALLEL ALGORITHMS IN VLSI.
M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-406.
1985.]
102432 THREE FAST ALGORITHMS FOR FOUR PROBLEMS IN STABLE MARRIAGE.
D. Gusfield.
[Yale University. Department of Computer Science. YALEU/DCS/TR-407.
1985.]
102433 ANALYSIS OF PRECONDITIONERS FOR DOMAIN DECOMPOSITION.
T. F. Chan.
[Yale University. Department of Computer Science. YALEU/DCS/RR-408.
1985.]
102434 A DOMAIN-DECOMPOSED FAST POISSON SOLVER ON A RECTANGLE.
T. F. Chan and D. C. Resasco.
[Yale University. Department of Computer Science. YALEU/DCS/RR-409.
1985.]
102435 AN EXPLICIT SCHEME FOR THE PREDICTION OF OCEAN ACOUSTIC PROPAGATION
IN THREE DIMENSIONS.
T. F. Chan, D. Lee, and L. Shen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-411.
1985.]
102436 A PARALLEL LANGUAGE AND ITS COMPILATION TO MULTIPROCESSOR MACHINES OR
VLSI.
M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-412.
1985.]
102437 STABILITY ANALYSIS OF DIFFERENCE SCHEMES FOR VARIABLE COEFFICIENT
SCHROEDINGER TYPE EQUATIONS.
T. F. Chan and L. Shen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-413.
1985.]
102438 DYNAMIC MONOTONE PRIORITIES ON PLANAR SETS.
M. J. Fischer and M. S. Paterson.
[Yale University. Department of Computer Science. YALEU/DCS/TR-415.
1985. Extended abstract.]
102439 A ROBUST AND VERIFIABLE CRYPTOGRAPHICALLY SECURE ELECTION SCHEME.
J. D. Cohen and M. J. Fischer.
[Yale University. Department of Computer Science. YALEU/DCS/TR-416.
1985. Extended abstract.]
102440 ON THE SOLUTION OF A CLASS OF TOEPLITZ SYSTEMS.
M. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-417.
1985.]
102442 DISTRIBUTED FIFO ALLOCATION OF IDENTICAL RESOURCES USING SMALL SHARED
SPACE.
M. J. Fischer et al.
[Yale University. Department of Computer Science. YALEU/DCS/TR-421.
1985.]
102443 INTERCONNECTION NETWORKS AND PARALLEL MEMORY ORGANIZATIONS FOR ARRAY
PROCESSING.
A. G. Ranade.
[Yale University. Department of Computer Science. YALEU/DCS/RR-422.
1985.]
102444 COMPLEX SHIFT AND INVERT STRATEGIES FOR REAL MATRICES.
B. N. Parlett and Y. Saad.
[Yale University. Department of Computer Science. YALEU/DCS/RR-424.
1985.]
102445 PARALLEL IMPLEMENTATIONS OF PRECONDITIONED CONJUGATE GRADIENT METHODS.
Y. Saad and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-425.
1985.]
102446 DATA COMMUNICATION IN HYPERCUBES.
Y. Saad and M. H. Schultz.
[Yale University. Department of Computer Science. YALEU/DCS/RR-428.
1985.]
VOL. 8, NO. 1 01/27/86
102447 OPTIMAL ALGORITHMS FOR FINDING THE SYMMETRIES OF A PLANAR POINT SET.
P. T. Highnam.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-13.
1985.]
102448 OPTIMIZATION OF MECHANISMS FOR FORCE GENERATION BY USING PULLEYS AND
SPRING.
T. Okada.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-14.
1985.]
102449 ACCURATE TRAJECTORY CONTROL OF ROBOTIC MANIPULATORS.
J. C. Van Winssen and C. W. DeSilva.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-15.
1985.]
102450 DP - FORMAT OF THE DRAWING FILES.
D. Giuse.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-16.
1985.]
102451 REPRESENTATION OF ACTIVITY KNOWLEDGE FOR PROJECT MANAGEMENT.
A. Sathi, M. S. Fox, and M. Greenberg.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-17.
1985.]
102452 THE MOTION OF A PUSHED, SLIDING OBJECT. PART 1: SLIDING FRICTION.
M. A. Peshkin and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-18.
1985.]
102453 THE USE OF QUANTITATIVE DATABASES IN ALADIN, AN ALLOY DESIGN SYSTEM.
I. Hulthage et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-19.
1985.]
102454 CALIBRATION AND USE OF A LIGHT STRIPE RANGE SENSOR MOUNTED ON THE
HAND OF A ROBOT.
G. J. Agin.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-85-20.
1985.]
102455 DETECTER LA PERTE DE JETONS ET LES REGENERER SUR UNE STRUCTURE EN
ANNEAU.
M. Raynal and G. Rubino.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 428. 1985. Also issued as Publication
interne 261, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
102456 THE PARTITION MODEL: A FUNCTIONAL APPROACH.
N. Spyratos.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 430. 1985.]
102457 CLAVECIN: UN SYSTEME EXPERT ET ANALYSE DE DONNEES.
E. Demonchaux, J. Quinqueton, and H. Ralambondrainy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 431. 1985.]
102458 CONSTRAINTS ON LONG DISTANCE DEPENDENCIES IN GAPPING GRAMMARS.
P. Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 432. 1985.]
102459 COMPUTATIONAL PROBABILITY AND ANALYSIS OF ALGORITHMS.
M. Hofri.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 433. 1985.]
102460 THE PART AND TRY ALGORITHM ADAPTED TO FREE CHANNEL ACCESS.
P. Jacquet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 436. 1985.]
102461 A CATALOGUE OF COMPLETE GROUP PRESENTATIONS.
P. Le Chenadec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 439. 1985.]
102472 LOGIC SPECIFICATIONS FOR COMPILING.
S. J. Westfold.
[Kestrel Institute. KES.U.83.8. 1984. Thesis (Ph.D.). "A dissertation
submitted to the Department of Computer Science and the Committee on
Graduate Studies of Stanford University in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
102473 STREAM PROCESSING.
A. Goldberg and R. Paige.
[Kestrel Institute. KES.U.84.1. 1984.]
102474 KNOWLEDGE-BASED PROJECT MANAGEMENT AND COMMUNICATION SUPPORT IN A
SYSTEM DEVELOPMENT ENVIRONMENT.
B. I. Kedzierski.
[Kestrel Institute. KES.U.84.2. 1984.]
102475 SYNTHESIS OF NETWORKS FOR ADDITION OF NUMBERS REPRESENTED AS "BIT"
VECTORS.
R. M. King.
[Kestrel Institute. KES.U.84.4. 1984.]
102476 SYNTHESIS OF TREE-STRUCTURED COMPUTING SYSTEMS THROUGH USE OF
CLOSURES.
R. M. King and C. C. Green.
[Kestrel Institute. KES.U.84.6. 1984.]
102477 VERY-HIGH-LEVEL PROGRAMMING OF KNOWLEDGE REPRESENTATION SCHEMES.
S. J. Westfold.
[Kestrel Institute. KES.U.84.7. 1984.]
102478 APPLICATIONS OF A STRATEGY FOR DESIGNING DIVIDE-AND-CONQUER
ALGORITHMS.
D. R. Smith.
[Kestrel Institute. KES.U.85.2. 1985.]
102479 REASONING BY CASES AND THE FORMATION OF CONDITIONAL PROGRAMS.
D. R. Smith.
[Kestrel Institute. KES.U.85.4. 1985.]
102480 KNOWLEDGE-BASED TRANSFORMATIONAL SYNTHESIS OF EFFICIENT STRUCTURES
FOR CONCURRENT COMPUTATION.
R. M. King.
[Kestrel Institute. KES.U.85.5. 1985. Thesis (Ph.D.).]
102481 KNOWLEDGE-BASED COMPILATION USING FINITE DIFFERENCING TECHNIQUES.
J. V. Coursey.
[Kestrel Institute. KES.U.85.6. 1985.]
102482 RESEARCH ON KNOWLEDGE-BASED SOFTWARE ENVIRONMENTS AT KESTREL
INSTITUTE.
D. R. Smith, G. B. Kotik, and S. J. Westfold.
[Kestrel Institute. KES.U.85.7. 1985.]
099091 MASSACHUSETTS INSTITUTE OF TECHNOLOGY. DEPARTMENT OF ELECTRICAL
ENGINEERING AND COMPUTER SCIENCE.
VLSI MEMORANDA ("Memos in this series...are not considered to be
published merely by virtue of appearing in this series. References
to these works should be either to the published version, if any,
or in the form 'private communication'...."):
099091-259 MASTIF - a workstation approach to fabrication process design.
D. S. Boning and D. A. Antoniadis.
[1985]
099091-260 RANDOMIZED ROUTING ON FAT-TREES.
R. I. Greenberg and C. E. Leiserson.
[1985]
099091-266 THE DATABASE ACCELERATOR: ARCHITECTURE.
R. E. Zippel.
[1985]
099091-267 COMPACTION WITH AUTOMATIC JOG INTRODUCTION.
F. M. Maley.
[1985]
099091-268 INTERPROCESSOR COMMUNICATION ISSUES IN FAT-TREE ARCHITECTURES.
A. T. Ishii.
[1985]
099091-269 COMPUTING MINIMUM SPANNING TREES ON A FAT-TREE ARCHITECTURE.
B. M. Maggs.
[1985]
099091-270 SPACE-EFFICIENT ALGORITHMS FOR COMPUTATIONAL GEOMETRY.
C. A. Phillips.
[1985. Thesis (M.S.)]
099091-271 SCHEMA: AN ARCHITECTURE FOR KNOWLEDGE BASED CAD.
C. G. Clark and R. E. Zippel.
[1985]
025075 EXPERT SYSTEMS: WORKING SYSTEMS AND THE RESEARCH LITERATURE.
B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-85-1075. 1985.]
025076 SOME APPROACHES TO KNOWLEDGE ACQUISITION.
B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-85-1076. 1985.]
102483 RECOGNITION OF OFF-LINE CURSIVE HANDWRITING: A CASE OF MULTI-LEVEL
MACHINE PERCEPTION.
R. M. Bozinovie.
[State University of New York, Buffalo. Department of Computer
Science. Report no. 85-01. 1985. Thesis (Ph.D.).]
102484 A SYSTEM FOR AUTOMATICALLY GRADING PROGRAM QUALITY.
P. B. Van Verth.
[State University of New York, Buffalo. Department of Computer
Science. Report no. 85-05. 1985. Thesis (Ph.D.).]
102485 A KNOWLEDGE BASED APPROACH TO NATURAL LANGUAGE UNDERSTANDING.
J. G. Neal.
[State University of New York, Buffalo. Department of Computer
Science. Report no. 85-06. 1985. Thesis (Ph.D.).]
102486 ADDRESS RECOGNITION TECHNIQUES IN MAIL SORTING: RESEARCH DIRECTIONS.
S. N. Srihari et al.
[State University of New York, Buffalo. Department of Computer
Science. Report no. 85-09. 1985.]
102487 A STUDY OF INDUCTIVE INFERENCE MACHINES.
M. A. Fulk.
[State University of New York, Buffalo. Department of Computer
Science. Report no. 85-10. 1985. Thesis (Ph.D).]
102488 TWO-MODE EVALUATION FOR DEALING WITH IMPLICIT INTERACTIONS BETWEEN
LOGIC PROGRAMS AND RELATIONAL DATA BASES.
I. P. Orci and D. Sahlin.
[Systems Development Laboratory (SYSLAB). Report no. 37. 1985.]
102489 RAMATIC - A MODELING SUPPORT SYSTEM.
R. Dahl et al.
[Systems Development Laboratory (SYSLAB). Report no. 34. 1985.]
102490 ON PARALLEL PROGRAMMING PRIMITIVES.
M. Yoeli and A. Ginzburg.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 351. 1985.]
102491 PARALLEL ALOGORITHM FOR FINDING MAXIMUM BIPARTITE MATCHINGS AND
MAXIMUM FLOW IN 0-1 NETWORKS.
E. Schieber and S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 352. 1985.]
102492 ELECTING A LEADER IN THE PRESENCE OF FAULTS: A RING AS A SPECIAL CASE.
L. Shrira and O. Goldreich.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 354. 1985.]
102493 CONSULTATION IN THE PRESENCE OF FAULTS: TWO LOWER BOUNDS.
L. Shrira and O. Goldreich.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 355. 1985.]
102494 COMPOSITE DIFFIE-HELLMAN PUBLIC-KEY GENERATING SYSTEMS ARE HARD TO
BREAK.
Z. Shmuely.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 356. 1985.]
102495 CONCURRENCY CONTROL IN B+-TREES DATABASES USING PREPARATORY
OPERATIONS.
Y. Mond and Y. Raz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 357. 1985.]
102496 THE PRIVATE WORKSPACE MODEL FEASIBILITY AND APPLICATIONS TO 2PL
PERFORMANCE IMPROVEMENTS.
I. Gold, O. Shmueli, and M. Hofri.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 358. 1985.]
102497 TIGHT INTEGRAL DUALITY GAP IN THE CHINESE POSTMAN PROBLEM.
E. Korach and M. Penn.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 360. 1985.]
102498 METHODOLOGICAL CONSTRUCTION OF RELIABLE DISTRIBUTED ALGORITHMS.
L. Shrira and M. Rodeh.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 361. 1985.]
102499 COMMUNICATION VERSUS COMPUTATION IN FAULT TOLERANT BROADCAST
PROTOCOLS.
S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 362. 1985.]
102500 HYPERGRAPH COVERING ALGORITHMS FOR RELATIONAL QUERY PROCESSING.
A. Lustig and O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 368. 1985.]
102501 PROVING TERMINATION OF PROLOG PROGRAMS.
N. Francez et al.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 369. 1985.]
102502 DYNAMIC RULE SUPPORT IN PROLOG.
O. Shmueli et al.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 370. 1985. Extended abstract.]
102503 A PARALLEL METHOD OF ORTHOGONAL PROJECTION FOR SOLVING LARGE SPARSE
LINEAR ALGEBRAIC SYSTEMS.
J. Jelinek and F. Sloboda.
[Turing Institute. TIRM-84-001. 1984.]
102504 SMOOTH AND SHARP LAPACIAN OPERATORS.
F. Sloboda.
[Turing Institute. TIRM-84-002. 1984.]
102505 LOW-LEVEL VISION: AWAY FROM EDGES.
J. Jelinek and P. H. Mowforth.
[Turing Institute. TIRM-84-003. 1984.]
102506 ASSOCIATIVE EVALUATION OF PROLOG PROGRAMS.
K. Nakamura.
[Turing Institute. TIRM-84-004. 1984.]
102507 INDUCTION OF PLANS.
R. Dechter and D. Michie.
[Turing Institute. TIRM-84-006. 1984.]
102508 INDUCTION OF REGULAR LANGUAGES FROM POSITIVE EXAMPLES.
S. Muggleton.
[Turing Institute. TIRM-84-009. 1984.]
102509 DISTRIBUTED CONSTRAINT PROPAGATION: A CASE STUDY.
M. Reinfrank.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-Project.
Memo SEKI-84-07. 1984.]
102510 FOUNDATION OF EXPERT SYSTEMS FOR CONCEPTIONAL DESIGN IN MECHANICAL
ENGINEERING.
P. Raulefs.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-Project.
Memo SEKI-84-08. 1984.]
102526 COMPARATIVE SEMANTICS OF PROGRAMMING LANGUAGES.
B. H. Mayoh.
[University of Aarhus. Department of Computer Science. DAIMI PB-173.
1984.]
102527 TOWARDS REACHABILITY TREES FOR HIGH-LEVEL PETRI NETS.
P. Huber et al.
[University of Aarhus. Department of Computer Science. DAIMI PB-174.
1985.]
102528 A TAXONOMY FOR PROGRAMMING LANGUAGES WITH MULTI-SEQUENTIAL PROCESSES.
K. S. Thomsen and J. L. Knudsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-175.
1984.]
102529 A CONCEPTUAL FRAMEWORK FOR THE CHARACTERIZATION OF PETRI NET
DESCRIPTION TECHNIQUES.
K. H. Madsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-176.
1984.]
102530 KERNEL LANGUAGES.
B. H. Mayoh.
[University of Aarhus. Department of Computer Science. DAIMI PB-177.
1984.]
102531 A VIRTUAL PROTOCOL MODEL FOR COMPUTER-HUMAN INTERACTION.
J. Nielsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-178.
1984.]
102532 LEARNING DIFFICULTIES OF PROGRAMMERS FACED WITH A NEW PROGRAMMING
ENVIRONMENT.
J. Nielsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-181.
1984.]
102533 HOW READERS ANNOTATE TEXTBOOKS AND MANUALS.
J. Nielsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-182.
1984.]
102534 THREE APPROACHES TO TEACHING SOFTWARE ERGONOMICS.
J. Nielsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-184.
1984.]
102535 EXPERIMENTS WITH A MULTIPROCESSOR.
P. Moeller-Nielsen and J. Staunstrup.
[University of Aarhus. Department of Computer Science. DAIMI PB-185.
1984.]
102536 EXPERIMENTS IN DISTRIBUTED TREE-SEARCH.
J. Schaeffer, M. Olafsson, and T. A. Marsland.
[University of Alberta. Department of Computing Science. TR 84-4.
1984.]
102537 "GLOBAL" GRAPH PROBLEMS TEND TO BE INTRACTABLE.
N. Lakshmipathy and K. Winklmann.
[University of Alberta. Department of Computing Science. TR 84-7.
1984.]
102538 A FAST ORDERED RETRIEVAL ALGORITHM FOR ASSOCIATIVE MEMORY.
D.-L. Lee and W. A. Davis.
[University of Alberta. Department of Computing Science. TR 84-8.
1984.]
102539 A NEW APPROACH TO LINEAR QUADTREES.
W. A. Davis and X. Wang.
[University of Alberta. Department of Computing Science. TR 84-9.
1984.]
102540 MODELING AND ANALYSIS OF DISTRIBUTED DATABASE CONCURRENCY CONTROL
ALGORITHMS USING AN EXTENDED PETRI NET FORMALISM.
M. T. Ozsu.
[University of Alberta. Department of Computing Science. TR 84-10.
1984.]
102541 A VLSI MULTI-PRECISION MATRIX MULTIPLIER AND POLYNOMIAL EVALUATOR.
D. Makarenko and J. Schaeffer.
[University of Alberta. Department of Computing Science. TR 84-11.
1984.]
102542 PARALLEL GAME-TREE SEARCH.
T. A. Marsland and F. Popowich.
[University of Alberta. Department of Computing Science. TR 85-1.
1985.]
102543 A SURVEY OF CURRENT LAN TECHNOLOGY AND PERFORMANCE.
W. J. Neilson and U. M. Maydell.
[University of Alberta. Department of Computing Science. TR 85-2.
1985.]
102544 EXPERIMENTS DETERMINING BEST PATHS FOR TESTING COMPUTER PROGRAM
PREDICATES.
L. J. White and P. N. Sahay.
[University of Alberta. Department of Computing Science. TR 85-3.
1985.]
102545 TOWARDS A GENERAL CONCURRENCY CONTROL ALGORITHM FOR DATABASE SYSTEMS.
A. A. Farrag and M. T. Ozsu.
[University of Alberta. Department of Computing Science. TR 85-4.
1985.]
102546 SELECTING TEST DATA FOR THE DOMAIN TESTING STRATEGY.
I. A. Perera and L. J. White.
[University of Alberta. Department of Computing Science. TR 85-5.
1985.]
102547 DATA STRUCTURES FOR SPATIAL DATA PROCESSING.
W. A. Davis and C. P. Gangadharaiah.
[University of Alberta. Department of Computing Science. TR 85-7.
1985.]
102548 IMPLEMENTATION OF VIRTUAL TREE MACHINES.
M. Olafsson and T. A. Marsland.
[University of Alberta. Department of Computing Science. TR 85-9.
1985.]
102549 PERFORMANCE COMPARISON OF RESILIENT CONCURRENCY CONTROL ALGORITHMS
FOR DISTRIBUTED DATABASES.
T.-M. Koon and M. T. Ozsu.
[University of Alberta. Department of Computing Science. TR 85-10.
1985.]
102550 USING SEMANTIC KNOWLEDGE OF TRANSACTIONS TO INCREASE CONCURRENCY.
A. A. Farrag and M. T. Ozsu.
[University of Alberta. Department of Computing Science. TR 85-11.
1985.]
102551 FILE ORGANIZATION SCHEMES FOR GEOMETRIC DATA.
W. A. Davis and C. H. Hwang.
[University of Alberta. Department of Computing Science. TR 85-14.
1985.]
102552 IS BEST FIRST SEARCH REALLY BEST?
A. Reinefeld, T. A. Marsland, and J. Schaeffer.
[University of Alberta. Department of Computing Science. TR 85-16.
1985.]
102553 DATA BASE MANAGEMENT FOR GEO-DATA.
W. A. Davis and M. Palat.
[University of Alberta. Department of Computing Science. TR 85-17.
1985.]
102554 SPECIFICATION AND VERIFICATION OF CONTEXT CONDITIONS FOR PROGRAMMING
LANGUAGES.
M. S. Kaplan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1232. 1985. Thesis (Ph.D.). "A thesis submitted
in fulfillment of the requirements of the degree of Doctor of
Philosophy, Department of Computer Science, University of Cape Town,
1985."]
102555 ADDENDUM TO REPORT NO. UIUCDCS-R-85-1205: IMPLEMENTING LINEAR
MULTISTEP FORMULAS FOR SOLVING ODES.
B. Leimkuhler.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1233. 1985.]
102556 A COMPLEXITY MEASURE FOR DATA FLOW MODELS.
H. E. Motteler and C. H. Smith.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1445. 1984.]
102558 SHAPE FROM RANDOM PLANAR FEATURES.
S. Naito and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-92.
1984. Also issued as CS-TR-1447, Computer Science Center, University
of Maryland.]
102559 DISTANCES BETWEEN FUZZY SETS.
A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-93.
1984. Also issued as CS-TR-1448, Computer Science Center, University
of Maryland.]
102560 READING FROM COMPUTER SCREENS.
C. B. Mills and L. J. Weldon.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1449. 1984. Also issued as CAR-TR-94, Center
for Automation Research, University of Maryland.]
102561 SOME EXPERIMENTS IN OBJECT RECOGNITION USING ORIENTED MODEL POINTS.
T. M. Silberberg and L. S. Davis.
[University of Maryland. Center for Automation Research. CAR-TR-95.
1984. Also issued as CS-TR-1450, Computer Science Center, University
of Maryland.]
102562 MIN-MAX OPERATORS IN TEXTURE ANALYSIS.
M. Werman and S. Peleg.
[University of Maryland. Center for Automation Research. CAR-TR-96.
1984. Also issued as CS-TR-1451, Computer Science Center, University
of Maryland.]
102563 PARALLEL UPDATE OF MINIMAL SPANNING TREES IN LOGARITHMIC TIME.
I. V. Ramakrishnan and S. Pawagi.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1452. 1984. Also issued as CAR-TR-97, Center
for Automation Research, University of Maryland.]
102564 A UNIFIED DESIGN LANGUAGE FOR SOFTWARE SPECIFICATION AND
IMPLEMENTATION.
J. N. Reed and R. T. Yeh.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1454. 1984.]
102565 PARALLEL PROCESSING OF ENCODED BIT STRINGS.
A. Y. Wu.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1455. 1984. Also issued as CAR-TR-98, Center
for Automation Research, University of Maryland.]
102566 ON THE DETERMINACY OF A MODEL FOR PARALLEL COMPUTATION.
D. P. O'Leary and G. W. Stewart.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1456. 1984.]
102567 VISUAL POSITION DETERMINATION FOR AUTONOMOUS VEHICLE NAVIGATION.
F. P. Andresen and L. S. Davis.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1458. 1984. Also issued as CAR-TR-100, Center
for Automation Research, University of Maryland.]
102568 RECOVERY MANAGEMENT SCHEMES IN DISTRIBUTED DATABASE SYSTEMS.
S. H. Son and A. K. Agrawala.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1459. 1984.]
102569 A SHRINKING TECHNIQUE FOR COMPLEX OBJECT DECOMPOSITION.
T. H. Phillips.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1461. 1984. Also issued as CAR-TR-101, Center
for Automation Research, University of Maryland.]
102570 AXIAL REPRESENTATION OF SHAPE.
A. Rosenfeld.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1462. 1984. Also issued as CAR-TR-102, Center
for Automation Research, University of Maryland.]
102571 ABDUCTIVE HYPOTHESIS FORMATION AND REFINEMENT DURING CONSTRUCTION OF
NATURAL SYSTEM MODELS.
M. A. Tagamets and J. A. Reggia.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1463. 1985.]
102572 PICTURE PROCESSING: 1984.
A. Rosenfeld.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1464. 1985. Also issued as CAR-TR-103, Center
for Automation Research, University of Maryland.]
102573 "CONTINUOUS" FUNCTIONS ON DIGITAL PICTURES.
A. Rosenfeld.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1465. 1985. Also issued as CAR-TR-104, Center
for Automation Research, University of Maryland.]
102574 O(N (SQRT N)) DECENTRALIZED COMMIT PROTOCOLS.
T. V. Lakshman and A. K. Agrawala.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1466. 1985.]
102575 AN EFFICIENT CONNECTED COMPONENTS ALGORITHM ON A MESH-CONNECTED
COMPUTER.
P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1467. 1985.]
102576 COMPUTING TREE FUNCTIONS ON SIMD COMPUTERS.
P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1468. 1985.]
102577 A NEW CONSTRUCT FOR SYNCHRONIZATION OF PARALLEL LOGIC PROGRAMS.
S. Kasif.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1469. 1985.]
102578 CONTROL AND DATA DRIVEN EXECUTION OF LOGIC PROGRAMS: A COMPARISON.
S. Kasif.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1470. 1985.]
102579 EXECUTION IN A PARALLEL, ASSOCIATIVE PROLOG MACHINE.
Y. Chu and K. Itano.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1471. 1985.]
102580 APPROXIMATION CSG TREES OF MOVING OBJECTS.
H. Samet and M. Tamminen.
[University of Maryland. Center for Automation Research. CAR-TR-105.
1985. Also issued as CS-TR-1472, Computer Science Center, University
of Maryland.]
102581 MACHINE VISION FOR INDUSTRY: TASKS, TOOLS, AND TECHNIQUES.
A. Rosenfeld.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1473. 1985. Also issued as CAR-TR-106, Center
for Automation Research, University of Maryland.]
102582 A SURVEY OF OBJECT REPRESENTATION AND RECOVERY TECHNIQUES.
T. M. Silberberg.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1474. 1985. Also issued as CAR-TR-107, Center
for Automation Research, University of Maryland.]
102583 AN EXPERIMENTAL COMPARISON OF A MOUSE AND ARROW KEYS FOR AN
INTERACTIVE ENCYCLOPEDIA.
J. Ewing et al.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1475. 1985. Also issued as CAR-TR-108, Center
for Automation Research, University of Maryland.]
102584 A LINEAR APPROACH TO THE CONSISTENT LABELING PROBLEM.
H. Shvaytser and S. Peleg.
[University of Maryland. Center for Automation Research. CAR-TR-109.
1985. Also issued as CS-TR-1476, Computer Science Center, University
of Maryland.]
102585 SYNTHESIS OF A ROAD IMAGE AS SEEN FROM A VEHICLE.
S. Ozawa and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-111.
1985. Also issued as CS-TR-1478, Computer Science Center, University
of Maryland.]
102586 EDGE INFORMATION IN COLOR IMAGES BASED ON HISTOGRAMS OF DIFFERENCES.
M. Pietikainen and D. Harwood.
[University of Maryland. Center for Automation Research. CAR-TR-112.
1985. Also issued as CS-TR-1479, Computer Science Center, University
of Maryland.]
102587 EFFICIENT COMPONENT LABELING OF IMAGES OF ARBITRARY DIMENSION.
H. Samet and M. Tamminen.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1480. 1985. Also issued as CAR-TR-1480, Center
for Automation Research, University of Maryland.]
102588 SYSTOLIC ARRAYS FOR MATRIX TRANSPOSE AND OTHER REORDERINGS.
D. P. O'Leary.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1481. 1985.]
102589 EDGE DETECTION BY ADAPTIVE THRESHOLDING AND KALMAN SMOOTHING.
G. R. Dattatreya and L. N. Kanal.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1482. 1985.]
102590 EFFICIENT DECENTRALIZED CONSENSUS PROTOCOLS.
T. V. Lakshman and A. K. Agrawala.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1483. 1985.]
102591 SELF-DESCRIBING DATABASE SYSTEMS - FORMALIZATION AND REALIZATION.
L. Mark.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1484. 1985. "This report is submitted in partial
fulfillment of the requirements for the degree of licentiatus
scientiarum at Aarhus University, Denmark."]
102592 ON THE UNIQUENESS OF IMAGE FLOW SOLUTIONS FOR PLANAR SURFACES IN
MOTION.
M. Subbarao and A. M. Waxman.
[University of Maryland. Center for Automation Research. CAR-TR-114.
1985. Also issued as CS-TR-1485, Computer Science Center, University
of Maryland.]
102593 ASSIGNMENT AND SCHEDULING IN PARALLEL MATRIX FACTORIZATION.
O'Leary D. P. and G. W. Stewart.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1486. 1985.]
102594 SELF-ROUTING TECHNIQUES IN PERFECT-SHUFFLE NETWORKS USING CONTROL
TAGS.
S.-T. Huang and S. K. Tripathi.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1487. 1985.]
102595 BOUNDARY LOCALIZATION IN AN IMAGE PYRAMID.
E. S. Baugher and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-115.
1985. Also issued as CS-TR-1488, Computer Science Center, University
of Maryland.]
102596 COMMUNICATION STRUCTURE OF DECENTRALIZED COMMIT PROTOCOLS.
T. V. Lakshman and A. K. Agrawala.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1489. 1985.]
102597 CONSTRAINTS AMONG EVENTS.
H. Shvayster.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1490. 1985. Also issued as CAR-TR-116, Center
for Automation Research, University of Maryland.]
102598 A COMPARATIVE ANALYSIS OF METHODS FOR EXPERT SYSTEMS.
C. L. Ramsey et al.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1491. 1985.]
102599 ON USING INVERTED TREES FOR UPDATING GRAPH PROPERTIES.
S. Pawagi and I. V. Ramakrishnan.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1492. 1985. Also issued as CAR-TR-117, Center
for Automation Research, University of Maryland.]
102600 A PROPOSED GENERATION PROCESS FOR THE RECONSTRUCTION OF SPACE CURVES.
C.-H. Lee, T. Seidman, and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-118.
1985. Also issued as CS-TR-1493, Computer Science Center, University
of Maryland.]
102601 BINOCULAR IMAGE FLOWS: STEPS TOWARD STEREO - MOTION FUSION.
A. M. Waxman and J. H. Duncan.
[University of Maryland. Center for Automation Research. CAR-TR-119.
1985. Also issued as CS-TR-1494, Computer Science Center, University
of Maryland.]
102602 ON FINDING SHORTEST PATHS ON CONVEX POLYHEDRA.
D. M. Mount.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1495. 1985. Also issued as CAR-TR-120, Center
for Automation Research, University of Maryland.]
102603 VORONOI DIAGRAMS ON THE SURFACE OF A POLYHEDRON.
D. M. Mount.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1496. 1985. Also issued as CAR-TR-121, Center
for Automation Research, University of Maryland.]
102604 COMPUTATION OF GEOMETRIC PROPERTIES FROM THE MEDIAL AXIS TRANSFORM IN
O(N LOGN) TIME.
A. Y. Wu, S. K. Bhaskar, and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-122.
1985. Also issued as CS-TR-1497, Computer Science Center, University
of Maryland.]
102605 COGNITIVE REPRESENTATIONS OF WINDOWS AND MULTIPLE SCREEN LAYOUTS OF
COMPUTER INTERFACES.
K. L. Norman, L. J. Weldon, and B. Shneiderman.
[University of Maryland. Computer Science Center. Computer science
technical report CS-TR-1498. 1985. Also issued as CAR-TR-123, Center
for Automation Research, University of Maryland.]
102606 COLLINEARITY, SCALING, AND ROUNDING ERROR.
G. W. Stewart.
[University of Maryland. Computer Science Center. Computer science
technical report TR-1499. 1985.]
102607 LOGIC PROGRAMMING AND GRAPH REWRITING.
J. H. Gallier and S. Raatz.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. 1985.]
102608 CONVERGING DISPARATE SENSORY DATA.
R. Bajcsy and P. Allen.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-54. 1984.
Also issued as GRASP LAB 26, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102609 A LATTICE THEORETIC APPROACH TO COMPUTATION BASED ON A CALCULUS OF
PARTIALLY ORDERED TYPE STRUCTURES.
H. Ati-Kaci.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-62. 1984.
Thesis (Ph.D.).]
102610 ANGY: A RULE-BASED EXPERT SYSTEM FOR IDENTIFYING AND ISOLATING
CORONARY VESSELS IN DIGITAL ANGIOGRAMS.
S. A. Stansfield.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-63. 1984.
Thesis (M.S.).]
102611 FILLING IN THE GAPS: A COMPUTATIONAL THEORY OF CONTOUR GENERATION.
D. J. Heeger.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-64. 1984.
Also issued as GRASP LAB 31, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102612 DETECTING TACTILE FEATURE POINTS WITH A ROBOT HAND.
K. Y. Goldberg and E. S. Walsh.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-84-65. 1984.
Also issued as GRASP LAB 32, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102613 A MODAL TEMPORAL LOGIC FOR REASONING ABOUT CHANGING DATABASES WITH
APPLICATIONS TO NATURAL LANGUAGE QUESTION ANSWERING.
E. Mays, A. K. Joshi, and B. L. Webber.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-01. 1985.]
102614 AN INCREMENTAL, STONGLY-TYPED DATABASE QUERY LANGUAGE.
R. S. Nikhil.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-02. 1985.
Thesis (Ph.D.).]
102615 EXACT COMPUTATION SEQUENCES.
A. Pelin and J. H. Gallier.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-05. 1985.]
102616 EXPLAINING CONCEPTS IN EXPERT SYSTEMS: THE CLEAR SYSTEM.
R. Rubinoff.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-06. 1985.]
102617 PARAMETRIC KEYFRAME INTERPOLATION INCORPORATING KINETIC ADJUSTMENT
AND PHRASING CONTROL.
S. N. Steketee and N. I. Badler.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-07. 1985.
Reprint of an article from "Computer Graphics," volume 19, no.3 (July
1985), pp.255-262, together with Appendices A-D which were not
included in the published article.]
102618 LOCAL MATCHING OF SURFACES USING BOUNDARY-CENTERED RADIAL
DECOMPOSITION.
G. M. Radack.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-09. 1985.
Thesis (Ph.D.).]
102619 IMPLEMENTATION OF A GAUSSIAN-SMOOTHING GRADIENT-EDGE DETECTOR.
D. Talton.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-12. 1985.
Also issued as GRASP LAB 35, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102620 IPON - ADVANCED ARCHITECTURAL FRAMEWORK FOR IMAGE PROCESSING.
D. L. Smitley, S. M. Goldwasser, and I. Lee.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-13. 1985.
Also issued as GRASP LAB 36, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102621 RESULTS IN FINDING EDGES AND CORNERS IN IMAGES USING THE FIRST
DIRECTIONAL DERIVATIVE.
E. P. Krotkov.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-14. 1985.
Also issued as GRASP LAB 37, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102622 DECIDABLE SUBCASES OF THE EQUIVALENCE PROBLEM FOR RECURSIVE PROGRAM
SCHEMES.
B. Coucelle and J. H. Gallier.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-15. 1985.]
102623 THE LINGUISTIC RELEVENCE OF THREE ADJOINING GRAMMAR.
A. S. Kroch and A. K. Joshi.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-16. 1985.]
102624 A COMPUTATIONAL LOGIC APPROACH TO SYNTAX AND SEMANTICS.
D. A. Miller and G. Nadathur.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-17. 1985.]
102625 GUIDE: GRAPHICAL USER INTERFACE DEVELOPMENT ENVIRONMENT.
T. E. Granor and N. I. Badler.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-19. 1985.]
102626 TEMPUS: A SYSTEM FOR THE DESIGN AND SIMULATION OF HUMAN FIGURES IN A
TASK-ORIENTED ENVIRONMENT.
N. I. Badler et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-20. 1985.]
102627 A DISTRIBUTED TESTBED FOR ACTIVE SENSORY PROCESSING.
I. Lee and S. M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-22. 1985.
Also issued as GRASP LAB 38, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102628 FAST SURFACE RENDERING ALGORITHMS FOR 3D MEDICAL OBJECTS.
R. A. Reynolds and S. M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-25. 1985.
Also issued as GRASP LAB 40, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102629 THE DESIGN AND ANALYSIS OF A STEREO VISION ALGORITHM.
D. L. Smitley.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-27. 1985.
Thesis (M.S.). Also issued as GRASP LAB 42, General Robotics and
Active Sensory Processing Laboratory, Department of Computer and
Information Science, Moore School of Electrical Engineering,
University of Pennsylvania.]
102630 A 3D PHYSICIAN'S WORKSTATION WITH REAL-TIME PERFORMANCE.
S. M. Goldwasser et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-28. 1985.
Also issued as GRASP LAB 43, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102631 TWO SENSORS ARE BETTER THAN ONE: EXAMPLE OF INTEGRATION OF VISION AND
TOUCH.
P. Allen and R. Bajcsy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-29. 1985.
Also issued as GRASP LAB 44, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102632 A DISTRIBUTED ACTIVE SENSOR PROCESSOR SYSTEM.
S. M. Goldwasser and R. Bajcsy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-30. 1985.
Also issued as GRASP LAB 45, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102633 THE ROLE OF PERSPECTIVE IN RESPONDING TO PROPERTY MISCONCEPTIONS.
K. F. McCoy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-31. 1985.]
102634 COMPUTER ARCHITECTURE FOR INTERACTIVE DISPLAY OF SEGMENTED IMAGERY.
S. M. Goldwasser.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-33. 1985.
Also issued as GRASP LAB 46, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102635 A MOTION VERB INTERFACE TO A TASK ANIMATION SYSTEM.
J. S. Gangel.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-35. 1985.
Thesis (M.S.).]
102636 BACK-TO-FRONT DISPLAY OF VOXEL-BASED OBJECTS.
F. Gideon, D. Gordon, and R. A. Reynolds.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-36. 1985.
Also issued as GRASP LAB 48, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102637 REAL-TIME DISPLAY AND MANIPULATION OF 3D MEDICAL OBJECTS: THE VOXEL
PROCESSOR ARCHITECTURE.
S. M. Goldwasser and R. A. Reynolds.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-37. 1985.
Also issued as GRASP LAB 49, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102638 THE VOXEL PROCESSOR FOR DISPLAY OF 3D MEDICAL OBJECTS.
S. M. Goldwasser et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-38. 1985.
Also issued as GRASP LAB 50, General Robotics and Active Sensory
Processing Laboratory, Department of Computer and Information
Science, Moore School of Electrical Engineering, University of
Pennsylvania.]
102639 AN EXPERT SYSTEMS APPROACH TO REALTIME, ACTIVE MANAGEMENT OF A TARGET
RESOURCE.
D. A. Klein.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-40. 1985.]
102640 ROMPER MUMBLES.
R. F. Karlin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-85-41. 1985.]
102641 A BASIC GUIDE TO UNIX.
L. Moses.
[University of Southern California. Information Sciences Institute.
ISI/TM-85-157. 1985.]
102642 INTERMAIL, AN EXPERIMENTAL MAIL FORWARDING SYSTEM.
A. L. DeSchon.
[University of Southern California. Information Sciences Institute.
RR-85-158. 1985.]
102643 THE USE OF MULTINOMIAL N-DIMENSIONAL CURVE FITTING IN COMPUTER
GRAPHICS.
R. H. Cole.
[University of Waterloo. Department of Computer Science. 1983. Thesis
(Master of Mathematics in Computer Science).]
102644 A CHARACTERIZATION OF TERNARY SIMULATION OF GATE NETWORKS.
J. A. Brzozowski and C.-J. Seger.
[University of Waterloo. Department of Computer Science. CS-85-37.
1985.]
102645 A VALIDATION TOOL FOR DESIGNING DATABASE VIEWS THAT PERMIT UPDATES.
C. M. B. Medeiros.
[University of Waterloo. Department of Computer Science. CS-85-44.
1985. Thesis (Ph.D.).]
102646 SPREADSHEETS WITH INCREMENTAL QUERIES AS A USER INTERFACE FOR LOGIC
PROGRAMMING.
M. H. van Emden, M. Ohki, and A. Takeuchi.
[University of Waterloo. Department of Computer Science. Technical
report CS-85-43. 1985.]
102647 ON THE DEFINITION AND COMPUTATION OF FINITELY-ORIENTED CONVEX HULLS.
G. J. E. Rawlins and D. Wood.
[University of Waterloo. Department of Computer Science. CS-85-46.
1985.]
102648 A HIERARCHICAL MODULE STRUCTURE FOR WUP PROGRAMS.
C. Baird.
[University of Waterloo. Department of Computer Science. Research
report CS-85-49. 1985.]
102649 USING DEFINITE CLAUSES AND INTEGRITY CONSTRAINTS AS THE BASIS FOR A
THEORY FORMATION APPROACH TO DIAGNOSTIC REASONING.
R. Goebel, K. Furukawa, and D. L. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-85-50. 1985.]
102650 GRACEFULLY ADDING NEGATION AND DISJUNCTION TO PROLOG.
D. L. Poole and R. Goebel.
[University of Waterloo. Department of Computer Science. Research
report CS-85-51. 1985.]
102651 TRANSLATION OF USUAL PROGRAMS TO DATA FLOW PROGRAMS WITH
SYNCHRONIZATION SUBSETS.
K. Culik and I. A. Natour.
[Wayne State University. Department of Computer Science. CSC-84-005.
1984.]
102652 ON THE PERFORMANCE OF AN OPTIMISTIC CONCURRENT TREE ALGORITHM.
R. Ford, M. J. Jipping, and R. Shultz.
[University of Iowa. Department of Computer Science. Technical report
85-07. 1985.]
102653 BIN PACKING AND MEMORY MANAGEMENT.
D. P. Konkin.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-18. 1985. Thesis (M.S.).]
102654 A FAST MUTUAL EXCLUSION ALGORITHM.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 7. 1985.]
102655 INCREMENTAL EXECUTION IN A PROGRAMMING ENVIRONMENT BASED ON
COMPILATION.
G. Hedin and B. Magnusson.
[Lund Institute of Technology. Department of Computer Sciences.
LUTFD2/(TFCS-3009)/1-12/(1985). 1985.]
102656 THE STRONGLY HYPERBOLIC EQUATION AND ITS APPLICATIONS.
N. Iwasaki.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-520. 1985.]
102657 EKL - AN INTERACTIVE PROOF CHECKER. USER'S REFERENCE MANUAL.
J. Ketonen and J. S. Weening.
[Stanford University. Department of Computer Science. 1983.]
VOL. 8, NO. 2 02/28/86
102667 SEVERAL ASPECTS ON UNIFICATION.
T. Adachi et al.
[Institute for New Generation Computer Technology (ICOT). TM-0046.
1984.]
102671 OBJECT ORIENTED PARSER IN THE LOGIC PROGRAMMING LANGUAGE ESP.
H. Miyoshi and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TM-0053.
1984.]
102673 UNIQUE FEATURES OF ESP.
T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TM-0055.
1984.]
102674 A CONSTRAINT BASED DYNAMIC SEMANTIC MODEL FOR LOGIC DATABASES.
T. Miyachi et al.
[Institute for New Generation Computer Technology (ICOT). TM-0056.
1984.]
102675 WRITING IN A FOREIGN LANGUAGE AND PROGRAMMING IN WARNIER'S
METHODOLOGY - A STUDY OF PROGRAMMING PROCESSES.
A. Taguchi.
[Institute for New Generation Computer Technology (ICOT). TM-0057.
1984.]
102676 MAID: A MAN-MACHINE INTERFACE FOR DOMESTIC AFFAIRS.
S. Hiroyuki.
[Institute for New Generation Computer Technology (ICOT). TM-0058.
1984.]
102677 PROBLEMS IN DEVELOPING AN EXPERIMENTAL SYSTEM ABLE TO REUSE EXISTING
PROGRAMS.
Y. Nagai, E. Chigira, and M. Kobayashi.
[Institute for New Generation Computer Technology (ICOT). TM-0059.
1984.]
102683 AN OPERATING SYSTEM FOR SEQUENTIAL INFERENCE MACHINE PSI.
T. Hattori et al.
[Institute for New Generation Computer Technology (ICOT). TM-0065.
1984.]
102690 SYNTACTIC PARSING WITH POPS - ITS PARSING TIME ORDER AND THE
COMPARISON WITH OTHER SYSTEMS.
H. Hirakawa and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TM-0073.
1984.]
102691 PROGRESS IN THE INITIAL STAGE OF THE FGCS PROJECT.
K. Takei.
[Institute for New Generation Computer Technology (ICOT). TM-0074.
1984.]
102694 A PERSONAL PERSPECTIVE ON SOME ASPECTS OF THE FGCS - PRELIMINARY
CONSIDERATIONS FOR FIFTH-GENERATION-COMPUTER NETWORKS.
A. Taguchi.
[Institute for New Generation Computer Technology (ICOT). TM-0077.
1984.]
102699 WIRING DESIGN EXPERT SYSTEM FOR VLSI: WIREX.
H. Mori et al.
[Institute for New Generation Computer Technology (ICOT). TM-0083.
1984.]
102700 GDLO: A GRAMMAR DESCRIPTION LANGUAGE BASED ON DCG.
T. Morishita and H. Hirakawa.
[Institute for New Generation Computer Technology (ICOT). TM-0084.
1984.]
102701 DELTA DEMONSTRATION AT ICOT OPEN HOUSE.
K. Murakami et al.
[Institute for New Generation Computer Technology (ICOT). TM-0085.
1984.]
102702 THE BOYER-MOORE THEOREM PROVER IN PROLOG. USER'S MANUAL.
[Institute for New Generation Computer Technology (ICOT). TM-0086.
1984. V3.6, November 1984.]
102703 KNUTH-BENDIX ALGORITHM FOR THUE SYSTEM BASED ON KACHINUKI ORDERING.
K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TM-0087.
1984.]
102707 SOURCE-LEVEL OPTIMIZATION TECHNIQUES FOR PROLOG.
H. Sawamura, T. Takeshima, and A. Kato.
[Institute for New Generation Computer Technology (ICOT). TM-0091.
1985.]
102710 PROTOTYPING A DIALOGING SYSTEM WITH A TOPIC MANAGEMENT FUNCTION.
T. Miyachi et al.
[Institute for New Generation Computer Technology (ICOT). TM-0094.
1985.]
102711 CONSTRAINT-BASED LOGIC DATABASE MANAGEMENT: STRUCTURING
META-KNOWLEDGE IN DATABASE MANAGEMENT.
T. Miyachi et al.
[Institute for New Generation Computer Technology (ICOT). TM-0095.
1985.]
102713 SOME CONSIDERATIONS ON ESSENTIAL REQUIREMENTS OF INTELLIGENT HUMAN
INTERFACES.
A. Taguchi.
[Institute for New Generation Computer Technology (ICOT). TM-0097.
1985.]
102715 SOME ASPECTS OF FUTURE KNOWLEDGE-COMMUNICATION NETWORKS AS
INFRASTRUCTURE FOR FIFTH GENERATION COMPUTERS.
A. Taguchi.
[Institute for New Generation Computer Technology (ICOT). TM-0099.
1985.]
102716 CONSTRUCTING THE SIMPOS SUPERVISOR IN AN OBJECT-ORIENTED APPROACH.
T. Hattori, N. Yoshida, and T. Fujisaki.
[Institute for New Generation Computer Technology (ICOT). TM-0100.
1985.]
102717 SOME EXPERIMENTS ON EKL.
M. Hagiya and S. Hayashi.
[Institute for New Generation Computer Technology (ICOT). TM-0101.
1985.]
102719 SOME ASPECTS OF GENERALIZED PHRASE STRUCTURE GRAMMAR.
S. Amano et al.
[Institute for New Generation Computer Technology (ICOT). TM-0103.
1985.]
102721 DESIGN OF A HIGH-SPEED PROLOG MACHINE (HPM).
R. Nakazaki et al.
[Institute for New Generation Computer Technology (ICOT). TM-0105.
1985.]
102725 WIREX: VSLI WIRING DESIGN EXPERT SYSTEM.
H. Mori et al.
[Institute for New Generation Computer Technology (ICOT). TM-0109.
1985.]
102728 PSI FONT EDITOR USER GUIDE.
H. Touati.
[Institute for New Generation Computer Technology (ICOT). TM-0112.
1985.]
102731 PSI FONT EDITOR IMPLEMENTATION NOTES.
H. Touati.
[Institute for New Generation Computer Technology (ICOT). TM-0115.
1985.]
102762 SOME COMMENTS ON SEMANTICAL DISK CACHE MANAGEMENT FOR KNOWLEDGE BASE
SYSTEMS.
H. Schweppe.
[Institute for New Generation Computer Technology (ICOT). TR-040.
1984.]
102763 [SIMULATOR OF XP'S]
M. Aso.
[Institute for New Generation Computer Technology (ICOT). TR-041.
1984. IN JAPANESE. English abstract.]
102764 AN APPROACH TO A PARALLEL INFERENCE MACHINE BASED ON CONTROL-DRIVEN
AND DATA-DRIVEN MECHANISMS.
R. Onai, M. Asou, and A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-042.
1984.]
102765 [MANDALA: KNOWLEDGE PROGRAMMING SYSTEM ON LOGIC PROGRAMMING LANGUAGE]
K. Furukawa, A. Takeuchi, and S. Kunifuji.
[Institute for New Generation Computer Technology (ICOT). TR-043.
1984. IN JAPANESE. English abstract.]
102766 ESP REFERENCE MANUAL.
T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-044.
1984.]
102767 THE DESIGN AND IMPLEMENTATION OF A PERSONAL SEQUENTIAL INFERENCE
MACHINE: PSI.
M. Yokota et al.
[Institute for New Generation Computer Technology (ICOT). TR-045.
1984.]
102768 DIALOGUE MANAGEMENT IN THE PERSONAL SEQUENTIAL INFERENCE MACHINE
(PSI).
J. Tsuji et al.
[Institute for New Generation Computer Technology (ICOT). TR-046.
1984.]
102769 [PROLOG SOURCE LEVEL OPTIMIZER: CATALOGUE OF OPTIMIZATION METHODOLOGY]
H. Sawamura.
[Institute for New Generation Computer Technology (ICOT). TR-047.
1984. IN JAPANESE. No English abstract. By H. Sawamura et al.]
102770 [ANALYSIS OF SEQUENTIAL PROLOG PROGRAM]
R. Onai.
[Institute for New Generation Computer Technology (ICOT). TR-048.
1984. IN JAPANESE. No English abstract. By R. Onai et al.]
102771 [META-INFERENCE AND ITS APPLICATION IN A LOGIC PROGRAMMING LANGUAGE]
S. Kunifuji et al.
[Institute for New Generation Computer Technology (ICOT). TR-049.
1984. IN JAPANESES. No English abstract.]
102772 [ARCHITECTURE OF DATAFLOW PARALLEL INFERENCE MACHINE]
T. Ito.
[Institute for New Generation Computer Technology (ICOT). TR-050.
1984. IN JAPANESE. No English abstract. By T. Ito et al.]
102773 [SOFTWARE DEVELOPMENT SUPPORTING SYSTEM]
M. Sugimoto.
[Institute for New Generation Computer Technology (ICOT). TR-051.
1984. IN JAPANESE. No English abstract.]
102774 [HARDWARE DESIGN OF PERSONAL SEQUENTIAL INFERENCE MACHINE]
K. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-052.
1984. IN JAPANESE. No English abstract. By K. Taki et al.]
102775 A RELATIONAL DATABASE MACHINE WITH LARGE SEMICONDUCTOR DISK AND
HARDWARE RELATIONAL ALGEBRA PROCESSOR.
S. Shibayama et al.
[Institute for New Generation Computer Technology (ICOT). TR-053.
1984.]
102776 [THE CONCEPTUAL SPECIFICATION OF THE KERNEL LANGUAGE, VERSION 1]
K. Furukawa et al.
[Institute for New Generation Computer Technology (ICOT). TR-054.
1984. IN JAPANESE. No English abstract.]
102777 SIMPOS: AN OPERATING SYSTEM FOR A PERSONAL PROLOG MACHINE PSI.
T. Hattori, J. Tsuji, and T. Yokoi.
[Institute for New Generation Computer Technology (ICOT). TR-055.
1984.]
102778 THE CONCEPTS AND FACILITIES OF SIMPOS SUPERVISOR.
T. Hattori and T. Yokoi.
[Institute for New Generation Computer Technology (ICOT). TR-056.
1984.]
102779 OVERALL DESIGN OF SIMPOS (SEQUENTIAL INFERENCE MACHINE PROGRAMMING
AND OPERATING SYSTEM).
S. Takagi et al.
[Institute for New Generation Computer Technology (ICOT). TR-057.
1984.]
102780 PROLOG-BASED EXPERT SYSTEM FOR LOGIC DESIGN.
F. Maruyama et al.
[Institute for New Generation Computer Technology (ICOT). TR-058.
1984.]
102781 THE CONCEPTS AND FACILITIES OF SIMPOS FILE SYSTEM.
T. Hattori and T. Yokoi.
[Institute for New Generation Computer Technology (ICOT). TR-059.
1984.]
102782 A NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.
T. Yokomori.
[Institute for New Generation Computer Technology (ICOT). TR-060.
1984.]
102783 COORDINATOR - THE KERNEL OF THE PROGRAMMING SYSTEM FOR THE PERSONAL
SEQUENTIAL INFERENCE MACHINE (PSI).
T. Kurokawa and S. Tojo.
[Institute for New Generation Computer Technology (ICOT). TR-061.
1984.]
102784 AN ORDERING METHOD FOR TERM REWRITING SYSTEMS.
K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TR-062.
1984.]
102785 DESIGN AND IMPLEMENTATION OF THE RELATIONAL DATABASE ENGINE.
H. Sakai et al.
[Institute for New Generation Computer Technology (ICOT). TR-063.
1984.]
102786 QUERY PROCESSING FLOW ON RDBM DELTA'S FUNCTIONALLY-DISTRIBUTED
ARCHITECTURE.
S. Shibayama et al.
[Institute for New Generation Computer Technology (ICOT). TR-064.
1984.]
102787 EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGE.
K. Ueda and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-065.
1984.]
102788 DESIGN AND IMPLEMENTATION OF A TWO-WAY MERGE-SORTER AND ITS
APPLICATION TO RELATIONAL DATABASE PROCESSING.
K. Iwata et al.
[Institute for New Generation Computer Technology (ICOT). TR-066.
1984.]
102789 NATURAL LANGUAGE BASED SOFTWARE DEVELOPMENT SYSTEM TELL.
H. Enomoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-067.
1984.]
102790 FORMAL SPECIFICATION AND VERIFICATION FOR CONCURRENT SYSTEMS BY TELL.
H. Enomoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-068.
1984.]
102791 [KNOWLEDGE REPRESENTATION (FOR WG4 WORKSHOP '83)]
F. Mizoguchi and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-070.
1984. IN JAPANESE. No English abstract. Edited by F. Mizoguchi and K.
Furukawa.]
102792 DESIGN CONCEPT FOR A SOFTWARE DEVELOPMENT CONSULTATION SYSTEM.
M. Sugimoto, H. Kato, and H. Yoshida.
[Institute for New Generation Computer Technology (ICOT). TR-071.
1984.]
102793 COMPARISON OF CLOSURE REDUCTION AND COMBINATORY REDUCTION SCHEMES.
T. Ida and A. Konagaya.
[Institute for New Generation Computer Technology (ICOT). TR-072.
1984.]
102794 [APPROACH TO TRANSLATION IN MORE NATURAL WAY (1)]
H. Tanaka.
[Institute for New Generation Computer Technology (ICOT). TR-073.
1984. IN JAPANESE. No English abstract. By H. Tanaka et al.]
102795 AN OVERVIEW OF RELATIONAL DATABASE MACHINE DELTA.
N. Miyazaki et al.
[Institute for New Generation Computer Technology (ICOT). TR-074.
1984.]
102796 HARDWARE DESIGN AND IMPLEMENTATION OF THE PERSONAL SEQUENTIAL
INFERENCE MACHINE (PSI).
K. Taki et al.
[Institute for New Generation Computer Technology (ICOT). TR-075.
1984.]
102797 MANDALA: A LOGIC BASED KNOWLEDGE PROGRAMMING SYSTEM.
K. Furukawa et al.
[Institute for New Generation Computer Technology (ICOT). TR-076.
1984.]
102798 [PARALLEL INFERENCE MACHINE PIM-R: ITS ARCHITECURE AND SOFTWARE
SIMULATION]
R. Onai.
[Institute for New Generation Computer Technology (ICOT). TR-077.
1984. IN JAPANESE. No English abstract. By R. Onai et al.]
102799 [PLAN FOR CONSTRUCTING KNOWLEDGE ARCHITECTURE]
H. Kondou.
[Institute for New Generation Computer Technology (ICOT). TR-078.
1984. IN JAPANESE. No English abstract.]
102800 [A MICROPROGRAMMED INTERPRETER FOR THE PERSONAL SEQUENTIAL INFERENCE
MACHINE PSI]
A. Yamamoto.
[Institute for New Generation Computer Technology (ICOT). TR-079.
1984. IN JAPANESE. No English abstract. By A. Yamamoto et al.]
102801 [THE DEVELOPMENT OF EXPERIMENTAL QA-SYSTEMS ON SITUATION SEMANTICS]
T. Kato.
[Institute for New Generation Computer Technology (ICOT). TR-080.
1984. IN JAPANESE. No English abstract.]
102802 [THE COMPOUND LOCAL AREA NETWORK INI - ITS PHYSICAL NETWORK
CONFIGURATION AND CHARACTERISTICS OF PHYSICAL LAYER PROTOCOLS]
A. Taguchi.
[Institute for New Generation Computer Technology (ICOT). TR-081.
1984. IN JAPANESE. No English abstract. By A. Taguchi et al.]
102803 CURRENT STATUS AND FUTURE PLANS OF THE FIFTH GENERATION COMPUTER
SYSTEMS PROJECT.
K. Kawanobe.
[Institute for New Generation Computer Technology (ICOT). TR-083.
1984.]
102804 ARCHITECTURES AND HARDWARE SYSTEMS: PARALLEL INFERENCE MACHINE AND
KNOWLEDGE BASE MACHINE.
K. Murakami, T. Kakuta, and R. Onai.
[Institute for New Generation Computer Technology (ICOT). TR-084.
1984.]
102805 BASIC SOFTWARE SYSTEM.
K. Furukawa and T. Yokoi.
[Institute for New Generation Computer Technology (ICOT). TR-085.
1984.]
102806 SEQUENTIAL INFERENCE MACHINE: SIM PROGRESS REPORT.
S. Uchida and T. Yokoi.
[Institute for New Generation Computer Technology (ICOT). TR-086.
1984.]
102807 SEQUENTIAL INFERENCE MACHINE: SIM - ITS PROGRAMMING AND OPERATING
SYSTEM.
T. Yokoi and S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TR-087.
1984.]
102808 RECURSIVE UNSOLVABILITY OF DETERMINACY, SOLVABLE CASES OF DETERMINACY
AND THEIR APPLICATIONS TO PROLOG OPTIMIZATION.
H. Sawamura and T. Takeshima.
[Institute for New Generation Computer Technology (ICOT). TR-088.
1984.]
102809 THE DESIGN AND IMPLEMENTATION OF RELATIONAL DATABASE MACHINE DELTA.
T. Kakuta et al.
[Institute for New Generation Computer Technology (ICOT). TR-089.
1984.]
102810 A SEQUENTIAL IMPLEMENTATION OF CONCURRENCT PROLOG BASED ON THE
SHALLOW BINDING SCHEME.
T. Miyazaki, A. Takeuchi, and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-090.
1984.]
102811 CONCURRENT PROLOG ON TOP OF PROLOG.
K. Ueda and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-092.
1984.]
102812 OCCAM TO CMOS EXPERIMENTAL LOGIC DESIGN SUPPORT SYSTEM.
T. Mano et al.
[Institute for New Generation Computer Technology (ICOT). TR-093.
1984.]
102813 FORMULATION OF INDUCTION FORMULAS IN VERIFICATION OF PROLOG PROGRAMS.
T. Kanamori and H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TR-094.
1984.]
102814 TYPE INFERENCE IN PROLOG AND ITS APPLICATIONS.
T. Kanamori and K. Horiuchi.
[Institute for New Generation Computer Technology (ICOT). TR-095.
1984.]
102815 VERIFICATION OF PROLOG PROGRAMS USING AN EXTENSION OF EXECUTION.
T. Kanamori and H. Seki.
[Institute for New Generation Computer Technology (ICOT). TR-096.
1984.]
102816 PRINCIPLES OF OBJ2.
J. A. Goguen, J.-P. Jouannaud, and J. Meseguer.
[Institute for New Generation Computer Technology (ICOT). TR-097.
1984.]
102817 LOGIC DESIGN: ISSUES IN BUILDING KNOWLEDGE-BASED DESIGN SYSTEMS.
F. Maruyama et al.
[Institute for New Generation Computer Technology (ICOT). TR-098.
1984.]
102818 DATA-FLOW BASED EXECUTION MECHANISMS OF PARALLEL AND CONCURRENT
PROLOG.
N. Ito et al.
[Institute for New Generation Computer Technology (ICOT). TR-099.
1984.]
102819 HORN CLAUSE LOGIC WITH PARAMETERIZED TYPES FOR SITUATION SEMANTICS
PROGRAMMING.
K. Mukai.
[Institute for New Generation Computer Technology (ICOT). TR-101.
1985.]
102820 TOWARDS AUTOMATED SYNTHETIC DIFFERENTIAL GEOMETRY 1 - BASIC
CATEGORICAL CONSTRUCTION.
S. Hayashi.
[Institute for New Generation Computer Technology (ICOT). TR-104.
1985.]
102821 ARCHITECTURE OF REDUCTION-BASED PARALLEL INFERENCE MACHINE: PIM-R.
R. Onai et al.
[Institute for New Generation Computer Technology (ICOT). TR-105.
1985.]
102822 [OPERATION MANUAL FOR QUTE PROCESSOR]
T. Sakurai and M. Fujita.
[Institute for New Generation Computer Technology (ICOT). TR-106.
1985. IN JAPANESE. No English abstract.]
102823 [FOUNDATIONS AND APPLICATIONS OF KNOWLEDGE ENGINEERING: PROLOG-BASED
KNOWLEDGE BASE MANAGEMENT]
S. Kunifuji et al.
[Institute for New Generation Computer Technology (ICOT). TR-107.
1985. IN JAPANESE. No English abstract.]
102824 BOUNDS ON THE LENGTH OF CONVEX PARTITIONS OF POLYGONS.
C. Levcopoulos and A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-14. 1984.]
102825 A NOVEL HEURISTIC FOR MINIMUM WEIGHT TRIANGULATION.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-15. 1984.]
102826 A NOTE ON COMPUTATIONAL COMPLEXITY OF LOGIC PROGRAMS.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-16. 1984.]
102827 HEURISTIC FOR MINIMUM EDGE LENGTH RECTANGULAR PARTITIONS OF
RECTILINEAR FIGURES.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-17. 1984.]
102828 A KNOWN MAX-FLOW ALGORITHM YIELDS A NEW UPPER TIME BOUND FOR MAXIMUM
BIPARTITE C-MATCHING.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-18. 1984.]
102829 COVERING POLYGONS WITH MINIMUM NUMBER OF RECTANGLES.
C. Levcopoulos and A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-19. 1984.]
102830 THE GREEDY AND DELAUNEY TRIANGULATIONS ARE NOT BAD IN THE AVERAGE
CASE AND MINIMUM WEIGHT GEOMETRIC TRIANGULATION OF MULTI-CONNECTED
POLYGONS IS NP-COMPLETE.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-20. 1984.]
102831 AN ARCHITECTURE STRATEGY FOR ASYNCHRONOUS PROCESSING.
H. W. Lawson and J. B. Lyles.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-22. 1984.]
102832 A SPECIALIZED CAD DATABASE.
P. Siemienski.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-23. 1984.]
102833 CAD APPROACHES FOR AN ASYNCHRONOUS ARCHITECTURE.
J. B. Lyles.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-24. 1984.]
102834 NAMING SERVICES IN DISTRIBUTED COMPUTER ARCHITECTURE.
J. B. Lyles, Z. Peng, and J. Fagerstrom.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-84-25. 1984.]
102835 THE STRUCTURE OF MIXED LANGUAGE PROGRAMMING REALIZATION.
B. Einarsson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-01. 1985.]
102836 A LINEAR-TIME HEURISTIC FOR MINIMUM WEIGHT TRIANGULATION OF CONVEX
POLYGONS.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-12. 1985.]
102837 ON PARTITIONING POLYGONS.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-13. 1985.]
102838 EXPERIENCES WITH OCCAM: A SIMULATOR FOR ASYNCHRONOUS PROCESSES.
J. Fagerstrom.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-14. 1985.]
102839 SUBGRAPH ISOMORPHISM FOR EASILY SEPARABLE GRAPHS ON BOUNDED VALENCE.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-15. 1985.]
102840 THE ANTIBODY ANALYSIS ADVISOR AND ITS MIGRATION INTO A PRODUCTIVE
ENVIRONMENT.
K. Sandahl et al.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-85-16. 1985.]
102841 INFINITE STREAMS AND FINITE OBSERVATIONS IN THE SEMANTICS OF UNIFORM
CONCURRENCY.
J. W. de Bakker, J.-J. Ch Meyer, and E.-R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8512. 1985.]
102842 DISTRIBUTED MATCH-MAKING FOR PROCESSES IN COMPUTER NETWORKS.
S. J. Mullender and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8513. 1985.]
102843 AREA PENALTY FOR SUBLINEAR SIGNAL PROPAGATION DELAY ON CHIP.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8514. 1985. Preliminary version.]
102844 OPERATIONAL SEMANTICS OF A PARALLEL OBJECT-ORIENTED LANGUAGE.
P. America et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8515. 1985.]
102845 DEVELOPMENT, GROWTH AND TIME.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8516. 1985.]
102846 READY TRACE SEMANTICS FOR CONCRETE PROCESS ALGEBRA WITH PRIORITY
OPERATOR.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8517. 1985.]
102847 A CONCEPTUAL MODELING EXPERT SYSTEM.
M. L. Kersten et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8518. 1985.]
102848 TAPE VERSUS QUEUE AND STACKS: THE LOWER BOUNDS.
M. Li and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8519. 1985.]
102849 PROGRAM DERIVATION THROUGH TRANSFORMATIONS: THE EVOLUTION OF
LIST-COPYING ALGORITHMS.
N. W. P. van Diepen and W. P. de Roever.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8520. 1985.]
102850 GLOBAL RENAMING OPERATORS IN CONCRETE PROCESS ALGEBRA.
J. C. M. Baeten and J. A. Bergstra.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8521. 1985.]
102851 AN OPERATIONAL SEMANTICS FOR PROCESS ALGEBRA.
J. C. M. Baeten, J. A. Bergtra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8522. 1985.]
102852 INFERENCE TECHNOLOGY: AN ASSESSMENT.
J. K. Debenham.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.1. 1985.]
102853 META-LOGICAL CONTROL FOR LOGIC PROGRAMS.
T. Vasak and J. Potter.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.2. 1985.]
102854 VOLUMETRIC PROPERTIES OF SUPERQUADRIC SHAPES.
K. G. Suffern.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.3. 1985.]
102855 DECISION TREES AND MULTI-VALUED ATTRIBUTES.
J. R. Quinlan.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.4. 1985.]
102856 A PARALLEL ARCHITECTURE GRAPHICS PROCESSOR.
T. Hintz.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.5. 1985.]
102857 INDUCTION OF DECISION TREES.
J. R. Quinlan.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.6. 1985.]
102858 STYLE IN LOGIC PROGRAMS.
J. K. Debenham.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.7. 1985.]
102859 DEMONSTRATION OF DATA COMMUNICATION PROTOCOLS.
J. Colville.
[New South Wales Institute of Technology. School of Computing
Science. Technical report 85.8. 1985.]
102860 A QUERY LANGUAGE WITH CONDITIONS OF EQUALITY AND INEQUALITY TYPE.
B. Konikowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 555. 1984.]
102861 INTERSECTION THEOREMS, FIXED-POINT THEOREMS AND VARIATIONAL
INEQUALITIES.
B. C. Cuong.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 556. 1984.]
102862 MECHANICAL PROOF METHODS FOR POST LOGICS.
E. Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 557. 1984.]
102863 ON PRIORITY AND NON-PRIORITY PATH EXPRESSIONS.
F. Okulicka.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 558. 1985.]
102864 AN ALGEBRAIC AND LOGICAL APPROACH TO INDISCERNIBILITY RELATIONS.
C. Rauszer.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 559. 1985.]
102865 KERNEL ESTIMATORS OF A DENSITY FUNCTION IN CASE OF CENSORED DATA.
J. Mielniczuk.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 560. 1985.]
102866 A MICROPROGRAMMABLE ARCHITECTURE WITH QUASI TIME-TRANSPARENT CONTROL
IN HIGHLY STRUCTURED MICROPROGRAMS.
M. Tudruj and R. Gajda.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 562. 1985.]
102867 DATA PROCESSING SYSTEMS FOR MICROCOMPUTERS.
W. W. Koczkodaj.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 563. 1985.]
102868 GRAPH PROBLEMS IN NETWORK DESIGN.
D. B. Skillicorn.
[Queen's University. Department of Computing and Information Science.
Technical report 85-174. 1985.]
102869 DRAT: A PROGRAM FOR MAINTAINING LISTINGS.
D. A. Lamb, I. Durham, and J. M. Newcomer.
[Queen's University. Department of Computing and Information Science.
Technical report 85-175. 1985.]
102870 IMPLEMENTATION STRATEGIES FOR DIANA ATTRIBUTES.
D. A. Lamb.
[Queen's University. Department of Computing and Information Science.
Technical report 85-176. 1985.]
102871 KNOWLEDGE PROCESSING VS. PROGRAMMING: CK-LOG VS. PROLOG.
C. V. Srinivasan.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-160. 1984.]
102872 A NOTE ON UNMERGING.
B. Reed, J. S. Salowe, and W. L. Steiger.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-161. 1985.]
102873 STABLE UNMERGING IN LINEAR TIME AND CONSTANT SPACE.
J. S. Salowe and W. L. Steiger.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-162. 1985.]
102874 SUBSET SIZE IN PARALLEL.
L. Rudolph and W. L. Steiger.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-163. 1985.]
102875 THE CONSISTENT LABELING PROBLEM, PART 1: BACKGROUND AND PROBLEM
FORMULATION.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-164. 1985.]
102876 THE CONSISTENCY LABELING PROBLEM, PART 2: SUBPROBLEMS, ENUMERATIONS
AND CONSTRAINT SATISFACTION.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-165. 1985.]
102877 THE CONSISTENT LABELING PROBLEM, PART 3: THE GENERALIZED BACKTRACKING
ALGORITHM.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-166. 1985.]
102878 THE CONSISTENT LABELING PROBLEM, PART 4: THE GENERALIZED FORWARD
CHECKING AND WORD-WISE FORWARD CHECKING ALGORITHMS.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-167. 1985.]
102879 EXPLANATION-BASED GENERALIZATION: UNIFYING VIEW.
T. M. Mitchell, R. M. Keller, and S. T. Kedar-Cabelli.
[Rutgers. Department of Computer Science. Technical report ML-TR-2.
1985.]
102880 ANALOGY - FROM A UNIFIED PERSPECTIVE.
S. T. Kedar-Cabelli.
[Rutgers. Department of Computer Science. Technical report ML-TR-3.
1985.]
102881 MACHINE LEARNING RESEARCH AT RUTGERS UNIVERSITY.
R. M. Keller and S. T. Kedar-Cabelli.
[Rutgers. Department of Computer Science. Technical report ML-TR-4.
1985. "This technical report collects together research summaries of
ongoing work in machine learning at the Department of Computer
Science at Rutgers University during 1985."]
102882 MARS: A MULTIPLE ABSTRACTION RULE-BASED SIMULATOR.
N. Singh.
[Fairchild Camera and Instrument Corporation. Laboratory of
Artificial Intelligence Research. FLAIR technical report 17. 1983.
Also issued as Report no. 640, Fairchild Camera and Instrument
Corporation.]
102883 QUALITATIVE REASONINGS WITH DEEP-LEVEL MECHANISM MODELS FOR DIAGNOSES
OF DEPENDENT FAILURES.
Y.-C. Pan.
[Schlumberger Computer Aided Systems. AI technical report 38. 1984.
Thesis (Ph.D.). "Thesis submitted in partial fulfillment of the
requirements for the degree of Doctor of Philosophy in Computer
Science in the Graduate College of the University of Illinois at
Urbana-Champaign, 1984."]
102884 KRYPTON: DESCRIPTION OF AN IMPLEMENTATION. VOLUME 1.
V. Pigman.
[Schlumberger Computer Aided Systems. AI technical report 40. 1984.]
102885 KRYPTON: DESCRIPTION OF AN IMPLEMENTATION. VOLUME 2.
V. Pigman.
[Schlumberger Computer Aided Systems. AI technical report 41. 1985.
Thesis (M.S.). "This work was done in partial fulfillment of the
requirements for the degree of Master of Science in Artificial
Intelligence at Stanford University."]
102886 EXPLOITING DESIGN MORPHOLOGY TO MANAGE COMPLEXITY.
N. Singh.
[Schlumberger Computer Aided Systems. AI technical report 43. 1985.
Thesis (Ph.D.). "A dissertation submitted to the Department of
Electrical Engineering and the Committee on Graduate Studies of
Stanford University in partial fulfillment of the requirements for
the degree of Doctor of Philosophy."]
052041 POSSIBLE-WORLD SEMANTICS FOR AUTOEPISTEMIC LOGIC.
R. C. Moore.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-41. 1985.]
052042 DEDUCTION WITH MANY-SORTED REWRITE.
J. Meseguer and J. A. Goguen.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-42. 1985.]
052043 ON SOME FORMAL PROPERTIES OF METARULES.
H. Uszkoreit and S. Peters.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-43. 1985.]
052044 LANGUAGE, MIND, AND INFORMATION.
J. Perry.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-44. 1985.]
025071 LEARNING BY UNDERSTANDING ANALOGIES.
R. Greiner.
[Stanford University. Department of Computer Science.
STAN-CS-85-1071. 1985. Thesis (Ph.D.).]
025072 A PROGRAMMING AND PROBLEM-SOLVING SEMINAR.
E. W. Mayr, R. J. Anderson, and P. H. Hochschild.
[Stanford University. Department of Computer Science.
STAN-CS-85-1072. 1985. "This report contains edited transcripts of
the discussions held in Stanford's course CS204, Problem Seminar,
during Winter Quarter 1984."]
025073 RESOURCE-EFFICIENT PARALLEL ALGORITHMS.
P. H. Hochschild.
[Stanford University. Department of Computer Science.
STAN-CS-85-1073. 1985. Thesis (Ph.D.).]
025074 DESIGNING NEW TYPEFACES WITH METAFONT.
R. Southall.
[Stanford University. Department of Computer Science.
STAN-CS-85-1074. 1985.]
025077 APPLICATIONS OF CIRCUMSCRIPTION TO FORMALIZING COMMON SENSE KNOWLEDGE.
J. McCarthy.
[Stanford University. Department of Computer Science.
STAN-CS-85-1077. 1985.]
102887 CORE COURSE DOCUMENTATION: MASTER'S DEGREE PROGRAM IN SOFTWARE
ENGINEERING.
M. Ardis et al.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-85-17. 1985. Edited by Dr. Richard Fairly.]
102888 A FORMAL CHARACTERIZATION OF SOME ASPECTS OF THE JSD SPECIFICATIONS.
F. R. D. Velasco.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-85-18. 1985.]
102889 THE ROLE OF ACADEME IN SOFTWARE ENGINEERING EDUCATION.
R. E. Fairley.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-85-19. 1985.]
102890 RCS REVISION CONTROL SYSTEM ON UNIX.
D. Ligett.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-85-20. 1985.]
102891 A COMPUTER SYSTEM FOR GENERATING TEST DATA USING THE DOMAIN STRATEGY.
L. J. White and P. N. Sahay.
[University of Alberta. Department of Computing Science. TR 85-6.
1985.]
102892 IMAGE EXPANSION USING INTERPOLATION AND NOISE-CLEANING METHODS.
W. A. Davis and K. W. Chan.
[University of Alberta. Department of Computing Science. TR 85-15.
1985.]
102893 ON THE DIMENSIONS OF THE SPLINE SPACE S[SUB2][SUPERSCRIPT 1](DELTA)
IN SPECIAL CASES.
R. H. J. G. Meyling and P. R. Pfluger.
[University of Amsterdam. Department of Mathematics. Report no.
85-14. 1985.]
102894 LEAST SQUARES APPROXIMATION BY LINEAR COMBINATIONS OF BIVARIATE
B-SPLINES.
R. H. J. G. Meyling.
[University of Amsterdam. Department of Mathematics. Report no.
85-23. 1985.]
102895 THE DESIGN OF POSTGRES.
M. Stonebraker and L. A. Rowe.
[University of California, Berkeley. Electronics Research Laboratory.
UCB/ERL 85/95. 1985.]
102896 A DECOMPOSITION ALGORITHM FOR CIRCUIT ROUTING.
T. C. Hu and M. T. Shing.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-01. 1984.]
102897 A VISUAL AND STRUCTURAL EDITOR.
B. Meyer and J.-M. Nerson.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-03. 1984. Revised: January 1985.]
102898 SHOWING PROGRAMS ON A SCREEN.
B. Meyer, J.-M. Nerson, and S. H. Ko.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-04. 1984. Revised: January 1985.]
102899 AN INTRODUCTION TO THE ART OF WRITING CORRECT PROGRAMS.
B. Meyer.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-05. 1984. Revised: January 1985.]
102900 A DECOMPOSITION ALGORITHM FOR MULTI-TERMINAL NETWORK FLOWS.
M. T. Shing and T. C. Hu.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-08. 1984. Revised edition of technical report
TRCS83-01.]
102901 PROBABILISTIC PARTITIONING ALGORITHMS FOR THE RECTILINEAR STEINER
PROBLEM.
J. Komlos and M. T. Shing.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-11. 1984.]
102902 AN APPLICATION OF PROGRAM TRANSFORMATION TO SUPERCOMPUTER PROGRAMMING.
A. Bossavit and B. Meyer.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-12. 1984. Revised: January 1985.]
102903 POSTCONDITIONAL SEMANTICS OF PREDICATE CALCULUS FOR UNIVERSAL
DATABASE LANGUAGES.
N. Rishe.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-14. 1984.]
102904 ALGORITHM FOR DESIGN OF RELATIONAL, NETWORK AND HIERARCHIC DATA BASE
SCHEMATA FROM CONCEPTUAL BINARY SCHEMATA.
N. Rishe.
[University of California, Santa Barbara. Department of Computer
Science. TRCS84-15. 1984.]
102905 A SYSTEMATIC CONSTRUCTION OF THE PARTITION PROCEDURE FOR QUICKSORT.
B. Meyer.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-02. 1985.]
102906 INCREMENTAL STRING MATCHING.
B. Meyer.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-03. 1985. Revised: April 1985.]
102907 THE SOFTWARE KNOWLEDGE BASE.
B. Meyer.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-04. 1985. Revised: June 1985.]
102908 SOME NOTES ON INTERARRIVAL TIME VARIABILITY IN CLOSED QUEUEING
NETWORKS WITH NON-PRODUCT FORM SUBSYSTEMS.
A. B. Bondi.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-05. 1985.]
102909 SEMANTIC MODELING OF DATA USING BINARY SCHEMATA.
N. Rishe.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-06. 1985.]
102910 THE ALPHA-BETA ROUTING.
T. C. Hu and M. T. Shing.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-08. 1985.]
102911 ALTERNATIVE ANALYSIS FOR DYNAMIC MODELS.
A. B. Bondi and A. A. B. Pritsker.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-09. 1985.]
102912 SEMANTICS OF UNIVERSAL LANGUAGES AND INFORMATION STRUCTURES IN DATA
BASES.
N. Rishe.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-10. 1985.]
102913 A 1.6 APPROXIMATION ALGORITHM FOR ROUTING MULTITERMINAL NETS.
T. F. Gonzalez and S.-L. Lee.
[University of California, Santa Barbara. Department of Computer
Science. TRCS85-12. 1985.]
102914 THE SAGA EDITOR: A LANGUAGE-ORIENTED EDITOR BASED ON AN INCREMENTAL
LR(1) PARSER.
P. A. C. Kirslis.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1236. 1985. Thesis (Ph.D.).]
102915 PARALLEL ARCHITECTURES FOR PROBLEM SOLVING.
L. V. Kale.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1237. 1985. Thesis (Ph.D.). "A dissertation
presented in partial fulfillment of the requirements for the degree
of Doctor of Philosophy, Department of Computer Science, State
University of New York at Stony Brook, 1985."]
102916 ON THE PERFORMANCE OF RUNGE-KUTTA CODES WHEN STABILITY RESTRICTS THE
STEPSIZE.
G. Hall.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1238. 1985.]
102917 THE PROBLEM OF EXISTENCE.
K. D. Forbus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-85-1239. 1985.]
102918 STRATEGIES AND PERFORMANCE NORMS FOR EFFICIENT UTILIZATION OF VECTOR
PIPELINE COMPUTERS AS ILLUSTRATED BY THE CLASSICAL MECHANICAL
SIMULATION OF ROTATIONALLY INELASTIC COLLISIONS.
D. L. Cochrane and D. G. Truhlar.
[University of Minnesota. Supercomputer Institute. UMSI 86/4. 1986.]
102919 UPDATE AND MERGE OF PARTITIONED DISTRIBUTED SYSTEMS.
J. A. Anyanwu and B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 204. 1985.]
102920 TRAIN JOURNEYS IN THE MERLIN-RANDALL PROBLEM.
M. Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 205. 1985.]
102921 A CHARACTERISATION OF FAULTS IN SYSTEMS.
P. D. Ezhilchelvan and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 206. 1985.]
102922 CYCLIC REFERENCE COUNTING FOR COMBINATOR MACHINES.
D. R. Brownbridge.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 207. 1985.]
102923 UDSTP: A TRANSPORT PROTOCOL FOR A UNIFORM DATAGRAM SERVICE.
T. A. Lee and A. Linton.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 208. 1985.]
102924 MODULAR REDUNDANCY IN A MESSAGE PASSING SYSTEM.
L. Mancini.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 209. 1985.]
102925 PROGRAMMING IN 'OCCAM': A TOURIST GUIDE TO PARALLEL PROGRAMMING.
G. Jones.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-43. 1984.]
102926 DEFECT AND LOCAL ERROR CONTROL IN CODES FOR SOLVING STIFF
INITIAL-VALUE PROBLEMS.
W. L. Seward.
[University of Toronto. Department of Computer Science. Technical
report 184/85. 1985. Thesis (Ph.D.).]
102927 PERMUTATION GRAPH STRUCTURE AND ALGORITHMS.
L. K. Stewart.
[University of Toronto. Department of Computer Science. Technical
report 185/85. 1985. Thesis (Ph.D.).]
102928 OPEN BOUNDARY CONDITIONS FOR THE FLOW AROUND WATER TURBINES.
L. Ferm.
[University of Uppsala. Department of Computer Science. Report no.
102. 1985.]
102929 A DATABASE OF PSYCHO-EDUCATIONAL TESTS.
M. Jones and M. Loken.
[University of Waterloo. Department of Computer Science. Research
report CS-85-17. 1985.]
102930 BACKWARD ERROR RECOVERY IN A UNIX ENVIRONMENT.
D. J. Taylor and M. L. Wright.
[University of Waterloo. Department of Computer Science. CS-85-54.
1985.]
102931 LOCAL CORRECTION OF MOD(K) LISTS.
I. J. Davis and D. J. Taylor.
[University of Waterloo. Department of Computer Science. CS-85-55.
1985.]
102932 PERFORMANCE ANALYSIS OF MULTIPROCESSOR CACHE CONSISTENCY PROTOCOLS
USING GENERALIZED TIMED PETRI NETS.
M. K. Vernon and M. A. Holliday.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 618. 1985.]
102933 REGISTER ALLOCATION FOR VLSI PROCESSORS.
W.-C. Hsu.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 619. 1985.]
102934 MULTIVARIATE SPLINES.
K. Hollig.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 620. 1985.]
102935 ON DISSEMINATING INFORMATION RELIABILITY WITHOUT BROADCASTING.
N. Alon, A. Barak, and U. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 621. 1985.]
102936 B-SPLINES WITHOUT DIVIDED DIFFERENCES.
C. de Boor and K. Hollig.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 622. 1985.]
102937 DISTRIBUTED QUERY PROCESSING WITH LOAD BALANCING IN LOCAL AREA
NETWORKS.
H. Lu.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 624. 1985. Thesis (Ph.D.).]
102938 LOAD BALANCING IN A LOCALLY DISTRIBUTED DATABASE SYSTEM.
M. J. Carey and H. Lu.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 625. 1985.]
102939 AN ALGORITHM FOR CONSTRUCTING THE ASPECT GRAPH.
W. H. Plantinga and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 627. 1985.]
102940 THE INVENTION OF COMPUTATIONALLY PLAUSIBLE KNOWLEDGE SYSTEMS IN THE
UPPER PALEOLITHIC.
S. Klein.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 628. 1985.]
VOL. 8, NO. 3 03/28/86
102941 NECESSARY AND SUFFICIENT CONDITIONS FOR THE UNIVERSALITY OF
PROGRAMMING FORMALISMS.
A. J. Kfoury and P. Urzyczyn.
[Boston University. Department of Computer Science. BUCS tech report
85/007. 1985.]
102942 CONSTRAINED SEMANTIC TRANSFERENCE: A FORMAL THEORY OF METAPHORS.
B. Indurkhya.
[Boston University. Department of Computer Science. BUCS tech report
85/008. 1985.]
102943 RELIABLE COMPUTATION WITH CELLULAR AUTOMATA.
P. Gacs.
[Boston University. Department of Computer Science. BUCS tech report
85/009. 1985.]
102944 MINIMAL DEGREES FOR POLYNOMIAL REDUCIBILITIES.
S. Homer.
[Boston University. Department of Computer Science. BUCS tech report
85/010. 1985.]
102945 ANALYZING DEGRADATION IN PERFORMANCE OF DISTRIBUTED PROGRAMS DUE TO
CONTENTION FOR SHARED RESOURCES.
B. Indurkhya.
[Boston University. Department of Computer Science. BUCS tech report
85/011. 1985.]
102946 APPROXIMATE SEMANTIC TRANSFERENCE: A COMPUTATIONAL THEORY OF
METAPHORS AND ANALOGIES.
B. Indurkhya.
[Boston University. Department of Computer Science. BUCS tech report
85/012. 1985.]
102947 COMPUTATIONAL LINGUISTICS TECHNICAL NOTES.
W. Wang.
[Boston University. Department of Computer Science. BUCS tech report
85/013. 1985.]
102948 CONCURRENCY CONTROL ON DATABASE INDEXES: THE MU PROTOCOL.
A. Biliris.
[Boston University. Department of Computer Science. BUCS tech report
85/014. 1985.]
102949 A MODEL FOR THE EVALUATION OF CONCURRENCY CONTROL ALGORITHMS ON
B-TREES: EXPERIMENTAL COMPARISON OF FOUR LOCKING PROTOCOLS.
A. Biliris.
[Boston University. Department of Computer Science. BUCS tech report
85/015. 1985.]
102950 THE WEAK GENERATIVE CAPACITY OF PARENTHESIS-FREE CATEGORIAL GRAMMARS.
J. Friedman, D. Dai, and W. Wang.
[Boston University. Department of Computer Science. BUCS tech report
86/001. 1986.]
102951 SQUARE-FREE AND OVERLAP-FREE WORDS.
A. J. Kfoury.
[Boston University. Department of Computer Science. BUCS tech report
86-002. 1986.]
102952 TOWARDS AN INTELLIGENT COMPUTER GRAPHICS SYSTEM.
M. Holynski, B. R. Gardner, and R. Ostrovsky.
[Boston University. Department of Computer Science. BUCS tech report
86-003. 1985.]
102953 COMBINING COMPUTATION WITH GEOMETRY.
S.-L. C. Lien.
[California Institute of Technology. Computer Science Department.
Report no. 5185:TR:85. 1985. Thesis (Ph.D.).]
102954 A NEW GENERALIZATION OF DEKKER'S ALGORITHM FOR MUTUAL EXCLUSION.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5195:TR:85. 1985.]
095145 XCPL: AN EXPERIMENTAL CONCURRENT PROGRAMMING LANGUAGE.
W. C. Athas.
[California Institute of Technology. Computer Science Department.
Report no. 5196:TR:85. 1985.]
102955 A MULTIPROCESSOR ARCHITECTURE FOR REAL-TIME COMPUTER ANIMATION.
D. S. Whelan.
[California Institute of Technology. Computer Science Department.
Report no. 5200:TR:85. 1985. Thesis (Ph.D.).]
102956 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 MARCH 1985 TO 15 SEPTEMBER 1985.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5202:TR:85. 1985. Principal investigator: Charles L.
Seitz. Faculty investigators: James T. Kajiya, Alain J. Martin,
Robert J McEliece, Martin Rem, Charles L. Seitz.]
095144 C PROGRAMMER'S GUIDE TO THE COSMIC CUBE.
W.-K. Su, R. Faucette, and C. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5203:TR:85. 1985.]
102957 DISTRIBUTED TRANSFORMATIONS FOR RELIABLE SYSTEMS.
A. Z. Spector et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-117. 1985.]
102958 THE DESIGN AND EVALUATION OF ON-LINE HELP SYSTEMS.
N. S. Borenstein.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-151. 1985. Thesis (Ph.D.).]
102959 A HOUSE OF CARDS: A HISTORY OF THE INORGANIC EVOLUTION OF THE CMU
BBOARD SYSTEM SOFTWARE.
N. S. Borenstein.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-152. 1985.]
102960 TOWARDS PROGRAMMING WITH KNOWLEDGE EXPRESSIONS.
R. Kurki-Suonio.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-153. 1985.]
102961 CHUNKING IN SOAR: THE ANATOMY OF A GENERAL LEARNING MECHANISM.
J. E. Laird, P. S. Rosenbloom, and A. Newell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-154. 1985.]
102962 COMPILING ORDINARY PROGRAMS FOR EXECUTION ON AN ASYNCHRONOUS
MULTIPROCESSOR.
T. L. Rodeheffer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-155. 1985. Thesis (Ph.D.).]
102963 A COMPARISON OF THE BLACK AND BLACK-WHITE PEBBLE GAMES.
R. Wilber.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-156. 1985. Thesis (Ph.D.).]
102964 USING REDUNDANCY FOR TESTABLE AND REPAIRABLE SYSTOLIC ARRAYS.
L. A. Shombert.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-157. 1985. Thesis (Ph.D.).]
102965 MEMORY REQUIREMENTS FOR BALANCED COMPUTER ARCHITECTURES.
H. T. Kung.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-158. 1985.]
102966 THE PERFORMANCE EFFECTS OF FUNCTIONAL MIGRATION AND ARCHITECTURAL
COMPLEXITY IN OBJECT-ORIENTED SYSTEMS.
R. P. Colwell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-159. 1985. Thesis (Ph.D.).]
102967 GENERALIZED IMAGE MATCHING BY THE METHOD OF DIFFERENCES.
B. D. Lucas.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-160. 1985. Thesis (Ph.D.).]
102968 EXPERIENCE WITH THE CMU PROGRAMMING SYSTOLIC CHIP.
A. L. Fisher, H. T. Kung, and K. Sarocky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-161. 1985.]
102969 DECOMPOSABLE SEARCHING PROBLEMS AND CIRCUIT OPTIMIZATION BY RETIMING:
TWO STUDIES IN GENERAL TRANSFORMATIONS OF COMPUTATIONAL STRUCTURES.
J. B. Saxe.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-162. 1985. Thesis (Ph.D.).]
102970 THE INTEGRATION OF VIRTUAL MEMORY MANAGEMENT AND INTERPROCESS
COMMUNICATION IN ACCENT.
R. Fitzgerald and R. F. Rashid.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-164. 1985.]
102971 CONSTRAINT-BASED TILED WINDOWS.
E. S. Cohen, E. T. Smith, and L. A. Iverson.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-165. 1985.]
102972 OPTIMIZATION OF USER-DEFINED ABSTRACT DATA TYPES: A PROGRAM
TRANSFORMATION APPROACH.
A. Hisgen.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-166. 1985. Thesis (Ph.D.).]
102973 LIMITATIONS OF SYNCHRONOUS COMMUNICATION WITH STATIC PROCESS
STRUCTURE IN LANGUAGES FOR DISTRIBUTED COMPUTING.
B. Liskov, M. Herlihy, and L. Gilbert.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-168. 1985.]
102974 FAST EVALUATION OF ARITHMETIC FUNCTIONS.
A. Nowatzyk.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-169. 1985.]
102975 LISTLESSNESS IS BETTER THAN LAZINESS: AN ALGORITHM THAT TRANSFORMS
APPLICATIVE PROGRAMS TO ELIMINATE INTERMEDIATE LISTS.
P. L. Wadler.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-171. 1984. Thesis (Ph.D.).]
102976 ADAPTABILITY AND PORTABILITY OF SYMBOLIC DEBUGGERS.
B. Bruegge.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-174. 1985. Thesis (Ph.D.).]
102977 IMPLEMENTING A MASTERY EXAMINATION IN COMPUTER SCIENCE.
M. J. Stehlik and P. L. Miller.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-175. 1985.]
102978 PROGRAMMING FOR OBSERVABILITY SUPPORT IN A PARALLEL PROGRAMMING
ENVIRONMENT.
F. Gregoretti and Z. Segall.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-176. 1985.]
102979 OVERVIEW OF ROME: A REASON-ORIENTED MODELING ENVIRONMENT.
D. W. Kosy and B. P. Wise.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-85-21. 1985.]
102980 MODEL-BASED EVALUATION OF LONG-RANGE RESOURCE ALLOCATION PLANS.
B. P. Wise and D. W. Kosy.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-85-22. 1985.]
102981 MODELING AND CONTROL OF ASSEMBLY TASKS AND SYSTEMS.
B. H. Krogh and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-1. 1985.]
102982 INTEGRATED LEARNING: CONTROLLING EXPLANATION.
M. Lebowitz.
[Columbia University. Department of Computer Science. CUCS-201-85.
1985.]
102983 STORY TELLING AS PLANNING AND LEARNING.
M. Lebowitz.
[Columbia University. Department of Computer Science. 1985.]
102984 THE USE OF MEMORY IN TEXT PROCESSING.
M. Lebowitz.
[Columbia University. Department of Computer Science. CUCS-200-85.
1985.]
102985 ON INTERPROCESS COMMUNICATION.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 8. 1985.]
102986 BUILDING AN EXPERT SYSTEM TO DIAGNOSE NOISE IN AUTOMOTIVE ENGINE
COOLING SYSTEMS.
S. E. Dourson and J. D. Joyce.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-4769R. 1985.]
102987 THE SYNTHESIS OF STABLE GRASPS IN THE PLANE.
V.-D. Nguyen.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5259. 1986.]
102988 MODULAR MULTI-RESOLUTION VISION PROCESSOR.
I. Masaki.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5260. 1986.]
102989 DESIGN COMPARISON: HAND-PACKED STANDARD CELLS TO SILICON COMPILATION.
T. E. Fuhrman and F. J. Schauerte.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5270. 1986.]
095134 OUTLINE OF FIFTH GENERATION COMPUTER PROJECT.
[Institute for New Generation Computer Technology (ICOT). 1985.]
102692 EXP - AN OBJECT ORIENTED LOGIC PROGRAMMING LANGUAGE.
T. Chikayama, S. Takagi, K. Takei.
[Institute for New Generation Computer Technology (ICOT). TM-0075.
1984.]
102990 NETTALK: A PARALLEL NETWORK THAT LEARNS TO READ ALOUD.
T. J. Sejnowski and C. R. Rosenberg.
[Johns Hopkins University. Department of Electrical Engineering and
Computer Science. Technical report JHU/EECS-86/01. 1986.]
102991 KYOTO COMMON LISP REFERENCE MANUAL.
T. Yuasa and M. Hagiya.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-498. 1984. Revised: December 4, 1984.]
102992 ON THE GLOBAL EXISTENCE OF REAL ANALYTIC SOLUTIONS AND HYPERFUNCTION
SOLUTIONS OF LINEAR DIFFERENTIAL EQUATIONS.
T. Kawai.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-530. 1985.]
102993 REDUCTION OF DISPERSION IN HYPERBOLIC DIFFERENCE SCHEMES BY ADAPTING
THE SPACE DISCRETIZATION.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8519. 1985.]
102994 SECOND ORDER ACCURATE UPWIND SOLUTIONS OF THE 2D STEADY EULER
EQUATIONS BY THE USE OF A DEFECT CORRECTION METHOD.
S. P. Spekreijse.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8520. 1985.]
102995 STABILIZATION OF EXPLICIT METHODS FOR HYPERBOLIC INITIAL-VALUE
PROBLEMS.
F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8521. 1985.]
102996 THE NUMERICAL SOLUTION OF NONLINEAR VOLTERRA INTEGRAL EQUATIONS OF
THE SECOND KIND BY COLLOCATION AND ITERATED COLLOCATION METHODS.
J. G. Blom and H. Brunner.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8522. 1985.]
102997 DEFECT CORRECTION AND HIGHER ORDER SCHEMES FOR THE MULTIGRID SOLUTION
OF THE STEADY EULER EQUATIONS.
P. W. Hemker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8523. 1985.]
102998 BLAS ON THE CYBER 205.
M. Nool-Louter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8524. 1985.]
102999 CONVERGENCE AND ORDER REDUCTION OF RUNGE-KUTTA SCHEMES APPLIED TO
EVOLUTIONARY PROBLEMS IN PARTIAL DIFFERENTIAL EQUATIONS.
J. M. Sanz-Serna, J. G. Verwer, and W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8525. 1985.]
103000 PROCEEDINGS OF THE INTER DEPARTMENTAL SEMINAR ON ARTIFICIAL
INTELLIGENCE, NOVEMBER 1985.
[National University of Singapore. Department of Information Systems
and Computer Science. TR11/85. 1985.]
103001 LOWER BOUNDS ON COMMUNICATION COMPLEXITY IN VLSI.
R. Cole and A. Siegel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Ultracomputer note 192. 1985. Also
issued as Report no. 90, Ultracomputer Project, Courant Institute of
Mathematical Sciences, New York University.]
103002 CONSIDERATIONS FOR MASSIVELY PARALLEL UNIX SYSTEMS ON THE NYU
ULTRACOMPUTER AND IBM RP3.
J. Edler, A. Gottlieb, and J. Lipkis.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 91. 1985.]
103003 OPERATING SYSTEM CONSIDERATIONS FOR LARGE-SCALE MIMD MACHINES.
J. Edler, A. Gottlieb, and J. Lipkis.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 92. 1985.]
103004 AN IMPLEMENTATION OF A COMBINING NETWORK FOR THE NYU ULTRACOMPUTER.
S. Dickey, R. Kenner, and M. Snir.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 93. 1986.]
103005 USING VLSI TO REDUCE SERIALIZATION AND MEMORY TRAFFIC IN SHARED
MEMORY PARALLEL COMPUTERS.
S. Dickey, A. Gottlieb, and R. Kenner.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Project. Ultracomputer note 94. 1986.]
103006 QUERY PROCESSING IN A SYMMETRIC PARALLEL ENVIRONMENT.
D. Shasha.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Ultracomputer note 197. 1986. Also
issued as Report no. 95, Ultracomputer Project, Courant Institute of
Mathematical Sciences, New York University.]
103007 COMPUTER ALGEBRA FOR CYLINDRICAL ALGEBRA DECOMPOSITION.
J. Davenport.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8511. 1985.]
103008 TRANSLATION OF A SUBSET OF SIMULA INTO C.
R. Ronngren and G. Overgaard.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8512. 1985.]
103009 INVESTIGATING SEMI-INFINITE PROGRAMS USING PENALTY FUNCTIONS AND
LAGRANGIAN METHODS.
S.-A. Gustafson.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8513. 1985.]
103010 BOUNDS ON NONLINEAR OPERATORS IN FINITE-DIMENSIONAL BANACH SPACES.
G. Soderlind.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8514. 1985.]
103011 COMPUTATION OF STATES IN SYNCHRONIZED SEQUENTIAL CIRCUITS BY PROLOG.
H. Ahrabian.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8515. 1985.]
095140 JTECH PANEL REPORT ON COMPUTER SCIENCE IN JAPAN.
D. Brandin et al.
[Science Applications International Corporation. Japanese Technology
Evaluation Program (JTECH). JTECH-TAR-8401. 1984.]
052034 APPLICABILITY OF INDEXED GRAMMARS TO NATURAL LANGUAGES.
G. Gazdar.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-34. 1985.]
052039 THE STRUCTURES OF DISCOURSE STRUCTURE.
B. Grosz and C. L. Sidner.
[Stanford University. Center for the Study of Language and
Information. CSLI-85-39. 1985.]
103012 SEMANTICS OF DECLARATIVE LANGUAGE.
E. Tyugu.
[Turing Institute. TIRM-84-007. 1984.]
103013 JUDGEMENTAL REASONING FOR EXPERT SYSTEMS.
T. Niblett.
[Turing Institute. TIRM-85-012. 1985.]
103014 A SIMPLE ENVIRONMENT FOR PROJECT DEVELOPMENT UNDER UNIX.
T. D. Gill.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-85-22. 1985.]
103015 EXPERIENCE WITH A SOFTWARE ENGINEERING PROJECT COURSE.
W. M. McKeeman.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-01. 1986.]
054221 MEMORY HIERARCHY ASPECTS OF A MULTIPROCESSOR RISC: CACHE AND BUS
ANALYSES.
R. H. Katz et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/221. 1985.]
054222 SENSITIVITY STUDY OF THE CLUSTERING APPROACH TO WORKLOAD MODELING.
M. Calzarossa and D. Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/222. 1985. Also issued as PROGRES report 85.1, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054223 PERFORMANCE OF A REMOTE INSTRUMENTATION PROGRAM.
M. D. Kupfer.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/223. 1985. Also issued as PROGRES report 85.2, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054224 ADDING REMOTE FILE ACCESS TO BERKELEY UNIX 4.2BSD THROUGH REMOTE
MOUNT.
E. Hunter.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/224. 1985. Also issued as PROGRES report 85.3, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054225 1985 VLSI TOOLS: MORE WORKS BY THE ORIGINAL ARTISTS.
W. S. Scott et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/225. 1985. "Includes these smash hits: Cifplot, by Dan
Fitzpatrick. Crystal, by John Ousterhout. Egntott, by Bob Cmelik.
Esim, by Chris Terman (MIT). Espresso, by Richard Rudell. Magic, by
Gordon Hamachi, Robert Mayo, John Ousterhout, Walter Scott, and
George Taylor. Mpack, by Robert Mayo and Fred Obermeier. Mpanda, by
Grace Mah. Mpla, by Robert Mayo. Mquilt, by Robert Mayo. Multibus
Design Frame, by Gaetano Borriello. Peg, by Gordon Hamachi. Pleasure,
by G.D. Micheli and Duksoon Kay. Spice2summary, by Fred Obermeier.
Vlsifont, by Robert Mayo. Plus many more of your old favorites..."
Edited by Walter S. Scott, Gordon Hamachi, Robert N. Mayo, and John
K. Ousterhout.]
054226 SOAR ARCHITECTURE.
A. D. Samples, M. Klein, and P. Foley.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/226. 1985.]
054227 THE UNDERSTANDING AND GENERATION OF ELLIPSES IN A NATURAL LANGUAGE
SYSTEM.
L. F. Rau.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/227. 1985.]
054228 DISTRIBUTED NAME SERVERS: NAMING AND CACHING IN LARGE DISTRIBUTED
COMPUTING ENVIRONMENTS.
D. B. Terry.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/228. 1985. Thesis (Ph.D.). Also issued as PROGRES report
85.4, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054229 CACHE EVALUATION AND THE IMPACT OF WORKLOAD CHOICE.
A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/229. 1985.]
054230 A TRACE-DRIVEN ANALYSIS OF THE UNIX 4.2BSD FILE SYSTEM.
J. K. Ousterhout et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/230. 1985.]
054231 REPLICATED DISTRIBUTED PROGRAMS.
E. C. Cooper.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/231. 1985. Thesis (Ph.D.). Also issued as PROGRES report
85.5, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054232 THE MULTIBUS DESIGN FRAME.
G. Borriello, R. H. Katz, and A. G. Bell.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/232. 1985.]
054233 TLB FOR FREE: IN-CACHE ADDRESS TRANSLATION FOR A MULTIPROCESSOR
WORKSTATION.
S. A. Ritchie.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/233. 1985.]
054236 DFS925: A DISTRIBUTED FILE SYSTEM IN A WORKSTATION/LAN ENVIRONMENT.
M. J. Arden.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/236. 1985. Also issued as PROGRES report 85.7, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054237 TALKING TO SMALLTALK.
J. Lo.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/237. 1985.]
054239 LINE (BLOCK) SIZE CHOICES FOR CPU CACHE MEMORIES.
A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/239. 1985.]
054240 UNIQUADRIX.
E. K. Ressler.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/240. 1985.]
054242 RANDOMIZED ROUNDING: A TECHNIQUE FOR PROVABLY GOOD ALGORITHMS AND
ALGORITHMIC PROOFS.
P. Raghavan and C. D. Thompson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/242. 1985.]
054243 SIGNAL DELAY IN RC TREES WITH CHARGE SHARING OR LEAKAGE.
A. Raghunathan and C. D. Thompson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/243. 1985.]
054244 A MINIMUM-AREA CIRCUIT FOR L-SELECTION.
P. Duris et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/244. 1985.]
054245 PERFORMANCE IMPROVEMENTS AND FUNCTIONAL ENHANCEMENTS IN 4.3BSD.
M. K. McKusick, M. J. Karels, and S. Leffler.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/245. 1985. Also issued as PROGRES report 85.9, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054246 AN APPRAISAL OF THE INSTRUMENTATION IN BERKELEY UNIX 4.2BSD.
M. D. Kupfer.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/246. 1985. Also issued as PROGRES report 85.10, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054247 THE IMPACT OF BUFFER MANAGEMENT ON NETWORKING SOFTWARE PERFORMANCE IN
BERKELEY UNIX 4.2BSD: A CASE STUDY.
L. F. Cabrera, M. J. Karels, and D. Mosher.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/247. 1985. Also issued as PROGRES report 85.11, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054249 EXPERIENCE WITH ADA CODE GENERATION.
B. G. Zorn.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/249. 1985.]
054250 THE BERKELEY UNIX 4.3BSD TIME SYNCHRONIZATION PROTOCOL: PROTOCOL
SPECIFICATION.
R. Gusella and S. Zatti.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/250. 1985. Also issued as PROGRES report 85.13, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054251 STATIC SEMANTICS AND COMPILER ERROR RECOVERY.
R. P. Corbett.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 85/251. 1985. Thesis (Ph.D.).]
054252 TIME-OPTIMAL DESIGN OF A CMOS ADDER.
B. W. Y. Wei, C. D. Thompson, and Y. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/252. 1985.]
054253 POWER AND GROUND REQUIREMENTS FOR A HIGH-SPEED 32 BIT COMPUTER CHIP
SET.
J. Keller.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/253. 1985.]
054254 A KNOWLEDGE-BASED APPROACH TO LANGUAGE PRODUCTION.
P. S. Jacobs.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/254. 1985. Thesis (Ph.D.).]
054255 GEOMETRIC CONTINUITY: A PARAMETRIZATION INDEPENDENT MEASURE OF
CONTINUITY FOR COMPUTER AIDED GEOMETRIC DESIGN.
A. D. DeRose.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/255. 1985. Thesis (Ph.D.).]
054256 FAULT TOLERANCE FOR VLSI MULTICOMPUTERS.
Y. Tamir.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/256. 1985. Thesis (Ph.D.).]
054257 THE BERKELEY PLM INSTRUCTION SET: AN INSTRUCTION SET FOR PROLOG.
B. Fagin and T. Dobry.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/257. 1985.]
054258 PROPERTIES AND UPDATE SEMANTICS OF CONSISTENT VIEWS.
G. Gottlob, P. Paolini, and R. Zicari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/258. 1985.]
054260 GRAPHIC PRESENTATION OF DATA STRUCTURES IN THE DBX DEBUGGER.
D. B. Baskerville.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/260. 1985.]
054261 PREFIX TABLES: A SIMPLE MECHANISM FOR LOCATING FILES IN A DISTRIBUTED
SYSTEM.
B. Welch and J. K. Ousterhout.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/261. 1985.]
054262 A STUDY OF LOAD INDICES FOR LOAD BALANCING SCHEMES.
D. Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/262. 1985. Also issued as PROGRES report 85.14, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054263 HIGH PERFORMANCE EXECUTION OF PROLOG PROGRAMS BASED ON A STATIC DATA
DEPENDENCY ANALYSIS.
J.-H. Chang.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/263. 1985. Thesis (Ph.D.).]
054264 CORNER-BASED GEOMETRIC LAYOUT RULE CHECKING FOR VLSI CIRCUITS.
M. H. Arnold.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/264. 1985. Thesis (Ph.D.).]
054265 ARBITRARY SUBDIVISION OF BEZIER CURVES.
B. A. Barsky.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/265. 1985.]
054266 A VERSION SERVER FOR COMPUTER-AIDED DESIGN DATA.
R. H. Katz, M. Anwaruddin, and E. Chang.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/266. 1985.]
054267 OBJECT MANAGEMENT IN LOCAL DISTRIBUTED SYSTEMS.
S. Zhou and R. Zicari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/267. 1985. Also issued as PROGRES report 85.15, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054268 THE ADMINISTRATION OF DISTRIBUTED COMPUTATIONS IN A NETWORK
ENVIRONMENT: AN INTERIM REPORT.
L. F. Cabrera, S. Sechrest, and R. Caceres.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/268. 1985. Also issued as PROGRES report 85.16, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054269 COMPACTION AND CIRCUIT EXTRACTION IN THE MAGIC IC LAYOUT SYSTEM.
W. S. Scott.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/269. 1985. Thesis (Ph.D.).]
054270 VERSION MODELING CONCEPTS FOR COMPUTER-AIDED DESIGN DATABASES.
R. H. Katz, E. Chang, and R. Bhateja.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/270. 1985.]
054271 ITERATION THEOREMS FOR DETERMINISTIC FAMILIES OF LANGUAGES.
M. A. Harrison.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/271. 1985.]
054272 1986 VLSI TOOLS: STILL MORE WORKS BY THE ORIGINAL ARTISTS.
W. S. Scott et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/272. 1985. "Includes these smash hits: Crystal, by John
Ousterhout. Egntott, by Bob Cmelik. Esim, by Chris Terman (MIT).
Espresso, by Richard Rudell. Magic, by Gordon Hamachi, Robert Mayo,
John Ousterhout, Walter Scott, and George Taylor. Meg, by David Wood.
Mpack, by Robert Mayo. Mpanda, by Grace Mah. Mpla, by Robert Mayo and
Fred Obermeier. Mquilt, by Robert Mayo. Multibus Design Frame, by
Gaetano Borriello. Peg, by Gordon Hamachi. Pleasure, by G.D. Micheli
and Duksoon Kay. Spice2summary, by Fred Obermeier. Vlsifont, by
Robert Mayo. Plus many others..." Edited by Walter S. Scott, Robert
N. Mayo, Gordon Hamachi, and John K. Ousterhout.]
054273 SPUR: A VLSI MULTIPROCESSOR WORKSTATION.
M. D. Hill et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/273. 1985.]
054274 A CHARACTERIZATION OF THE USE OF THE UNIX C SHELL.
R. K. Hanson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/274. 1985.]
054275 AN ELECTION ALGORITHM FOR A DISTRIBUTED CLOCK SYNCHRONIZATION PROGRAM.
R. Gusella and S. Zatti.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/275. 1985. Also issued as PROGRES report 85.17, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054276 LOAD BALANCING WITH MAITRE D'.
B. Bershad.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/276. 1985. Also issued as PROGRES report 85.18, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054277 A MODEL OF EVIDENTIAL REASONING IN A HIERARCHICAL HYPOTHESIS SPACE.
J. Yen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/277. 1985.]
054278 MORE...CREATIVE GEOMETRIC MODELING.
C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/278. 1985. "This is a report on the second offering of the
graduate course CS292A, 'Creative Geometric Modeling'..." With
contributions by: Cecilia Aragon, Rajiv Bhateja, Eric Fan, Dan Filip,
Philip D. Flanner, Ziv Gigus, Nachshon Gal, Mark Gerolimatos, Thomas
Laidig, Lucia Longhi, Don Marsh, Gene Ressler, Jim Ruppert, Mark
Segal, H.B. Siegal, Lun-Shin Yuen.]
054279 JESSIE: AN INTERACTIVE EDITOR FOR UNIGRAFIX.
H. B. Siegal.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/279. 1985.]
054281 THE BERKELEY UIGRAFIX TOOLS: VERSION 2.5.
C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/281. 1985.]
103045 AN EXPLANATION OF AND CURE FOR MINIMAX PATHOLOGY.
B. Abramson.
[University of California, Los Angeles. Computer Science Department.
CSD-850034. 1985.]
103046 ANALYSIS OF ALTERNATIVES FOR A SINGULAR VALUE DECOMPOSITION PROCESSOR.
J. Moreno.
[University of California, Los Angeles. Computer Science Department.
CSD-850035. 1985. Thesis (M.S.).]
103047 DISTRIBUTED ALGORITHMS FOR ELECTION IN UNIDIRECTIONAL AND COMPLETE
NETWORKS.
Y. Afek.
[University of California, Los Angeles. Computer Science Department.
CSD-850036. 1985. Thesis (Ph.D.).]
103048 DISTRIBUTED COMPUTER SIMULATION OF DATA COMMUNICATION NETWORKS:
PROJECT REPORT III.
S. Cheung, J. W. Carlyle, and W. J. Karplus.
[University of California, Los Angeles. Computer Science Department.
CSD-850037. 1985.]
103049 GRAPHOIDS: A GRAPH-BASED LOGIC FOR REASONING ABOUT RELEVANCE
RELATIONS.
J. Pearl and A. Paz.
[University of California, Los Angeles. Computer Science Department.
CSD-850038. 1985.]
103050 HUMAN PROBLEM UNDERSTANDING AND ADVICE GIVING: A COMPUTER MODEL.
A. E. Quilici.
[University of California, Los Angeles. Computer Science Department.
CSD-850039. 1985. Thesis (M.S.).]
103051 REDUCED REGISTER SAVING/RESTORING IN SINGLE-WINDOW REGISTER FILES.
T. Lang and M. Huguet.
[University of California, Los Angeles. Computer Science Department.
CSD-850040. 1985.]
103052 TASK RESPONSE TIME AND MODULE ASSIGNMENT FOR REAL-TIME DISTRIBUTED
PROCESSING SYSTEMS.
K. K. Leung.
[University of California, Los Angeles. Computer Science Department.
CSD-850041. 1985. Thesis (Ph.D.).]
103053 LEARNING INTERNAL REPRESENTATIONS BY ERROR PROPAGATION.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8506. 1985.]
103054 ON LEARNING THE PAST TENSES OF ENGLISH VERBS.
D. E. Rumelhart and J. L. McClelland.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8507. 1985.]
103055 IOWA CAPABILITY ARCHITECTURE PROJECT: ICAP. PROGRAMMER'S REFERENCE
MANUAL.
D. W. Jones.
[University of Iowa. Department of Computer Science. Technical report
85-08. 1985.]
103056 AUTOMATED INSTRUMENTATION OF COMMUNICATION PROTOCOLS FOR TESTING AND
EVALUATION.
S. P. Miller.
[University of Iowa. Department of Computer Science. Technical report
85-09. 1985. Thesis (M.S.).]
103057 SLUMLORD: A REGISTER ALLOCATION ALGORITHM AND ITS STATISTICAL
ANALYSIS.
M. D. Moshier and V. Rajlich.
[University of Michigan. Computing Research Laboratory. CRL-TR-2-85.
1985.]
103058 ON THE NUMBER OF ACTIVE NODES IN A MULTICOMPUTER SYSTEM.
A. Barak, Z. Dresner, and Y. Gurevich.
[University of Michigan. Computing Research Laboratory. CRL-TR-3-85.
1985.]
103059 A STUDY IN MEMORY INTERFERENCE MODELS.
B. H. Humoud.
[University of Michigan. Computing Research Laboratory. CRL-TR-4-85.
1985. Thesis (Ph.D.).]
103060 FIXED-POINT EXTENSIONS OF FIRST-ORDER LOGIC.
Y. Gurevich and S. Shelah.
[University of Michigan. Computing Research Laboratory. CRL-TR-5-85.
1985.]
103061 ON THE AUTOMATIC TRANSFORMATION OF EXTENDED ER DIAGRAMS INTO THE
RELATIONAL MODEL.
D. Yang, T. Teory, and J. Fry.
[University of Michigan. Computing Research Laboratory. CRL-TR-6-85.
1985.]
103062 AUTOMATICALLY-GENERATED FORM SCREENS AS A DATABASE INTERFACE LANGUAGE.
D. V. Beard.
[University of Michigan. Computing Research Laboratory. CRL-TR-7-85.
1985. Thesis (Ph.D.).]
103063 G.E.N.I.U.S.: AN EXPERIMENT IN IGNORANCE-BASED AUTOMATED PROGRAM
ADVISING.
G. I. McCalla and K. M. Murtagh.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-20. 1985.]
103064 HUMAN BODY MOTION SEGMENTATION IN A COMPLEX SCENE.
M. K. Leung and Y.-H. Yang.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-21. 1985.]
103065 THE DESIGN OF THE SCENT AUTOMATED ADVISOR.
G. I. McCalla, R. B. Bunt, and J. J. Harms.
[University of Saskatchewan. Department of Computational Science.
Report no. 85-22. 1985.]
103066 USING AND REVISING LEARNED CONCEPT MODELS: A RESEARCH PROPOSAL.
B. W. Porter.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-04. 1985.]
103067 A SELF ORGANIZING RETRIEVAL SYSTEM FOR GRAPHS.
R. A. Levinson.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-05. 1985. Thesis (Ph.D.).]
103068 LISP PROGRAMMING LECTURE NOTES.
G. S. Novak Jr..
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-06. 1985.]
103069 HEURISTIC AND FORMAL METHODS IN AUTOMATIC PROGRAM DEBUGGING.
W. R. Murray.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-07. 1985.]
103070 A GENERAL HEURISTIC BOTTOM-UP PROCEDURE FOR SEARCHING AND/OR GRAPHS.
V. Kumar.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-08. 1985.]
103071 A GENERAL PARADIGM FOR AND/OR GRAPH AND GAME TREE SEARCH.
V. Kumar, D. S. Nau, and L. N. Kanal.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-09. 1985.]
103072 PARALLEL PROCESSING FOR ARTIFICIAL INTELLIGENCE.
V. Kumar.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-10. 1985.]
103073 BRANCH-AND-BOUND SEARCH.
V. Kumar.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-11. 1985.]
103074 COMPUTATIONAL TREATMENT OF METAPHOR IN TEXT UNDERSTANDING: A FIRST
APPROACH.
O. Winghart.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-12. 1985. Thesis (M.S.).]
103075 COMPUTER SCIENCE AND MEDICAL IR.
R. F. Simmons.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-13. 1985.]
103076 TECHNOLOGIES FOR MACHINE TRANSLATION.
R. F. Simmons.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-14. 1985.]
103077 THE KNOWER'S PARADOX AND THE LOGICS OF ATTITUDES.
N. Asher and H. Kamp.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-15. 1985.]
103078 NEGOTIATED INTERFACES FOR SOFTWARE REUSABILITY.
F. K. Hill.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-16. 1985.]
103079 THE MAP-LEARNING CRITTER.
B. J. Kuipers.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-17. 1985.]
103080 MENU-BASED CREATION OF PROCEDURES FOR DISPLAY OF DATA.
M.-L. Wan.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-18. 1985.]
103081 EXPLANATION OF MECHANICAL SYSTEMS THROUGH QUALITATIVE SIMULATION.
S. Laughton.
[University of Texas, Austin. Artificial Intelligence Laboratory.
AI-TR-85-19. 1985.]
103082 THE WATERLOO CGL RAY TRACING PACKAGE.
M. A. J. Sweeney.
[University of Waterloo. Department of Computer Science. CS-85-35.
1985.]
103083 COMBINATIONAL STATIC CMOS NETWORKS.
J. A. Brzozowski and M. Yoeli.
[University of Waterloo. Department of Computer Science. CS-85-42.
1985.]
103084 SETTING TABLES AND ILLUSTRATIONS WITH STYLE.
R. J. Beach.
[University of Waterloo. Department of Computer Science. CS-85-45.
1985. Thesis (Ph.D.).]
103085 MAKING "CLAUSAL" THEOREM PROVERS "NON-CLAUSAL."
D. L. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-85-52. 1985.]
103086 A TUTORIAL INTRODUCTION TO MAPLE.
B. W. Char et al.
[University of Waterloo. Department of Computer Science. Research
report CS-85-56. 1985.]
103087 SOR AND MGR[NU] EXPERIMENTS ON THE CRYSTAL MULTICOMPUTER.
D. Kamowitz.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 623. 1986.]
103088 TRUST REGION METHODS FOR PIECEWISE-LINEAR APPROXIMATION.
R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 626. 1985.]
103089 PATTERN-BASED AND KNOWLEDGE-DIRECTED QUERY COMPILATION FOR RECURSIVE
DATA BASES.
J. Han.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 629. 1986. Thesis (Ph.D.).]
103090 COUPLED AND DECOUPLED ALGORITHMS FOR SEMICONDUCTOR SIMULATION.
T. Kerkhoven.
[Yale University. Department of Computer Science. Research report
YALEU/DCS/RR-429. 1985.]
103091 HOW TO EMBED TREES IN HYPERCUBES.
S. N. Bhatt and I. C. F. Ipsen.
[Yale University. Department of Computer Science. Research report
YALEU/DCS/RR-443. 1985.]
VOL. 8, NO. 4 05/19/86
103092 A STUDY OF THE WORST-CASE OF SHELLSORT.
J. Incerpi.
[Brown University. Computer Science Department. Technical report
CS-85-15. 1985. Thesis (Ph.D.).]
103093 TOWARDS A WORKSTATION OPERATING SYSTEM.
T. W. Doeppner Jr..
[Brown University. Computer Science Department. Technical report
CS-85-17. 1985.]
103094 VIEWING OBJECT-ORIENTED PROGRAMMING AS AN ENHANCEMENT OF DATA
ABSTRACTION METHODOLOGY.
J. A. Hendler and P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-85-18. 1985.]
103095 LANGUAGE AND METHODOLOGY FOR OBJECT-ORIENTED DATABASE ENVIRONMENTS.
S. B. Zdonik and P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-85-19. 1985.]
103096 PARALLEL EVALUATION OF RECURSIVE RULE QUERIES.
S. S. Cosmadakis and P. C. Kanellakis.
[Brown University. Computer Science Department. Technical report
CS-85-20. 1985.]
103097 SOME TECHNIQUES FOR GEOMETRIC SEARCHING WITH IMPLICIT SET
REPRESENTATIONS.
B. Chazelle.
[Brown University. Computer Science Department. Technical report
CS-86-03. 1986.]
103098 CMU STRATEGIC COMPUTING VISION PROJECT REPORT: 1984 TO 1985.
T. Kanade and C. Thorpe.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-2. 1985. By Takeo Kanade and Charles Thorpe, with
contributions from CMU SCVision Project Staff.]
103099 AUTONOMOUS MOBILE ROBOTS: ANNUAL REPORT 1985.
H. P. Moravec.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-4. 1985. Edited by Hans P. Moravec. Also issued as
MRL-86-1, Mobile Robot Laboratory, Robotics Institute,
Carnegie-Mellon University.]
103100 THE DEVELOPMENT OF ALADIN, AN EXPERT SYSTEM FOR ALUMINUM ALLOY DESIGN.
M. L. Farinacci et al.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-5. 1986.]
103101 THE MOTION OF A PUSHED, SLIDING OBJECT. PART 2: CONTACT FRICTION.
M. A. Peshkin and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-7. 1986.]
103102 AND/OR GRAPH REPRESENTATION OF ASSEMBLY PLANS.
L. S. H. de Mello and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-8. 1986.]
103123 DYNAMIC TIMESTAMP ORDERING MECHANISMS FOR DATABASE SYSTEMS.
A. A. Farrag, A. A. Farrag, and M. T. Ozsu.
[Dalhousie University. Computing Science Division. Technical report
1985CS-1. 1985.]
103124 CUBATURE FORMULAS FOR THE SPHERE AND THE SIMPLEX.
P. Keast.
[Dalhousie University. Computing Science Division. Technical report
1985CS-2. 1985.]
103125 NUMERICAL INTEGRATION OF SINGULAR FUNCTIONS OVER A TRIANGLE.
M. Hollosi and P. Keast.
[Dalhousie University. Computing Science Division. Technical report
1985CS-3. 1985.]
103126 USING SAS SOFTWARE IN THE DESIGN AND ANALYSIS OF TWO-LEVEL FRACTIONAL
FACTORIAL EXPERIMENTS.
J. R. Wendelberger.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5281. 1986.]
103127 A COMPUTATIONAL SURVEY OF THE CONJUGATE GRADIENT PRECONDITIONERS ON
THE CRAY 1-S.
C. C. Ashcraft, G. M. Shook, and J. D. Jones.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5299. 1986.]
103128 BOX-BISECTION FOR SOLVING SECOND-DEGREE SYSTEMS AND THE PROBLEM OF
CLUSTERING.
A. P. Morgan and V. Shapiro.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5302. 1986.]
103129 ANALYSE DISCRIMINANTE: METHODE DU TYPE PLUS PROCHES VOISINS UTILISANT
UN PRETRAITEMENT DES DONNEES.
F. Bonneau and J.-M. Proth.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 440. 1985.]
103130 LA MICROPROGRAMMATION DU SYSTEME LELISP: UNE PREMIER APPROCHE.
M. Devin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 441. 1985.]
103131 FINITE ELEMENT AND MULTIGRID SOLUTION OF THE TWO DIMENSIONAL EULER
EQUATIONS ON A NON STRUCTURED MESH.
E. Perez.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 442. 1985.]
103132 ETUDE DE LA VERSION "TEMPS REEL" D'UN ALGORITHME DE BIN-PACKING
ASYMPTOTIQUEMENT OPTIMAL.
P. Robert.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 444. 1985.]
103133 LE PROJET SATURNE.
Y. Deswarte et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 445. 1985.]
103134 MATHEMATICAL AND NUMERICAL ASPECTS OF ONE-DIMENSIONAL LAMINAR FLAME
SIMULATION.
M. Sermange.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 446. 1985.]
103135 REAL-TIME LOCAL NETWORKS: SOME DESIGN AND MODELLING ISSUES.
G. LeLann et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 448. 1985.]
103136 EXPRESSION OF SYNTACTIC AND SEMANTIC FEATURES IN LOGIC-BASED GRAMMARS.
P. Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 449. 1985. Also issued as Publication
interne 226, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
103137 AUTOMATIC DESIGN OF SYSTOLIC CHIPS.
P. Quintion and P. Gachet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 450. 1985.]
103138 REMARKS ON A FLAME PROPAGATION MODEL.
G. Barles.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 451. 1985.]
103139 HYPERBOLIC SYSTEMS IN DIAGONAL FORM WITH DISSIPATION, IN SEVERAL
SPACES VARIABLES: EXISTENCE AND UNIQUENESS RESULTS.
O. Bennouna.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 452. 1985.]
103140 ON STRONGLY COUPLED ELLIPTIC SYSTEMS: EXISTENCE, UNIQUENESS AND
REPRESENTATION RESULTS.
O. Bennouna.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 453. 1985.]
103141 DYNAMIC BEHAVIOR OF N-STAGE TRANSFER LINES WITH UNRELIABLE MACHINES
AND FINITE BUFFERS.
E. Wesfreid.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 456. 1985.]
103142 OPTIMAL PRIORITY ASSIGNMENT WITH HARD CONSTRAINTS.
P. Nain and K. W. Ross.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 459. 1985.]
103143 TECHNIQUES DE BASE SUR L'EXPLOITATION AUTOMATIQUE DU PARALLELISME
DANS LES PROGRAMMES.
A. Lichnewsky and F. Thomasset.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 460. 1985.]
103144 A VISUALISATION METHOD FOR CONSTRUCTIVE SOLID GEOMETRY USING POLYGON
CLIPPING.
A. Verroust.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 461. 1985.]
103145 A PROBABILISTIC MODEL FOR EVALUATING THE VERSO SOFTWARE FILTER.
V. Delebarre and P. Richard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 462. 1985.]
103146 A KNOWLEDGE BASE ARCHITECTURE AND ITS EXPERIMENTAL HARDWARE.
S. Shibayama, K. Iwata, and H. Sakai.
[Institute for New Generation Computer Technology (ICOT). TM-0117.
1985.]
103147 AND-OR-QUEUING IN EXTENDED CONCURRENT PROLOG.
T. Yokomori and M. Kishishita.
[Institute for New Generation Computer Technology (ICOT). TM-0120(E).
1985.]
103148 DEVELOPMENT OF DELTA AS A FIRST STEP TO A KNOWLEDGE BASE MACHINE.
H. Sakai, K. Iwata, and S. Shibayama.
[Institute for New Generation Computer Technology (ICOT). TM-0121.
1985.]
103149 THE CONCEPTS AND FACILITIES OF SIMPOS WINDOW SYSTEM.
J. Tsuji and S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TM-0125.
1985.]
103150 A NEW PARALLEL INFERENCE MECHANISM BASED ON SEQUENTIAL PROCESSING.
Y. Sohma et al.
[Institute for New Generation Computer Technology (ICOT). TM-0131.
1985.]
103151 ON THE OPERATIONAL SEMANTICS OF GUARDED HORN CLAUSES.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TM-0136.
1985. Preliminary draft.]
103152 ANALYSIS OF SEQUENTIAL PROLOG PROGRAMS.
R. Onai et al.
[Institute for New Generation Computer Technology (ICOT). TR-048.
1984.]
103153 GUARDED HORN CLAUSES.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-103.
1985.]
103154 INCORPORATING GENERALIZATION HEURISTICS INTO VERIFICATION OF PROLOG
PROGRAMS.
H. Seki and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-108.
1985.]
103155 THE PROGRAM CHARACTERISTICS IN LOGIC PROGRAMMING LANGUAGE ESP.
A. Yamamoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-112(E).
1985.]
103156 UNIFICATION OVER COMPLEX INDETERMINATES IN PROLOG.
K. Mukai.
[Institute for New Generation Computer Technology (ICOT). TR-113.
1985.]
103157 THE DATAFLOW-BASED PARALLEL INFERENCE MACHINE TO SUPPORT TWO BASIC
LANGUAGES IN KL1.
M. Kishi, E. Kuno, and K. Rokusawa.
[Institute for New Generation Computer Technology (ICOT). TR-114.
1985.]
103158 CONSTRAINT-BASED LOGIC DATABASE MANAGEMENT: STRUCTURING
META-KNOWLEDGE IN DATABASE MANAGEMENT.
H. Kitakami et al.
[Institute for New Generation Computer Technology (ICOT). TR-121.
1985.]
103159 DEDUCTIVE DATABASE SYSTEM BASED ON UNIT RESOLUTION.
H. Yokota, K. Sakai, and H. Ito.
[Institute for New Generation Computer Technology (ICOT). TR-123.
1985.]
103160 PROOFREADING JAPANESE WORD USAGE AND PROPER NOUNS BY COMPUTER.
S. Ishii.
[Institute for New Generation Computer Technology (ICOT). TR-125.
1985.]
103161 PARTIAL EVALUATION OF PROLOG PROGRAMS AND ITS APPLICATION TO META
PROGRAMMING.
A. Takeuchi and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-126.
1985.]
103162 THE CORRECTNESS OF TWO TRANSLATION METHODS FROM DEFINITE CLAUSE
GRAMMARS INTO PROLOG PROGRAMS.
K. Sakai et al.
[Institute for New Generation Computer Technology (ICOT). TR-128.
1985.]
103163 REPRESENTATION THEOREMS AND PRIMITIVE PREDICATES FOR LOGIC PROGRAMS.
T. Yokomori.
[Institute for New Generation Computer Technology (ICOT). TR-131.
1985.]
103164 ON QFTL AND THE REFUTATION PROCEDURE ON OMEGA-GRAPHS.
A. Fusaoka and K. Takahashi.
[Institute for New Generation Computer Technology (ICOT). TR-132.
1985.]
103165 RETRIEVAL OF SOFTWARE MODULE FUNCTIONS USING FIRST-ORDER PREDICATE
LOGICAL FORMULAE.
H. Yoshida, H. Kato, and M. Sugimoto.
[Institute for New Generation Computer Technology (ICOT). TR-135.
1985.]
103166 DESIGN AND EVALUATION OF A PROLOG COMPILER.
M. Kishimoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-136.
1985.]
103167 ARCHITECTURE AND EVALUATION OF A REDUCTION-BASED INFERENCE MACHINE:
PIM-R.
R. Onai et al.
[Institute for New Generation Computer Technology (ICOT). TR-138.
1985.]
103168 SINGLE QUEUE COMPILATION IN EXTENDED CONCURRENT PROLOG.
M. Kishishita, T. Yokomori, and J. Tanaka.
[Institute for New Generation Computer Technology (ICOT). TR-139.
1985.]
103169 STANDOFF AND STANDOFF RESOLUTION IN DEADLOCK FREE NETWORKS.
G. A. Grover and J. M. Jaffe.
[International Business Machines Corporation (IBM). Research
Division. RC 11009. 1985.]
103170 TRANSACTION RECOVERY IN DISTRIBUTED DB/DC SYSTEMS: A PROGRESSIVE
APPROACH.
P. S. Yu, B. R. Iyer, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. RC 11273. 1985.]
103171 EMBEDDED MENUS: SELECTING ITEMS IN CONTEXT.
L. Koved and B. Shneiderman.
[International Business Machines Corporation (IBM). Research
Division. RC 11310. 1985.]
103172 DIVIDED DIFFERENCES, HYPERBOLIC EQUATIONS AND LIFTING DISTRIBUTIONS.
K. Hollig and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 11333. 1985.]
103173 PNEUMATICALLY SEVOED ROBOT GRIPPER.
A. Sharon.
[International Business Machines Corporation (IBM). Research
Division. RC 11349. 1985.]
103174 FUNCTIONAL TESTING OF A RELATIONAL DATA BASE.
G. Barzilai and H. Barzilai.
[International Business Machines Corporation (IBM). Research
Division. RC 11351. 1985.]
103175 A PROGRAM DEVELOPMENT ENVIRONMENT FOR PROGRAMMING BY REFINEMENT AND
REUSE.
W. Harrison.
[International Business Machines Corporation (IBM). Research
Division. RC 11352. 1985.]
103176 A PART SELECTION PROBLEM FOR A FLEXIBLE INSPECTION STATION.
C. S. Tang.
[International Business Machines Corporation (IBM). Research
Division. RC 11355. 1985.]
103177 WHAT MAKES A FAST DIGITAL DEVICE?
R. W. Keyes.
[International Business Machines Corporation (IBM). Research
Division. RC 11356. 1985.]
103178 DOUBLY-LINKED LISTS WITH A SINGLE POINTER PER ELEMENT.
C. L. Cesar, L. W. Hoevel, and M. A. Martin.
[International Business Machines Corporation (IBM). Research
Division. RC 11361. 1985.]
103179 DUAL ROW MODULES AND POLYHEDRA OF BLOCKING GROUP PROBLEMS.
E. L. Johnson and Chopra S..
[International Business Machines Corporation (IBM). Research
Division. RC 11379. 1985.]
103180 ON FOUR PROBLEMS IN GRAPH THEORY.
E. L. Johnson and S. Mosterts.
[International Business Machines Corporation (IBM). Research
Division. RC 11383. 1985.]
103181 PROCESSOR-LEVEL WORKLOAD CHARACTERIZATION.
O. R. LaMaire and W. W. White.
[International Business Machines Corporation (IBM). Research
Division. RC 11385. 1985.]
103182 DESIGNING A QUALITY VOICE: AN ANALYSIS OF LISTENERS' REACTIONS TO
SYNTHETIC VOICES.
M. B. Rosson and A. J. Cecala.
[International Business Machines Corporation (IBM). Research
Division. RC 11389. 1985.]
103183 A VERSITILE CAMERA CALIBRATION TECHNIQUE FOR HIGH ACCURACY 3D MACHINE
VISION METROLOGY USING OFF-THE-SHELF TV CAMERAS AND LENSES.
R. Y. Tsai.
[International Business Machines Corporation (IBM). Research
Division. RC 11413. 1985.]
103184 HDMS: A HIERARCHICAL VLSI DESIGN DATA MANAGEMENT SYSTEM.
A. Beetem, J. Beetem, and A. Nigam.
[International Business Machines Corporation (IBM). Research
Division. RC 11417. 1985.]
103185 NON-PROCEDURAL BUSINESS GRAPHICS QUERY INTERFACE.
K.-T. Huang.
[International Business Machines Corporation (IBM). Research
Division. RC 11418. 1985.]
103186 PROGRAMMING WITH INVARIANTS.
R. Paige.
[International Business Machines Corporation (IBM). Research
Division. RC 11419. 1985.]
103187 ANALYSIS OF AFFINITY BASED ROUTING IN MULTI-SYSTEM DATA SHARING.
P. S. Yu et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11424. 1985.]
103188 LISA LEARNING.
J. M. Carroll and S. A. Mazur.
[International Business Machines Corporation (IBM). Research
Division. RC 11427. 1985.]
103189 ANALYSIS OF DATABASE PERFORMANCE WITH DYNAMIC LOCKING.
I. K. Ryu and A. Thomasian.
[International Business Machines Corporation (IBM). Research
Division. RC 11428. 1985.]
103190 SEARCH FOR MINIMUM IN A DISTRIBUTED SYSTEM.
R. Nair and S. J. Hong.
[International Business Machines Corporation (IBM). Research
Division. RC 11430. 1985.]
103191 ON TYPING IN PROLOG.
D. Brand.
[International Business Machines Corporation (IBM). Research
Division. RC 11431. 1985.]
103192 RESEARCH IN HIGHLY PARALLEL COMPUTER SYSTEMS.
G. S. Alamasi.
[International Business Machines Corporation (IBM). Research
Division. RC 11434. 1985.]
103193 MITE: MORPHIC IMAGE TRANSFORM ENGINE: AN ARCHITECTURE FOR
RECONFIGURABLE PIPELINES OF NEIGHBORHOOD PROCESSORS.
M. J. Kimmel et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11438. 1985.]
103194 INTEGRATION METHODS FOR THE SOLUTION OF CIRCUIT EQUATIONS.
W. Liniger, F. Odeh, and A. Ruehli.
[International Business Machines Corporation (IBM). Research
Division. RC 11442. 1985.]
103195 THE AVERAGE COMPLEXITY OF DEPTH-FIRST SEARCH.
H. S. Stone and P. Sipala.
[International Business Machines Corporation (IBM). Research
Division. RC 11443. 1985.]
103196 RECENT RESULTS IN PERFORMABILITY ANALYSIS.
B. R. Iyer.
[International Business Machines Corporation (IBM). Research
Division. RC 11450. 1985.]
103197 COMMUNICATION VERSUS COMPUTATION IN FAULT TOLERANT BROADCAST
PROTOCOLS.
S. Moran.
[International Business Machines Corporation (IBM). Research
Division. RC 11455. 1985.]
103198 USING A SINGLE-PROGRAM-MULTIPLE-DATA COMPUTATIONAL MODEL FOR PARALLEL
EXECUTION OF SCIENTIFIC APPLICATIONS.
F. Darema-Rogers, V. A. Norton, and G. F. Pfister.
[International Business Machines Corporation (IBM). Research
Division. RC 11552. 1985.]
103199 CATEGORICAL SEMANTICS, OR EXTENDING DATA TYPES TO INCLUDE MEMORY.
E. G. Wagner.
[International Business Machines Corporation (IBM). Research
Division. RC 11456. 1985.]
103200 INTONATIONAL STRUCTURE IN SYNTHETIC SPEECH: NOUN COMPOUNDING.
J. L. Klavans et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11460. 1985.]
103201 YSCOPE: A SHELL FOR BUILDING EXPERT SYSTEMS FOR SOLVING
COMPUTER-PERFORMANCE PROBLEMS.
J. Hellerstein and H. Van Woerkom.
[International Business Machines Corporation (IBM). Research
Division. RC 11463. 1985.]
103202 LIMIT THEOREMS FOR THE NUMBER OF RENEWALS.
K. K. Anderson.
[International Business Machines Corporation (IBM). Research
Division. RC 11468. 1985.]
103203 CONSTRUCTING MAXIMAL SLICING FROM GEOMETRY.
M. Tamminen et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11476. 1985.]
103204 MINIMUM-AREA WIRING FOR SLICING STRUCTURES.
W. K. Luk, P. Sipala, and C. K. Wong.
[International Business Machines Corporation (IBM). Research
Division. RC 11477. 1985.]
103205 APPROXIMATE ANALYSIS OF FORK/JOIN SYNCHRONIZATION IN PARALLEL QUEUES.
R. Nelson and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 11481. 1985.]
103206 BINARY IMAGE MANIPULATION ALGORITHMS IN THE IMAGE VIEW FACILITY.
K. L. Anderson et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11491. 1985]
103207 PANDA: PROCESSING ALGORITHM FOR NON-CODED DOCUMENT ACQUISITION.
Y.-H. Chen, F. C. Mintzer, and K. S. Pennington.
[International Business Machines Corporation (IBM). Research
Division. RC 11492. 1985.]
103208 FILE REQUEST TRANSPARENCY BETWEEN HETEROGENEOUS SYSTEMS.
J. Auerbach.
[International Business Machines Corporation (IBM). Research
Division. RC 11496. 1985.]
103209 YES/L1: A LANGUAGE FOR IMPLEMENTING REAL-TIME EXPERT SYSTEMS.
K. R. Milliken et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11500. 1985.]
103210 NESTED PARALLELISM IN A PARALLEL FORTRAN ENVIRONMENT.
J. M. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 11506. 1985.]
103211 THE RELIABILITY OF APPROXIMATE TESTABILITY MEASURES.
L. M. Huisman.
[International Business Machines Corporation (IBM). Research
Division. RC 11509. 1985.]
103212 ANALYTICAL PERFORMANCE EVALUATION FOR A CLASS OF DATA LINK.
B. E. Wolfinger and A. Badach.
[International Business Machines Corporation (IBM). Research
Division. RC 11514 1985.]
103213 A HIGHLY AVAILABLE STORAGE SYSTEM USING THE CHECKSUM METHOD.
Y. Dishon and C. J. Georgiou.
[International Business Machines Corporation (IBM). Research
Division. RC 11515. 1985.]
103214 MULTILEVEL GRID FILES.
K.-Y. Whang and R. Krishnamurthy.
[International Business Machines Corporation (IBM). Research
Division. RC 11516. 1985.]
103215 1-2 BINARY SEARCH TREES.
A. Mukherjee.
[International Business Machines Corporation (IBM). Research
Division. RC 11520. 1985.]
103216 PERFORMABILITY ANALYSIS OF OPERATION MODES OF CONFIGURABLE DUPLEX
SYSTEMS.
B. R. Iyer, D. M. Dias, and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 11527. 1985.]
103217 ERROR CORRECTION SCHEMES IN A MIXED VOICE/DATA ENVIRONMENT -
SELECTIVE REPEAT PROTOCOLS.
P. Kermani and H. Ahmadi.
[International Business Machines Corporation (IBM). Research
Division. RC 11532. 1985.]
103218 ANALYSIS OF TRANSACTION RECOVERY PROTOCOLS IN DISTRIBUTED DB/DC
SYSTEMS.
B. R. Iyer, P. S. Yu, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. RC 11535. 1985.]
103219 OPTIMAL DESIGN AND SEQUENTIAL ANALYSIS OF VLSI TESTING STRATEGY.
P. S. Yu, C. M. Krishna, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. RC 11536. 1985.]
103220 NOTES ON DYNAMIC LOAD SHARING AND TRANSACTION ROUTING.
P. S. Yu, S. Balsamo, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. RC 11537. 1985.]
103221 REASONING IN EMBEDDED CONTEXTS.
D. Teeple.
[International Business Machines Corporation (IBM). Research
Division. RC 11539. 1985.]
103222 MAPPING FROM BITS IN MEMORY TO PELS ON SCREEN: DESIGN CONSIDERATIONS.
D. T. Ling.
[International Business Machines Corporation (IBM). Research
Division. RC 11555. 1985.]
103223 DESIGN AND ANALYSIS OF INTEGRATED CONCURRENCY-COHERENCY CONTROLS.
D. M. Dias et al.
[International Business Machines Corporation (IBM). Research
Division. RC 11557. 1985.]
103224 DISTRIBUTED ALGORITHMS FOR CONSTRUCTING A MINIMUM-WEIGHT SPANNING
TREE IN A BROADCAST NETWORK.
Y. I. Gold and S. Moran.
[International Business Machines Corporation (IBM). Research
Division. RC 11559. 1985.]
103225 FAST HOUGH TRANSFORM FOR MULTIDIMENSIONAL SIGNAL PROCESSING.
H. Li.
[International Business Machines Corporation (IBM). Research
Division. RC 11562. 1985.]
103226 SYMMETRY BREAKING IN A RING NETWORK.
S. Pilpel.
[International Business Machines Corporation (IBM). Research
Division. RC 11566. 1985.]
103227 QUERY OPTIMIZATION IN OFFICE-BY-EXAMPLE.
K.-Y. Whang.
[International Business Machines Corporation (IBM). Research
Division. RC 11571. 1985.]
103228 RANDOMNESS AND GODEL'S THEOREM.
G. J. Chaitin.
[International Business Machines Corporation (IBM). Research
Division. RC 11582. 1985.]
103229 AN OVERVIEW AND COMPARATIVE ANALYSIS OF THE THREE IBM DISCRETE-EVENT
SIMULATION LANGUAGES AS APPLIED TO MANUFACTURING.
C. Hartnett.
[International Business Machines Corporation (IBM). Research
Division. RC 11602. 1985.]
103230 AN ALGORITHM TO COMPUTE THE VORONOI DIAGRAM OF A MULTIPLY CONNECTED
POLYGONAL DOMAIN.
V. Srinivasan and L. R. Nackman.
[International Business Machines Corporation (IBM). Research
Division. RC 11605. 1985.]
103231 THE ONSET OF HOT SPOT CONTENTION.
G. F. Pfister.
[International Business Machines Corporation (IBM). Research
Division. RC 11610. 1985.]
103232 CACHE OPERATIONS BY MRU CHANGE.
K. So and R. N. Rechtschaffen.
[International Business Machines Corporation (IBM). Research
Division. RC 11613. 1985.]
103233 VANGUARD: A CHIP PHYSICAL DESIGN SYSTEM.
P. S. Hauge and E. J. Yoffa.
[International Business Machines Corporation (IBM). Research
Division. RC 11623. 1985.]
103234 OPTIMAL PRECISION IN THE PRESENCE OF UNCERTAINTY.
J. Y. Halpern, N. Megiddo, and A. A. Munshi.
[International Business Machines Corporation (IBM). Research
Division. RJ 4768. 1985.]
103235 VERSION SUPPORT FOR ENGINEERING DATABASE SYSTEMS.
K. R. Dittrich and R. A. Lori.
[International Business Machines Corporation (IBM). Research
Division. RJ 4769. 1985.]
103236 STORING AND EVALUATING HORN-CLAUSE RULES IN A RELATIONAL DATABASE.
G. Emde Boas van and P. Emde Boas van.
[International Business Machines Corporation (IBM). Research
Division. RJ 4776. 1985.]
103237 A SIMPLE CHARACTERIZATION OF DATABASE DEPENDENCY IMPLICATION.
Y. Hanatani and R. Fagin.
[International Business Machines Corporation (IBM). Research
Division. RJ 4777. 1985.]
103238 KEY-SEQUENCE DATA SETS ON INDELIBLE STORAGE.
M. C. Easton.
[International Business Machines Corporation (IBM). Research
Division. RJ 4778. 1985.]
103239 THE SET OF CONTINUOUS FUNCTIONS WITH EVERYWHERE CONVERGENT FOURIER
SERIES.
M. Ajtai and A. S. Kechris.
[International Business Machines Corporation (IBM). Research
Division. RJ 4782. 1985.]
103240 ACHIEVING HIGH AVAILABILITY IN PARTITIONED DATABASE SYSTEMS.
D. Skeen.
[International Business Machines Corporation (IBM). Research
Division. RJ 4783. 1985.]
103241 ON NETWORKS OF NOISY GATES.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. RJ 4814. 1985. Preliminary version.]
103242 ON APPLICATIONS OF MULTI-COLORED POLYGONAL MASKS AND THEIR
COMPUTATION IN IMAGE PROCESSING PIPELINE ARCHITECTURES.
D. Petkovic, J. Sanz, and I. Dinstein.
[International Business Machines Corporation (IBM). Research
Division. RJ 4815. 1985.]
103243 SPEEDING UP RANDOM ACCESS MACHINES BY FEW PROCESSORS.
F. Meyer auf der Heide.
[International Business Machines Corporation (IBM). Research
Division. RJ 4816. 1985.]
103244 TEST RECOGNITION USING ADAPTIVE SOFTWARE.
R. G. Casey and K. Y. Wong.
[International Business Machines Corporation (IBM). Research
Division. RJ 4830. 1985.]
103245 INDEX SCANS USING A FINITE LRU BUFFER: A VALIDATED I/O MODEL.
L. F. Mackert and G. M. Lohman.
[International Business Machines Corporation (IBM). Research
Division. RJ 4836. 1985.]
103246 INCREASING AVAILABILITY IN PARTITIONED DATABASE SYSTEMS.
D. Skeen and D. D. Wright.
[International Business Machines Corporation (IBM). Research
Division. RJ 4857. 1985.]
103247 FUNDAMENTALS OF DEPENDENCY THEORY.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. RJ 4858. 1985.]
103248 A RETROSPECTIVE OF R*: A DISTRIBUTED DATABASE MANAGEMENT SYSTEM.
B. Lindsay.
[International Business Machines Corporation (IBM). Research
Division. RJ 4859. 1985.]
103249 DETERMINISITIC SIMULATION OF PROBABILISTIC CONSTANT DEPTH CIRCUITS.
M. Ajtai and A. Wigderson.
[International Business Machines Corporation (IBM). Research
Division. RJ 4866. 1985. Preliminary version.]
103250 A LOWER BOUND FOR FINDING PREDECESSORS IN YAO'S CELL PROBE MODEL.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. RJ 4867. 1985.]
103251 RL, A LANGUAGE FOR ENHANCED RULE BASED DATABASE PROCESSING, WORKING
DOCUMENT.
P. Emde Boas van.
[International Business Machines Corporation (IBM). Research
Division. RJ 4869. 1985.]
103252 PHASE-ONLY IMAGE RECONSTRUCTION FROM OFFSET FOURIER DATA.
D. C. Munson Jr..
[International Business Machines Corporation (IBM). Research
Division. RJ 4871. 1985.]
103253 INTEGRATING CONSTRAINT LANGUAGES AND RELATIONAL DATABASES.
M. R. Hansen et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4873. 1985.]
103254 QUERYING LOGICAL DATABASES.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. RJ 4874. 1985.]
103255 USING THE MICROSOFT MOUSE WITH TURBO PASCAL: AN APPLICATION OF
IN-LINE ASSEMBLY.
T. K. Truong.
[International Business Machines Corporation (IBM). Research
Division. RJ 4880. 1985.]
103256 A NOTE ON DEGENERACY IN LINEAR PROGRAMMING.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. RJ 4895. 1985.]
103257 THE COMPLEXITY OF PARALLEL COMPUTATION ON MATROIDS.
R. M. Karp and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. RJ 4896. 1985.]
103258 CLASSIFYING THE COMPUTATIONAL COMPLEXITY OF PROBLEMS.
L. Stockmeyer.
[International Business Machines Corporation (IBM). Research
Division. RJ 4908. 1985.]
103259 SPOKING INSTABILITY OF FLUID FLOW ON ROTATING DISK.
Y.-O. Tu.
[International Business Machines Corporation (IBM). Research
Division. RJ 4909. 1985.]
103260 ON A MAXIMUM ENERGY CONCENTRATION SPECTRAL WINDOW.
L. C. Barbosa.
[International Business Machines Corporation (IBM). Research
Division. RJ 4910. 1985.]
103261 A TIME-SPACE TRADEOFF FOR ELEMENT DISTINCTNESS.
A. Borodin et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 4915. 1985.]
103262 DOCUMENT CONVERGENCE IN AN INTERACTIVE FORMATTING SYSTEM.
D. D. Chamberlin.
[International Business Machines Corporation (IBM). Research
Division. RJ 4916. 1985.]
103263 PREDICTIVE AND NONPREDICTIVE MINIMUM DESCRIPTION LENGTH PRINCIPLES.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. RJ 4919. 1985.]
103264 BOUNDS ON THE CONVEX LABEL NUMBER OF TREES.
M. Bern, M. Klawe, and A. Wong.
[International Business Machines Corporation (IBM). Research
Division. RJ 4923. 1985.]
103265 A NOTE ON SENSITIVITY ANALYSIS IN ALGEBRAIC ALGORITHMS.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. RJ 4958. 1985.]
103266 COUNTING UNIQUE VALUES OF AN ATTRIBUTE WITHOUT SORTING.
M. M. Astrahan, M. Schkolnick, and K.-Y. Whang.
[International Business Machines Corporation (IBM). Research
Division. RJ 4960. 1985.]
103267 IMPROVED ASYMPTOTIC ANALYSIS OF THE AVERAGE NUMBER OF STEPS OF THE
SELF-DUAL SIMPLEX ALGORITHM.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. RJ 4962. 1985.]
103268 ON EXTENDING THE REALM OF APPLICATION OF RELATIONAL SYSTEMS.
R. A. Lorie and J.-J. Daudenarde.
[International Business Machines Corporation (IBM). Research
Division. RJ 4973. 1985.]
103269 RULE-BASED TRANSLATION OF RELATIONAL QUERIES INTO ITERATIVE PROGRAMS.
J. C. Freytag and N. Goodman.
[International Business Machines Corporation (IBM). Research
Division. RJ 4974. 1985.]
103270 NEW RESULTS ON TRELLIS CODING FOR PARTIAL-RESPONSE CHANNELS.
G. Ungerboeck and J. K. Wolf.
[International Business Machines Corporation (IBM). Research
Division. RZ 1395. 1985.]
103271 OVERLAY OPTICAL-FIBER LOCAL-AREA NETWORK.
H. Keller et al.
[International Business Machines Corporation (IBM). Research
Division. RZ 1407. 1985.]
103272 COMMUNICATION-SYSTEM MODELS EMBEDDED IN THE OSI-REFERENCE MODEL, A
SURVEY.
M. Reiser.
[International Business Machines Corporation (IBM). Research
Division. RZ 1408. 1985.]
103273 A BINARY IMAGE PREPROCESSOR FOR DOCUMENT QUALITY IMPROVEMENT AND DATA
REDUCTION.
F. M. Wahl.
[International Business Machines Corporation (IBM). Research
Division. RZ 1438. 1985.]
103274 A NEW ANALYSIS OF LALR FORMALISMS.
K. M. Choe.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-84-03. 1984.]
103275 A HIGHLY CONCURRENT CONTROL AND DATA FLOW COMPUTER ARCHITECTURE.
S. R. Maeng.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-84-04. 1984.]
103276 FETE (A FRONT END TEXT EDITOR).
H. K. Lee.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-84-05. 1984.]
103277 A STUDY OF THE PROGRAM DISASSEMBLY USING FLOW ANALYSIS TECHNIQUES.
C.-W. Yoo.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-85-06. 1985.]
103278 AUTOMATIC CONSTRUCTION OF CODE GENERATORS FOR A RETARGETABLE COMPILER.
S.-M. Oh.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-85-07. 1985.]
103279 AN EXTENDED RELATIONAL MODEL FOR DESIGN DATABASES.
K.-J. Han.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-85-08. 1985.]
103280 PERFORMANCE OF CONCURRENCY CONTROL METHODS IN DISTRIBUTED DATABASE
MANAGEMENT SYSTEMS.
S. C. Moon.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-85-09. 1985. Thesis (Ph.D.). "Thesis
submitted in partial fulfillment of the requirements for the degree
of Doctor of Philosophy in Computer Science in the Graduate College
of the University of Illinois at Urbana-Champaign, 1985."]
103281 PRELIMINARY REPORT ON A THEORY OF PLAN SYNTHESIS.
E. P. D. Pednault.
[SRI International. Artificial Intelligence Center. Technical note
358. 1985.]
103282 SPECIFYING SOFTWARE/HARDWARE INTERACTIONS IN DISTRIBUTED SYSTEMS.
G.-C. Roman.
[Washington University. Department of Computer Science. Technical
report WUCS-85-2. 1985.]
103283 DESIGN OF AN INTEGRATED SERVICES PACKET NETWORK.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-85-3. 1985.]
103284 DESIGN OF A BROADCAST PACKET SWITCHING NETWORK.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-85-4. 1985.]
103285 COLLECTING DATA ABOUT LOGIC SIMULATION.
R. D. Chamberlain and M. A. Franklin.
[Washington University. Department of Computer Science. Technical
report WUCS-85-6. 1985.]
103286 ON THE PROBABLE PERFORMANCE OF GRAPH COLORING ALGORITHMS.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-85-7. 1985.]
103287 STATISTICS ON LOGIC SIMULATION.
K. F. Wong et al.
[Washington University. Department of Computer Science. Technical
report WUCS-85-9. 1985.]
103288 SHOW AND TELL USER'S MANUAL.
P. McLain and T. D. Kimura.
[Washington University. Department of Computer Science. Technical
report WUCS-86-4. 1986.]
103289 DETERMINANCY OF HIERARCHICAL DATAFLOW MODEL: A COMPUTATION MODEL FOR
VISUAL PROGRAMMING.
T. D. Kimura.
[Washington University. Department of Computer Science. Technical
report WUCS-86-5. 1986. This report is an up-dated version of
WUCS-85-5, "Hierarchical Dataflow Model: a Computation Model for
School Children."]
103290 D/M: AN INTERACTIVE FUNCTIONAL LANGUAGE FOR THE MODULAR CONSTRUCTION
OF PROGRAMS.
A. Sakharov.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 112. 1985.]
103291 EIN TESTVERFAHREN FUER DATENBANKPRADIKATE.
S. Bottcher.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 114. 1985.]
103292 TWO NET-ORIENTED SEMANTICS FOR TCSP.
D. A. Taubner.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 116. 1985.]
103293 IMPLEMENTATION ASSESSMENT OF A NETWORK SERVICE: SPECIFICATION OF A
CONFORMANCE TEST SUITE.
G. W. Cowin and S. E. Hambly.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 67/85. 1985.]
103294 A SURVEY OF EXTENSIONS IN PASCAL IMPLEMENTATIONS.
D. A. Joslin and B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 69/86. 1986.]
103295 A COMPUTATIONAL THEORY OF DISPOSITIONS.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 30.
1985.]
103296 DEVELOPMENT OF PRAGMATIC USES OF SUBJECT PRONOUNS IN TURKISH CHILD
LANGUAGE.
D. I. Slobin and A. Talay.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 31.
1986.]
103297 FUZZY SETS, USUALITY AND COMMONSENSE REASONING.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 32.
1985.]
103298 A SIMPLE VIEW OF THE DEMPSTER-SHAFER THEORY OF EVIDENCE AND ITS
IMPLICATIONS FOR THE RULE OF COMBINATION.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 33.
1985.]
103299 SYLLOGISTIC REASONING IN FUZZY LOGIC AND ITS APPLICATIONS TO USUALITY
AND REASONING WITH DISPOSITIONS.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 34.
1985.]
103300 OUTLINE OF A THEORY OF USUALITY BASED ON FUZZY LOGIC.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 35.
1986.]
103301 WHY HIGHER-ORDER LOGIC IS A GOOD FORMALISM FOR SPECIFYING AND
VERIFYING HARDWARE.
M. J. C. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 77.
1985.]
103302 A COMPLETE PROOF SYSTEM FOR SCCS WITH MODAL ASSERTIONS.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 78.
1985.]
103303 PETRI NETS, ALGEBRAS AND MORPHISMS.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 79.
1985.]
103304 INTERACTIVE THEOREM PROVING WITH CAMBRIDGE LCF: A USER'S MANUAL.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 80.
1985.]
103305 THE IMPLEMENTATION OF FUNCTIONAL LANGUAGES USING CUSTOM HARDWARE.
W. Stoye.
[University of Cambridge. Computer Laboratory. Technical report 81.
1985. Thesis (Ph.D.).]
103306 NATURAL DEDUCTION PROOF AS HIGHER-ORDER RESOLUTION.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 82.
1985. Revised version: December 1985.]
103307 AN EXTREMAL CONNECTIVITY METRIC FOR PARTITIONING VLSI DESIGNS.
A. R. Deas.
[University of Edinburgh. Department of Computer Science. CSR-183-85.
1985.]
103308 BEHAVIORAL CORRECTNESS OF DATA REPRESENTATIONS.
O. Schoett.
[University of Edinburgh. Department of Computer Science. CSR-185-85.
1985.]
103309 USING WEAK CONTINUITY CONSTRAINTS - WHAT THEY ARE, AND HOW THEY DO IT.
A. Blake and A. Zisserman.
[University of Edinburgh. Department of Computer Science. CSR-186-85.
1985.]
103310 RANDOM GENERATION OF COMBINATORIAL STRUCTURES FROM A UNIFORM
DISTRIBUTION.
M. R. Jerrum, L. G. Valiant, and V. V. Vazirani.
[University of Edinburgh. Department of Computer Science. CSR-187-85.
1985.]
103311 A COMPOSITIONAL REFORMULATION OF OWICKI-GRIES'S PARTIAL CORRECTNESS
FOR A PARALLEL WHILE LANGUAGE.
C. Stirling.
[University of Edinburgh. Department of Computer Science. CSR-189-85.
1985.]
103312 COMPLEMENTARY PARTIAL ORDERS AND RECTANGLE PACKING.
M. Jerrum.
[University of Edinburgh. Department of Computer Science. CSR-190-85.
1985.]
103313 THE EDINBURGH NODE OF THE PROTEUS DISTRIBUTED DATABASE SYSTEM.
M. Norrie.
[University of Edinburgh. Department of Computer Science. CSR-191-85.
1985.]
103314 THE UNIFICATION OF TERMS: A CATEGORY-THEORETIC ALGORITHM.
D. E. Rydeheard and R. M. Burstall.
[University of Edinburgh. Department of Computer Science. CSR-192-85.
1985.]
103315 MODAL LOGICS FOR COMMUNICATING SYSTEMS.
C. Stirling.
[University of Edinburgh. Department of Computer Science. CSR-193-85.
1985.]
103316 POLYLITH ARCHITECTURE.
J. M. Purtilo.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1188. 1986.]
103317 PROCESS SUSPENSION AND RESUMPTION IN THE UNIX SYSTEM V OPERATING
SYSTEM.
R. P. Cagle.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1240. 1986.]
103318 ROUTING PROBLEMS IN THE PHYSICAL DESIGN OF INTEGRATED CIRCUITS.
H. W. Leong.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1242. 1986. Thesis (Ph.D.).]
103319 A GENERAL BLOCK PLACEMENT USING VARIABLE ASPECT RATIO BLOCKS.
Y.-C. Hsu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1243. 1986. Thesis (M.S.).]
103320 THE POTENTIAL FOR PARALLELISM IN ORDINARY DIFFERENTIAL EQUATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1246. 1986.]
103321 INTERPRETING OBSERVATIONS OF PHYSICAL SYSTEMS.
K. Forbus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1248. 1986.]
103322 ENVIRONMENTS FOR PROTOTYPING PARALLEL ALGORITHMS.
J. M. Purtilo, D. A. Reed, and D. C. Grunwald.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1249. 1986.]
103323 APPLICATIONS OF A SOFTWARE INTERCONNECTION SYSTEM IN MATHEMATICAL
PROBLEM SOLVING ENVIRONMENTS.
J. M. Purtilo.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1254. 1986.]
103324 TOPOLOGICALLY SWEEPING AN ARRANGEMENT.
H. Edelsbrunner and L. J. Guibas.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1255. 1986.]
103325 HOW OFTEN CAN YOU SEE YOURSELF IN A CONVEX CONFIGURATION OF MIRRORS?
H. Edelsbrunner and J. W. Jaromczyk.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1256. 1986.]
103326 AN EXPERT-SYSTEM PARADIGM FOR DESIGN.
F. D. Brewer and D. D. Gajski.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1258. 1986.]
103327 DYNAMIC LOAD BALANCING ALGORITHMS IN HOMOGENEOUS DISTRIBUTED SYSTEMS.
C.-Y. H. Hsu and J. W.-S. Liu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1261. 1986.]
103328 MONTE CARLO SIMULATION OF FINITE MASS NUCLEONS INTERACTING VIA A
NEUTRAL, SCALAR BOSON FIELD.
L. Szybisz and J. G. Zabolitzky.
[University of Minnesota. Supercomputer Institute. UMSI 86/11. 1986.]
103329 PRECISION CALCULATION OF ELASTICITY FOR PERCOLATION.
J. G. Zabolitzky, D. J. Bergman, and D. Stauffer.
[University of Minnesota. Supercomputer Institute. UMSI 86/13. 1986.]
103330 MINNESOTA SUPERCOMPUTER ACCESS NETWORK: TCP/IP SATELLITE
COMMUNICATIONS TO UNIX SUPERCOMPUTERS.
T. F. Walsh.
[University of Minnesota. Supercomputer Institute. UMSI 86/16. 1986.]
103331 INFINITE-VALUED LOGIC BASED ON PROBABILITY.
E. Hisdal.
[University of Oslo. Institute for Informatics. Research report 63.
1984.]
103332 EXITS FORM SYSTEMS OF NESTED PROCESSES: AN AXIOMATIC SEMANTICS.
S. Meldal.
[University of Oslo. Institute for Informatics. Research report 93.
1985.]
103333 SPECIFICATION AND REASONING ABOUT DISCRETE SIMULATION MODELS: A CASE
STUDY.
O.-J. Dahl.
[University of Oslo. Institute for Informatics. Research report 94.
1985.]
103334 AN AXIOMATIC SEMANTICS OF CONCURRENT PROCESSES AND MONITORS.
S. Gjessing.
[University of Oslo. Institute for Informatics. Research report 95.
1985.]
103335 SYMMETRY EVALUATORS.
S. A. Friedberg.
[University of Rochester. Department of Computer Science. TR 134.
1986. March 1984 (Revised January 1986).]
103336 PARALLEL LOGICAL INFERENCE AND ENERGY MINIMIZATION.
D. H. Ballard and P. J. Hayes.
[University of Rochester. Department of Computer Science. TR 142.
1986.]
103337 CONNECTIONIST MODELS AND PARALLELISM IN HIGH LEVEL VISION.
J. A. Feldman.
[University of Rochester. Department of Computer Science. TR 146.
1985.]
103338 REASONING USING EXCLUSION: AN EXTENSION OF CLAUSAL FORM.
J. D. Tenenberg.
[University of Rochester. Department of Computer Science. TR 147.
1985.]
103339 ALGORITHMS AND HARDWARE FOR EFFICIENT IMAGE SMOOTHING.
A. Bassu and C. M. Brown.
[University of Rochester. Department of Computer Science. TR 149.
1984.]
103340 DISTRIBUTED DATA STRUCTURES: A CASE STUDY.
C. S. Ellis.
[University of Rochester. Department of Computer Science. TR 150.
1985.]
103341 CONCURRENCY AND LINEAR HASHING.
C. S. Ellis.
[University of Rochester. Department of Computer Science. TR 151.
1985.]
103342 EXPERIMENTS IN ROTATIONAL EGOMOTION CALCULATION.
B. Sarachan.
[University of Rochester. Department of Computer Science. TR 152.
1985.]
103343 HPC: A MODEL OF STRUCTURE AND CHANGE IN DISTRIBUTED SYSTEMS.
T. J. LeBlanc and S. A. Friedberg.
[University of Rochester. Department of Computer Science. TR 153.
1985.]
103344 CONNECTIONIST APPROACH TO WORK SENSE DISAMBIGUATION.
G. W. Cottrell.
[University of Rochester. Department of Computer Science. TR 154.
1985. Thesis (Ph.D.).]
103345 ENERGY AND THE BEHAVIOR OF CONNECTIONIST MODELS.
J. A. Feldman.
[University of Rochester. Department of Computer Science. TR 155.
1985.]
103346 TEMPLATE MATCHING ON PARALLEL ARCHITECTURES.
D. Sher.
[University of Rochester. Department of Computer Science. TR 156.
1985.]
103347 PERCEPTION OF RIGID MOTION FROM SPATIO-TEMPORAL DERIVATIVES OF
OPTICAL FLOW.
A. Bandyopadhyay and J. Aloimonos.
[University of Rochester. Department of Computer Science. TR 157.
1985.]
103348 PERCEPTION OF STRUCTURE FROM MOTION: LOWER BOUND RESULTS.
J. Aloimonos and A. Bandyopadhyay.
[University of Rochester. Department of Computer Science. TR 158.
1985.]
103349 ONE EYE SUFFICES: A COMPUTATIONAL MODEL OF MONOCULAR ROBOT DEPTH
PERCEPTION.
J. Aloimonos.
[University of Rochester. Department of Computer Science. TR 160.
1984.]
103350 DETECTION OF SURFACE ORIENTATION AND MOTION FROM TEXTURE: 1. THE CASE
OF PLANES.
J. Aloimonos and P. B. Chou.
[University of Rochester. Department of Computer Science. TR 161.
1985.]
103351 STRUCTURING RESILIENT DISTRIBUTED PROGRAMS WITH THE ACTIVITY MODEL.
C. S. Ellis and J. E. Heliotis.
[University of Rochester. Department of Computer Science. TR 163.
1985.]
103352 A CONNECTION SIMULATOR FOR THE BBN BUTTERFLY MULTIPROCESSOR.
M. Fanty.
[University of Rochester. Department of Computer Science. TR 164.
1986.]
103353 EVIDENTIAL REASONING IN SEMANTIC NETWORKS: A FORMAL THEORY AND ITS
PARALLEL IMPLEMENTATION.
L. Shastri.
[University of Rochester. Department of Computer Science. TR 166.
1985. Thesis (Ph.D.).]
103354 CONSTRAINTS ON THE COMPUTATION OF RIGID MOTION PARAMETERS FROM
RETINAL DISPLACEMENTS.
A. Bandyopadhyay.
[University of Rochester. Department of Computer Science. TR 168.
1985.]
103355 PLAN RECOGNITION AND DISCOURSE ANALYSIS: AN INTEGRATED APPROACH FOR
UNDERSTANDING.
D. J. Litman.
[University of Rochester. Department of Computer Science. TR 170.
1985. Thesis (Ph.D.).]
103356 A SET THEORETIC PROBLEM: A SOLUTION FOR THE HYPERCUBE AND ITS
APPLICATIONS.
R. E. Newman-Wolfe.
[University of Rochester. Department of Computer Science. TR 171.
1985.]
103357 ROCHESTER CONNECTIONIST PAPERS: 1979-1985.
J. A. Feldman et al.
[University of Rochester. Department of Computer Science. TR 172.
1985.]
103358 HAMILTONIAN PATHS IN NON-RECTANGULAR GRID GRAPHS.
H. J. M. Everett.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-1. 1986. Thesis (M.S.).]
103359 A FAST TWO-DIMENSIONAL LINE CLIPPING ALGORITHM.
M. S. Sobkow, P. Pospisil, and Y.-H. Yang.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-2. 1986.]
103360 ANNOTATIONS FOR DISTRIBUTED PROGRAMMING IN LOGIC.
R. Ramakrishnan and A. Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-15. 1985.]
103361 AN ANALYSIS OF THE NONEMPTINESS PROBLEM FOR CLASSES OF
REVERSAL-BOUNDED MULTICOUNTER MACHINES.
R. R. Howell and L. E. Rosier.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-16. 1985.]
103362 LINEAR ALGORITHMS THAT ARE EFFICIENTLY PARALLELIZED TO TIME O(LOGN).
T. Herman.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-17. 1985.]
103363 SUPPORT FOR VERSIONS OF VLSI CAD OBJECTS.
D. S. Batory and W. Kim.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-18. 1985.]
103364 SQL/NF: A QUERY LANGUAGE FOR [NOT]1NF RELATIONAL DATABASES.
M. A. Roth, H. F. Korth, and D. S. Batory.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-19. 1985.]
103365 UNDERSTANDING A BYZANTINE ALGORITHM.
J. Misra.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-20. 1985.]
103366 MODALITIES FOR MODEL CHECKING: BRANCHING TIME LOGIC STRIKES BACK.
E. A. Emerson and C.-L. Lei.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-21. 1985.]
103367 ON THE COMPLEXITY OF DECIDING FAIR TERMINATION OF PROBABILISTIC
CONCURRENT FINITE-STATE PROGRAMS.
L. E. Rosier and H.-C. Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-22. 1985]
103368 A MECHANICALLY CERTIFIED THEOREM ABOUT OPTIMAL CONCURRENCY OF SORTING
NETWORKS, AND ITS PROOF.
C. Lengauer and C.-H. Huang.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-23. 1985.]
103369 TIME-DEPENDENT DISTRIBUTED SYSTEMS: PROVING SAFETY, LIVENESS AND
REAL-TIME PROPERTIES.
A. U. Shankar and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-24. 1985.]
103370 LOCAL AREA NETWORK TESTBED DESIGN.
B. L. Barnett and M. K. Molloy.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-25. 1985.]
103371 AN EXAMPLE OF STEPWISE REFINEMENT OF DISTRIBUTED PROGRAMS: QUIESCENCE
DETECTION.
M. Chandy and J. Misra.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-26. 1985.]
103372 ON THE PARALLEL STRUCTURING OF RESOURCE MANAGEMENT.
R. W. O'Dell.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-27. 1985.]
103373 PICASSO: A GRAPHICAL QUERY LANGUAGE FOR NAIVE USERS.
H. J. Kim, H. F. Korth, and A. Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-30. 1985.]
103374 AUTOMATIC VERIFICATION OF FINITE STATE CONCURRENT SYSTEMS USING
TEMPORAL LOGIC SPECIFICATIONS.
E. M. Clarke, E. A. Emerson, and A. P. Sistla.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-31. 1985.]
103375 NULL VALUES IN [NOT]1INF RELATIONAL DATABASES.
M. A. Roth, H. F. Korth, and A. Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-32. 1985.]
103376 THE MAP-LEARNING CRITTER.
B. Kuipers.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-33. 1985. Also issued as AI-85-17, Artificial Intelligence
Laboratory, University of Texas, Austin.]
103377 A THEORY OF DIAGNOSIS FROM FIRST PRINCIPLES.
R. Reiter.
[University of Toronto. Department of Computer Science. Technical
report 187/86. 1985.]
103378 PROVING MONITOR PROOF RULES.
L. S. Nielsen and A. P. Black.
[University of Washington. Department of Computer Science. Technical
report 85-08-01. 1985.]
103379 THE EDEN PROGRAMMING LANGUAGE.
A. P. Black.
[University of Washington. Department of Computer Science. Technical
report 85-09-01. 1985. Revised: December 1985.]
103380 PLAYING POKER: A FULL PROGRAMMING EXAMPLE USING THE POKER ENVIRONMENT.
L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 85-09-02. 1985.]
103381 POKER 3.1: A PROGRAMMER'S REFERENCE GUIDE.
L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 85-09-03. 1985.]
103382 CONSTRAINTS AND FUNCTIONAL PROGRAMMING.
A. Borning.
[University of Washington. Department of Computer Science. Technical
report 85-09-05. 1985.]
103383 DEFINING CONSTRAINTS GRAPHICALLY.
A. Borning.
[University of Washington. Department of Computer Science. Technical
report 85-09-06. 1985.]
103384 THE PYRAMIDCALC SYSTEM FOR RESEARCH IN PYRAMID MACHINE ALGORITHMS.
R. P. Blanford and S. L. Tanimoto.
[University of Washington. Department of Computer Science. Technical
report 85-10-02. 1985.]
103385 AN APPROACH TO ACCOMMODATING HETEROGENEITY.
A. P. Black et al.
[University of Washington. Department of Computer Science. Technical
report 85-10-04. 1985.]
VOL. 8, NO. 5 06/26/86
103386 THE AMBER MACHINE.
L. Cardelli.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 119. 1985.]
103387 AWK - A PATTERN SCANNING AND PROCESSING LANGUAGE. PROGRAMMER'S MANUAL.
A. V. Aho, B. W. Kernighan, and P. J. Weinberger.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 118. 1985.]
103388 TWIG REFERENCE MANUAL.
S. W. K. Tjian.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 120. 1986.]
103389 THE BLIT PROGRAMMER'S MANUAL (TTY EDITION).
R. Pike.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 121. 1985.]
103390 MARKING FAIRNESS IN PETRI NETS.
W.-M. Lu.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
3. 1986.]
103391 TUILI - A LANGUAGE FOR EXPERT SYSTEMS.
Rugian Lu.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
4. 1986.]
103392 THE CATALOG MANAGEMENT STRATEGY OF THE DISTRIBUTED DATA BASE SYSTEM
C-POREL.
L.-X. Zhou.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
5. 1986.]
103393 THE SECOND MACHINE CLASS 2, AN ENCYCLOPEDIA VIEW ON THE PARALLEL
COMPUTATION THESIS.
P. van Emde Boas.
[University of Amsterdam. Department of Mathematics. Report no.
85-24. 1985.]
103394 ON THE SYNTAX OF MARTIN-LOF'S THEORIES.
A. S. Troelstra.
[University of Amsterdam. Department of Mathematics. Report no.
86-03. 1986.]
103395 BIBLIOGRAPHY OF DOCUMENTS RELATED TO THE SNOBOL, SL5, AND ICON
PROGRAMMING LANGUAGES.
R. E. Griswold and M. T. Griswold.
[University of Arizona. Department of Computer Science. TR 85-13a.
1985. Compiled by Ralph E. Griswold and Madge T. Griswold. Revised:
December 4, 1985.]
103396 FAILURE HANDLING IN DISTRIBUTED PROGRAMMING LANGUAGES.
R. D. Schlichting and T. D. M. Purdin.
[University of Arizona. Department of Computer Science. TR 85-14.
1985.]
103397 (PROBABLY) THE MINIMUM SUM OF SQUARES.
P. J. Downey.
[University of Arizona. Department of Computer Science. TR 85-21.
1985.]
103398 THE EVOLUTION OF THE SR LANGUAGE.
G. R. Andrews and R. A. Olsson.
[University of Arizona. Department of Computer Science. TR 85-22.
1985.]
103399 REPORT ON THE DISTRIBUTED PROGRAMMING LANGUAGE SR.
G. R. Andrews and R. A. Olsson.
[University of Arizona. Department of Computer Science. TR 85-23.
1985.]
103400 MECHANISMS TO ENHANCE FILE AVAILABILITY IN DISTRIBUTED SYSTEMS.
R. D. Schlichting, G. R. Andrews, and T. D. M. Purdin.
[University of Arizona. Department of Computer Science. TR 85-24.
1985.]
103401 PROGRAMMING IN ICON. PART 1 - PROGRAMMING WITH GENERATORS.
R. E. Griswold.
[University of Arizona. Department of Computer Science. TR 85-25.
1985.]
103402 CONVERSATION-BASED MAIL.
D. E. Comer and L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 85-26.
1985.]
103403 A MODEL OF NAMING IN DISTRIBUTED SYSTEMS.
D. E. Comer and L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 85-27.
1985.]
103404 NAMING USERS IN A HETEROGENEOUS INTERNET: FRAMEWORK FOR A NEW
APPROACH.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 85-28.
1985.]
103405 COMBINATORIAL BIN PACKING PROBLEMS.
T. N. Nielsen.
[University of Arizona. Department of Computer Science. TR 85-29.
1985. Thesis (Ph.D.).]
103406 PROMISES AND PITFALLS OF KNOWLEDGE SYSTEMS: AN OVERVIEW.
J. D. Joyce and R. Uthurusamy.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5269R. 1986.]
103432 READIES AND FAILURES IN THE ALGEBRA OF COMMUNICATING PROCESSES.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8523. 1985.]
103433 TRANSITION SYSTEMS, METRIC SPACES AND READY SETS IN THE SEMANTICS OF
UNIFORM CONCURRENCY.
J. W. de Bakker et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8601. 1986.]
103434 PATTERN REPRESENTATION.
P. J. W. ten Hagen and C. G. Trienekens.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8602. 1986.]
103435 CONTRASTING THEMES IN THE SEMANTICS OF IMPERATIVE CONCURRENCY.
J. W. de Bakker et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8603. 1986.]
103436 EXTENDED GENERAL DESIGN THEORY.
T. Tomiyama and H. Yoshikawa.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8604. 1986.]
103437 DENOTATIONAL SEMANTICS OF NETS WITH NONDETERMINISM.
J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8605. 1986.]
103438 FIXED POINT EQUATIONS WITH PARAMETERS IN THE PROJECTIVE MODEL.
E. Kranakis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8606. 1986.]
103439 APPROXIMATING THE PROJECTIVE MODEL.
E. Kranakis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8607. 1986.]
103440 VERIFICATION OF TWO COMMUNICATION PROTOCOLS BY MEANS OF PROCESS
ALGEBRA.
F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8608. 1986.]
103441 FAILURE SEMANTICS WITH FAIR ABSTRACTION.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8609. 1986.]
103442 MUTUAL EXCLUSION IN PARTITIONED DISTRIBUTED SYSTEMS.
D. Barbara and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-001. 1985.]
103443 DATA PROCESSING WITH TRIPLE MODULAR REDUNDANCY.
F. Pittelli and H. Garcia-Molina.
[Princeton University. Department of Computer Science. TR-002-85.
1985.]
103444 ROTATION DISTANCE.
D. D. Sleator, R. E. Tarjan, and W. P. Thurston.
[Princeton University. Department of Computer Science. CS-TR-003-85.
1985.]
103445 A LOCALLY ADAPTIVE DATA COMPRESSION SCHEME.
J. L. Bentley et al.
[Princeton University. Department of Computer Science. CS-TR-004-85.
1985.]
103446 PLANAR POINT LOCATION USING PERSISTENT SEARCH TREES.
N. Sarnak and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-005-85.
1985.]
103447 EFFICIENT TOP-DOWN UPDATING OF RED-BLACK TREES.
R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-006-85.
1985.]
103448 RECTILINEAR PLANAR LAYOUTS OF PLANAR GRAPHS AND BIPOLAR ORIENTATIONS.
P. Rosenstiehl and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-007-85.
1985.]
103449 THE PAIRING HEAP: A NEW FORM OF SELF-ADJUSTED HEAP.
M. L. Fredman et al.
[Princeton University. Department of Computer Science. CS-TR-008-85.
1985.]
103450 POLICIES FOR DYNAMIC VOTE REASSIGNMENT.
D. Barbara, H. Garcia-Molina, and A. Spauster.
[Princeton University. Department of Computer Science. CS-TR-010-85.
1985.]
103451 A PROPOSED ARCHITECTURE FOR A MASSIVE MEMORY MACHINE.
D. Lopresti.
[Princeton University. Department of Computer Science. TR CS-011.
1985.]
103452 OPTIMIZING SHADOW RECOVERY ALGORITHMS.
J. Kent and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-012-85.
1985.]
103453 TWO STREAMLINED DEPTH-FIRST SEARCH ALGORITHMS.
R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-013-86.
1985.]
103454 GEOMETRIC COMPLEXITY AND COMPUTER GRAPHICS -- DOES THEORY APPLY IN
PRACTICE?
D. P. Dobkin.
[Princeton University. Department of Computer Science. CS-TR-014-85.
1985.]
103455 AN EXAMPLE OF STRUCTURED EXPLANATION GENERATION.
M. A. Bienkowski.
[Princeton University. Department of Computer Science. CS-TR-016-85.
1985.]
103456 DESIGN OF AN INTERLEAVED MASSIVE MEMORY MACHINE.
A. Park.
[Princeton University. Department of Computer Science. Technical
report 17. 1985.]
103457 A PROGRAMMING ENVIRONMENT FOR FORTRAN.
R. T. Hood and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 84-1. 1984.]
103458 EFFICIENT ABSTRACTIONS FOR THE IMPLEMENTATION OF STRUCTURED EDITORS
(SUMMARY).
R. T. Hood.
[Rice University. Department of Computer Science. Computer science
technical report 84-3. 1984.]
103459 AN INCREMENTAL UNPARSER FOR STRUCTURED EDITORS (SUMMARY).
M. A. Caplinger and R. T. Hood.
[Rice University. Department of Computer Science. Computer science
technical report 84-4. 1984.]
103460 TYPES AS INTERVALS.
R. Cartwright.
[Rice University. Department of Computer Science. Computer science
technical report 84-5. 1984.]
103461 THE IMPACT OF INTERPROCEDURAL ANALYSIS AND OPTIMIZATION ON THE DESIGN
OF A SOFTWARE DEVELOPMENT ENVIRONMENT.
K. D. Cooper, K. Kennedy, and L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 84-6. 1984.]
103462 INTERPROCEDURAL OPTIMIZATION: ELIMINATING UNNECESSARY RECOMPILATION.
K. D. Cooper, K. Kennedy, and L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 85-7. 1985.]
103463 A PARALLEL PROGRAMMING ENVIRONMENT.
J. R. Allen and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 84-8. 1984.]
103464 AUTOMATIC TRANSLATION OF FORTRAN PROGRAMS TO VECTOR FORM.
J. R. Allen and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 84-9. 1984.]
103465 INTERPROCEDURAL INFORMATION IN A PROGRAMMING ENVIRONMENT.
R. T. Hood and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 85-10. 1985.]
103466 STRUCTURED EDITOR SUPPORT FOR MODULARITY AND DATA ABSTRACTION.
M. A. Caplinger.
[Rice University. Department of Computer Science. Computer science
technical report 85-11. 1985.]
103467 UNDERSTANDING AND EXPLOITING DISTRIBUTION.
G. T. Almes and W. Zwaenepoel.
[Rice University. Department of Computer Science. Computer science
technical report 85-12. 1985.]
103468 DISTRIBUTED PROCESS GROUPS IN THE V KERNEL.
D. R. Cheriton and W. Zwaenepoel.
[Rice University. Department of Computer Science. Computer science
technical report 85-13. 1985.]
103469 IMPLEMENTATION AND PERFORMANCE OF PIPES IN THE V-SYSTEM.
W. Zwaenepoel.
[Rice University. Department of Computer Science. Computer science
technical report 85-14. 1985.]
103470 EFFICIENT APPLICATIVE OPERATIONS ON RECURSIVE DATA STRUCTURES.
R. T. Hood.
[Rice University. Department of Computer Science. Computer science
technical report 85-15. 1985. Summary.]
103471 A PROGRAMMER'S INTRODUCTION TO RUSSELL.
H.-J. Boehm, A. Demers, and J. Donahue.
[Rice University. Department of Computer Science. Computer science
technical report 85-16. 1985.]
103472 PTOOL: A PRELIMINARY DESIGN.
J. R. Allen and A. Porterfield.
[Rice University. Department of Computer Science. Computer science
technical report 85-17. 1985.]
103473 PROGRAMMING ENVIRONMENTS FOR SUPERCOMPUTERS.
J. R. Allen and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 85-18. 1985.]
103474 A COMPLETE PROOF SYSTEM FOR AN ACCEPTANCE-REFUSAL MODEL OF CSP.
W. G. Golson.
[Rice University. Department of Computer Science. Computer science
technical report 85-19. 1985.]
103475 THE R SUPERSCRIPT N PROJECT, RICE UNIVERSITY PROGRESS REPORT 1984-85.
R. Cartwright et al.
[Rice University. Department of Computer Science. Computer science
technical report 85-20. 1985.]
103476 COMPILATION DEPENDENCIES IN AN AMBITIOUS OPTIMIZING COMPILER.
L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 85-21. 1985. Thesis (Ph.D.).]
103477 PROTOCOLS FOR LARGE DATA TRANSFERS OVER LOCAL NETWORKS.
W. Zwaenepoel.
[Rice University. Department of Computer Science. Computer science
technical report 85-23. 1985.]
103478 OPTIMIZATION OF COMPILED CODE IN THE R SUPERSCRIPT N PROGRAMMING
ENVIRONMENT.
K. D. Cooper, K. Kennedy, and L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 85-24. 1985.]
103479 IMPLEMENTING RUSSELL.
H.-J. Boehm and A. Demers.
[Rice University. Department of Computer Science. Computer science
technical report 85-25. 1985.]
103480 THE IMPACT OF LANGUAGE AND SYSTEM ON REMOTE PROCEDURE CALL DESIGN.
G. T. Almes.
[Rice University. Department of Computer Science. Computer science
technical report 85-26. 1985.]
103481 THE IMPACT OF INTERPROCEDURAL ANALYSIS AND OPTIMIZATION IN THE R
SUPERSCRIPT N PROGRAMMING ENVIRONMENT.
K. D. Cooper, K. Kennedy, and L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 85-27. 1985.]
103482 A SINGLE INTERMEDIATE LANGUAGE FOR PROGRAMMING ENVIRONMENTS.
M. A. Caplinger.
[Rice University. Department of Computer Science. Computer science
technical report 85-28. 1985. Thesis (Ph.D.). "This is the technical
report version of a dissertation submitted in partial fulfillment of
the requirements for the Ph.D. degree in Computer Science."]
103483 INTERPROCEDURAL CONSTANT PROPAGATION.
K. D. Cooper, K. Kennedy, and L. M. Torczon.
[Rice University. Department of Computer Science. Computer science
technical report 85-29. 1985.]
103484 CONNECTING THE RICE CAMPUS NETWORK TO PHASE 1 NSFNET.
G. T. Almes.
[Rice University. Department of Computer Science. Computer science
technical report 86-30. 1986.]
103485 PTOOL: A SEMI-AUTOMATIC PARALLEL PROGRAMMING ASSISTANT.
J. R. Allen et al.
[Rice University. Department of Computer Science. Computer science
technical report 86-31. 1986.]
103486 CHARACTERISTICS OF A PARALLEL PROGRAMMING ENVIRONMENT.
J. R. Allen, R. T. Hood, and K. Kennedy.
[Rice University. Department of Computer Science. Computer science
technical report 86-32. 1986.]
103487 TAXICABS AND LEAST-COST PARTITION ALGORITHMS.
T. J. Marlowe Jr..
[Rutgers. Department of Computer Science. Technical report
DCS-TR-169. 1986.]
103488 THE GENERAL CONSISTENT LABELING (OR CONSTRAINT SATISFACTION) PROBLEM.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-170. 1986.]
103489 THREE CONSTRAINT SATISFACTION ALGORITHMS AND THEIR COMPLEXITIES:
SEARCH-ORDER DEPENDENT AND EFFECTIVELY INSTANCE-SPECIFIC RESULTS.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-171. 1986.]
103490 INCREMENTAL UPDATING OF DEPTH-FIRST SEARCH TREES.
M. G. Sackrowitz.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-172. 1986.]
103491 SIMPLIFIED STABLE MERGING TASKS.
J. Salowe and W. L. Steiger.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-173. 1986.]
103492 DETERMINISTIC SELECTION IN O(LOGLOG N) PARALLEL TIME.
M. Ajtai et al.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-174. 1986.]
103493 FPOPT: A GLOBALLY OPTIMIZING COMPILER FOR FP.
J. S. Pendergrast and B. G. Ryder.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-175. 1986.]
103494 WAVE PROPAGATION ANALYSIS OF THE BOX AND OTHER IMPLICIT
APPROXIMATIONS OF HYPERBOLIC EQUATIONS.
R. Vichnevetsky.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-176. 1986.]
103495 ON THE EXISTENCE OF WEAK GREEDY MATCHING HEURISTICS.
M. D. Grigoriadis, B. Kalantari, and C. Y. Lai.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-75. 1985.]
103496 A NEW CLASS OF HEURISTIC ALGORITHMS FOR WEIGHTED PERFECT MATCHING.
M. D. Grigoriadis and B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-76. 1985.]
103497 A FAST ALGORITHM FOR TRUMMER'S PROBLEM.
A. Gerasoulis, M. D. Grigoriadis, and L. Sun.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-77. 1985.]
052046 CONSTRAINTS ON ORDER.
H. Uszkoreit.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-46. 1986.]
052047 LINEAR PRECEDENCE IN DISCONTINUOUS CONSTITUENTS: COMPLEX FRONTING IN
GERMAN.
H. Uszkoreit.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-47. 1986.]
052048 A COMPILATION OF PAPERS ON UNIFICATION-BASED GRAMMAR FORMALISMS.
PARTS I AND II.
S. M. Shieber et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-48. 1986.]
038265 DESIGN FOR TESTABILITY REPRINTS.
E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Center for
Reliable Computing. Report no. 85-6. 1985. "This report contains
reprints of papers which appeared in the December 1984 issue of 'VLSI
Design' magazine and in the April 1985 issue of 'IEEE Design & Test
of Computers' magazine." Also issued as Technical note 85-265,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
038266 CONCURRENT ERROR DETECTION USING WATCHDOG PROCESSORS - A SURVEY.
A. Mahmood and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-266. 1985. Also issued as
Report no. 85-7, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038267 THE WATCHDOG TASK: CONCURRENT ERROR DETECTION USING ASSERTIONS.
A. Ersoz, D. M. Andrews, and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-267. 1985. Also issued as
Report no. 85-8, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038268 LIST AND DOCUMENTATION OF THE PLA TESTABILITY PROGRAM.
S. Bozorgui-Nesbat.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-268. 1985. Also issued as
Report no. 85-9, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038269 NETWORK SEGMENTATION FOR PSEUDO-EXHAUSTIVE TESTING.
E. C. Archambeau.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-269. 1985. Also issued as
Report no. 85-10, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038270 PREPRINTS OF THE INTERNATIONAL TEST CONFERENCE 1985.
[Stanford University. Stanford Electronics Laboratories. Center for
Reliable Computing. Report no. 85-11. 1985. "This technical report
contains preprints of [4] papers accepted for presentation at the
International Test Conference 1985, Philadelphia, Pennsylvania,
November 19-21, 1985." Also issued as Technical note 85-270, Computer
Systems Laboratory, Stanford Electronics Laboratories, Stanford
University.]
038271 DELAY TESTING OF DIGITAL CIRCUITS USING PSEUDORANDOM INPUT SEQUENCES.
K. D. Wagner.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-271. 1985. Also issued as
Report no. 85-12, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038272 AN ENHANCED DAISY TESTABILITY ANALYZER (DTA).
L.-T. Wang and E. Law.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-272. 1985. Also issued as
Report no. 85-13, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038273 TEST LENGTH FOR PSEUDO RANDOM TESTING.
C. K. Chin and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-273. 1985. Also issued as
Report no. 85-14, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038274 DYNAMIC ASSERTION TESTING OF FLIGHT CONTROL SOFTWARE.
D. M. Andrews, A. Mahmood, and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-274. 1985. Also issued as
Report no. 85-15, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038275 DEL STRUCTURE CACHEING.
W. L. Lynch.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-275. 1985.]
038276 EFFECT OF SUPPLY VOLTAGE ON CIRCUIT PROPAGATION DELAY AND TEST
APPLICATIONS.
K. D. Wagner and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-276. 1985. Also issued as
Report no. 85-17, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038277 FINAL REPORT: THE MEASUREMENT AND MODELING OF COMPUTER RELIABILITY AS
AFFECTED BY SYSTEM ACTIVITY.
D. M. Andrews and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-277. 1985. Also issued as
Report no. 85-18, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038278 VERIFICATION TESTING OF PROGRAMMABLE LOGIC ARRAYS.
S. Bozorgui-Nesbat and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-278. 1985. Also issued as
Report no. 85-19, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038279 A METHODOLOGY FOR ANALYSIS OF FAILURE PREDICTION DATA.
F. A. Nassar and D. M. Andrews.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-279. 1985. Also issued as
Report no. 85-20, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038280 MEASUREMENT AND MODELING OF COMPUTER RELIABILITY AS AFFECTED BY
SYSTEM ACTIVITY.
R. K. Iyer, D. J. Rossetti, and M. C. Hsueh.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-280. 1985. Also issued as
Report no. 85-21, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038281 CONDENSED LINEAR FEEDBACK SHIFT REGISTER (LFSR) TESTING -- A
PSEUDO-EXHAUSTIVE TEST TECHNIQUE.
L.-W. Wang and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-281. 1985. Also issued as
Report no. 85-24, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038282 A METHODOLOGY FOR TESTING FAULT-TOLERANT SOFTWARE.
D. M. Andrews, A. Mahmood, and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-282. 1985. Also issued as
Report no. 85-22, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038284 STUCK-AT FAULT DETECTION IN PARITY TREES.
S. Mourad, L. A. Hughes, and E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-284. 1985. Also issued as
Report no. 85-23, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038285 A COMPARISON OF TEST PATTERN GENERATION TECHNIQUES.
E. J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 85-285. 1985. Also issued as
Report no. 85-16, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
038286 MICROPROGRAM CONTROL OF A PROLOG MACHINE.
K. Koyama.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 86-286. 1986.]
038287 PREPRINTS.
[Stanford University. Stanford Electronics Laboratories. Center for
Reliable Computing. Report no. 86-1. 1986. "This technical report
contains preprints and reprints [of papers presented at various
conferences by members of the Center for Reliable Computing]." Also
issued as Technical note 86-287, Computer Systems Laboratory,
Stanford Electronics Laboratories, Stanford University.]
038288 BIBLIOGRAPHY OF 1975-1985 CRC PUBLICATIONS.
J. McCluskey.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical note 86-288. 1986. Also issued as
Report no. 86-0, Center for Reliable Computing, Stanford Electronics
Laboratories, Stanford University.]
035270 A MODEL AND TEMPORAL PROOF SYSTEM FOR NETWORKS OF PROCESSES.
V. Nguyen, D. Gries, and S. S. Owicki.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-270. 1985.]
035277 THROUGHPUT PERFORMANCE OF A DIRECT SEQUENCE CDMA PACKET RADIO NETWORK.
J. S. Storey and F. A. Tobagi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-277. 1985. Also issued as
SURAN temporary note 20, Survivable Packet Radio Network Project
(SURAN).]
035278 PERFORMANCE EVALUATION OF CHANNEL ACCES SCHEMES IN MULTISHOP PACKET
RADIO NETWORKS WITH REGULAR STRUCTURE BY SIMULATION.
F. A. Tobagi and D. H. Shur.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-278. 1985. Also issued as
SURAN temporary note 33, Survivable Packet Radio Network Project
(SURAN).]
035279 MULTI-LEVEL LOGIC ARRAY SYNTHESIS.
C. Rowen.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-279. 1985. Thesis (Ph.D.).]
035281 PROLOG MEMORY-REFERENCING BEHAVIOR.
E. Tick.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-281. 1985.]
035290 HIGH-RESOLUTION PRINTING WITHOUT A FRAME BUFFER.
C. F. Bell.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 85-290. 1985. Thesis (Ph.D.).]
035291 LISP AND PROLOG MEMORY PERFORMANCE.
E. Tick.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 86-291. 1986.]
035292 ON THE PERFORMANCE EFFECTS OF STATION LOCATIONS AND ACCESS PROTOCOL
PARAMETERS IN ETHERNET NETWORKS.
T. A. Gonsalves and F. A. Tobagi.
[Stanford University. Stanford Electronics Laboratories. Computer
Systems Laboratory. Technical report 86-292. 1986.]
103498 AMALGAMATION OF GRAPH MANIPULATIONS.
P. Boehm, H.-R. Fonio, and A. Habel.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103499 ALGEBRAIC SPECIFICATION OF MODULES.
H. Ehrig and H. Weber.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103500 CONCURRENT TRANSFORMATIONS OF RELATIONAL STRUCTURES.
H. Ehrig, A. Habel, and B. K. Rosen.
[Technische Universitaet Berlin. Fachbereich Informatik. 1986.]
103501 FUNDAMENTALS OF ALGEBRAIC SPECIFICATION 1: EQUATIONS AND INITIAL
SEMANTICS. CHAPTER 9: CONCEPTS OF A SPECIFICATION LANGUAGE. CHAPTER
10: SEMANTICS OF THE SPECIFICATION LANGUAGE ACT ONE.
H. Ehrig and B. Mahr.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.
Preprint of chapters 9 and 10 from the authors' forthcoming book.]
103502 GRAPH GRAMMARS WITH APPLICATION CONDITIONS.
H. Ehrig and A. Habel.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103503 TOWARDS PROGRAMMING IN THE LARGE WITH ALGEBRAIC MODULE SPECIFICATIONS.
H. Ehrig and H. Weber.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103504 SPECIFICATION OF MODULAR SYSTEMS.
H. Weber and H. Ehrig.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103505 SOME STRUCTURAL ASPECTS OF HYPERGRAPH LANGUAGES GENERATED BY
HYPEREDGE REPLACEMENT.
A. Habel and H.-J. Kreowski.
[Technische Universitaet Berlin. Fachbereich Informatik. 1985.]
103506 OSI TRANSPORT SERVICE CONSIDERED AS AN ABSTRACT DATA TYPE.
K. P. Hasler and J. de Meer.
[Technische Universitaet Berlin. Fachbereich Informatik. n.d.]
103507 A STORAGE MANAGEMENT SYSTEM: AN EXAMPLE FOR AN ALGEBRAIC
SPECIFICATION AND ITS PROOF TECHNIQUES.
U. Hummert and K.-J. Werner.
[Technische Universitaet Berlin. Fachbereich Informatik. Report no.
85-17. 1985.]
103508 OPTIMALLY PARALLEL ALGORITHMS FOR CONVEX HULL DETERMINATION.
H. Wagener.
[1985.]
103509 AN IMPLEMENTATION FOR NOISE SUPPRESSION IN IMAGES.
P. H. Mowforth and Z. P. Jin.
[Turing Institute. TIRM-85-011. 1985.]
103510 THE SUPERARTICULACY PHENOMENON IN THE CONTEXT OF SOFTWARE MANUFACTURE.
D. Michie.
[Turing Institute. TIRM-85-013. 1984.]
103511 AI AND ROBOTICS: FLEXIBILITY AND INTEGRATION.
P. H. Mowforth and I. Bratko.
[Turing Institute. TIRM-86-014. 1986.]
103512 A HIERARCHICALLY-BASED REMOTE FUNCTION CALL MECHANISM FOR
INTERPRETERS.
A. Shapiro.
[Turing Institute. TIRM-86-016. 1986.]
103513 CHARACTERISTICS OF GRAPH LANGUAGES GENERATED BY EDGE REPLACEMENT.
A. Habel and H.-J. Kreowski.
[Universitaet Bremen. Fachbereich Mathematik/Informatik. Report no.
3/85. 1985.]
103514 UN SYSTEME DE CORRECTION AUTOMATIQUE DES ACCORDS DES PARTICIPES
PASSES.
D. Richard and G. Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 535. 1985.]
103515 SELF-ADJUSTING NETWORKS FOR VLSI SIMULATION.
J. Gecsei and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 539. 1986.]
103516 MODELLING AND SPECIFICATION OF SERVICES AND BEHAVIOR IN DISTRIBUTED
SYSTEMS.
R. Gotzhein and S. Keramidis.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 545. 1985.]
103517 A MAXIMAL DISTANCE RESULT OF INTEREST IN ROBOTIC SIMULATION.
L.-E. Andersson, G. Hurteau, and N. F. Stewart.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 546. 1985.]
103518 A MIXED-MODE HIERARCHICAL VLSI SIMULATOR.
J. Cloutier, E. Cerny, and J. Hlavicka.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 548. 1985.]
103519 THE EVOLUTION OF END-USER LANGUAGES.
C. Frasson.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 549. 1985.]
103520 LATTICE MODEL OF BROWSEABLE DATA SPACES.
R. Godin, E. Saunders, and J. Gecsei.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 550. 1985.]
103521 MAXIMAL DISTANCE FOR ROBOTIC SIMULATION - THE CONVEX CASE.
L.-E. Andersson and N. F. Stewart.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 551. 1985.]
103522 GENIAL: UN GENERATEUR D'INTERFACE EN LANGUE NATURELLE.
B. Pelletier and J. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 553. 1985.]
103523 A METHODOLOGY FOR IMPLEMENTING HIGH LEVEL COMMUNICATION PROTOCOLS.
J. M. Serre, E. Cerny, and G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 555. 1986.]
103524 TRANSPORT RELAYS.
G. v. Bochmann, A. Jacques, and C. Kawa.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 556. 1986.]
103525 RECENT DEVELOPMENTS IN PROTOCOL SPECIFICATION, VALIDATION AND TESTING.
G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 557. 1986.]
103526 SEQUENTIAL C-TESTABILITY OF UNILATERAL ONE-DIMENSIONAL COMBINATIONAL
ITERATIVE ARRAYS.
E. M. Aboulhamid.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 558. 1986.]
103527 PROBLEMS COMPLETE FOR DETERMINISTIC LOGARITHMIC SPACE.
S. A. Cook and P. McKenzie.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 560. 1986.]
103528 SPECIFYING ABSTRACT DATA TYPES WITH LOTOS.
R. Gotzhein.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 561. 1986.]
103529 DERIVING PROTOCOL SPECIFICATIONS FROM SERVICE SPECIFICATIONS.
G. v. Bochmann and R. Gotzhein.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 562. 1986.]
103530 BUILT-IN SELF TEST OF A CMOS ALU.
E. Cerny, G. Bois, and E. M. Aboulhamid.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 563. 1986.]
103531 A DISTRIBUTED MIXED-MODE HIERARCHICAL SIMULATOR.
J. Cloutier, C. Roy, and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 564. 1986.]
103532 OPTIMAL BLOCK REPLACEMENT POLICIES WITH MULTIPLE CHOICE AT FAILURE.
D. A. Kadi and R. Cleroux.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 566. 1986.]
103533 NORMALIZATION AND QUOTIENT DIGIT SELECTION FOR A VARIABLE PRECISION
ARITHMETIC UNIT.
J. E. Robertson.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1229. 1986.]
103534 THE GENERALIZED SRT ITERATION FOR LINEAR SYSTEMS OF EQUATIONS.
S. F. Ashby.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1234. 1986.]
103535 AUTOMATIC RANDOM LOGIC LAYOUT SYNTHESIS - A MODULE GENERATOR APPROACH.
M.-L. Yu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1244. 1986. Thesis (Ph.D.).]
103536 DYNAMIC CONTROL STRUCTURES FOR COOPERATING PROCESSES.
M. R. Railey.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1257. 1986. Thesis (Ph.D.).]
103537 PROGRAM PARTITIONING AND SYNCHRONIZATION ON MULTIPROCESSOR SYSTEMS.
J.-K. Peir.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1259. 1986. Thesis (Ph.D.).]
103538 STENCILS AND PROBLEM PARTITIONINGS: THEIR INFLUENCE ON THE
PERFORMANCE OF MULTIPLE PROCESSOR SYSTEMS.
D. A. Reed, L. M. Adams, and M. L. Patrick.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1262. 1986.]
103539 PROBABILISTIC RULE GENERATOR.
W. D. Lee and S. R. Ray.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1263. 1986.]
103540 PROBABILISTIC RULE GENERATOR: A NEW METHODOLOGY OF VARIABLE-VALUED
LOGIC SYNTHESIS.
W. D. Lee and S. R. Ray.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1264. 1986.]
103541 EQUATIONAL PROGRAMMING.
N. Dershowitz and D. A. Plaisted.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1265. 1986.]
103542 MEDIATORS: A HIGH-LEVEL LANGUAGE CONSTRUCT FOR DISTRIBUTED SYSTEMS.
J. E. Grass.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1266. 1986. Thesis (Ph.D.).]
103543 A GENERAL FRAMEWORK FOR INDUCTION AND A STUDY OF SELECTIVE INDUCTION.
L. Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1270. 1986.]
103544 EXPERT SYSTEMS IN MEDICAL STUDIES - A NEW TWIST.
J. R. Slagle et al.
[University of Minnesota. Computer Science Department. TR 86-3. 1986.]
103545 A PROTOTYPING LANGUAGE FOR REAL TIME SOFTWARE.
V. B. Lugi and R. T. Yeh.
[University of Minnesota. Computer Science Department. TR 86-4. 1986.]
103546 AN INTERPRETIVE TECHNIQUE FOR EVALUATING FUNCTIONAL ATTRIBUTE
GRAMMARS.
R. M. Herndon Jr. and V. A. Berzins.
[University of Minnesota. Computer Science Department. TR 86-5. 1986.]
103547 A METHOD FOR THE CONSTRUCTION OF DYNAMIC, LAZY EVALUATORS FOR
FUNCTIONAL ATTRIBUTE GRAMMARS.
R. M. Herndon Jr. and V. A. Berzins.
[University of Minnesota. Computer Science Department. TR 86-6. 1986.]
103548 AN ENHANCED HEURISTIC FOR MULTI-CHANNEL OPTIMIZATION IN GATE-ARRAY
LAYOUT.
L. Lin, S. Sahni, and E. Shragowitz.
[University of Minnesota. Computer Science Department. TR 86-7. 1986.]
103549 SIMULATION OF LARGE EDEN CLUSTERS ON A CRAY-2.
J. G. Zabolitzky and D. Stauffer.
[University of Minnesota. Supercomputer Institute. UMSI 86/22. 1986.]
103550 DYNAMIC SCALING OF EDEN CLUSTER SURFACES.
D. Stauffer and J. G. Zabolitzky.
[University of Minnesota. Supercomputer Institute. UMSI 86/23. 1986.]
103551 REEXAMINATION OF 3D PERCOLATION THRESHOLD ESTIMATES.
D. Stauffer and J. G. Zabolitzky.
[University of Minnesota. Supercomputer Institute. UMSI 86/24. 1986.]
103552 THE RESPONSE FUNCTION METHOD FOR SPECIFYING CONCURRENT SYSTEMS.
O. Owe.
[University of Oslo. Institute for Informatics. Research report 96.
1986.]
103553 THE APPLICATION PERSPECTIVE IS A FRAME FOR UNDERSTANDING DEVELOPMENT
OF COMPUTER-BASED SYSTEMS FOR NURSES.
G. Bjerknes and T. Bratteteig.
[University of Oslo. Institute for Informatics. Research report 97.
1986.]
103554 FLORENCE IN WONDERLAND. SYSTEM DEVELOPMENT WITH NURSES.
G. Bjerknes and T. Bratteteig.
[University of Oslo. Institute for Informatics. Research report 98.
1986.]
103555 THEOREM PROVING IN CLASSICAL LOGIC APPLIED WITHIN A LOGIC FOR SYSTEM
SPECIFICATION.
M. Holden.
[University of Oslo. Institute for Informatics. Research report 99.
1986. Thesis (Ph.D.).]
103556 GUIDE TO DESIGNING INSTRUCTION AND DOCUMENTATION FOR COMPUTING
HARDWARE AND SOFTWARE.
A. H. J. Sale.
[University of Tasmania. Department of Information Science. R85-6.
1985.]
103557 INCLUDING AN EXPLICIT MEMORY MODEL IN A MACHINE DESCRIPTION.
C. A. Lakos.
[University of Tasmania. Department of Information Science. R85-7.
1985.]
103558 RULE-BASED EXPERT SYSTEMS.
J. P. H. Coleman.
[University of Tasmania. Department of Information Science. R86-1.
1986.]
103559 TYPED LOGICAL CALCULUS.
M. Sato.
[University of Tokyo. Department of Information Science. Technical
report 85-13. 1985.]
103560 FORM TRANSFORMER - A FORMALISM FOR OFFICE MANIPULATION.
H. Kitagawa and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 85-14. 1980.]
103561 A MENU GENERATOR FOR AUDIO VISUAL NETWORKS.
T. L. Kunii, Y. Shirota, and T. Noma.
[University of Tokyo. Department of Information Science. Technical
report 85-15. 1985.]
103562 CONTRACTIBLE EDGES IN GRAPHS WITH LARGE MINIMUM DEGREE.
A. Saito.
[University of Tokyo. Department of Information Science. Technical
report 85-16. 1985.]
103563 MULTIMEDIA WORKSTATION - PIE.
M. Ohta et al.
[University of Tokyo. Department of Information Science. Technical
report 85-17. 1985.]
103564 MULTIMEDIA INFORMATION PROCESSING BASED ON A GENERAL MEDIA MODEL.
M. Ohta et al.
[University of Tokyo. Department of Information Science. Technical
report 85-18. 1985.]
103565 PSUEDO-RANDOM ROUNDING FOR TRUNCATED MULTIPLIERS.
N. Yoshida, E. Goto, and S. Ichikawa.
[University of Tokyo. Department of Information Science. Technical
report 86-01. 1986.]
103566 THE DESIGN AND EVALUATION OF A TEXT-RETRIEVAL MACHINE FOR LARGE
DATABASES.
D. L. Lee.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-172. 1985. Thesis (Ph.D.).]
103567 A FOUNDATIONAL APPROACH TO CONJECTURE AND KNOWLEDGE.
J. P. Delgrande.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-173. 1985. Thesis (Ph.D.).]
103568 ORDERINGS AND SOME COMBINATORIAL OPTIMIZATION PROBLEMS WITH GEOMETRIC
APPLICATIONS.
A. Lubiw.
[University of Toronto. Department of Computer Science. Technical
report 186/86. 1986. Thesis (Ph.D.).]
103569 PROVING MONITOR PROOF RULES.
L. S. Nielsen and A. P. Black.
[University of Washington. Department of Computer Science. Technical
report 85-08-01. 1985.]
103570 REASONING ABOUT INTERACTIVE SYSTEMS.
V. Ambriola and D. Notkin.
[University of Washington. Department of Computer Science. Technical
report 85-08-02. 1985.]
103571 TENSOR RANK AND THE COMPUTATIONAL COMPLEXITY OF STRAIGHT LINE
PROGRAMS.
R. S. Fowler.
[University of Washington. Department of Computer Science. Technical
report 85-08-03. 1985. Thesis (M.S.).]
103572 DISTRIBUTION AND ABSTRACT TYPES IN EMERALD.
A. P. Black et al.
[University of Washington. Department of Computer Science. Technical
report 85-08-05. 1985.]
103573 REPLICATION IN DISTRIBUTED SYSTEMS: THE EDEN EXPERIENCE.
J. D. Noe, A. B. Proudfoot, and C. Pu.
[University of Washington. Department of Computer Science. Technical
report 85-08-06. 1985.]
103574 USER INTERFACE COMPONENTS BASED ON A MULTIPLE WINDOW PACKAGE.
C. Binding.
[University of Washington. Department of Computer Science. Technical
report 85-08-07. 1985.]
103575 A USER INTERFACE DESIGN FOR DEAF-BLIND USERS.
R. Ladner, D. Gentry, and R. Day.
[University of Washington. Department of Computer Science. Technical
report 85-08-09. 1985. Preliminary report.]
103576 ARCHITECTURAL ISSUES FOR INTERMEDIATE-LEVEL VISION.
S. L. Tanimoto.
[University of Washington. Department of Computer Science. Technical
report 85-08-11. 1985.]
103577 A DUAL-PURPOSE MODULE INTERCONNECTION LANGUAGE.
D. Notkin.
[University of Washington. Department of Computer Science. Technical
report 85-10-06. 1985.]
103578 STEREO: A NEW SYSTEM FOR IMPROVING ACCURACY OF RADIATION THERAPY
PLANNING.
A. W. Borning.
[University of Washington. Department of Computer Science. Technical
report 85-11-01. 1985.]
103579 A NON-SYSTOLIC MATRIX PRODUCT ALGORITHM.
P. A. Nelson.
[University of Washington. Department of Computer Science. Technical
report 85-11-02. 1985.]
103580 DECENTRALIZED OBJECT FINDING USING FORWARDING ADDRESSES.
R. J. Fowler.
[University of Washington. Department of Computer Science. Technical
report 85-12-01. 1985. Thesis (Ph.D.).]
103581 AUTOMATED GENERATION OF MICROCONTROLLERS.
B. W. Jinks, D. L. Pulfrey, and W. S. Snyder.
[University of Washington. Department of Computer Science. Technical
report 85-12-02. 1985.]
103582 REPLECTS: DATA REPLICATION IN THE EDEN SYSTEM.
A. B. Proudfoot.
[University of Washington. Department of Computer Science. Technical
report 85-12-04. 1985. Thesis (Ph.D.).]
103583 COMPUTING A NEW CLASS OF PAINT BRUSHES.
D. Field.
[University of Waterloo. Department of Computer Science. CS-85-29.
1985.]
103584 FAST HIT DETECTION FOR DISJOINT RECTANGLES.
D. Field.
[University of Waterloo. Department of Computer Science. CS-85-53.
1985.]
103585 THE EQUIVALENCE OF FINITE VALUED TRANSDUCERS (ON HDTOL LANGUAGES) IS
DECIDABLE.
K. Culik II and J. Karhumaki.
[University of Waterloo. Department of Computer Science. Research
report CS-86-01. 1986.]
103586 SPARSE CHOLESKY FACTORIZATION ON A LOCAL-MEMORY MULTIPROCESSOR.
A. George et al.
[University of Waterloo. Department of Computer Science. CS-86-02.
1986.]
103587 REAL TIME, PSEUDO REAL TIME AND LINEAR TIME ITA.
K. Culik II and S. Yu.
[University of Waterloo. Department of Computer Science. Research
report CS-86-03. 1986.]
103588 SYNCHRONIZABLE DETERMINISTIC PUSHDOWN AUTOMATA AND THE DECIDABILITY
OF THEIR EQUIVALENCE.
K. Culik II and J. Karhumaki.
[University of Waterloo. Department of Computer Science. Research
report CS-86-04. 1986.]
103589 EQUATIONAL LOGIC PROGRAMMING.
M. H. van Emden and K. Yukawa.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-05. 1986.]
103590 THEORIST: A LOGICAL REASONING SYSTEM FOR DEFAULTS AND DIAGNOSIS.
D. L. Poole, R. Goebel, and R. Aleliunas.
[University of Waterloo. Department of Computer Science. Research
report CS-86-06. 1986.]
103591 DEFAULT REASONING AND DIAGNOSIS AS THEORY FORMATION.
D. L. Poole.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-08. 1986.]
103592 TUTORIAL DIAGNOSIS OF SUBTRACTION ERRORS.
R. Bryant.
[University of Waterloo. Department of Computer Science. Research
report CS-86-09. 1986.]
103593 CONSTRAINED NONLINEAR LEAST SQUARES: AN EXACT PENALTY APPROACH WITH
STRUCTURED QUASI-NEWTON UPDATES.
N. Mahdavi-Amiri and R. H. Bartels.
[University of Waterloo. Department of Computer Science. Research
report CS-86-10. 1986.]
103594 AP: AN ASSERTIONAL PROGRAMMING SYSTEM.
M. H. M. Cheng and K. Yukawa.
[University of Waterloo. Department of Computer Science. Research
report CS-86-11. 1986.]
103595 ROBIN HOOD HASHING.
P. Celis.
[University of Waterloo. Department of Computer Science. CS-86-14.
1986. Thesis (Ph.D.).]
103596 RATIONAL EQUIVALENCE RELATIONS.
J. H. Johnson.
[University of Waterloo. Department of Computer Science. Research
report CS-86-16. 1986.]
103597 A LOGIC DATA MODEL FOR THE MACHINE REPRESENTATION OF KNOWLEDGE.
R. Goebel.
[University of Waterloo. Department of Computer Science. 1985. Thesis
(Ph.D.). "This report is a slightly revised version of [a] doctoral
dissertation accepted at the University of British Columbia in
October of 1985."]
103598 EXPERIENCE WITH CRYSTAL, CHARLOTTE AND LYNX.
R. Finkel et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 630. 1986.]
103599 ERROR BONDS FOR STRONGLY CONVEX PROGRAMS AND (SUPER)LINEARLY
CONVERGENT ITERATIVE SCHEMES FOR THE LEAST 2-NORM SOLUTION OF LINEAR
PROGRAMS.
O. L. Mangasarian and R. De Leone.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 631. 1986.]
103600 INTERPROCESS COMMUNICATION IN CHARLOTTE.
Y. Artsy, H.-Y. Chang, and R. Finkel.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 632. 1986.]
103601 LOAD-BALANCED TASK ALLOCATION IN LOCALLY DISTRIBUTED COMPUTER SYSTEMS.
H. Lu and M. J. Carey.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 633. 1986.]
103602 TRACKING THE ELUSIVE EUREKA.
E. Norman.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 636. 1986.]
103603 QUERY PROCESSING IN MAIN MEMORY DATABASE MANAGEMENT SYSTEMS.
T. J. Lehman and M. J. Carey.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 637. 1986.]
103604 OBJECT AND FILE MANAGEMENT IN THE EXODUS EXTENSIBLE DATABASE SYSTEM.
M. J. Carey et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 638. 1986.]
103605 APPLICATIONS GENERATORS AND FOURTH GENERATION LANGUAGES.
S. A. Raghavan and D. R. Chand.
[Wang Institute of Graduate Studies. School of Information
Technology. Technical report TR-86-02. 1986.]
103606 A MODEL FOR CONCURRENCY IN NESTED TRANSACTIONS SYSTEMS.
C. Beeri, P. A. Bernstein, and N. Goodman.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-03. 1986.]
103607 EFFICIENT PARALLEL SOLUTION OF LINEAR SYSTEMS.
V. Pan and J. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-02-85. 1985.]
103608 HYPERCUBE ALGORITHMS AND IMPLEMENTATIONS.
O. A. McBryan and E. F. Van de Velde.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-271. 1986.]
103609 SHAPE-PRESERVING SPLINE APPROXIMATION IN THE L SUBSCRIPT 1-NORM.
M. G. Cox and H. M. Jones.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 68/85. 1985.]
103610 EXECUTING TRACE SPECIFICATIONS USING PROLOG.
J. D. McLean, D. M. Weiss, and C. E. Landwehr.
[United States. Naval Research Laboratory. Report no. 8940. 1986.]
103612 EDGE-PACKINGS OF GRAPHS AND NETWORK RELIABILITY.
C. J. Colbourn.
[University of Auckland. Department of Computer Science. Report no.
3. 1986.]
103613 COGNITIVE SEMANTICS.
G. Lakoff.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Report no. 36. 1986.]
103614 TOWARD A THEORY OF PLAN RECOGNITION.
H. A. Kautz.
[University of Rochester. Department of Computer Science. TR 162.
1985.]
103615 A FORMAL BASIS FOR SYNTHESISING SYSTOLIC ARRAYS.
S. V. Rajopadhye.
[University of Utah. Department of Computer Science. UUCS-84-010.
1984. Thesis proposal for Doctor of Philosophy.]
103616 A HIERARCHICAL MODEL OF ORGANIZATION CONTROL FOR THE ANALYSIS OF
INFORMATION SYSTEMS REQUIREMENTS.
R. R. Kampfner.
[Wayne State University. Department of Computer Science. CSC-86-001.
1986.]
VOL. 8, NO. 6 08/04/86
103617 PHONOLOGICAL ANALYSIS FOR FRENCH DICTATION: PRELIMINARIES TO AN
INTELLIGENT TUTORING SYSTEM.
J. Friedman and C. Neidle.
[Boston University. Department of Computer Science. BUCS technical
report 86-004. 1986.]
103618 CATEGORIAL AND NON-CATEGORIAL LANGUAGES.
J. Friedman and R. Venkatesan.
[Boston University. Department of Computer Science. BUCS technical
report 86-005. 1986.]
103619 LOGICS OF PROGRAMS WITH BOOLEAN MEMORY.
P. Urzyczyn.
[Boston University. Department of Computer Science. BUCS technical
report 86-006. 1986.]
103620 A PARALLEL ALGORITHM FOR RECOGNIZING UNORDERED DEPTH-FIRST SEARCH.
C. A. Schevon and J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-85-21. 1985.]
103621 EMPIRICAL ANALYSIS OF PAIRING HEAP PRIORITY QUEUES.
J. T. Stasko and J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-86-02. 1986.]
103622 SOME TECHNIQUES FOR GEOMETRIC SEARCHING WITH IMPLICIT SET
REPRESENTATIONS.
B. Chazelle.
[Brown University. Computer Science Department. Technical report
CS-86-03. 1986.]
103623 HOFF PRELIMINARY DEFINITION, VERSION I(1).
B. A. Dalio.
[Brown University. Computer Science Department. Technical report
CS-86-04. 1986.]
103624 SYSTOLIC ARCHITECTURES: A CRITICAL SURVEY.
S. Manohar.
[Brown University. Computer Science Department. Technical report
CS-86-05. 1986.]
103625 PE-I: A SUPER-COPROCESSOR FOR SOLVING PDE'S.
S. Manohar and G. M. Baudet.
[Brown University. Computer Science Department. Technical report
CS-86-06. 1986.]
103626 MAILDRIVER: A DISTRIBUTED CAMPUS-WIDE MAIL SYSTEM.
R. Yampell.
[Brown University. Computer Science Department. Technical report
CS-86-07. 1986.]
103627 INFEASIBLE COMPUTATION: AN INTRODUCTION TO NP-COMPLETENESS.
E. A. Lamagna.
[Brown University. Computer Science Department. Technical report
CS-86-08. 1986.]
103628 FUSION: A FUNCTIONAL SIMULATOR FOR HIERARCHICALLY-STRUCTURED CIRCUITS.
C. L. Harkness and G. M. Baudet.
[Brown University. Computer Science Department. Technical report
CS-86-09. 1986.]
103629 MAIL SYSTEM INTERFACE ISSUES WITH A UNIX-MACINTOSH IMPLEMENTATION.
J. J. Bowe.
[Brown University. Computer Science Department. Technical report
CS-86-10. 1986. Thesis (M.S.).]
103630 SESAME: THE SPICE FILE SYSTEM.
M. R. Thompson et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-172. 1985.]
103631 ON THE EXISTENCE OF DELAY-INSENSITIVE FAIR ARBITERS: TRACE THEORY AND
ITS LIMITATIONS.
D. L. Black.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-173. 1985.]
103632 FAULT FREE PERFORMANCE VALIDATION OF A FAULT TOLERANT MULTIPROCESSOR:
BASELINE AND SYNTHETIC WORKLOAD MEASUREMENTS.
E. W. Czeck, D. P. Siewiorek, and Z. Segall.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-177. 1985.]
103633 A COMPARATIVE ANALYSIS OF COMPUTER ARCHITECTURES FOR PRODUCTION
SYSTEM MACHINES.
J. Quinlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-178. 1985. Thesis (M.S.).]
103634 SML - A HIGH LEVEL LANGUAGE FOR THE DESIGN AND VERIFICATION OF FINITE
STATE MACHINES.
M. C. Browne and E. M. Clarke.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-179. 1985.]
103635 INCREMENTAL NETWORK GENERATION IN TEMPLATE-BASED WORD RECOGNITION.
K.-F. Lee.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-181. 1985.]
103636 DESCRIBE - AN EXPLANATION FACILITY FOR AN OBJECT-BASED EXPERT SYSTEM.
R. L. Joseph et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-182. 1985.]
103637 DYPAR-I: TUTORIAL AND REFERENCE MANUAL.
M. Boggs et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-185. 1985.]
103638 OVERLOAD RESOLUTION IN ADA+.
R. G. Stockton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-186. 1985.]
103639 TYPE CHECKING AND TYPE DEDUCTION TECHNIQUES FOR POLYMORPHIC
PROGRAMMING LANGUAGES.
P. Giannini.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-187. 1985.]
103640 A SORTING SYSTEM USING VERY LOW RESOLUTION OPTICAL SENSOR ARRAY IN
ROBOT FINGERTIPS.
R. Q. Yang and M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-86-10.
1986.]
103641 PHYSICALLY-BASED SIMULATION MODEL FOR ACOUSTIC SENSOR ROBOT
NAVIGATION.
R. Kuc and M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-86-11.
1986.]
103642 TOPOLOGICALLY SWEEPING AN ARRANGEMENT.
H. Edelsbrunner and L. J. Guibas.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 9. 1986.]
103643 A POLYMORPHIC LAMBDA-CALCULUS WITH TYPE:TYPE.
L. Cardelli.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 10. 1986.]
103644 CONTROL PREDICATES ARE BETTER THAN DUMMY VARIABLES FOR REASONING
ABOUT PROGRAM CONTROL.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 11. 1986.]
103645 COMPUTABLE DIRECTORY QUERIES.
E. Dahlhaus and J. A. Makowsky.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 65. 1985. Two papers published
together.]
103646 DESIGN OF A PORTABLE DEBUGGER (BY W. HEIZ).
W. Heiz and N. Wirth.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 66. 1985. Two papers published
together.]
103647 HIGH PERFORMANCE GRAPHICS FOR EXPLORING MULTIVARIATE DATA.
C. M. Wang and H. W. Gugel.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5387. 1986.]
103648 G SUPERSCRIPT 1 INTERPOLATION OF GENERALLY UNRESTRICTED CUBIC BEZIER
CURVES.
R. F. Sarraga.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5424. 1986.]
103649 USING THE LISP LANGUAGE T FOR DATABASE IMPLEMENTATION.
J. C. Freytag, N. Goodman, and J. Ramsdell.
[Harvard University. Center for Research in Computing Technology.
TR-21-84. 1984.]
103650 PROBABILISTIC ALGORITHMS IN GROUP THEORY.
J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-01-85. 1985.]
103651 EFFICIENT VLSI FAULT SIMULATION.
J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-03-85. 1985.]
103652 COMPLEXITY OF THE GENERALIZED MOVER'S PROBLEM.
J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-04-85. 1985.]
103653 SHORTEST PATHS IN EUCLIDEAN SPACE WITH POLYHEDRAL OBSTACLES.
J. H. Reif and J. A. Storer.
[Harvard University. Center for Research in Computing Technology.
TR-05-85. 1985.]
103654 A MODEL AND AN IMPLEMENTATION OF A LOGIC PROGRAMMING ENVIRONMENT.
H. J. Komorowski and S. Omori.
[Harvard University. Center for Research in Computing Technology.
TR-07-85. 1985.]
103655 RECURSION THEORETIC TECHNIQUES IN COMPLEXITY THEORY AND COMBINATORICS.
W. I. Gasarch.
[Harvard University. Center for Research in Computing Technology.
TR-09-85. 1985. Thesis (Ph.D.).]
103656 UNIFICATION-FREE EXECUTION OF LOGIC PROGRAMS.
J. Maluszynski and H. J. Komorowski.
[Harvard University. Center for Research in Computing Technology.
TR-10-85. 1985.]
103657 FAST AND EFFICIENT ALGORITHMS FOR LINEAR PROGRAMMING AND FOR THE
LINEAR LEAST SQUARES PROBLEM.
V. Pan and J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-11-85. 1985.]
103658 CASE STUDIES IN COMPUTATION BY ANALOGY.
D. C. Stefanescu.
[Harvard University. Center for Research in Computing Technology.
TR-12-85. 1985. Thesis (Ph.D.).]
103659 EFFICIENT PARALLEL ALGORITHMS FOR GRAPH COLORING AND PARTITIONING
PROBLEMS.
H. J. Karloff, D. B. Shmoys, and D. Soroker.
[Harvard University. Center for Research in Computing Technology.
TR-13-85. 1985.]
103660 TRANSLATING RELATIONAL QUERIES INTO ITERATIVE PROGRAMS.
J. C. Freytag.
[Harvard University. Center for Research in Computing Technology.
TR-14-85. 1985. Thesis (Ph.D.).]
103661 EXTENSION OF THE PARALLEL NESTED DISSECTION ALGORITHM TO THE PATH
ALGEBRA PROBLEMS.
V. Pan and J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-15-85. 1985.]
103662 DERIVATION OF RANDOMIZED ALGORITHMS.
S. Rajasekaran and J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-16-85. 1985.]
103663 THE LOGIC OF DISTRIBUTED PROTOCOLS.
R. E. Ladner and J. H. Reif.
[Harvard University. Center for Research in Computing Technology.
TR-17-85. 1985. Preliminary report.]
103664 CONCEPTS MATHEMATIQUES ET INFORMATIQUES FORMALISES DANS LE CALCUL DES
CONSTRUCTIONS.
T. Coquand and G. Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 463. 1985.]
103665 TOWARDS A SPECIFICATION AND PROOF OF ASYNCHRONOUS SYSTEMS.
B. Gamatie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 466. 1985.]
103666 LA TRAITEMENT DES AXIOMES RECURSIFS DANS LES BASES DE DONNEES
DEDUCTIVES.
C. de Maindreville.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 467. 1985.]
103667 CRIKA QUAND LES REGLES RECONTRENT LES SCHEMAS.
F. Rechenmann and P. Vignard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 468. 1985.]
103668 FAMILLES DE PRODUITS ET ILOTS DE FABRICATION: LE CAS DE MACHINES
MULTIPLES.
H. Garcia, B. Mutel, and J.-M. Proth.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 469. 1985.]
103669 ALGORITHMIQUE PARALLELE ET DISTRIBUEE.
I. Lavallee and C. Lavault.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 471. 1985.]
103670 NUMERICAL DIFFRACTION BY AN UNIFORM GRID.
A. Bamberger, J.-C. Guillot, and P. Joly.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 472. 1986.]
103671 BASES DE DONNEES: EVALUATION DES PROGRAMMES LOGIQUES RECURSIFS PAR
DES FONCTIONS RECURRENTES.
G. Gardarin and C. de Maindreville.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 473. 1986.]
103672 AN ACTIVE SET METHOD FOR SOLVING LINEARLY CONSTRAINED NONSMOOTH
OPTIMIZATION PROBLEMS.
E. Panier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 475. 1986.]
103673 EFFICIENT EVALUATION OF RELATIONAL QUERIES USING "NESTED RELATIONS."
N. Bidoit.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 480. 1986.]
103674 ALCYONE: LA BOITE A OUTILS OBJETS.
J.-M. Hullot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 60. 1985.]
103675 MODELISATION ET GESTION D'UNIVERS 3D.
G. Hegron and P. Rives.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 61. 1985.]
103676 LE META-DECOMPILATEUR PRETTY SOUS MENTOR.
A.-M. Vercoustre.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 62. 1985.]
103677 SAISIE DE TEXTE INTERACTIVE SOUS MENTOR.
V. Migot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 63. 1985.]
103678 CRIQUET: UN OUTIL DE BASE POUR CONSTRUIRE DES SYSTEMES EXPERTS.
VERSION 5. MANUEL D'UTILISATEUR.
P. Vignard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 64. 1985.]
103679 A VARIATION OF KARMARKAR'S ALGORITHM FOR SOLVING LINEAR PROGRAMMING
PROBLEMS.
E. R. Barnes.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11136. 1985.]
103680 DESIGN ELEMENTS OF A HIGH FUNCTION VIDEOTEX TERMINAL.
T. Burket and K. Kannan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11375. 1986.]
103681 PIECEWISE POLYNOMIAL SPACES AND GEOMETRIC CONTINUITY OF CURVES.
N. Dyn and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11390. 1985.]
103682 THE DESIGN OF A SELF MANAGING SECONDARY MEMORY.
B. D. Rathi, J. C. Browne, and G. J. Libovski.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11483. 1985.]
103683 PADE, STABLE PADE, AND CHEBYSHEV-PADE APPROXIMATION.
L. N. Trefethen and M. J. Gutknecht.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11603. 1985.]
103684 BLASCHKE PRODUCTS AND OPTIMAL RECOVERY IN H SUPERSCRIPT INFINITY.
N. Dyn, C. A. Micchelli, and T. J. Rivlin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11609. 1986.]
103685 FOOTPRINTS IN THE CACHE.
H. S. Stone and D. Thiebaut.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11624. 1986.]
103686 MORPHOLOGICAL OPERATIONS ON MESH CONNECTED ARCHITECTURE: A
GENERALIZED CONVOLUTION ALGORITHM.
M. Maresca and H. Li.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11627. 1986.]
103687 DISTRIBUTED OFFICE BY EXAMPLE (D-OBE).
E. Kantorowitz, F. Maryanski, and D. Shasha.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11632. 1985.]
103688 DETERMINISTIC SELFTEST.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11633. 1986.]
103689 DESCENDING SUBSEQUENCES OF RANDOM PERMUTATIONS.
S. Pilpel.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11634. 1986.]
103690 EFFICIENT FAULT SIMULATION OF CMOS CIRCUITS WITH ACCURATE MODELS.
Z. Barzilai, V. S. Iyengar, and B. K. Rosen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11635. 1986.]
103691 PARADOX OF THE ACTIVE USER.
J. M. Carroll and M. B. Rosson.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11638. 1986.]
103692 MEAN VALUE ANALYSIS BY CHAIN OF PRODUCT FORM QUEUEING NETWORKS.
A. E. Conway, E. de Souza e Silva, and S. S. Lavenberg.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11641. 1986. Revised: April 2, 1986.]
103693 ON A FUNDAMENTAL PROPERTY OF THE WIGNER DISTRIBUTION.
L. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11650. 1986.]
103694 JOINT DISTRIBUTION FOR GIVEN MARGINALS AND MOMENTS.
L. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11651. 1986.]
103695 NONLINEAR DYNAMIC BEHAVIOR OF THE TRANSCENDENTAL FUNCTION, HYPERBOLIC
COMPLEX COSH: COMPUTER GRAPHICS MAPS ITERATES IN THE MU PLANE (Z ->
COSH(Z)+MU).
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report.$v{ RC 11652. 1986.]
103696 MASON: A GLOBAL FLOOR-PLANNING APPROACH FOR VLSI DESIGN.
D. P. LaPotin and S. W. Director.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11657. 1986.]
103697 COMPUTER APPLICATION IN MANUFACTURING.
D. D. Grossman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11662. 1986.]
103698 DISTRIBUTED GARBAGE COLLECTION WITH NO GLOBAL SYNCHRONIZATION.
M. J. Beckerle and K. Ekanadham.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11667. 1986.]
103699 EXPANSIVE DYNAMICS ON ZERO-DIMENSIONAL GROUPS.
B. P. Kitchens.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11671. 1986.]
103700 SYMBOLIC DESIGN OF COMBINATIONAL AND SEQUENTIAL LOGIC CIRCUITS
IMPLEMENTED BY TWO-LEVEL LOGIC MACROS.
G. de Michelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11672. 1986.]
103701 PSIMUL - A SYSTEM FOR PARALLEL SIMULATION [OF] THE EXECUTION OF
PARALLEL PROGRAMS.
K. So et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11674. 1986.]
103702 EVON: AN EXTENDED VON NEUMANN MODEL FOR PARALLEL PROCESSING.
W.-M. Ching.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11675. 1984.]
103703 ON THE NUMBER OF MULTIPLICATIONS NEEDED TO EVALUATE THE RELIABILITY
OF K-OUT-OF-N SYSTEMS.
T. Risse.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11678. 1986.]
103704 ALGEBRAIC ASPECTS OF INTERPOLATION.
C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11679. 1986.]
103705 ON THE CONNECTIVITY AND HAMILTONICITY OF A CLASS OF RANDOM GRAPHS.
T. K. Philips.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11683. 1986.]
103706 THE MONOTONE CIRCUIT COMPLEXITY OF BOOLEAN FUNCTIONS.
N. Alon and R. B. Boppana.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4981. 1986.]
103707 DYNAMIC LOCATION PROBLEMS.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4983. 1986.]
103708 ON PLAY BY MEANS OF COMPUTING MACHINES.
N. Megiddo and A. Wigderson.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4984. 1986. Preliminary version.]
103709 ON THE COMPLEXITY OF LINEAR PROGRAMMING.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4985. 1986.]
103710 COMPUTING CIRCULAR SEPARABILITY.
J. O'Rourke, S. R. Kosaraju, and N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4986. 1986.]
103711 ON THE COMPLEXITY OF SEARCHING A GRAPH.
N. Megiddo et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4987. 1986.]
103712 R* OPTIMIZER VALIDATION AND PERFORMANCE EVALUATION FOR LOCAL QUERIES.
L. F. Mackert and G. M. Lohman.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4989. 1986.]
103713 KNOWLEDGE AND IMPLICIT KNOWLEDGE IN A DISTRIBUTED ENVIRONMENT:
PRELIMINARY REPORT.
R. Fagin and M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4990. 1986.]
103714 A SNAPSHOT DIFFERENTIAL REFRESH ALGORITHM.
B. Lindsay et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 4992. 1986.]
103715 REASONING ABOUT KNOWLEDGE: AN OVERVIEW.
J. Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5001. 1986.]
103716 STOCHASTIC COMPLEXITY AND MODELING.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5002. 1986.]
103717 AN O(N LOG N) RANDOMIZING ALGORITHM FOR THE WEIGHTED EUCLIDEAN
1-CENTER PROBLEM.
N. Megiddo and E. Zemel.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5005. 1986.]
103718 ON EPISTEMIC LOGIC AND LOGICAL OMNISCIENCE.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5022. 1986.]
103719 THE ADMINISTRATION OF DISTRIBUTED COMPUTATIONS IN A NETWORKED
ENVIRONMENT: AN INTERIM REPORT.
L. F. Cabrera, S. Sechrest, and R. Caceres.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5023. 1986.]
103720 WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH
SWITCH-OVER TIMES.
O. J. Boxma and B. Meister.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1449. 1986.]
103721 A CODED-LIGHT APPROACH FOR 3-DIMENSIONAL (3D) VISION.
F. M. Wahl.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1452. 1984.]
_______________________________________________________________________________
| |
| MASSACHUSETTS INSTITUTE OF TECHNOLOGY |
| DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE |
| VLSI MEMORANDA |
| |
| "Memos in this series...are not considered to be published |
| merely by virtue of appearing in this series. References |
| to these works should be either to the published version, |
| if any, or in the form 'private communication'...."). |
| |
| |
| |
| 099091-272 WAFER-SCALE INTEGRATION OF SYSTOLIC ARRAYS. |
| F. T. Leighton and Charles E. Leiserson. |
| [1985.] |
| |
| 099091-274 SYNTHESIS OF A SELF-TIMED CONTROLLER FOR A SUCCESSIVE- |
| APPROXIMATION A/D CONVERTER. |
| T.-A. Chu and L. A. Glasser. |
| [1985.] |
| |
| 099091-276 SYNCHRONIZER FAILURE IN A/D CONVERTERS. |
| L. A. Glasser. |
| [1985.] |
| |
| 099091-278 SIGNAL DELAY IN LEAKY RC MESH MODELS FOR BIPOLAR |
| INTERCONNECT. |
| P. O'Brien and John L. Wyatt Jr. |
| [1985.] |
| |
| 099091-281 CMOS DESIGN OF A FDDI SERIAL DATA COMMUNICATION CIRCUIT. |
| F. C. Park. |
| [1985. Thesis (B.S.).] |
| |
| 099091-282 AN AUTOMATIC PROGRAMMING APPROACH TO TESTING. |
| M. H. Shirley. |
| [1985.] |
| |
| 099091-283 A HIGH-SPEED ASYNCHRONOUS COMMUNICATION TECHNIQUE FOR MOS |
| VSLI SYSTEMS. |
| P. D. Bassett. |
| [1985. Thesis (M.S.).] |
| |
| 099091-284 AMERICAN MICROELECTRONICS IN DECLINE: EVIDENCE, ANALYSIS, |
| AND ALTERNATIVES. |
| C. H. Ferguson. |
| [1985. "This document is a draft version of approximately |
| one-third of the author's forthcoming Ph.D. thesis."] |
| |
| 099091-295 PARALLEL SIMULATION OF DIGITAL LSI CIRCUITS. |
| J. M. Arnold. |
| [1986. Thesis (M.S.).] |
| |
| 099091-310 GRAPH BISECTION ALGORITHMS. |
| T. N. Bui. |
| [1986. Thesis (Ph.D.).] |
| |
| 099091-312 NEW UPPER BOUNDS FOR TWO-LAYER CHANNEL ROUTING. |
| B. A. Berger. |
| [1986. Thesis (M.S.).] |
| |
| 099091-316 COMPACTION WITH AUTOMATIC JOG INTRODUCTION. |
| F. M. Maley. |
| [1986. Thesis (M.S.).] |
| |
| 099091-317 IMPROVED SIGNAL DELAY BOUNDS FOR RC TREE NETWORKS. |
| D. Standley and John L. Wyatt Jr. |
| [1986.] |
| |
| 099091-319 MACE: A MULTIPROCESSING APPROACH TO CIRCUIT EXTRACTION. |
| S. M. Levitin. |
| [1986. Thesis (M.S.).] |
| |
| 099091-320 TIGHT BOUNDS FOR MINIMAX GRID MATCHING, WITH APPLICATIONS |
| TO THE AVERAGE CASE ANALYSIS OF ALGORITHMS. |
| F. T. Leighton and P. Shor. |
| [1986.] |
| |
| 099091-321 LOGIC SIMULATION USING A CONTENT-ADDRESSABLE MEMORY SYSTEM. |
| B.-H. Lim. |
| [1986. Thesis (B.S.).] |
| |
| 099091-323 THE COUPLED DEPTH/SLOPE APPROACH TO SURFACE RECONSTRUCTION. |
| J. G. Harris. |
| [1986. Thesis (M.S./E.E.).] |
| |
|_____________________________________________________________________________|
103722 MINIMUM AREA CIRCUMSCRIBING POLYGONS.
A. Aggarwal, J. S. Chang, and C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 160. 1985. Also issued
as Robotics report 42, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103723 AN O(N LOG N) ALGORITHM FOR THE VORONOI DIAGRAM OF A SET OF SIMPLE
CURVE SEGMENTS.
C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 161. 1985. Preliminary
version. Also issued as Robotics report 43, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
103724 TWO DIMENSIONAL MODEL BASED BOUNDARY MATCHING USING FOOTPRINTS.
A. Kalvin et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 162. 1985. Also issued
as Robotics report 44, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103725 COMPUTING STABLE EIGENDECOMPOSITIONS OF MATRIX PENCILS.
J. W. Demmel and B. Kagstrom.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 163. 1985.]
103726 EFFICIENT MOTION PLANNING ALGORITHMS IN ENVIRONMENTS OF BOUNDED LOCAL
COMPLEXITY.
J. T. Schwartz and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 164. 1985. Also issued
as Robotics report 45, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103727 IDENTIFICATION OF PARTIALLY OBSCURED OBJECTS IN TWO DIMENSIONS BY
MATCHING OF NOISY 'CHARACTERISTIC CURVES.'
J. T. Schwartz and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 165. 1985. Also issued
as Robotics report 46, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103728 EFFICIENT STRING MATCHING WITH K MISMATCHES.
G. M. Landau and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 167. 1985.]
103729 AN EFFICIENT STRING MATCHING ALGORITHM WITH K DIFFERENCES FOR
NUCLEOTIDE AND AMINO ACID SEQUENCES.
G. M. Landau, U. Vishkin, and R. Nussinov.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 168. 1985.]
103730 A POLYNOMIAL SOLUTION FOR POTATO-PEELING PROBLEM.
J. S. Chang and C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 169. 1985. Also issued
as Robotics report 48, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103731 ITERATIVE METHODS FOR OVERFLOW QUEUEING MODELS.
R. Chan.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 171. 1985. Thesis
(Ph.D.).]
103732 OPTIMAL VLSI CIRCUITS FOR SORTING.
R. Cole and A. Siegel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 172. 1985. Also issued
as Ultracomputer note 86, Ultracomputer Research Laboratory, Courant
Institute of Mathematical Sciences, New York University.]
103733 CONNECTED COMPONENT LABELING IN IMAGE PROCESSING WITH MIMD
ARCHITECTURES.
R. A. Hummel and A. Rojer.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 173. 1985. Also issued
as Robotics report 49, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103734 CONSTRAINED TOTAL LEAST SQUARES PROBLEMS AND THE SMALLEST
PERTURBATION OF A SUBMATRIX WHICH LOWERS THE RANK.
J. Demmel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 174. 1985.]
103735 DETERMINISTIC COIN TOSSING WITH APPLICATIONS TO OPTIMAL PARALLEL LIST
RANKING.
U. Vishkin and R. Cole.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 175. 1985. Also issued
as Ultracomputer note 89, Ultracomputer Research Laboratory, Courant
Institute of Mathematical Sciences, New York University.]
103736 RECEPTIVE FIELDS AND THE RECONSTRUCTION OF VISUAL INFORMATION.
S. W. Zucker and R. A. Hummel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 176. 1985. Also issued
as Robotics report 50, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103737 A BRIEF SURVEY OF KNOWLEDGE AGGREGATION METHODS.
M. S. Landy and R. A. Hummel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 177. 1985. Also issued
as Robotics report 51, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103738 WHEN DOES NON-LINEAR TEXT HELP?
D. Shasha.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 178. 1985.]
103739 THE FORMULATION AND ANALYSIS OF NUMERICAL METHODS FOR INVERSE
EIGENVALUE PROBLEMS.
S. Friedland, J. Nocedal, and M. Overton.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 179. 1985.]
103740 ON SHORTEST PATHS BETWEEN TWO CONVEX POLYHEDRA.
A. Baltsan and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 180. 1985. Also issued
as Robotics report 52, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103741 ON SHORTEST PATHS AMIDST CONVEX POLYHEDRA.
M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 181. 1985. Also issued
as Robotics report 53, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103742 INPUT SENSITIVE, OPTIMAL PARALLEL RANDOMIZED ALGORITHMS FOR ADDITION
AND IDENTIFICATION.
P. Spirakis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 182. 1985.]
103743 A LAGRANGIAN FRACTIONAL STEP METHOD FOR THE INCOMPRESSIBLE NAVIER
STOKES EQUATIONS.
C. Boergers.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 183. 1985. Thesis
(Ph.D.).]
103744 PARTITIONING POINT SETS IN ARBITRARY DIMENSION.
R. Cole.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 184. 1985.]
103745 THREE METHODS FOR REFINING ESTIMATES OF INVARIANT SUBSPACES.
J. Demmel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 185. 1985.]
103746 EFFICIENT STRING MATCHING WITH K DIFFERENCES.
G. M. Landau and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 186. 1985.]
103747 ON THE NUMBER OF CRITICAL FREE CONTACTS OF A CONVEX POLYGONAL OBJECT
MOVING IN 2-D POLYGONAL SPACE.
D. Leven and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 187. 1985. Also issued
as Robotics report 54, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
103748 CONSTRAINT PROPAGATION ON REAL-VALUED QUANTITIES.
E. Davis.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 189. 1985.]
103749 AN INEQUALITY FOR SELF-ADJOINT OPERATORS ON A HILBERT SPACE.
H. J. Bernstein.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 190. 1985.]
103750 ON CONDITION NUMBERS AND THE DISTANCE TO THE NEAREST ILL-POSED
PROBLEM.
J. Demmel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 191. 1985.]
103751 EFFICIENT AND CORRECT EXECUTION OF PARALLEL PROGRAMS THAT SHARE
MEMORY.
D. Shasha and M. Snir.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 96. 1986. Also
issued as Technical report 206, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
103752 "AN OPTIMAL SELECTION ALGORITHM."
R. Cole.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 97. 1986. Also
issued as Technical report 209, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
103753 SYNCHRONIZATION COSTS ON MULTIPROCESSORS.
A. Greenbaum.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 98. 1986.]
103754 SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS USING FORTRAN WITH PARALLEL
EXTENSIONS ON THE NYU ULTRACOMPUTER PROTOTYPE.
A. Greenbaum.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 99. 1986.]
103755 ROUGH SETS AND SOME PROBLEMS OF ARTIFICIAL INTELLIGENCE.
Z. Pawlak.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 565. 1985.]
103756 PASCAL MP.
M. Missala and J. Zakrecki.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 566. 1985.]
103757 SOME ASPECTS OF MODLAN HDL SUBSET IMPLEMENTATION.
A. Pawlak.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 567. 1985.]
103758 AN ALGEBRA OF PROCESSES.
J. Winkowski and A. Maggiolo-Schettini.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 568. 1985.]
103759 KRIPKE MODELS WITH RELATIVE ACCESSIBILITY.
E. Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 569. 1985.]
103760 THE EXPONENTIAL METHOD.
G. Soederlind.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8517. 1985.]
103761 EDGE FOCUSING.
F. Bergholm.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8518. 1985. Also issued as
INTEGRAL-46, INTEGRAL Project, Department of Numerical Analysis and
Computing Science, Royal Institute of Technology, Stockholm.]
103762 INVESTIGATIONS INTO THE PATTERN PROCESSING CAPABILITIES OF
ASSOCIATIVE NETS.
A. Lansner.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8601. 1986. "This thesis
consists of a review and...six papers (Appendix A-F)."]
103763 ON HIERARCHICAL EDGE MATCHING IN DIGITAL IMAGES USING DISTANCE
TRANSFORMATIONS.
G. Borgefors.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8602. 1986. "This thesis
consists of a review and...three papers (Appendix A-C)."]
103764 LOCAL SYMMETRY COMPUTATION FOR SHAPE DESCRIPTION.
G.-W. Lee and S. N. Srihari.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 85-12. 1985.]
103765 ROCS: A SYSTEM FOR READING OFF-LINE CURSIVE SCRIPT.
R. M. Bozinovic and S. N. Srihari.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 85-13. 1985.]
103766 DEVELOPING AN EXPERT SHIP MESSAGE INTERPRETER: THEORETICAL AND
PRACTICAL CONCLUSIONS.
S. L. Hardt and J. Rosenberg.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 85-14. 1985.]
103767 SNEPS CONSIDERED AS A FULLY INTENSIONAL PROPOSITIONAL SEMANTIC
NETWORK.
S. C. Shapiro and W. J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 85-15. 1985.]
103768 LOGIC AND ARTIFICIAL INTELLIGENCE.
W. J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 85-16. 1985.]
103769 EXAMPLE OF PROGRAM DEVELOPMENT: THE ACKERMANN FUNCTION.
H. Ehler.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8507. 1985.]
103770 RESPONSE TIMES OF A REAL-TIME SYSTEM WITH MICROPROGRAMMED OPERATING
SYSTEM KERNEL.
T. Tempelmeier.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8505. 1985.]
103771 THE MUNICH PROJECT CIP. VOLUME II: THE PROGRAM TRANSFORMATION SYSTEM
CIP-S. PART I: FORMAL SPECIFICATION.
A. Horsch et al.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8508. 1985. Tentative version.]
103773 ON THE USE OF COMPOSITION IN TRANSFORMATIONAL PROGRAMMING.
R. Berghammer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8512. 1985.]
103774 CONTROL FOR ITERATIVE EVALUATION OF RECURSIVE RULES IN DATABASE
SYSTEMS.
U. Guentzer and R. Bayer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8513. 1985.]
103775 DAS TEXTSYSTEM TROFF AUF PUNKTRASTER-DRUCKERN.
R. Foessmeier.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8514. 1985.]
103772 USER MANUAL FOR THE CIP-SYSTEM-PROTOTYPE.
H.-O. Riethmayer, F. Erhard, and H. Ehler.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8511. 1985.]
103776 TRANSFORMATIONAL PROGRAM DEVELOPMENT IN A PARTICULAR PROBLEM DOMAIN.
H. Partsch.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8515. 1985.]
103777 PARALLEL PROGRAMMING WITH MODULES.
S. Eichholz.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8516. 1985.]
103778 PROBABILISTISCHE PROGRAMME: SEMANTIK UND ANWENDUNGEN.
C. Herzog.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8517. 1985.]
103779 SELF-COMPOSABILITY OF ATTRIBUTE COUPLED GRAMMARS.
S. Thuermel.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8518. 1985.]
103780 DISCRETIZATIONS FOR MULTIGRID METHODS.
U. Ruede.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8519. 1985.]
103781 JUMP INTERPOLATION SEARCH TREES AND SYMMETRIC BINARY NUMBERS.
U. Guentzer and M. Paul.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8520. 1985.]
103782 TEMPORAL LOGIC OF PROGRAMS - LECTURE NOTES.
F. Kroeger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8521. 1985.]
103783 SPEZIFIKATION VON KOMMUNIKATIONSPROTOKOLLEN AUF DER BASIS
ATTRIBUTIERTER GRAMMATIKEN.
O. Hass.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8522. 1985.]
103784 WECHSELSEITIGE EINFLUESSE VON LEISTUNG UND ZUVERLAESSIGKEIT IN
RECHENSYSTEMEN: STAND DER FORSCHUNG.
O. Schoen.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8523. 1985.]
103785 TREE GRAMMARS AS A PATTERN MATCHING MECHANISM FOR CODE GENERATION.
M. Benk.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8524. 1985.]
103786 ON THE TREATMENT OF SINGULARITIES IN THE MULTIGRID METHOD.
U. Ruede and C. Zenger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8526. 1985.]
103787 MAKING FORMAL SPECIFICATIONS READABLE.
H. Ehler.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8527. 1985.]
103788 ABSTRACT MODULES.
F. Kroeger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8601. 1986.]
103789 ERFAHRUNGSBERICHT UEBER DEN EINSATZ VON ULTRIX-32.
H. Halfar et al.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8602. 1986.]
103790 ON THE EVALUATION OF RECURSION IN (DEDUCTIVE) DATABASE SYSTEMS BY
EFFICIENT DIFFERENTIAL FIXPOINT ITERATION.
U. Guentzer, W. Kiessling, and R. Bayer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8603. 1986.]
103791 TOWARDS A FORMALIZATION OF DIGITAL CIRCUIT DESIGN.
C. D. Kloos.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8604. 1986.]
103792 THE LAMBEK CALCULUS.
J. van Benthem.
[University of Amsterdam. Department of Mathematics. Report no.
86-06. 1986.]
103793 DIAGONALISATION METHODS IN A POLYNOMIAL SETTING.
L. Torenvliet and P. van Emde Boas.
[University of Amsterdam. Department of Mathematics. Report no.
86-08. 1986.]
103794 AN EXTENSION OF ELMORE'S DELAY.
P. K. Chan.
[University of California, Los Angeles. Computer Science Department.
CSD-860050. 1986.]
103795 DISTRIBUTED DIAGNOSIS IN CAUSAL MODELS WITH CONTINUOUS VARIABLES.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860051. 1986.]
103796 vFP: AN ENVIRONMENT FOR THE MULTI-LEVEL SPECIFICATION, ANALYSIS, AND
SYNTHESIS OF HARDWARE ALGORITHMS.
D. Patel, M. Schlag, and M. D. Ercegovac.
[University of California, Los Angeles. Computer Science Department.
CSD-860052. 1986.]
103797 INEXACT REASONING IN PROLOG-BASED EXPERT SYSTEMS.
K. G. Lecot.
[University of California, Los Angeles. Computer Science Department.
CSD-860053. 1986. Thesis (M.S.).]
103798 A FUNCTIONAL STYLE DESCRIPTION OF DIGITAL SYSTEMS.
J. S. Worley.
[University of California, Los Angeles. Computer Science Department.
CSD-860054. 1986. Thesis (M.S.).]
103799 DISTRIBUTED SORTING ALGORITHMS FOR MULTI-CHANNEL BROADCAST NETWORKS.
E. Gafni and J. Marberg.
[University of California, Los Angeles. Computer Science Department.
CSD-860055. 1986.]
103800 AN EXTENSION OF ELMORE'S DELAY AND ITS APPLICATION FOR TIMING
ANALYSIS ON MOS PASS TRANSISTOR NETWORKS.
P. K. Chan.
[University of California, Los Angeles. Computer Science Department.
CSD-860056. 1986.]
103801 RELAXATION PROBLEM SOLVING (WITH INPUT TO CHINESE INPUT PROBLEM).
K. P. Chow.
[University of California, Los Angeles. Computer Science Department.
CSD-860058. 1986. Thesis (Ph.D.).]
103802 RELAXATION PROCESSES: THEORY, CASE STUDIES AND APPLICATIONS.
C.-T. Chou.
[University of California, Los Angeles. Computer Science Department.
CSD-860057. 1986. Thesis (M.S.).]
103803 ALLOCATION FOR THE SANDAC MULTIPROCESSOR SYSTEM.
T. M. Ravi and M. D. Ercegovac.
[University of California, Los Angeles. Computer Science Department.
CSD-860059. 1986.]
103804 A KNOWLEDGE-BASED SYSTEM FOR DEBUGGING CONCURRENT SOFTWARE.
C. H. LeDoux.
[University of California, Los Angeles. Computer Science Department.
CSD-860060. 1986. Thesis (Ph.D.).]
103805 A THREADED FP INTERPRETER/COMPILER.
S. Pungsornruk.
[University of California, Los Angeles. Computer Science Department.
CSD-860061. 1986.]
103806 ON THE LOGIC OF PROBABILISTIC DEPENDENCIES.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860062. 1986.]
103807 AN INVESTIGATION AND RATIONAL RECONSTRUCTION OF THE UT THEOREM PROVER.
D. Plummer.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 256. 1985.]
103808 USING AND COMPUTING SYMMETRY IN GEOMETRY PROOFS.
D. Fearnley-Sander.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 257. 1985.]
103809 GENERATING CONNECTION CALCULI FROM TABLEAUX AND SEQUENT BASED PROOF
SYSTEMS.
L. A. Wallen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 258. 1985.]
103810 CORRECTNESS CRITERIA OF SOME ALGORITHMS FOR UNCERTAIN REASONING USING
INCIDENCE CALCULUS.
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 259. 1985.]
103811 A PROBLEM SOLVING APPROACH TO GENERATING TEXT FROM SYSTEMIC GRAMMARS.
T. Patten.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 260. 1985.]
103812 IMPLEMENTING A GAME-THEORETIC INTERPRETATION OF LOGIC.
P. Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 263. 1985.]
103813 USER MODELLING IN COMMAND-DRIVEN SYSTEMS.
P. Ross, J. Jones, and M. Millington.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 264. 1985.]
103814 A GEOMETRIC REASONING SYSTEM FOR MOVING AN OBJECT WHILE MAINTAINING
CONTACT WITH OTHERS.
A. Koutsou.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 267. 1985.]
103815 WHAT STORIES SHOULD WE TELL NOVICE PROLOG PROGRAMMERS?
H. Pain and A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 269. 1985.]
103816 RELEVANT CRITERIA FOR CHOOSING AN INFERENCE ENGINE IN EXPERT SYSTEMS.
H. Reichgelt and F. van Harmelen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 270. 1985.]
103817 ANALYSIS OF UNCERTAINTIES IN A STRUCTURE OF PARTS.
A. Fleming.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 272. 1985.]
103818 META-LEVEL INFERENCE IN ALGEBRA.
A. Bundy and L. Sterling.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 273. 1985.]
103819 MODELLING AS A METHOD OF LEARNING PHYSICAL SCIENCE AND MATHEMATICS.
P. Ross.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 274. 1985.]
103820 THE COMPUTATIONAL COMPLEXITY OF SENTENCE GENERATION USING FUNCTIONAL
UNIFICATION GRAMMAR.
G. Ritchie.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 275. 1986.]
103821 THE PRONOMINALIZATION DECISION IN LANGUAGE GENERATION.
R. Dale.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 276. 1986.]
103822 A BLACKBOARD SHELL IN PROLOG.
J. Jones, M. Millington, and P. Ross.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 277. 1986.]
103823 COMBINATORS AND GRAMMARS.
M. Steedman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 278. 1986.]
103824 COMBINATORY GRAMMARS AND HUMAN LANGUAGE PROCESSING.
M. Steedman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 279. 1986.]
103825 PROBABILISTIC INFERENCE: THEORY AND PRACTICE.
W. D. Lee.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1271. 1986. Thesis (Ph.D.).]
103826 MINIMUM POLYGONAL SEPARATION.
H. Edelsbrunner and F. P. Preparata.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1272. 1986.]
103827 A THEORY OF QUALITATIVE KINEMATICS IN MECHANISMS.
B. Faltings.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1274. 1986.]
103828 ISPY: AN INSTRUCTION SET ANALYSIS TOOL.
M. B. Konsek and D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1276. 1986.]
103829 REAL-TIME INTEGRATION FORMULAS WITH OFF-STEP INPUTS AND THEIR
STABILITY.
C. W. Gear and D. Wang.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1277. 1986.]
103830 COMPARING THE EFFECTIVENESS OF SOFTWARE TESTING STRATEGIES.
V. R. Basili and R. W. Selby Jr..
[University of Maryland. Department of Computer Science. TR-1501.
1985.]
103831 ON USING MULTIPLE INVERTED TREES FOR PARALLEL UPDATING OF GRAPH
PROPERTIES.
S. Pawagi and I. V. Ranakrishnan.
[University of Maryland. Department of Computer Science. CS-TR-1502.
1985. Also issued as CAR-TR-124, Center for Automation Research,
University of Maryland.]
103832 GRAPH ALGORITHMS ON FIXED-INTERCONNECTION SIMD COMPUTERS.
P. S. Gopalakrishnan, I. V. Ranakrishnan, and L. N. Kanal.
[University of Maryland. Department of Computer Science. CS-TR-1505.
1985.]
103833 COMPUTING POLYGON FILL-LINES.
G. D. Knott.
[University of Maryland. Department of Computer Science. CS-TR-1506.
1985. Also issued as CAR-TR-126, Center for Automation Research,
University of Maryland.]
103834 MULTIRESOLUTION PATH PLANNING FOR MOBILE ROBOTS.
S. Kambhampati and L. S. Davis.
[University of Maryland. Department of Computer Science. CS-TR-1507.
1985. Also issued as CAR-TR-127, Center for Automation Research,
University of Maryland.]
103835 A METHOD OF DETECTING THE ORIENTATION OF ALIGNED COMPONENTS.
A. Hashizume et al.
[University of Maryland. Department of Computer Science. CS-TR-1508.
1985. Also issued as CAR-TR-128, Center for Automation Research,
University of Maryland.]
103836 A TOKEN-BASED RESILIENCY CONTROL SCHEME IN REPLICATED DATABASE
SYSTEMS.
S. H. Son and A. K. Agrawala.
[University of Maryland. Department of Computer Science. TR-1509.
1985.]
103837 A PYRAMID THAT GROWS BY POWERS OF 2.
W. G. Kropatsch.
[University of Maryland. Department of Computer Science. CS-TR-1510.
1985. Also issued as CAR-TR-129, Center for Automation Research,
University of Maryland.]
103838 A HYBRID SSS*/ALPHA-BETA ALGORITHM FOR PARALLEL SEARCH OF GAME TREES.
D. B. Leifker and L. N. Kanal.
[University of Maryland. Department of Computer Science. TR-1511.
1984.]
103839 ESTIMATION OF A PRIORI CLASS PROBABILITIES IN MULTICATEGORY
INFORMATION PROCESSING.
G. R. Dattatreya and L. N. Kanal.
[University of Maryland. Department of Computer Science. TR-1512.
n.d.]
103840 HYPOTHESIS INTEGRATION IN IMAGE UNDERSTANDING SYSTEMS.
V. S.-S. Hwang, L. S. Davis, and T. Matsuyama.
[University of Maryland. Department of Computer Science. CS-TR-1513.
1985. Also issued as CAR-TR-130, Center for Automation Research,
University of Maryland.]
103841 THE COMPLEXITY OF SEARCHING SEVERAL CLASSES OF AND/OR GRAPHS.
H. E. Motteler and L. N. Kanal.
[University of Maryland. Department of Computer Science. TR-1514.
1985.]
103842 SIPP (SEMI-INTELLIGENT PROCESS PLANNER) REFERENCE MANUAL.
D. S. Nau.
[University of Maryland. Department of Computer Science. TR-1515.
1985.]
103843 A NATURAL LANGUAGE DATABASE INTERFACE THAT PROVIDES COOPERATIVE
ANSWERS.
A. Gal and J. Minker.
[University of Maryland. Department of Computer Science. TR-1516.
n.d.]
103844 COMPLETENESS AND RESULTS FOR CIRCUMSCRIPTION.
D. Perlis and J. Minker.
[University of Maryland. Department of Computer Science. TR-1517.
n.d.]
103845 AN ALGORITHM FOR UPDATE SYNCHRONIZATION IN REPLICATED DATABASE
SYSTEMS.
M. Singhal and A. K. Agrawala.
[University of Maryland. Department of Computer Science. CS-TR-1518.
1985.]
103846 PERFORMANCE STUDY OF DISTRIBUTED RESOURCE SHARING ALGORITHMS.
M. Abrams and A. K. Agrawala.
[University of Maryland. Department of Computer Science. TR-1521.
1985.]
103847 HIERARCHICAL CURVE REPRESENTATION IN A NEW PYRAMID SCHEME.
W. G. Kropatsch.
[University of Maryland. Department of Computer Science. CS-TR-1522.
1985. Also issued as CAR-TR-131, Center for Automation Research,
University of Maryland.]
103848 AN ALGORITHM WITH UPDATE TRANSPORT FOR UPDATE SYNCHRONIZATION IN
REPLICATED DATABASE SYSTEMS.
M. Singhal and A. K. Agrawala.
[University of Maryland. Department of Computer Science. CS-TR-1523.
1985.]
103849 ARC COLORINGS, PARTIAL PATH GROUPS, AND PARALLEL GRAPH CONTRACTIONS.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1524.
1985. Also issued as CAR-TR-132, Center for Automation Research,
University of Maryland.]
103850 AN ALGORITHM FOR DATABASE RECONSTRUCTION IN DISTRIBUTED ENVIRONMENTS.
S. H. Son and A. K. Agrawala.
[University of Maryland. Department of Computer Science. CS-TR-1525.
1985.]
103851 ABLOG/IC: A PROGRAMMING LANGUAGE SUPPORTING ABDUCTIVE PROBLEM-SOLVING.
B.-T. Chu.
[University of Maryland. Department of Computer Science. TR-1526.
1985.]
103852 DISTRIBUTED RESOURCE SCHEDULING FOR A LARGE SCALE NETWORK OF
PROCESSORS.
S. K. Tripathi and S.-T. Huang.
[University of Maryland. Department of Computer Science. CS-TR-1527.
1985. Also issued as UMIACS-TR-85-5, Institute for Advanced Computer
Studies, University of Maryland.]
103853 BUS INTERCONNECTION SCHEMES BASED ON SHUFFLE CONNECTION.
S. K. Tripathi and S.-T. Huang.
[University of Maryland. Department of Computer Science. CS-TR-1528.
1985. Also issued as UMIACS-TR-85-6, Institute for Advanced Computer
Studies, University of Maryland.]
103854 RESTRUCTURING TEXTUAL INFORMATION FOR ONLINE RETRIEVAL.
L. Koved.
[University of Maryland. Department of Computer Science. CS-TR-1529.
1985. Thesis (M.S.). Also issued as CAR-TR-133, Center for Automation
Research, University of Maryland.]
103855 IMPLEMENTATION AND MEASUREMENT OF A DISTRIBUTED DINING PHILOSOPHERS
ALGORITHM ON ZMOB.
N. Vanderlipp et al.
[University of Maryland. Department of Computer Science. TR-1530.
1985.]
103856 CONTOUR EVOLUTION, NEIGHBORHOOD DEFORMATION AND LOCAL IMAGE FLOW:
CURVED SURFACES IN MOTION.
K. Wohn and A. M. Waxman.
[University of Maryland. Department of Computer Science. CS-TR-1531.
1985. Also issued as CAR-TR-134, Center for Automation Research,
University of Maryland.]
103857 HASH TABLE COLLISION RESOLUTION WITH DIRECT-CHAINING.
G. D. Knott and P. de la Torre.
[University of Maryland. Department of Computer Science. CS-TR-1533.
1985. Also issued as CAR-TR-135, Center for Automation Research,
University of Maryland.]
103858 THE DECOMPOSITION OF A SQUARE INTO RECTANGLES OF MINIMAL PERIMETER.
T. Y. Kong, D. M. Mount, and M. Werman.
[University of Maryland. Department of Computer Science. CS-TR-1535.
1985. Also issued as CAR-TR-137, Center for Automation Research,
University of Maryland.]
103859 IMAGE PROCESSING FOR VISUAL NAVIGATION OF ROADWAYS.
J. Le Moigne et al.
[University of Maryland. Department of Computer Science. CS-TR-1536.
1985. Also issued as CAR-TR-138, Center for Automation Research,
University of Maryland.]
103860 A VISUAL NAVIGATION SYSTEM FOR AUTONOMOUS LAND VEHICLES.
A. M. Waxman et al.
[University of Maryland. Department of Computer Science. CS-TR-1537.
1985. Also issued as CAR-TR-139, Center for Automation Research,
University of Maryland.]
103861 ROAD BOUNDARY DETECTION FOR AUTONOMOUS VEHICLE NAVIGATION.
L. S. Davis and T. Kushner.
[University of Maryland. Department of Computer Science. CS-TR-1538.
1985. Also issued as CAR-TR-140, Center for Automation Research,
University of Maryland.]
103862 A SIMPLIFIED METHOD OF DETECTING STRUCTURE IN GLASS PATTERNS.
T. H. Phillips and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1539.
1985. Also issued as CAR-TR-141, Center for Automation Research,
University of Maryland.]
103863 SUB-PIXEL GEOMETRIC CORRECTION OF PICTURES BY CALIBRATION AND
DECALIBRATION.
N. Yokobori, P.-S. Yeh, and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1540.
1985. Also issued as CAR-TR-142, Center for Automation Research,
University of Maryland.]
103864 VLSI DESIGN: FROM CDL TO CHIP LAYOUTS.
Y. Chu and Z.-S. Wang.
[University of Maryland. Department of Computer Science. TR-1541.
1985.]
103865 POSE DETERMINATION OF A THREE-DIMENSIONAL OBJECT USING TRIANGLE PAIRS.
S. Linnainmaa, D. Harwood, and L. S. Davis.
[University of Maryland. Department of Computer Science. CS-TR-1542.
1985. Also issued as CAR-TR-143, Center for Automation Research,
University of Maryland.]
103866 HIRB: A HIERARCHICAL RING BUS.
K. Itano.
[University of Maryland. Department of Computer Science. TR-1543.
1985.]
103867 A PROLOG DIRECT-EXECUTION MACHINE ORGANIZATION.
Y. Chu and K. Itano.
[University of Maryland. Department of Computer Science. TR-1545.
1985.]
103868 TESSELATION GRAPH CHARACTERIZATION USING ROSETTAS.
R. A. Melter.
[University of Maryland. Department of Computer Science. CS-TR-1546.
1985. Also issued as CAR-TR-144, Center for Automation Research,
University of Maryland.]
103869 USING DISPARITY FUNCTIONALS FOR STEREO CORRESPONDENCE AND SURFACE
RECONSTRUCTION.
R. D. Eastman and A. M. Waxman.
[University of Maryland. Department of Computer Science. CS-TR-1547.
1985. Also issued as CAR-TR-145, Center for Automation Research,
University of Maryland.]
103870 RECOVERY MANAGEMENT TECHNIQUES IN DISTRIBUTED DATABASE SYSTEMS.
S. K. Tripathi and S. H. Son.
[University of Maryland. Department of Computer Science. CS-TR-1548.
1985.]
103871 A FAST LAPLACIAN FOR DIGITAL PICTURES.
S. Antoy.
[University of Maryland. Department of Computer Science. CS-TR-1549.
1985. Also issued as CAR-TR-146, Center for Automation Research,
University of Maryland.]
103872 USING LINEAR QUADTREES TO STORE VECTOR DATA.
H. Samet and C. A. Shaffer.
[University of Maryland. Department of Computer Science. CS-TR-1550.
1985. Also issued as CAR-TR-147, Center for Automation Research,
University of Maryland.]
103873 RELIABILITY AND SECURITY ISSUES IN DISTRIBUTED COMPUTING SYSTEMS.
B. Randell and J. E. Dobson.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 210. 1985.]
103874 STRICT: A DESIGN LANGUAGE FOR STRONGLY TYPED RECURSIVE INTEGRATED
CIRCUITS.
R. H. Campbell, A. M. Koelmans, and M. R. McLauchlan.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 211. 1986.]
103875 THE NUNET-UNIX INTERFACE PROTOCOL DESCRIPTION.
F. L. Hughes.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 212. 1985.]
103876 FORMAL SPECIFICATION OF N-MODULAR REDUNDANCY.
L. Mancini and M. Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 213. 1986.]
103877 BUILDING RELIABLE SECURE COMPUTING SYSTEMS OUT OF UNRELIABLE INSECURE
COMPONENTS.
J. E. Dobson and B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 214. 1986.]
103878 SOFTWARE MONITORING OF UNIX SYSTEMS.
A. Montasar-Kohsari, I. Mitrani, and T. Betteridge.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 215. 1986.]
103879 SCALEABILITY OF A BINARY TREE ON A HYPERCUBE.
S. R. Deshpande.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-01. 1986.]
103880 COMPACTNESS AND COMPLETENESS IN COMPONENT SEMANTICS.
N. M. Martin.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-02. 1986.]
103881 BOOLEAN MINIMIZATION AND THE VICINITY METHOD.
N. M. Martin.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-03. 1986.]
103882 VICINITIES, MINTERMS AND PRIME IMPLICANT COVERINGS.
N. M. Martin.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-04. 1986.]
103883 USER REFERENCE MANUAL FOR TASK LEVEL DATA FLOW LANGUAGE: VERSION 1.
N. Graner and J. Biswas.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-05. 1986.]
103885 GENESIS: A RECONFIGURABLE DATABASE MANAGEMENT SYSTEM.
D. S. Batory et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-07. 1986.]
103886 SOME COMPLEXITY BOUNDS FOR PROBLEMS CONCERNING FINITE AND
2-DIMENSIONAL VECTOR ADDITION SYSTEMS WITH STATES.
R. R. Howell et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-08. 1986.]
103887 CONSTRUCTION OF SLIDING WINDOW PROTOCOLS.
A. U. Shankar and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-09. 1986.]
103888 THE DERIVATION OF SYSTOLIC IMPLEMENTATIONS OF PROGRAMS.
C.-H. Huang and C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-10. 1986.]
103889 ON THE COMPLEXITY OF PRECEDENCE CONSTRAINED SCHEDULING.
K. SSV. Palem.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-11. 1986. Thesis (Ph.D.).]
103890 FOUR DIMENSIONS OF PROGRAMMING-LANGUAGE INDEPENDENCE.
D. J. Salomon.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-13. 1986.]
103891 THE EFFECT OF ASYMMETRIC DELETIONS ON BINARY SEARCH TREES.
J. C. Culberson.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-15. 1986. Thesis (Ph.D.).]
103892 A HIGH PERFORMANCE DATAFLOW DATABASE MACHINE.
D. J. DeWitt et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 635. 1986.]
103893 THE GTPN ANALYZER: NUMERICAL METHODS AND USER INTERFACE.
M. A. Holliday and M. K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 639. 1986.]
103894 BOX SPLINES.
K. Hoellig.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 640. 1986.]
103895 ON STRONG DIGRAPH WITH A UNIQUE MINIMALLY STRONG SUBDIGRAPH.
R. A. Brualdi and R. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 641. 1986.]
103896 CONVOLUTION ALGORITHMS ON THE PIPELINED IMAGE-PROCESSING ENGINE.
C. V. Stewart and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 643. 1986.]
103897 THE ARCHITECTURE OF THE EXODUS EXTENSIBLE DBMS: A PRELIMINARY REPORT.
M. J. Carey et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 644. 1986.]
103898 REALTIME GARBAGE COLLECTION ON GENERAL-PURPOSE MACHINES.
T. Yuasa.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-535. 1986.]
103899 ANWENDUNG DER MEHRGITTERMETHODE ZUR BERECHNUNG VON DIGITALEN
HOEHENMODELLEN IN DER PHOTOGRAMMETRIE.
U. Ruede.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8525. 1985.]
103900 SURVEY OF KEY MANAGEMENT FOR DATA ENCIPHERMENT.
W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 70/86. 1986.]
103901 RELFUN: A RELATIONAL/FUNCTIONAL INTEGRATION WITH VALUED CLAUSES.
H. Boley.
[Universitaet Kaiserslautern. Fachbereich Informatik. Interner
Bericht 153/86. 1986.]
103902 GRAPH PROBLEMS AND CONNECTIONIST ARCHITECTURES.
D. H. Ballard, P. C. Gardner, and M. A. Srinivas.
[University of Rochester. Department of Computer Science. TR 167.
1986.]
VOL. 8, NO. 7 09/15/86
104476 VIRTUAL MEMORY MANAGEMENT FOR RECOVERABLE OBJECTS IN THE TABS
PROTOTYPE.
J. L. Eppinger and A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-163. 1985.]
104477 MAKING ROBUST PROGRAMS.
C. F. Everhart.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-85-170. 1985. Thesis (Ph.D.).]
104478 PROBLEMS WITH CONCURRENT PROLOG.
V. A. Saraswat.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-100. 1986. May 1985: revised January 1986.]
104479 TEXT-INDEPENDENT SPEAKER RECOGNITION EXPERIMENTS USING CODEBOOKS IN
VECTOR QUANTIZATION.
K. Shikano.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-101. 1986.]
104480 SPEAKER-INDEPENDENT PHONEME RECOGNITION IN CONTINUOUS SPEECH BY A
STATISTICAL METHOD AND A STOCHASTIC DYNAMIC TIME WARPING METHOD.
S. Nakagawa.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-102. 1986.]
104481 TWO DESIGNS OF FUNCTIONAL UNITS FOR VLSI BASED CHESS MACHINES.
F. Hsu.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-103. 1986.]
104482 THEORIES OF CAUSAL ORDERING: REPLY TO DE KLEER AND BROWN.
Y. Iwasaki and H. A. Simon.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-104. 1986.]
104483 MINKOWSKI'S CONVEX BODY THEOREM AND INTEGER PROGRAMMING.
R. Kannan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-105. 1986.]
104484 ON AUTOMATIC COMPOSITION OF STEREOTYPIC DOCUMENTS IN FOREIGN
LANGUAGES.
H. Saito and M. Tomita.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-107. 1985.]
104485 EVALUATION OF LPC SPECTRAL MATCHING MEASURES FOR PHONETIC UNIT
RECOGNITION.
K. Shikano.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-108. 1986.]
104486 SPEAKER-INDEPENDENT SENTENCE RECOGNITION BY PHONEME-BASED WORD
SPOTTING AND TIME-SYNCHRONOUS CONTEXT-FREE PARSING.
S. Nakagawa.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-109. 1986.]
104487 CONCURRENCY AND AVAILABILITY AS DUAL PROPERTIES OF REPLICATED ATOMIC
DATA.
M. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-110. 1986.]
104488 THE PROCESSES OF SCIENTIFIC DISCOVERY: THE STRATEGY OF
EXPERIMENTATION.
D. Kulkarni and H. A. Simon.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-111. 1986.]
104489 PAPERS ON A SYMBOLIC ANALYZER FOR MOS CIRCUITS.
R. E. Bryant.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-114. 1986.]
104490 ON COMPUTING SMOOTH SOLUTIONS OF PROBLEMS WITH LARGE LIPSCHITZ
CONSTANTS.
R. M. M. Mattheij.
[Catholic University (Nijmegen). Department of Mathematics. Report
no. 8533. 1985.]
104491 SEQUENTIAL STEP CONTROL FOR INTEGRATION OF TWO-POINT BOUNDARY VALUE
PROBLEMS.
R. England and R. M. M. Mattheij.
[Catholic University (Nijmegen). Department of Mathematics. Report
no. 8541. 1985.]
104492 ON THE EIGENVALUE PROBLEM FOR COERCIVE SINGULAR PERTURBATIONS: AN
ILLUSTRATIVE EXAMPLE.
L. S. Frank and J. J. Heijstek.
[Catholic University (Nijmegen). Department of Mathematics. Report
no. 8604. 1986.]
104493 THE STRUCTURE OF PARALLELISMS IN PG(3,2).
R. H. Jeurissen.
[Catholic University (Nijmegen). Department of Mathematics. Report
no. 8606. 1986.]
104494 THE GAUSSIAN DERIVATIVE MODEL FOR MACHINE VISION: VISUAL CORTEX
SIMULATION.
R. A. Young.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-5323. 1986.]
104495 A REGRESSION UPDATING APPROACH TO DETECTING MULTIPLE CURVES.
D. S. Chen.
[General Motors Corporation. Research Laboratories. Computer Science
Department. GMR-5429. 1986.]
104496 ANALYTIC MODELS AND AMBIGUITY OF CONTEXT-FREE LANGUAGES.
P. Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 483. 1986.]
104497 LEVEL NUMBER SEQUENCES FOR TREES.
P. Flajolet and H. Prodinger.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 484. 1986.]
104498 A SURVEY ON ATTRIBUTE GRAMMARS. PART I: MAIN RESULTS ON ATTRIBUTE
GRAMMARS.
P. Deransart, M. Jourdan, and B. Lorho.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 485. 1986.]
104499 ON A FEYNMAN-KAC TYPE RESULT FOR COUPLED ELLIPTIC SYSTEMS - I.
O. Bennouna.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 486. 1986.]
104500 ON GLOBAL SMOOTH SOLUTION OF CAUCHY PROBLEM FOR A CLASS OF
QUASILINEAR PARABOLIC SYSTEMS IN SEVERAL SPACES VARIABLES.
O. Bennouna.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 487. 1986.]
104501 ON A CLASS OF BOLTZMANN-TYPE SCHEMES FOR HYPERBOLIC CONSERVATION LAWS.
O. Bennouna.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 488. 1986.]
104502 PRACTICAL VARIATIONS OF SHELLSORT.
J. Incerpi and R. Sedgewick.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 489. 1986.]
104503 PRELIMINARY RESULTS ON THE ITERATIVE CONVERGENCE OF A CLASS OF
IMPLICIT SCHEMES.
J.-A. Desideri.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 490. 1986.]
104504 SCATTERING OF ELASTIC WAVES IN A PERTURBED ISOTROPIC HALF SPACE WITH
A FREE BOUNDARY: THE LIMITING ABSORPTION PRINCIPLE.
Y. Dermenjian and J.-C. Guillot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 491. 1986.]
104505 PREFIXES OF INFINITE WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES.
J.-M. Autebert, P. Flajolet, and J. Gabarro.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 492. 1986.]
104506 CONTROLLING KNOWLEDGE TRANSFERS IN DISTRIBUTED ALGORITHMS:
APPLICATION TO DEADLOCK DETECTION.
J.-M. Helary, A. Maddi, and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 493. 1986. Also issued as Publication
interne 278, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104507 UNE METHODE DE CONCEPTION DE PROGRAMMES FONCTIONNELS.
R. Durand and M. Vergne.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 494. 1986. Also issued as Publication
interne 279, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104508 COMMANDE DE SYSTEMES REDONDANTS ET EVITEMENT D'OBSTACLES.
B. Espiau.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 495. 1986. Also issued as Publication
interne 280, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104509 A DISTRIBUTED ALGORITHM FOR MUTUAL EXCLUSION IN AN ARBITRARY NETWORK.
J.-M. Helary, N. Plouzeau, and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 496. 1986. Also issued as Publication
interne 281, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104510 AN ALGEBRAIC APPROACH TO RECURSIVE QUERIES IN RELATIONAL DATABASES.
N. Spyratos and C. Lecluse.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 499. 1986.]
104511 THE BLAZE LANGUAGE: A PARALLEL LANGUAGE FOR SCIENTIFIC PROGRAMMING.
P. Mehrotra and J. Van Rosendale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 85-29. 1985.]
104512 PRECONDITIONED METHODS FOR SOLVING THE INCOMPRESSIBLE AND LOW SPEED
COMPRESSIBLE EQUATIONS.
E. Turkel.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-14. 1986.]
104513 A FOURTH ORDER ACCURATE FINITE DIFFERENCE SCHEME FOR THE COMPUTATION
OF ELASTIC WAVES.
A. Bayliss et al.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-21. 1986.]
104514 USING THE STRUCTURAL OPERATIONAL APPROACH TO EXPRESS TRUE CONCURRENCY.
W. Li and P. E. Lauer.
[McMaster University. Department of Computer Science and Systems.
Technical report 85-01. 1985.]
104515 CONCURRENT AND MAXIMALLY CONCURRENT EVOLUTION OF NON-SEQUENTIAL
SYSTEMS.
R. Janicki et al.
[McMaster University. Department of Computer Science and Systems.
Technical report 85-02. 1985.]
104516 TOP-DOWN SEMANTICS OF FAIR COMPUTATIONS OF LOGIC PROGRAMS.
M. H. van Emden and M. A. Nait Abdallah.
[McMaster University. Department of Computer Science and Systems.
Technical report 85-03. 1985.]
104517 ALGORITHMS FOR THE REDUCTION OF MATRIX BANDWIDTH AND PROFILE.
W. F. Smyth.
[McMaster University. Department of Computer Science and Systems.
Technical report 85-04. 1985.]
104518 IMPLEMENTING FIG-FORTH ON THE MC68000 EDUCATIONAL COMPUTER BOARD.
Z. Huaining and N. Solntseff.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-01. 1986.]
104519 SHARP BOUNDS ON THE DIAMETER OF A GRAPH.
W. F. Smyth.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-02. 1986.]
104520 EQUIVALENT EVOLUTIONS OF NON-SEQUENTIAL SYSTEMS.
R. Janicki and M. Koutny.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-03. 1986.]
104521 AN UPPER BOUND ON THE MAXIMUM CARDINALITY OF THE VERTEX SET OF GRAPHS
OF GIVEN MAXIMUM DEGREE AND DIAMETER.
W. F. Smyth.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-04. 1986.]
104522 EVALUATING MEASURES OF PROGRAM QUALITY.
K. A. Redish and W. F. Smyth.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-05. 1986.]
104523 THE CLEANING PERSON ALGORITHM.
T. Budd.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8610. 1986.]
104524 DISTRIBUTED CONTROL IN COMPUTER NETWORKS AND CROSS-SECTIONS OF
COLORED MULTIDIMENSIONAL BODIES.
E. Kranakis and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8611. 1986.]
104525 THE POWER OF THE QUEUE.
M. Li, L. Longpre, and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8612. 1986.]
104526 KNOWLEDGE REPRESENTATION AND INFERENCE IN RULE-BASED SYSTEMS.
P. J. F. Lucas.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8613. 1986.]
104527 LOWER BOUNDS FOR A CLASS OF KOSTKA NUMBERS.
J. W. Klop and E. Kranakis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8614. 1986.]
104528 A GENERAL OBJECT-CENTERED DATABASE LANGUAGE: A PRELIMINARY DEFINITION.
M. L. Kersten and F. H. Schippers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8615. 1986.]
104529 PROLOG: AN EXPERT SYSTEM BUILDING TOOL.
L. C. van der Gaag.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8616. 1986.]
104530 MODULE ALGEBRA.
J. A. Bergstra, J. Heering, and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8617. 1986.]
104531 ALGEBRAIC SPECIFICATIONS OF COMPUTABLE AND SEMICOMPUTABLE DATATYPES.
J. A. Bergstra and J. V. Tucker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8619. 1986.]
104532 EULER FLOW SOLUTIONS FOR A TRANSONIC WINDTUNNEL SECTION.
B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8601. 1986.]
104533 MULTIGRID APPROACHES TO THE EULER EQUATIONS.
P. W. Hemker and G. M. Johnson.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8602. 1986.]
104534 LINEAR STABILITY OF THE HOPSCOTCH SCHEME.
W. H. Hundsdorfer and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8603. 1986.]
104535 ON THE NUMERICAL INTEGRATION OF SECOND-ORDER INITIAL VALUE PROBLEMS
WITH A PERIODIC FORCING FUNCTION.
P. J. van der Houwen et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8604. 1986.]
104536 THE METHOD OF LINES AND EXPONENTIAL FITTING.
P. J. van der Houwen and F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8605. 1986.]
104537 A NOTE ON MONOTONICITY OF A ROSENBROCK METHOD.
W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8606. 1986.]
104538 THE ORDER OF B-CONVERGENCE OF ALGEBRAICALLY STABLE RUNGE-KUTTA
METHODS.
K. Burrage and W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8607. 1986.]
104539 CONVERGENCE ANALYSIS OF ONE-STEP SCHEMES IN THE METHOD OF LINES.
J. M. Sanz-Serna and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8608. 1986.]
104540 ON THE SIGN OF THE DIFFERENCE PI(X) - LI(X).
H. J. J. Te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8609. 1986.]
104541 AN ANALYSIS OF MULTIVALUED AND JOIN DEPENDENCIES BASED ON THE
ENTITY-RELATIONSHIP APPROACH.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA4/86. 1986.]
104542 THE PROLOG NOT-PREDICATE AND NEGATION AS FAILURE RULE.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB4/86. 1986.]
104543 A NORMAL FORM FOR ENTITY-RELATIONSHIP DIAGRAMS.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC4/86. 1986.]
104544 BUSINESS GRAPHICS: USAGE AND EFFECTIVENESS.
K. Venkata Rao and K. V. Rao.
[National University of Singapore. Department of Information Systems
and Computer Science. TRD4/86. 1986.]
104545 CHARACTERISATION OF TERMINATION LOGIC PROGRAMS.
T. Vasak and J. Potter.
[New South Wales Institute of Technology. School of Computing
Sciences. Technical report 86.1. 1986.]
104546 INTEGRATING VOICE AND DATA IN THE AUTOMATED OFFICE.
M. Fry.
[New South Wales Institute of Technology. School of Computing
Sciences. Technical report 86.2. 1986.]
104547 GENERALISED SUBSUMPTION AND ITS APPLICATIONS TO INDUCTION AND
REDUNDANCY.
W. Buntine.
[New South Wales Institute of Technology. School of Computing
Sciences. Technical report 86.3. 1986.]
104548 INDUCTIVE KNOWLEDGE ACQUISITION: A CASE STUDY.
J. R. Quinlan et al.
[New South Wales Institute of Technology. School of Computing
Sciences. Technical report 86.4. 1986.]
104549 A LOW COST PACKET BROADCAST SUBNET FOR MICROCOMPUTERS.
M. Fry.
[New South Wales Institute of Technology. School of Computing
Sciences. Technical report 86.5. 1986.]
104550 ELIMINATION ALGORITHMS FOR DATA FLOW ANALYSIS.
B. G. Ryder and M. C. Paull.
[Rutgers. Department of Computer Science. DCS-TR-140. 1986. Revised:
May 1986.]
104551 ALGORITHM FOR LARGE-SCALE GLOBAL MINIMIZATION OF LINEARLY CONSTRAINED
CONCAVE QUADRATIC FUNCTIONS.
B. Kalantari and J. B. Rosen.
[Rutgers. Department of Computer Science. DCS-TR-147. 1985. Revised:
August 1985.]
104552 QUERY PROCESSING IN DEDUCTIVE DATABASES WITH INCOMPLETE INFORMATION.
T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-177. 1986.]
104553 ABSTRACTION IN QUERY PROCESSING.
T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-178. 1986.]
104554 RESULTS ON TRANSLATING DEFAULTS TO CIRCUMSCRIPTION.
T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-179. 1986.]
104555 TRANSFORMING LOGICAL RULES BY RELATIONAL ALGEBRA.
T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-180. 1986.]
104556 AUTOMATED DEDUCTION IN DATABASES WITH INCOMPLETE INFORMATION.
T. Imielinski.
[Rutgers. Department of Computer Science. DCS-TR-181. 1986.]
104557 REPRESENTATION-SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE
STUDY USING N-QUEENS.
B. A. Nadel.
[Rutgers. Department of Computer Science. DCS-TR-182. 1986.]
104558 THEORY-BASED SEARCH-ORDER SELECTION FOR CONSTRAINT SATISFACTION
PROBLEMS.
B. A. Nadel.
[Rutgers. Department of Computer Science. DCS-TR-183. 1986.]
104559 THE COMPLEXITY OF SPARSE SETS IN P.
E. W. Allender.
[Rutgers. Department of Computer Science. DCS-TR-184. 1986.]
104560 WEAKLY TRIANGULATED GRAPHS ARE STRICT QUASI-PARITY GRAPHS.
C. T. Hoang and F. Maffray.
[Rutgers. Department of Computer Science. DCS-TR-185. 1986.]
104561 PROBLEMS, CHALLENGES AND OPPORTUNITIES IN NAVAL OPERATIONAL PLANNING.
C. V. Srinivasan.
[Rutgers. Department of Computer Science. DCS-TR-187. 1986.]
104562 ALTERNATING ORIENTATION AND ALTERNATING COLOURATION OF PERFECT GRAPHS.
C. T. Hoang.
[Rutgers. Department of Computer Science. DCS-TR-189. 1986. Revised:
May 1986.]
104563 CONVEX ENVELOPES FOR INDEFINITE QUADRATIC PROGRAMS.
B. Kalantari and J. B. Rosen.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-78. 1986.]
104564 A FAST ALGORITHM FOR THE MULTIPLICATION OF GENERALIZED HILBERT
MATRICES WITH VECTORS.
A. Gerasoulis.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-79. 1986.]
104565 KARMARKAR'S ALGORITHM WITH IMPROVED STEPS.
B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-80. 1986.]
025078 A NEW PROGRAM STRUCTURING MECHANISM BASED ON LAYERED GRAPHS.
H. L. Ossher.
[Stanford University. Department of Computer Science.
STAN-CS-85-1078. December 1984. Thesis (Ph.D.).]
025079 TWO PROCESSOR SCHEDULING IS IN NC.
D. Helmbold and E. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-85-1079. October 1985.]
025080 THE COMPLEAT GUIDE TO MRS.
S. Russell Esq.
[Stanford University. Department of Computer Science.
STAN-CS-85-1080. June 1985. Also issued as KSL-85-12, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025081 RATIONAL INTERACTION: COOPERATION AMONG INTELLIGENT AGENTS.
J. S. Rosenschein.
[Stanford University. Department of Computer Science.
STAN-CS-85-1081. October 1985. Thesis (Ph.D.). Also issued as
KSL-85-40, Knowledge Systems Laboratory, Department of Computer
Science, Stanford University.]
025082 PARTITIONING OF FUNCTION IN A DISTRIBUTED GRAPHICS SYSTEM.
W. I. Nowicki.
[Stanford University. Department of Computer Science.
STAN-CS-85-1082. March 1985. Thesis (Ph.D.). Also issued as Technical
report 85-282, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025083 MESSAGE PASSING ON A LOCAL NETWORK.
W. Zwaenepoel.
[Stanford University. Department of Computer Science.
STAN-CS-85-1083. October 1985. Thesis (Ph.D.). Also issued as
Technical report 85-283, Computer Systems Laboratory, Stanford
Electronics Laboratories, Stanford University.]
025084 TALIESIN: A DISTRIBUTED BULLETIN BOARD SYSTEM.
J. L. Edighoffer and K. A. Lantz.
[Stanford University. Department of Computer Science.
STAN-CS-85-1084. September 1985. Also issued as Technical report
85-284, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025085 BIBLIOGRAPHY OF COMPUTER SCIENCE REPORTS, 1963-1986.
K. A. Berg and T. Marashian.
[Stanford University. Department of Computer Science.
STAN-CS-86-1085. June 1986.]
025086 TOWARDS A UNIVERSAL DIRECTORY SERVICE.
K. A. Lantz, J. L. Edighoffer, and B. L. Hitson.
[Stanford University. Department of Computer Science.
STAN-CS-85-1086. August 1985. Also issued as Technical report 85-286,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
025087 PREEMPTABLE REMOTE EXECUTION FACILITIES FOR THE V-SYSTEM.
M. M. Theimer, K. A. Lantz, and D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-85-1087. September 1985. Also issued as Technical report
85-288, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025088 A MESSAGE PASSING FRAMEWORK FOR LOGICAL QUERY EVALUATION.
A. Van Gelder.
[Stanford University. Department of Computer Science.
STAN-CS-85-1088. December 1985.]
025089 PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS.
J. D. Ullman and A. Van Gelder.
[Stanford University. Department of Computer Science.
STAN-CS-85-1089. December 1985.]
025090 CONSTRUCTING AND ANALYZING SPECIFICATIONS OF REAL WORLD SYSTEMS.
K. Yue.
[Stanford University. Department of Computer Science.
STAN-CS-86-1090. September 1985. Thesis (Ph.D.).]
025091 LEARNING OBJECT-LEVEL AND META-LEVEL KNOWLEDGE IN EXPERT SYSTEMS.
L.-M. Fu.
[Stanford University. Department of Computer Science.
STAN-CS-86-1091. November 1985. Thesis (Ph.D.). Also issued as
KSL-85-44, Knowledge Systems Laboratory, Department of Computer
Science, Stanford University.]
025092 THE COMPLEXITY OF PARALLEL ALGORITHMS.
R. Anderson.
[Stanford University. Department of Computer Science.
STAN-CS-86-1092. November 1985. Thesis (Ph.D.).]
025093 A GENERAL READING LIST FOR ARTIFICIAL INTELLIGENCE.
D. Subramanian and B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-86-1093. December 1985. Also issued as KSL-85-54, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025094 EXPERT SYSTEMS: WORKING SYSTEMS AND THE RESEARCH LITERATURE.
B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-86-1094. December 1985. Also issued as KSL-85-37, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025095 A TORTURE TEST FOR METAFONT.
D. E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-86-1095. January 1986.]
025096 A MODEL-THEORETIC APPROACH TO UPDATING LOGICAL DATABASES.
M. W. Wilkins.
[Stanford University. Department of Computer Science.
STAN-CS-86-1096. January 1986.]
025097 TEXWARE.
D. E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-86-1097. April 1986. This report documents four TEX utility
programs: "The POOLtype Processor" (Version 2, July 1983), "The
TFtoPL Processor" (Version 2.5, September 1985), "The PLtoTF
Processor" (Version 2.3, August 1985), and "The DVItype Processor"
(Version 2.8, August 1984).]
025099 INTERPRETING LINE DRAWINGS OF CURVED OBJECTS.
J. Malik.
[Stanford University. Department of Computer Science.
STAN-CS-86-1099. December 1985. Thesis (Ph.D.).]
025101 ON RANDOM STRINGS AND SEQUENCE COMPARISONS.
D. E. Foulser.
[Stanford University. Department of Computer Science.
STAN-CS-86-1101. February 1986. Thesis (Ph.D.).]
025102 DATA INDEPENDENT RECURSION IN DEDUCTIVE DATABASES.
J. Naughton.
[Stanford University. Department of Computer Science.
STAN-CS-86-1102. February 1986.]
025103 REPRESENTING INFORMATION ABOUT FILES.
J. C. Mogul.
[Stanford University. Department of Computer Science.
STAN-CS-86-1103. March 1986. Thesis (Ph.D.).]
104590 A PROGRAM TRANSFORMATION REGARDED AS A PROOF TRANSFORMATION.
L. Shrira and N. Francez.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 371. 1985.]
104591 ON THE MESSAGE COMPLEXITY AND BIT COMPLEXITY OF DISTRIBUTED SORTING.
O. Gerstel and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 373. 1985.]
104592 ON THE COST OF SENSE OF DIRECTION IN DISTRIBUTED NETWORKS.
Z. Harpaz and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 378. 1985.]
104593 A MODULAR TECHNIQUE FOR THE DESIGN OF EFFICIENT DISTRIBUTED LEADER
FINDING ALGORITHMS.
E. Korach, S. Kutten, and S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 379. 1985.]
104594 COOPERATIVE DISTRIBUTED ALGORITHMS FOR DYNAMIC CYCLE PREVENTION.
S. Katz and O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 380. 1985. Revised version: October 1985.]
104595 ON THE BIT COMPLEXITY OF DISTRIBUTED COMPUTATIONS ON A UNIDIRECTIONAL
RING WITH A LEADER.
Y. Mansour and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 383. 1985.]
104596 ACYCLIC HYPERGRAPH PROJECTIONS AND RELATIONSHIPS TO CIRCULAR-ARC
GRAPHS AND CIRCULAR REPRESENTABLE HYPERGRAPHS.
A. Lustig and O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 385. 1985.]
104597 OVERHEAD OF LOCKING PROTOCOLS IN A DISTRIBUTED DATABASE.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 386. 1985.]
104598 CONCURRENT EXECUTION OF SYNTACTICALLY IDENTICAL TRANSACTIONS.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 387. 1985.]
104599 PROVING NONINTERACTION: AN OPTIMIZED APPROACH.
R. Gerth and L. Shrira.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 388. 1985.]
104600 A 1.44...NLOGN ALGORITHM FOR DISTRIBUTED LEADER FINDING IN
BIDIRECTIONAL RINGS OF PROCESSORS.
S. Moran, M. Shalom, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 389. 1985.]
104601 INFINITE TREES, MARKINGS AND WELL FOUNDEDNESS.
R. Rinat, N. Francez, and O. Grumberg.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 390. 1985.]
104602 YAPES - YET ANOTHER PROLOG EXPERT SYSTEM.
T. Niblett.
[Turing Institute. TIRM-84-008. 1984.]
104603 AN APPROPRIATE REPRESENTATION FOR EARLY VISION.
P. H. Mowforth, J. Jelinek, and Z. P. Jin.
[Turing Institute. TIRM-86-017. 1985.]
104604 MEHRGITTERVERFAHREN ZUR ERMITTLUNG VON VERSCHIEBUNGSVEKTORFELDERN IN
BILDFOLGEN.
W. Enkelmann.
[Universitaet Hamburg. Fachbereich Informatik. FBI-HH-B-115/85. 1985.]
104605 VERKLEMMUNGSFREIE BETRIEBSMITTELZUTEILUNG MIT HILFE VON RESIDUEN.
D. Hauschildt.
[Universitaet Hamburg. Fachbereich Informatik. FBI-HH-118/85. 1985.]
104606 THE ROLE OF OUTCOME CONFLICT IN DUAL-TASK INTERFERENCE.
D. Navon and J. Miller.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8601. 1986.]
104607 GRAPHICAL INTERFACES FOR SIMULATION.
J. D. Hollan et al.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8603. 1986.]
104608 SERIAL ORDER: A PARALLEL DISTRIBUTED PROCESSING APPROACH.
M. I. Jordan.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8604. 1986.]
104609 A COMBINATORIAL PROPERTY OF EOL LANGUAGES.
A. Ehrenfeucht, G. Rozenberg, and R. Verraedt.
[University of Colorado. Department of Computer Science.
CU-CS-273-84. 1984.]
104610 COMPUTATIONAL EXPERIENCE WITH CONFIDENCE REGIONS AND CONFIDENCE
INTERVALS FOR NONLINEAR LEAST SQUARES.
J. R. Donaldson and R. B. Schnabel.
[University of Colorado. Department of Computer Science.
CU-CS-302-84. 1985.]
104611 COMBINATORIAL PROPERTIES OF BOUNDARY NLC GRAPH LANGUAGES.
G. Rozenberg and E. Welzl.
[University of Colorado. Department of Computer Science.
CU-CS-295-85. 1985.]
104612 IMMINENT GARBAGE COLLECTION.
J. Shultis.
[University of Colorado. Department of Computer Science.
CU-CS-305-85. 1985.]
104613 DCS: A SYSTEM FOR DISTRIBUTED COMPUTING SUPPORT.
P. K. Harter Jr. and P. Maybee.
[University of Colorado. Department of Computer Science.
CU-CS-309-85. 1985.]
104614 AN IMPLEMENTATION OF SHARED MEMORY FOR UNIX WITH REAL-TIME
SYNCHRONIZATION.
P. K. Harter Jr. and G. R. Bollendonk.
[University of Colorado. Department of Computer Science.
CU-CS-310-85. 1985.]
104615 A TRUST REGION ALGORITHM FOR NONLINEARLY CONSTRAINED OPTIMIZATION.
R. H. Byrd, R. B. Schnabel, and G. A. Shultz.
[University of Colorado. Department of Computer Science.
CU-CS-313-85. 1985.]
104616 A TECHNIQUE FOR PROVING INTRINSIC LIMITATIONS OF ALGORITHM DESIGNS.
K. Winklmann.
[University of Colorado. Department of Computer Science.
CU-CS-315-85. 1985.]
104617 AN OPTIMIZING PRECOMPILER FOR FINITE-DIFFERENCE COMPUTATIONS ON A
VECTOR COMPUTER.
J. Gary and L. Fosdick.
[University of Colorado. Department of Computer Science.
CU-CS-316-85. 1985.]
104618 A STABLE AND EFFICIENT ALGORITHM FOR NONLINEAR ORTHOGONAL DISTANCE
REGRESSION.
P. T. Boggs, R. H. Byrd, and R. B. Schnabel.
[University of Colorado. Department of Computer Science.
CU-CS-317-85. 1985.]
104619 EXCEPTION FLOW ANALYSIS IN ADA.
D. A. Baker and S. M. Sutton Jr..
[University of Colorado. Department of Computer Science.
CU-CS-319-86. 1986.]
104620 INFORMATION PROCESSING IN DYNAMICAL SYSTEMS: FOUNDATIONS OF HARMONY
THEORY.
P. Smolensky.
[University of Colorado. Department of Computer Science.
CU-CS-321-86. 1986.]
104621 INSTANCE COMPLEXITY FOR SORTING AND NP-COMPLETE PROBLEMS.
H. Mannila.
[University of Helsinki. Department of Computer Science. A-1985-1.
1985.]
104622 PROGRAM BEHAVIOUR IN MEMORY HIERARCHIES.
I. J. Haikala.
[University of Helsinki. Department of Computer Science. A-1986-2.
1986.]
104623 THE STRUCTURE OF POLYNOMIAL COMPLEXITY CORES.
P. Orponen.
[University of Helsinki. Department of Computer Science. A-1986-3.
1986.]
104639 OPTIMISTIC PARTITIONED OPERATION IN DISTRIBUTED DATABASE SYSTEMS.
A. V. Ma.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1250. 1986. Thesis (Ph.D.).]
104640 UIGKS: A DISTRIBUTED GRAPHICS SYSTEM.
G. S. Rogers.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1253. 1986. Thesis (M.S.).]
104641 THE STRUCTURE-MAPPING ENGINE.
B. Falkenhainer, K. D. Forbus, and D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1275. 1986.]
104642 PROBABILISTIC INFERENCE.
W. D. Lee and S. R. Ray.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1278. 1986.]
104643 RULE REFINEMENT USING THE PROBABILISTIC RULE GENERATOR.
W. D. Lee and S. R. Ray.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1279. 1986.]
104644 UNIVERSITY OF ILLINOIS GRAPHICAL KERNEL SYSTEM: C LANGUAGE BINDING.
G. S. Rogers.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1280. 1986.]
104645 UNIVERSITY OF ILLINOIS GRAPHICAL KERNEL SYSTEM VIRTUAL WORKSTATION
SERVER SPECIFICATION.
G. S. Rogers.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1281. 1986.]
104646 ON THE EFFECTIVENESS OF GUMMEL'S METHOD.
T. Kerkhoven.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1283. 1986.]
104647 THE UNIFIELD PROCESSOR, A MATRIX COMPUTER USING STRINGS OF "ONES" TO
REPRESENT DECIMALS.
W. J. Poppelbaum.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1285. 1986. "Based on the original proposal of
1983, revised 1984."]
104648 AN UNIX 4.2BSD IMPLEMENTATION OF PROCESS SUSPENSION AND RESUMPTION.
A. Y.-C. Chen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1286. 1986. Thesis (M.S.).]
104649 ERROR ESTIMATES FOR DIFFERENTIAL-ALGEBRAIC EQUATIONS.
B. J. Leimkuhler.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1287. 1986.]
104650 BATCHER'S SORTS.
J. V. Carlis.
[University of Minnesota. Supercomputer Institute. UMSI 86/27. 1986.]
104651 MULTITASKING MATHEMATICAL PROGRAMMING ALGORITHMS.
A. T. Phillips and J. B. Rosen.
[University of Minnesota. Supercomputer Institute. UMSI 86/28. 1986.]
104652 CONVECTIVE CURRENTS ON SLOPING BOUNDARIES.
G. M. Horsch and H. G. Stefan.
[University of Minnesota. Supercomputer Institute. UMSI 86/29. 1986.]
104653 MONTE-CARLO CALCULATION FOR THE EFFECTIVE COUPLINGS OF POLYAKOV LOOPS.
J. Deckert, S. Wansleben, and J. G. Zabolitzky.
[University of Minnesota. Supercomputer Institute. UMSI 86/30. 1986.]
104654 MESSAGE PASSING IN SYNCHRONOUS HYPERCUBES.
C. McCrosky.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-4. 1986.]
104655 OPTIMALITY OF PARTIAL MATCH SEARCH IN BD TREES.
S. P. Dandamudi and P. G. Sorenson.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-5. 1986.]
104656 REALIZING THE PARALLELISM OF ARRAY-BASED COMPUTATION.
C. McCrosky.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-6. 1986.]
104657 ON THE SELECTION OF THE APPROACH FOR THE DEVELOPMENT OF THE REFERENCE
MODEL FOR DBMS STANDARDS.
H. Kangassalo.
[University of Tampere. Department of Mathematical Sciences. A104.
1983.]
104568 A VIRTUAL LUKKO MACHINE AND ITS IMPLEMENTATION.
J.-M. Heimonen.
[University of Tampere. Department of Mathematical Sciences. A105.
1983.]
104659 THE ABC SYSTEM - A COLLECTION OF RESEARCH ARTICLES.
P. Jaervinen.
[University of Tampere. Department of Mathematical Sciences. A112.
1983.]
104660 ON THE SEMANTICS OF DATA ABSTRACTION.
H. Kangassalo.
[University of Tampere. Department of Mathematical Sciences. A116.
1983.]
104661 A TOOL FOR TEACHING PROGRAM VERIFICATION.
P. Hietala.
[University of Tampere. Department of Mathematical Sciences. A148.
1985. Thesis (Licentiate in Philosophy).]
104662 THE SPECIFICATION OF DATA REFORMATTING IN DATA CONVERSION.
T. Niemi.
[University of Tampere. Department of Mathematical Sciences. A150.
1985.]
104663 A SYSTEMATIC APPROACH TO MODELLING THE COSTS OF FLAT FILES.
K. Jaervelin.
[University of Tampere. Department of Mathematical Sciences. A152.
1985. Thesis (Licentiate in Philosophy).]
104664 ADVANCED TOOLS FOR THE DATABASE ADMINISTRATOR.
K. Jaervelin and T. Niemi.
[University of Tampere. Department of Mathematical Sciences. A164.
1986.]
104665 CARRIER SENSE MULTIPLE ACCESS ON THE BUS TOPOLOGY.
K. Sohraby.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-174. 1985. Thesis (Ph.D.).]
104666 EMBEDDING BINARY TREES IN A HYPERCUBE.
A. Wagner.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-175. 1985.]
104667 GEOMETRIC CONTINUITY OF SPLINE CURVES AND SURFACES.
K. Hoellig.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 645. 1986.]
104668 PARALLEL, HIERARCHICAL SOFTWARE/HARDWARE PYRAMID ARCHITECTURES.
L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 646. 1986.]
104669 PARALLEL SUCCESSIVE OVERRELAXATION METHODS FOR SYMMETRIC LINEAR
COMPLEMENTARITY PROBLEMS AND LINEAR PROGRAMS.
O. L. Mangasarian and R. De Leone.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 647. 1986.]
104670 BREAKPOINTS AND HALTING IN DISTRIBUTED PROGRAMS.
B. P. Miller and J.-D. Choi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 648. 1986.]
104671 EXPERIENCE WITH CRYSTAL, CHARLOTTE AND LYNX: SECOND REPORT.
R. Finkel et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 649. 1986.]
104672 DEMOS/MP: THE DEVELOPMENT OF A DISTRIBUTED OPERATING SYSTEM.
B. P. Miller, D. L. Presotto, and M. L. Powell.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 650. 1986.]
104673 TOWARD A COMPUTATIONAL INFORMATION-PROCESSING MODEL OF OBJECT
PERCEPTION.
L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 651. 1986.]
104674 DETERMINISTIC TIME AND ANALYTICAL MODELS OF PARALLEL ARCHITECTURES.
M. A. Holliday.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 652. 1986. Thesis (Ph.D.).]
104675 TEACHING A SOFTWARE DESIGN METHODOLOGY.
D. M. Weiss.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-04. 1986.]
104676 MULTILINGUAL PROGRAMMING: COORDINATION PROGRAMS, USER INTERFACES,
ON-LINE HELP, AND DOCUMENTATION.
G. Perlman.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-05. 1986.]
104677 PARTIAL EXPANSIONS FOR FILE ORGANIZATIONS WITH AN INDEX.
D. B. Lomet.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-06. 1986.]
104678 THE ALPINE FILE SYSTEM.
M. R. Brown, K. Kolling, and E. A. Taft.
[Xerox Corporation. Palo Alto Research Center. CSL-84-4. 1984.]
104679 EXPERIENCE WITH THE CEDAR PROGRAMMING ENVIRONMENT FOR COMPUTER
GRAPHICS RESEARCH.
R. J. Beach.
[Xerox Corporation. Palo Alto Research Center. CSL-84-6. 1985.]
104680 ON ADDING GARBAGE COLLECTION AND RUNTIME TYPES TO A STRONGLY-TYPED,
STATICALLY-CHECKED, CONCURRENT LANGUAGE.
P. Rovner.
[Xerox Corporation. Palo Alto Research Center. CSL-84-7. 1985.]
104681 DISTRIBUTED NAME SERVERS: NAMING AND CACHING IN LARGE DISTRIBUTED
COMPUTING ENVIRONMENTS.
B. D. Terry.
[Xerox Corporation. Palo Alto Research Center. CSL-85-1. 1985. Thesis
(Ph.D.). Dissertation performed for the Computer Science Division of
the University of California at Berkeley.]
104682 SETTING TABLES AND ILLUSTRATIONS WITH STYLE.
R. J. Beach.
[Xerox Corporation. Palo Alto Research Center. CSL-85-3. 1985. Thesis
(Ph.D.). "A thesis presented to the University of Waterloo in
fulfillment of the thesis requirements for the degree of Doctor of
Philosophy in Computer Science."]
104683 WHITEBOARDS: A GRAPHICAL DATABASE TOOL.
J. Donahue and J. Widom.
[Xerox Corporation. Palo Alto Research Center. CSL-85-4. 1985.]
104684 A CACHING FILE SYSTEM FOR A PROGRAMMER'S WORKSTATION.
M. D. Schroeder, D. K. Gifford, and R. M. Needham.
[Xerox Corporation. Palo Alto Research Center. CSL-85-7. 1985.]
104685 AN EFFECTIVE TEST STRATEGY.
H. Sturgis.
[Xerox Corporation. Palo Alto Research Center. CSL-85-8. 1985.]
104686 WALNUT: STORING ELECTRONIC MAIL IN A DATABASE.
J. Donahue and W.-S. Orr.
[Xerox Corporation. Palo Alto Research Center. CSL-85-9. 1985.]
104687 FRACTIONAL CASCADING.
B. Chazelle and L. J. Guibas.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 12. 1986.]
104688 EXEMPLES DE DEVELOPPEMENT DE PROGRAMMES DANS LA THEORIE DES
CONSTRUCTIONS.
C. Mohring.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 497. 1986.]
104689 AN OVERVIEW OF THE NYU ULTRACOMPUTER PROJECT.
A. Gottlieb.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 100. 1986.]
104690 INTEGRATION OF FREE-FORM SURFACES AND SOLID MODELLING.
P.-O. Fjaellstroem.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8510. 1985. "Dissertation."]
104691 REGULAR ITERATIVE ALGORITHMS AND THEIR IMPLEMENTATIONS ON PROCESSOR
ARRAYS.
S. K. Rao.
[Stanford University. Stanford Electronics Laboratories. Information
Systems Laboratory. 1985. Thesis (Ph.D.).]
104692 A SURVEY OF RESTRICTIONS IN PASCAL IMPLEMENTATIONS.
R. S. Smith and B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 72/86. 1986.]
104693 SURVEY AND EXAMPLES OF SPECIFICATION TECHNIQUES FOR USER-COMPUTER
INTERFACES.
R. J. K. Jacob.
[United States. Naval Research Laboratory. Report no. 8948. 1986.]
104694 CHOOSING ARCHITECTURES FOR EXPERT SYSTEMS.
P. J. Kline and S. B. Dolins.
[United States. Rome Air Development Center, Griffiss AFB, New York.
RADC-TR-85-192. 1985.]
104695 TRANSDUCERS AND REPETITIONS.
M. Crochemore.
[Universite Paris-Nord. Department de Mathematique et Informatique.
Fascicule 66. n.d.]
104696 UNSYMMETRIC HYPERBOLIC SYSTEMS AND THE EULER EQUATIONS AT LOW
MACH-NUMBERS.
B. Gustafsson.
[University of Uppsala. Department of Computer Science. Report no.
104. 1986.]
104697 FEATURE POINT MATCHING USING TEMPORAL SMOOTHNESS IN VELOCITY.
I. K. Sethi, V. Salari, and S. Vemuri.
[Wayne State University. Department of Computer Science. CSC-86-003.
1986.]
VOL. 8, NO. 8 10/03/86
104698 THE TORUS ROUTING CHIP.
W. J. Dally and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5208:TR:86. 1986.]
104699 A VLSI ARCHITECTURE FOR CONCURRENT DATA STRUCTURES.
W. J. Dally.
[California Institute of Technology. Computer Science Department.
Report no. 5209:TR:86. 1986. Thesis (Ph.D.).]
104700 COMPILING COMMUNICATING PROCESSES INTO DELAY-INSENSITIVE VLSI
CIRCUITS.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5210:TR:86. 1986.]
104701 ASK IS TRANSPORTABLE IN HALF A DOZEN WAYS.
B. H. Thompson and F. B. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5214:TR:86. 1985.]
104702 HOW TO GET A LARGE NATURAL-LANGUAGE SYSTEM INTO A PERSONAL COMPUTER.
B. H. Thompson and F. B. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5215:TR:86. 1985.]
104703 LINGUISTIC ANALYSIS OF NATURAL LANGUAGE COMMUNICATION WITH COMPUTERS.
B. H. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5216:TR:86. 1980. "This paper is identical with the one
published in the 'Proceedings of COLING 80' except for the formating,
corrections of a few typographical errors, and the inclusion of the
Appendix." "The Appendix contains some data very relevant to the
experiments which were included in the presentation but not in the
paper due to space limitations."]
104704 THE SYNC MODEL: A PARALLEL EXECUTION METHOD FOR LOGIC PROGRAMMING.
P. P. Li and A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5221:TR:86. 1986.]
104705 A PARALLEL EXECUTION MODEL FOR LOGIC PROGRAMMING.
P. P. Li.
[California Institute of Technology. Computer Science Department.
Report no. 5227:TR:86. 1986. Thesis (Ph.D.).]
104706 RELIABLE COMMUNICATION IN AN UNRELIABLE ENVIRONMENT.
K. P. Birman and T. A. Joseph.
[Cornell University. Department of Computer Science. Technical report
85-694. 1985. Revised: September 1985.]
104707 COMBINATORIAL PROBLEMS IN MATRIX COMPUTATION.
A. Edenbrandt.
[Cornell University. Department of Computer Science. Technical report
85-695. 1985. Thesis (Ph.D.).]
104708 GENERATING LANGUAGE-BASED EDITORS: A RELATIONALLY-ATTRIBUTED APPROACH.
S. B. Horwitz.
[Cornell University. Department of Computer Science. Technical report
85-696. 1985. Thesis (Ph.D.).]
104709 THE GENERIC PROGRAMMING LANGUAGE MANUAL.
J. A. Solworth.
[Cornell University. Department of Computer Science. Technical report
85-698. 1985.]
104710 THE POTENTIAL METHOD FOR BLENDING SURFACES AND CORNERS.
C. Hoffmann and J. Hopcroft.
[Cornell University. Department of Computer Science. Technical report
85-699. 1985.]
104711 INVESTIGATIONS OF TYPE THEORY IN PROGRAMMING LOGICS AND INTELLIGENT
SYSTEMS.
R. L. Constable.
[Cornell University. Department of Computer Science. Technical report
85-701. 1985.]
104712 THE COMPLEXITY OF FACETS RESOLVED.
C. H. Papadimitriou and D. Wolfe.
[Cornell University. Department of Computer Science. Technical report
85-702. 1985.]
104713 IN-SITU INVERSION OF A CYCLIC PERMUTATION.
W. H. J. Feijen, A. J. M. Van Gasteren, and D. Gries.
[Cornell University. Department of Computer Science. Technical report
85-703. 1985.]
104714 THE EFFECTIVENESS AND EFFICIENCY OF AGGLOMERATIVE HIERARCHIC
CLUSTERING IN DOCUMENT RETRIEVAL.
E. M. Voorhees.
[Cornell University. Department of Computer Science. Technical report
85-705. 1985. Thesis (Ph.D.).]
104715 CHECKPOINTING AND ROLLBACK-RECOVERY FOR DISTRIBUTED SYSTEMS.
R. Koo and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
85-706. 1985.]
104716 ON SPARSE ORACLES SEPARATING FEASIBLE COMPLEXITY CLASSES.
J. Hartmanis and L. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
85-707. 1985.]
104717 SAFETY WITHOUT STUTTERING.
B. L. Alpern, A. J. Demers, and F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
85-708. 1985.]
104718 LOOP QUANTIZATION: UNWINDING FOR FINE-GRAIN PARALLELISM EXPLOITATION.
A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
85-709. 1985.]
104719 MICROFLOW: A FINE-GRAIN PARALLEL PROCESSING APPROACH.
J. A. Solworth and A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
85-710. 1985.]
104720 DEVELOPING TWO OF ARSAC'S FUNNY ALGORITHMS.
D. Gries.
[Cornell University. Department of Computer Science. Technical report
85-711. 1985.]
104721 LOW COST MANAGEMENT OF REPLICATED DATA.
T. A. Joseph.
[Cornell University. Department of Computer Science. Technical report
85-712. 1985. Thesis (Ph.D.).]
104722 TYPE THEORY AND CONCURRENCY.
R. Cleaveland and P. Panangaden.
[Cornell University. Department of Computer Science. Technical report
85-714. 1985.]
104723 WITH PROBABILITY ONE, A RANDOM ORACLE SEPARATES PSPACE FROM THE
POLYNOMIAL-TIME HIERARCHY.
J. Cai.
[Cornell University. Department of Computer Science. Technical report
85-715. 1985.]
104724 CATEGORICAL TYPE THEORY.
P. Panangaden and M. I. Schwartzbach.
[Cornell University. Department of Computer Science. Technical report
85-716. 1985.]
104725 SEMANTICS OF DIGITAL NETWORKS CONTAINING INDETERMINATE MODULES.
R. M. Keller and P. Panangaden.
[Cornell University. Department of Computer Science. Technical report
85-717. 1985.]
104726 A GENERAL FRAMEWORK FOR COMPUTING BLOCK ACCESSES.
B. T. Vander Zanden, H. M. Taylor, and D. Bitton.
[Cornell University. Department of Computer Science. Technical report
85-718. 1985.]
104727 THE COMPLEXITY OF OPTIMIZATION PROBLEMS.
M. W. Krentel.
[Cornell University. Department of Computer Science. Technical report
85-719. 1985.]
104728 RELIABLE BROADCASTS THROUGH PARTIAL BROADCASTS.
OE. Babaoglu and P. Stephenson.
[Cornell University. Department of Computer Science. Technical report
85-720. 1985.]
104729 MAINTAINING AVAILABILITY IN PARTITIONED REPLICATED DATABASES.
A. El Abbadi and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
85-721. 1986. Revised: April 1986.]
104730 A DEVELOPMENT ENVIRONMENT FOR SCIENTIFIC PARALLEL PROGRAMS.
A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
86-722. 1985.]
104731 VERIFYING TEMPORAL PROPERTIES WITHOUT USING TEMPORAL LOGIC.
B. L. Alpern and F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
85-723. 1985.]
104732 THE BOOLEAN HIERARCHY: HARDWARE OVER NP.
Y. Cai and L. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
85-724. 1985. Revised: December 1985.]
104733 GEOMETRIC AMBIGUITIES IN BOUNDARY REPRESENTATIONS.
C. Hoffmann and J. Hopcroft.
[Cornell University. Department of Computer Science. Technical report
86-725. 1986.]
104734 ON ESTIMATING THE CONDITION OF EIGENVALUES AND EIGENVECTORS.
C. Van Loan.
[Cornell University. Department of Computer Science. Technical report
86-726. 1986.]
104735 RECOGNIZING SAFETY AND LIVENESS.
B. L. Alpern and F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
86-727. 1986. Revised: June 1986.]
104736 MCLAREN'S MASTERPIECE.
D. Gries and J. F. Prins.
[Cornell University. Department of Computer Science. Technical report
86-729. 1986.]
104737 COMPUTING A SPARSE BASIS FOR THE NULL SPACE.
J. R. Gilbert and M. T. Heath.
[Cornell University. Department of Computer Science. Technical report
86-730. 1986.]
104738 PERFORMANCE EVALUATION OF MAIN MEMORY DATABASE SYSTEMS.
D. Bitton and C. Turbyfill.
[Cornell University. Department of Computer Science. Technical report
86-731. 1986.]
104739 PROVING TEMPORAL PROPERTIES OF CONCURRENT PROGRAMS: A NON-TEMPORAL
APPROACH.
B. L. Alpern.
[Cornell University. Department of Computer Science. Technical report
86-732. 1986. Thesis (Ph.D.).]
104740 A PARALLEL ALGORITHM FOR LARGE SPARSE SYMBOLIC AND NUMERIC CHOLESKY
FACTORIZATION ON A MULTIPROCESSOR.
E. Zmijewski and J. R. Gilbert.
[Cornell University. Department of Computer Science. Technical report
86-733. 1986.]
104741 THE COMPLEXITY OF FINE MOTION PLANNING.
B. K. Natarajan.
[Cornell University. Department of Computer Science. Technical report
86-734. 1986.]
104742 ON THE RELIABILITY OF FAULT-TOLERANT DISTRIBUTED COMPUTING SYSTEMS.
OE. Babaoglu.
[Cornell University. Department of Computer Science. Technical report
86-738. 1986. Revised: May 1986.]
104743 SORTING LARGE FILES ON A BACKEND MULTIPROCESSOR.
M. Beck, D. Bitton, and W. K. Wilkinson.
[Cornell University. Department of Computer Science. Technical report
86-741. 1986.]
104744 FORMALIZED METAREASONING IN TYPE THEORY.
T. B. Knoblock and R. L. Constable.
[Cornell University. Department of Computer Science. Technical report
86-742. 1986.]
104745 INFINITE OBJECTS IN TYPE THEORY.
N. P. Mendler, P. Panangaden, and R. L. Constable.
[Cornell University. Department of Computer Science. Technical report
86-743. 1986.]
104746 ISIS: A SYSTEM FOR FAULT-TOLERANT DISTRIBUTED COMPUTING.
K. P. Birman.
[Cornell University. Department of Computer Science. Technical report
86-744. 1986.]
104747 ABSTRACTIONS FOR FAULT TOLERANCE IN DISTRIBUTED SYSTEMS.
F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
86-745. 1986.]
104748 COMPLEXITY CLASSES WITHOUT MACHINES: ON COMPLETE LANGUAGES FOR UP.
J. Hartmanis and L. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
86-746. 1986.]
104749 THE NULL SPACE PROBLEM II: ALGORITHMS.
T. F. Coleman and A. Pothen.
[Cornell University. Department of Computer Science. Technical report
86-747. 1986.]
104750 MODULAR MULTI-RESOLUTION VISION PROCESSOR.
I. Masaki.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5260R. 1986.]
104751 CIRCUIT SYNTHESIS INCORPORATING ARCHITECTURAL CHOICES.
P. J. Ainslie et al.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5467. 1986.]
104752 CONCURRENT PROLOG RE-EXAMINED.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-102.
1985.]
104753 AN ALGEBRAIC MANIPULATION SYSTEM USING META-LEVEL INFERENCE BASED ON
HUMAN HEURISTICS.
T. Takewaki et al.
[Institute for New Generation Computer Technology (ICOT). TR-140.
1985.]
104754 A MODEL AND AN ARCHITECTURE FOR A RELATIONAL KNOWLEDGE BASE.
H. Yokota and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-141.
1985.]
104755 EVALUATION OF PSI MICRO-INTERPRETER.
H. Nakashima et al.
[Institute for New Generation Computer Technology (ICOT). TR-142.
1985.]
104756 AN ALGORITHM FOR FINDING A QUERY WHICH DISCRIMINATES COMPETING
HYPOTHESES.
H. Seki and A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-143.
1985.]
104757 SPREADSHEETS WITH INCREMENTAL QUERIES AS A USER INTERFACE FOR LOGIC
PROGRAMMING.
M. H. Van Emden, M. Ohki, and A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-144.
1985.]
104758 MAKING EXHAUSTIVE SEARCH PROGRAMS DETERMINISTIC.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-145.
1985.]
104759 A PARALLEL PARSING SYSTEM FOR NATURAL LANGUAGE ANALYSIS.
Y. Matsumoto.
[Institute for New Generation Computer Technology (ICOT). TR-146.
1985.]
104760 APPLICATION OF PARTIAL EVALUATION TO THE ALGEBRAIC MANIPULATION
SYSTEM AND ITS EVALUATION.
T. Takewaki et al.
[Institute for New Generation Computer Technology (ICOT). TR-148.
1985.]
104761 FORMAL SEMANTICS OF A RELATIONAL KNOWLEDGE BASE.
M. Murakami, H. Yokota, and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-149.
1985.]
104762 LOGIC-BASED RETRIEVAL AND REUSE OF SOFTWARE MODULES.
H. Katoh, H. Yoshida, and M. Sugimoto.
[Institute for New Generation Computer Technology (ICOT). TR-153.
1985.]
104763 A LARGE-SCALE KNOWLEDGE BASE MACHINE CONTROL TECHNIQUE USING
MULTI-PORT PAGE MEMORY.
H. Monoi et al.
[Institute for New Generation Computer Technology (ICOT). TR-156.
1986.]
104764 PARALLEL CONTROL TECHNIQUES FOR DEDICATED RELATIONAL DATABASE ENGINES.
M. Abe, T. Kakuta, and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-157.
1986.]
104765 RETRIEVAL-BY-UNIFICATION OPERATION ON A RELATIONAL KNOWLEDGE BASE
MODEL.
Y. Morita et al.
[Institute for New Generation Computer Technology (ICOT). TR-158.
1986.]
104766 DISTRIBUTED IMPLEMENTATION OF FGHC - TOWARD THE REALIZATION OF
MULTI-PSI SYSTEM.
M. Kishishita et al.
[Institute for New Generation Computer Technology (ICOT). TR-159.
1986.]
104767 THE ARCHITECTURE AND PRELIMINARY EVALUATION RESULTS OF THE
EXPERIMENTAL PARALLEL INFERENCE MACHINE PIM-D.
E. Kuno et al.
[Institute for New Generation Computer Technology (ICOT). TR-160.
1986.]
104768 A THEOREM PROVER BASED ON CONNECTION GRAPH AND ITS IMPLEMENTATION BY
PROLOG.
T. Minami.
[Institute for New Generation Computer Technology (ICOT). TR-161.
1986.]
104769 PARALLEL LOGIC PROGRAMMING LANGUAGES.
A. Takeuchi and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-163.
1986.]
104770 AFFINITY BETWEEN META INTERPRETERS AND PARTIAL EVALUATION.
A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-166.
1986.]
104771 GUARDED HORN CLAUSES AND EXPERIENCES WITH PARALLEL LOGIC PROGRAMMING.
J. Tanaka et al.
[Institute for New Generation Computer Technology (ICOT). TR-168.
1986.]
104772 INTELLIGENT SUPPORT FOR OFFICE WORK WITH A PROLOG-BASED
OBJECT-ORIENTED PROGRAMMING LANGUAGE ESP.
H. Sato and H. Matsumoto.
[Institute for New Generation Computer Technology (ICOT). TR-172.
1986.]
104773 DEVELOPMENT OF EXPERT SYSTEMS IN THE FIFTH GENERATION COMPUTER
SYSTEMS PROJECT.
Y. Iwashita and J. Sawamoto.
[Institute for New Generation Computer Technology (ICOT). TR-173.
1986.]
104774 AN INTEGRATED KNOWLEDGE REPRESENTATION SCHEME FOR EXPERT SYSTEMS.
H. Takenouchi and Y. Iwashita.
[Institute for New Generation Computer Technology (ICOT). TR-174.
1986.]
104775 SOUNDNESS AND COMPLETENESS OF EXTENDED EXECUTION FOR PROVING
PROPERTIES OF PROLOG PROGRAMS.
T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-175.
1986.]
104776 ARGUS/V: A SYSTEM FOR VERIFICATION OF PROLOG PROGRAMS.
T. Kanamori et al.
[Institute for New Generation Computer Technology (ICOT). TR-176.
1986.]
104777 CONSTRUCTION OF LOGIC PROGRAMS BASED ON GENERALIZED UNFOLD/FOLD RULES.
T. Kanamori and K. Horiuchi.
[Institute for New Generation Computer Technology (ICOT). TR-177.
1986.]
104778 DEVIATION OF LOGIC PROGRAMS FROM IMPLICIT DEFINITION.
T. Kanamori and M. Maeji.
[Institute for New Generation Computer Technology (ICOT). TR-178.
1986.]
104779 UNFOLD/FOLD TRANSFORMATION OF LOGIC PROGRAMS WITH COUNTERS.
T. Kanamori and H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TR-179.
1986.]
041813 THE VARIATIONAL APPROACH TO SHAPE FROM SHADING.
B. K. P. Horn and M. J. Brooks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 813. 1985.]
041832 PERSPECTIVE PROJECTION INVARIANTS.
A. Verri and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 832. 1986. Also issued as C.B.I.P. paper 011,
Center for Biological Information Processing, Whitaker College.]
041845 THE INCREMENTAL RIGIDITY SCHEME FOR RECOVERING STRUCTURE FROM MOTION:
POSITION VS. VELOCITY BASED FORMULATIONS.
N. M. Grzywacz and E. C. Hildreth.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 845. 1985. Also issued as C.B.I.P. memo 015,
Center for Biological Information Processing, Whitaker College.]
041846 THE COMPUTATIONAL APPROACH TO VISION AND MOTOR CONTROL.
E. C. Hildreth and J. M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 846. 1985. Also issued as C.B.I.P. memo 014,
Center for Biological Information Processing, Whitaker College.]
041854 A CLOSED FORM SOLUTION FOR INVERSE KINEMATICS OF ROBOT MANIPULATOR
WITH REDUNDANCY.
P. H. Chang.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 854. 1986.]
041855 SENSING STRATEGIES FOR DISAMBIGUATING AMONG MULTIPLE OBJECTS IN KNOWN
POSES.
W. E. L. Grimson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 855. 1985.]
041856 THE COMPUTATIONAL COMPLEXITY OF TWO-LEVEL MORPHOLOGY.
G. E. Barton Jr..
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 856. 1985.]
041861 THE SYNTHESIS OF FORCE-CLOSURE GRASPS IN THE PLANE.
V.-D. Nguyen.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 861. 1985.]
041862 THE SYNTHESIS OF STABLE GRASPS IN THE PLANE.
V.-D. Nguyen.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 862. 1985.]
041864 A ROBUST LAYERED CONTROL SYSTEM FOR A MOBILE ROBOT.
R. A. Brooks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 864. 1985.]
041867 EXPLOITING SEQUENTIAL PHONETIC CONSTRAINTS IN RECOGNIZING SPOKEN
WORDS.
D. P. Huttenlocher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 867. 1985.]
041868 CIRCUMSCRIBING CIRCUMSCRIPTION: A GUIDE TO RELEVANCE AND
INCOMPLETENESS.
B. C. Williams.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 868. 1985.]
041869 A VISION CHIP.
J. Batali.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 869. 1981. Thesis (M.S.).]
041870 THE OPTICAL FLOW OF PLANAR SURFACES.
S. Ullman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 870. 1985.]
041871 HERMENEUTICS: FROM TEXTUAL EXPLICATION TO COMPUTER UNDERSTANDING?
J. C. Mallery, R. Hurwitz, and G. Duffy.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 871. 1986.]
041873 DIAGRAM UNDERSTANDING: THE INTERSECTION OF COMPUTER VISION AND
GRAPHICS.
F. S. Montalvo.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 873. 1985.]
041875 SPATIO-TEMPORAL REASONING AND LINEAR INEQUALITIES.
R. E. Valdes-Perez.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 875. 1986.]
041877 THE OUTER SOLAR SYSTEM FOR 210 MILLION YEARS.
J. H. Applegate et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 877. 1986.]
041882 REDUNDANCY RESOLUTION OF MANIPULATORS THROUGH TORQUE OPTIMIZATION.
J. M. Hollerbach and K. C. Suh.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 882. 1986.]
041883 ON MULTIPLE MOVING OBJECTS.
M. Erdmann and T. Lozano-Perez.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 883. 1986.]
041887 ESTIMATION OF INERTIAL PARAMETERS OF RIGID BODY LINKS OF MANIPULATORS.
C. H. An, C. G. Atkeson, and J. M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 887. 1986.]
041890 GENETIC AI - TRANSLATING PIAGET INTO LISP.
G. L. Drescher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 890. 1986.]
041894 COMPUTATIONAL COMPLEXITY OF CURRENT GPSG THEORY.
E. S. Ristad.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 894. 1986.]
041895 DEFINING NATURAL LANGUAGE GRAMMARS IN GPSG.
E. S. Ristad.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 895. 1986.]
041898 DISCOVERY SYSTEMS.
K. W. Haase Jr..
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 898. 1986.]
041899 ACHIEVING ARTIFICIAL INTELLIGENCE THROUGH BUILDING ROBOTS.
R. A. Brooks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 899. 1986.]
040802 PLANNING FOR CONJUNCTIVE GOALS.
D. Chapman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 802. 1985. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on January 25, 1985 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040843 TEMPEST: A TEMPLATE EDITOR FOR STRUCTURED TEXT.
P. J. Sterpe.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 843. 1985. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on June 3, 1985 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040853 LEARNING SHAPE DESCRIPTIONS: GENERATING AND GENERALIZING MODELS OF
VISUAL OBJECTS.
J. H. Connell.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 853. 1985. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on August 27, 1985 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040859 REDUNDANT SENSORS FOR MOBILE ROBOT NAVIGATION.
A. M. Flynn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 859. 1985. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on August 9, 1985 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040874 BUILD: A TOOL FOR MAINTAINING CONSISTENCY IN MODULAR SYSTEMS.
R. E. Robbins.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 874. 1985. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science on June 3, 1985 in partial
fulfillment of the requirements for the degree of Master of
Science."]
040906 LEARNING BY FAILING TO EXPLAIN.
R. J. Hall.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 906. 1986. Thesis (M.S.). "Revised
version of 'On Using Analogy to Learn Design Grammar Rules,' a thesis
submitted to the Department of Electrical Engineering and Computer
Science in December 1985 in partial fulfillment of the degree of
Master of Science."]
104780 GENERATION OF INTERACTIVE PROGRAMMING ENVIRONMENTS - GIPE.
INTERMEDIATE REPORT.
J. Heering, J. Sidi, and A. Verhoog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8620. 1986. Editors: J. Heering, J. Sidi, and A.
Verhoog. Participants: D. Clement, J. Despeyroux, T. Despeyroux,
N.W.P. van Diepen, L. Gallot, L. Hascoeet, J. Heering, P.R.H.
Hendriks, G. Kahn, P. Klint, B. Lang, J. Sidi, J. Symes, G.P.
Verhoog. External consultants: J.A. Bergstra, P. Borras, M. Devin, V.
Pascual-Migot.]
104781 NUMVEC FORTRAN LIBRARY MANUAL. CHAPTER: PARABOLIC PDES. ROUTINE: BDMG.
B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8610. 1986.]
104782 MULTIGRID SOLUTION OF MONOTONE SECOND-ORDER DISCRETIZATIONS OF
HYPERBOLIC CONSERVATION LAWS.
S. P. Spekreijse.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8611. 1986.]
104783 PHASE-LAG ANALYSIS OF IMPLICIT RUNGE-KUTTA METHODS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8612. 1986.]
104784 STABILIZATION OF THE LAX-WENDROFF METHODS AND A GENERALIZED ON-STEP
RUNGE-KUTTA METHOD FOR HYPERBOLIC INITIAL-VALUE PROBLEMS.
E. de Goede.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8613. 1986.]
104785 NUMVEC FORTRAN LIBRARY MANUAL. CHAPTER: SIMULTANEOUS LINEAR EQUATIONS.
W. Hoffmann and W. M. Lioen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8614. 1986.]
104786 THE ODD-EVEN HOPSCOTCH PRESSURE CORRECTION SCHEME FOR THE
INCOMPRESSIBLE NAVIER-STOKES EQUATIONS.
J. H. M. ten Thije Boonkkamp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8615. 1986.]
104787 EVALUATION OF SECOND ORDER SCHEMES AND DEFECT CORRECTION FOR THE
MULTIGRID COMPUTATION OF AIRFOIL FLOWS WITH THE STEADY EULER
EQUATIONS.
B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8616. 1986.]
104788 PROCEEDINGS OF THE INTER DEPARTMENT SEMINAR ON LOCAL AREA NETWORKS,
JUNE, 1986.
A. L. Ananda et al.
[National University of Singapore. Department of Information Systems
and Computer Science. Technical report TRA6/86. 1986.]
104789 ON THE ROLE OF (DATA) ABSTRACTION IN PROGRAM DEVELOPMENT AND PROBLEM
SOLVING.
P. A. S. Veloso.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 6/85. 1985.]
104790 A QUADRATIC FINITE ELEMENT METHOD FOR SOLVING BIHARMONIC PROBLEMS IN
R SUPERSCRIPT N.
V. Ruas.
[Pontificia Universidad Catolica do Rio de Janeiro. Departamento de
Informatica. Monografias em Ciencia da Computacao 1/86. 1986.]
052040 A COMPLETE, TYPE-FREE "SECOND-ORDER" LOGIC AND ITS PHILOSOPHICAL
FOUNDATIONS.
C. Menzel.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-40. March 1986.]
052049 AN ALGORITHM FOR GENERATING QUANTIFIER SCOPINGS.
J. R. Hobbs and S. M. Shieber.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-49. April 1986.]
052050 VERBS OF CHANGE, CAUSATION, AND TIME.
D. Abusch.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-50. May 1986.]
052052 NOUN PHRASES, GENERALIZED QUANTIFIERS AND ANAPHORA.
J. Barwise.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-52. August 1986.]
052053 CIRCUMSTANTIAL ATTITUDES AND BENEVOLENT COGNITION.
J. Perry.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-53. August 1986.]
052054 A STUDY IN THE FOUNDATIONS OF PROGRAMMING METHODOLOGY:
SPECIFICATIONS, INSTITUTIONS, CHARTERS AND PARCHMENTS.
J. A. Goguen and R. M. Burstall.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-54. June 1986.]
052055 QUANTIFIERS IN FORMAL AND NATURAL LANGUAGES.
D. Westerstahl.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-55. June 1986. "This paper was...published in
'Handbook of Philosophical Logic,' Volume 4, D. Gabbay and F.
Guenthner, editors."]
052056 INTENTIONALITY, INFORMATION, AND MATTER.
I. Blair.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-56. August 1986.]
052057 GRAPHS AND GRAMMARS.
W. Marsh.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-57. June 1986.]
052059 THE RELEVANCE OF COMPUTATIONAL LINGUISTICS.
L. Karttunen.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-59. August 1986.]
052061 D-PATR: A DEVELOPMENT ENVIRONMENT FOR UNIFICATION-BASED GRAMMARS.
L. Karttunen.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-61. August 1986.]
025098 A DECENTRALIZED NAMING FACILITY.
D. R. Cheriton and T. P. Mann.
[Stanford University. Department of Computer Science.
STAN-CS-86-1098. February 1986.]
025100 MODAL THEOREM PROVING.
M. Abadi and Z. Manna.
[Stanford University. Department of Computer Science.
STAN-CS-86-1100. May 1986.]
025104 CS229B: A SURVEY OF AI. CLASSNOTES FOR WINTER 84-85.
D. Subramanian.
[Stanford University. Department of Computer Science.
STAN-CS-86-1104. April 1986. "These are the compiled classnotes for
the course CS229b offered in Winter 1985. This course was an
intensive 10 week survey...for the 1984-1985 Qualifying Examination
in Artificial Intelligence at Stanford University."]
025105 SOFTWARE-CONTROLLED CACHES IN THE VMP MULTIPROCESSOR.
D. R. Cheriton, G. A. Slavenburg, and P. D. Boyle.
[Stanford University. Department of Computer Science.
STAN-CS-86-1105. March 1986. Also issued as Technical report 86-294,
Computer Systems Laboratory, Stanford Electronics Laboratories,
Stanford University.]
025106 A TIMELY RESOLUTION.
M. Abadi and Z. Manna.
[Stanford University. Department of Computer Science.
STAN-CS-86-1106. April 1986.]
025107 CONTROLLING INFERENCE.
D. E. Smith.
[Stanford University. Department of Computer Science.
STAN-CS-86-1107. April 1986. Thesis (Ph.D.). "This is a slightly
revised version of a dissertation submitted to the Department of
Computer Science of Stanford University on August 15, 1985, in
partial fulfillment of the requirements for the degree of Doctor of
Philosophy."]
025108 DESIGN OVERVIEW OF THE NAIL! SYSTEM.
K. Morris, J. D. Ullman, and A. Van Gelder.
[Stanford University. Department of Computer Science.
STAN-CS-86-1108. May 1986.]
025109 A PROOF EDITOR FOR PROPOSITIONAL TEMPORAL LOGIC.
R. Casley.
[Stanford University. Department of Computer Science.
STAN-CS-86-1109. May 1986.]
025110 TABLOG: A NEW APPROACH TO LOGIC PROGRAMMING.
Y. Malachi, Z. Manna, and R. Waldinger.
[Stanford University. Department of Computer Science.
STAN-CS-86-1110. March 1985.]
025111 MAPPING EXPLANATION-BASED GENERALIZATION ONTO SOAR.
P. S. Rosenbloom and J. E. Laird.
[Stanford University. Department of Computer Science.
STAN-CS-86-1111. June 1986. Also issued as KSL-86-46, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025112 SCAN LINE ACCESS MEMORIES FOR HIGH SPEED IMAGE RASTERIZATION.
S. G. Demetrescu.
[Stanford University. Department of Computer Science.
STAN-CS-86-1112. June 1986. Thesis (Ph.D.). Also issued as Technical
report 86-297, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025113 MODELLING CONCURRENCY WITH PARTIAL ORDERS.
V. Pratt.
[Stanford University. Department of Computer Science.
STAN-CS-86-1113. June 1986.]
025114 OPTIMIZING FUNCTION-FREE RECURSIVE INFERENCE RULES.
J. F. Naughton.
[Stanford University. Department of Computer Science.
STAN-CS-86-1114. May 1986.]
025115 THE HEURISTIC REFINEMENT METHOD FOR DERIVING SOLUTION STRUCTURES OF
PROTEINS.
B. G. Buchanan et al.
[Stanford University. Department of Computer Science.
STAN-CS-86-1115. March 1986. Also issued as KSL-85-41, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025116 INDUCTIVE KNOWLEDGE ACQUISITION FOR RULE-BASED EXPERT SYSTEMS.
L.-M. Fu and B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-86-1116. October 1985. Also issued as KSL-85-42, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025117 AN EMPIRICAL STUDY OF DISTRIBUTED APPLICATION PERFORMANCE.
K. A. Lantz, W. I. Nowicki, and M. M. Theimer.
[Stanford University. Department of Computer Science.
STAN-CS-86-1117. October 1985. Also issued as Technical report
85-287, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025118 APPLICATIONS OF PARALLEL SCHEDULING TO PERFECT GRAPHS.
D. Helmbold and E. W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-86-1118. June 1986.]
025119 SIMULATION OF AN ULTRACOMPUTER WITH SEVERAL 'HOT SPOTS'.
D. S. Rosenblum and E. W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-86-1119. June 1986.]
025120 KNOWLEDGE IN A DISTRIBUTED ENVIRONMENT.
Y. O. Moses.
[Stanford University. Department of Computer Science.
STAN-CS-86-1120. March 1986. Thesis (Ph.D.).]
025121 PRODUCT GRAPHS: SOME ALGORITHMIC AND COMBINATORIAL RESULTS.
J. Feigenbaum.
[Stanford University. Department of Computer Science.
STAN-CS-86-1121. June 1986. Thesis (Ph.D.).]
104791 MONITORING DYNAMIC DATABASE INTEGRITY BY TRANSITION GRAPHS.
U. W. Lipeck, G. Saake, and H.-D. Ehrich.
[Technische Universitaet Braunschweig. Institut fuer Informatik.
Report no. 86-08. 1986.]
104792 ABSTRACTS OF THE 4TH WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES
[BURG WARBERG, MAY 20-23, 1986].
H.-D. Ehrich et al.
[Technische Universitaet Braunschweig. Institut fuer Informatik.
Report no. 86-09. 1986.]
104793 RELFUN: A RELATIONAL/FUNCTIONAL INTEGRATION WITH VALUED CLAUSES.
H. Boley.
[Universitaet Kaiserslautern. Fachbereich Informatik. Report no.
153/86. 1986. Extended version: May 1986.]
104794 COGNITIVE PRINCIPLES OF PROBLEM SOLVING AND INSTRUCTION.
J. G. Greeno et al.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 41.
1986.]
104795 IS PROBABILITY THEORY SUFFICIENT FOR DEALING WITH UNCERTAINTY IN AI:
A NEGATIVE VIEW.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 42.
1986.]
104796 OUTLINE OF A COMPUTATIONAL APPROACH TO MEANING AND KNOWLEDGE
REPRESENTATION BASED ON THE CONCEPT OF A GENERALIZED ASSIGNMENT
STATEMENT.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 43.
1986.]
104797 ISSUES IN ADAPTIVE PLANNING.
R. Alterman.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 44.
1986.]
104798 OPERATING SYSTEM DESIGN FOR LARGE PERSONAL WORKSTATIONS.
I. D. Wilson.
[University of Cambridge. Computer Laboratory. Technical report 83.
1985. Thesis (Ph.D.).]
104799 BSPL: A LANGUAGE FOR DESCRIBING THE BEHAVIOUR OF SYNCHRONOUS HARDWARE.
M. Richards.
[University of Cambridge. Computer Laboratory. Technical report 84.
1986. Revised edition: July 1986.]
104800 CATEGORY THEORY AND MODELS FOR PARALLEL COMPUTATION.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 85.
1986.]
104801 THE ENTITY SYSTEM: AN OBJECT-BASED FILING SYSTEM.
S. C. Crawley.
[University of Cambridge. Computer Laboratory. Technical report 86.
1986. Thesis (Ph.D.).]
104802 COMPUTER-AIDED TYPE FACE DESIGN.
K. A. Carter.
[University of Cambridge. Computer Laboratory. Technical report 87.
1986. Thesis (Ph.D.).]
104803 A SHALLOW PROCESSING APPROACH TO ANAPHOR RESOLUTION.
D. M. Carter.
[University of Cambridge. Computer Laboratory. Technical report 88.
1986. Thesis (Ph.D.).]
104804 MAKING FORM FOLLOW FUNCTION: AN EXERCISE IN FUNCTIONAL PROGRAMMING
STYLE.
J. Fairbairn.
[University of Cambridge. Computer Laboratory. Technical report 89.
1986.]
104805 THE CAMBRIDGE FAST RING NETWORKING SYSTEM (CFR).
A. Hopper and R. M. Needham.
[University of Cambridge. Computer Laboratory. Technical report 90.
1986.]
104806 HARDWARE VERIFICATION USING HIGHER-ORDER LOGIC.
A. Camilleri, M. Gordon, and T. Melham.
[University of Cambridge. Computer Laboratory. Technical report 91.
1986.]
104807 IMPLEMENTATION AND PROGRAMMING TECHNIQUES FOR FUNCTIONAL LANGUAGES.
S. C. Wray.
[University of Cambridge. Computer Laboratory. Technical report 92.
1986. Thesis (Ph.D.).]
104808 AUTOMATED DESIGN OF AN INSTRUCTION SET FOR BCPL.
J. P. Bennett.
[University of Cambridge. Computer Laboratory. Technical report 93.
1986.]
104809 WEAK CONTINUITY CONSTRAINTS IN COMPUTER VISION.
A. Blake and A. Zisserman.
[University of Edinburgh. Department of Computer Science. Internal
report CSR-197-86. 1986.]
104810 HARDWARE DESCRIPTION LANGUAGES: SOME RECENT DEVELOPMENTS.
B. S. Davie.
[University of Edinburgh. Department of Computer Science. Internal
report CSR-198-86. 1986.]
104811 IS COMPUTING AN EXPERIMENTAL SCIENCE?
R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-1. 1986.]
104812 FUNCTOR-CATEGORY SEMANTICS OF PROGRAMMING LANGUAGES AND LOGICS.
R. D. Tennent.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-3. 1986.]
104813 SEMANTIC ANALYSIS OF SPECIFICATION LOGIC.
R. D. Tennent.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-5. 1986.]
104814 THE AQ15 INDUCTIVE LEARNING SYSTEM: AN OVERVIEW AND EXPERIMENTS.
R. S. Michalski et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1260. 1986.]
104815 AUTOMATED REFERENCE LIBRARIANS FOR PROGRAM LIBRARIES AND THEIR
INTERACTION WITH LANGUAGE BASED EDITORS.
J. J. Shilling.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1268. 1986. Thesis (Ph.D.).]
104816 MAIL PROCESSING AT UIUC.
R. B. Essick IV.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1289. 1986.]
104817 COMPUTING THE ROOTS OF COMPLEX ORTHOGONAL AND KERNEL POLYNOMIALS.
P. E. Saylor and D. C. Smolarski S.J.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1290. 1986.]
104818 GLOBAL ERROR ESTIMATION AND THE BACKWARD DIFFERENTIATION FORMULAS.
R. D. Skeel.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1291. 1986.]
104819 LOGARITHMIC REDUCTION OF THE WRAPPING EFFECT WITH APPLICATION TO
ORDINARY DIFFERENTIAL EQUATIONS.
T. N. Gambill and R. D. Skeel.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1292. 1986.]
104820 INDUCTION, OF AND BY PROBABILITY.
L. Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1293. 1986. Revised: August 1986.]
104821 PERFORMABILITY MODELING WITH STOCHASTIC ACTIVITY NETWORKS.
A. Movaghar.
[University of Michigan. Computing Research Laboratory. CRL-TR-8-85.
1985. Thesis (Ph.D.).]
104822 NONCONVERGENCE, UNDECIDABILITY, AND INTRACTABILITY IN ASYMPTOTIC
PROBLEMS.
K. J. Compton, C. W. Henson, and S. Shelah.
[University of Michigan. Computing Research Laboratory. CRL-TR-9-85.
1985.]
104823 ALGORITHM GUIDED DESIGN CONSIDERATIONS FOR MESHES AND PYRAMIDS.
Q. F. Stout.
[University of Michigan. Computing Research Laboratory. CRL-TR-11-85.
1985.]
104824 THE CONSISTENT LABELING PROBLEM, PART 1: BACKGROUND AND PROBLEM
FORMULATION.
B. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-13-85.
1985.]
104825 THE CONSISTENT LABELING PROBLEM, PART 2: SUBPROBLEMS, ENUMERATIONS
AND CONSTRAINT SATISFIABILITY.
B. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-14-85.
1985.]
104826 THE CONSISTENT LABELING PROBLEM, PART 4: THE GENERALIZED FORWARD
CHECKING AND WORD-WISE FORWARD CHECKING ALGORITHMS.
B. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-15-85.
1985.]
104827 THE GENERAL CONSISTENT LABELING (OR CONSTRAINT SATISFACTION) PROBLEM.
B. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-2-86.
1986.]
104828 THREE CONSTRAINT SATISFACTION ALGORITHMS AND THEIR COMPLEXITIES:
SEARCH-ORDER DEPENDENT AND EFFECTIVELY INSTANCE-SPECIFIC RESULTS.
B. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-3-86.
1986.]
104829 A LOGICAL DESIGN METHODOLOGY FOR RELATIONAL DATABASES USING THE
EXTENDED ER MODEL.
T. Teorey, D. Yang, and J. Fry.
[University of Michigan. Computing Research Laboratory. CRL-TR-4-86.
1986. Revision 1: March 1986.]
104830 DISSIPATIVE HEATING IN COMPRESSIBLE MANTLE CONVECTION: EFFECTS FROM
EQUATION OF STATE AND RHEOLOGY.
D. A. Yuen, F. Quareni, and H.-J. Hong.
[University of Minnesota. Supercomputer Institute. UMSI 86/35. 1986.]
104831 RAPID CONVERGENCE OF DISCRETE-BASIS REPRESENTATIONS OF THE AMPLITUDE
DENSITY FOR QUANTAL SCATTERING CALCULATIONS.
G. Staszewska and D. G. Truhlar.
[University of Minnesota. Supercomputer Institute. UMSI 86/36. 1986.]
104832 MINIMUM ENERGY CONFIGURATIONS FOR LIQUID CRYSTALS: COMPUTATIONAL
RESULTS.
R. Cohen et al.
[University of Minnesota. Supercomputer Institute. UMSI 86/37. 1986.]
104833 CYCLE TIMES OF A CLASS OF CONCURRENT ROBOT PROGRAMS.
B. I. Soroka.
[University of Southern California. Robotics Institute. Technical
report 8605. 1986.]
104834 EQUIVALENCE AND TRANSFORMATION OF ROBOT PROGRAMS.
B. I. Soroka.
[University of Southern California. Robotics Institute. Technical
report 8606. 1986.]
104835 THE TUNIS REPORT: DESIGN OF A UNIX-COMPATIBLE OPERATING SYSTEM.
P. A. Ewens et al.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-176. 1986.]
104836 AN ORTHOGONAL MODEL FOR CODE GENERATION.
J. R. Cordy.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-177. 1986. Thesis (Ph.D.). Revised: January
1986.]
104837 EDGE DELETION IN LABELLED GRAPHS.
J. S. Diamond.
[University of Toronto. Department of Computer Science. Technical
report 189. 1986. Thesis (Ph.D.).]
104838 ANIMATED GRAPHICAL INTERFACES USING TEMPORAL CONSTRAINTS.
R. A. Duisberg.
[University of Washington. Department of Computer Science. Technical
report 86-01-02. 1986.]
104839 PROGRAMMING ENVIRONMENTS FOR SYSTOLIC ARRAYS.
L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 86-02-02. 1986.]
104840 DISTRIBUTION AND ABSTRACT TYPES IN EMERALD.
A. Black et al.
[University of Washington. Department of Computer Science. Technical
report 86-02-04. 1986. Revised version of technical report 85-08-05.
Revised: July 1986.]
104841 CONCURRENT PROGRAMMING AND SLICE-BASED SCHEDULING.
A. C. Shaw.
[University of Washington. Department of Computer Science. Technical
report 86-02-05. 1986.]
104842 COMPUTER SYSTEM PERFORMANCE EVALUATION USING QUEUEING NETWORK MODELS.
E. D. Lazowska, J. Zahorjan, and K. C. Sevcik.
[University of Washington. Department of Computer Science. Technical
report 86-02-07. 1986.]
104843 USING CONDITIONAL INFORMATION IN QUEUEING MODELS: ANALYSIS OF THE IMS
SCHEDULER.
G. Sundaresan.
[University of Washington. Department of Computer Science. Technical
report 86-02-08. 1986. Thesis (M.S.).]
104844 BRIGHT-SPOT DETECTION IN PYRAMIDS.
R. P. Blanford and S. L. Tanimoto.
[University of Washington. Department of Computer Science. Technical
report 86-03-01. 1986.]
104845 PROGRAMMING SOLUTIONS TO THE ALGORITHM CONTRACTION PROBLEM.
P. A. Nelson and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 86-03-02. 1986.]
104846 A PYRAMID MACHINE SIMULATOR FOR THE SYMBOLICS 3600.
R. P. Blanford and S. L. Tanimoto.
[University of Washington. Department of Computer Science. Technical
report 86-03-03. 1986.]
104847 PROTOTYPE SPECIFICATION FOR: A STRUCTURE EDITOR GENERATOR FOR
DOCUMENTS, PROGRAMS, AND OTHER STRUCTURED DATA.
C. W. Fraser and A. C. Shaw.
[University of Washington. Department of Computer Science. Technical
report 86-04-01. 1986. Revised: November 27, 1985.]
104848 HIERARCHICAL CELLULAR LOGIC FOR BYTE-PYRAMIDS.
R. P. Blanford.
[University of Washington. Department of Computer Science. Technical
report 86-04-02. 1986.]
104849 OBJECT STRUCTURE IN THE EMERALD SYSTEM.
A. Black et al.
[University of Washington. Department of Computer Science. Technical
report 86-04-03. 1986. Revised: June 1986.]
104850 HOW TO SHARE A SECRET WITH CHEATERS.
M. Tompa and H. Woll.
[University of Washington. Department of Computer Science. Technical
report 86-04-05. 1986.]
104851 UPDATING DERIVED RELATIONS: DETECTING IRRELEVANT AND AUTONOMOUSLY
COMPUTABLE UPDATES.
J. A. Blakeley, N. Coburn, and P.-A. Larson.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-17. 1986.]
104852 DATA COMPRESSION USING DYNAMIC MARKOV MODELLING.
G. V. Cormack and R. N. S. Horspool.
[University of Waterloo. Department of Computer Science. Research
report CS-86-18. 1986.]
104853 TERNARY SIMULATION OF ASYNCHRONOUS GATE NETWORKS.
C.-J. H. Seger.
[University of Waterloo. Department of Computer Science. CS-86-19.
1986. Thesis (Master of Mathematics).]
104854 STRUCTURING THE TEXT OF THE OXFORD ENGLISH DICTIONARY THROUGH FINITE
STATE TRANSDUCTION.
R. Kazman.
[University of Waterloo. Department of Computer Science. CS-86-20.
1986. Thesis (Master of Mathematics).]
104855 DYNAMIC HASH TABLES.
P.-A. Larson.
[University of Waterloo. Department of Computer Science. CS-86-21.
1986.]
104856 AN OPTIMISTIC TERNARY SIMULATION OF GATE RACES.
C.-J. H. Seger and J. A. Brzozowski.
[University of Waterloo. Department of Computer Science. CS-86-22.
1986.]
104857 A GENERAL SYSTEM FOR MANAGING VIDEOTEX INFORMATION STRUCTURES.
D. A. Tanguay.
[University of Waterloo. Department of Computer Science. CS-86-23.
1986.]
104858 PERFECT HASHING FOR EXTERNAL FILES.
M. V. Ramakrishna.
[University of Waterloo. Department of Computer Science. CS-86-25.
1986. Thesis (Ph.D.).]
104859 AN IMPLEMENTATION OF A COMPUTATIONAL MODEL FOR THE ANALYSIS OF
ARGUMENTS: AN INTRODUCTION TO THE FIRST ATTEMPT.
T. J. Smedley.
[University of Waterloo. Department of Computer Science. Research
report CS-86-26. 1986.]
104860 AN ADAPTIVE TECHNIQUE FOR IMPROVING THE EFFICIENCY OF PLANNERS.
J. A. N. A. Trudel.
[University of Waterloo. Department of Computer Science. 1986.]
104861 REMARKS ON MULTIGRID CONVERGENCE THEOREMS.
S. V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 634. 1986.]
104862 EXPERIENCE WITH CHARLOTTE: SIMPLICITY VERSUS FUNCTION IN A
DISTRIBUTED OPERATING SYSTEM.
R. A. Finkel et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 653. 1986.]
104863 ESTIMATES FOR MULTIGRID METHODS BASED ON RED-BLACK GAUSS-SEIDEL
SMOOTHINGS.
S. V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 654. 1986.]
104864 PROCESSES MIGRATE IN CHARLOTTE.
Y. Artsy, H.-Y. Chang, and R. A. Finkel.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 655. 1986.]
104865 DESIGN AND PERFORMANCE EVALUATION OF A MAIN MEMORY RELATIONAL
DATABASE SYSTEM.
T. J. Lehman.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 656. 1986. Thesis (Ph.D.).]
104866 DREGS: A DISTRIBUTED RUNTIME ENVIRONMENT FOR GAME SUPPORT.
A. Bricker, T. Lebeck, and B. P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 657. 1986.]
104867 A STRUCTURED MEMORY ACCESS ARCHITECTURE FOR LISP.
M. J. Thazhuthaveetil.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 658. 1986. Thesis (Ph.D.).]
104868 USING MATHEMATICAL INDUCTION TO DESIGN COMPUTER ALGORITHMS.
U. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 660. 1986.]
104869 EFFICIENT ALGORITHMS FOR MULTIPLE PATTERN MATCHING.
M. A. Sridhar.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 661. 1986.]
104870 A RELIABLE AND SECURE UNIX CONNECTION SERVICE.
D. Draheim, B. P. Miller, and S. Snyder.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 662. 1986.]
104871 EXPERIMENTAL RESULTS FOR MULTIGRID AND TRANSPORT PROBLEMS.
D. Kamowitz.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 663. 1986.]
VOL. 9, NO. 1 01/05/87
104872 AN ARCHITECTURE FOR SENSOR FUSION IN A MOBILE ROBOT.
S. A. Shafer, A. Stentz, and C. E. Thorpe.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-9. 1986.]
104873 KINEMATIC MODELING OF WHEELED MOBILE ROBOTS.
P. F. Muir and C. P. Neuman.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-12. 1986.]
104874 ANALYSIS OF HUMAN COMMUNICATION DURING ASSEMBLY TASKS.
K. S. Barber and G. J. Agin.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-13. 1986.]
104875 LOCATING INDUSTRIAL PARTS WITH SUBPIXEL ACCURACIES.
R. A. Young.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5567. 1986.]
104876 DIRECTIONS IN FLEXIBLE ASSEMBLY.
R. L. Haar.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5569. 1986.]
104877 A NEW STATISTICAL APPROACH FOR THE AUTOMATIC SEGMENTATION OF
CONTINUOUS SPEECH SIGNALS.
R. Andre-Obrecht.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 511. 1986. Also issued as Publication
interne 287, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104878 DEDUCTION AND COMPUTATION.
G. Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 513. 1986.]
104879 PROOF OF TRANSLATION IN NATURAL SEMANTICS.
J. Despeyroux.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 514. 1986.]
104880 CONCEPTS MATHEMATIQUES ET INFORMATIQUES FORMALISES DANS LE CALCUL DES
CONSTRUCTIONS.
T. Coquand and G. Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 515. 1986.]
104881 CALCUL DISTRIBUE D'UN EXTREMUM ET DU ROUTAGE ASSOCIE DANS UN RESEAU
QUELCONQUE.
J.-M. Helary, A. Maddi, and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 516. 1986. Also issued as Publication
interne 289, Institut de Recherche en Informatique et Systemes
Aleatiores (IRISA).]
104882 A CLASS OF IMPLICIT UPWIND SCHEMES FOR EULER SIMULATIONS WITH
UNSTRUCTURED MESHES.
F. Fezoui and B. Stoufflet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 517. 1986.]
104883 THE EVOLUTION OF TWO STACKS IN BOUNDED SPACE AND RANDOM WALKS IN A
TRIANGLE.
P. Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 518. 1986.]
104884 SOME ASPECTS OF HIGH RESOLUTION NUMERICAL METHODS FOR HYPERBOLIC
SYSTEMS OF CONSERVATION LAWS, WITH APPLICATION TO GAS DYNAMICS.
P. Arminjon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 520. 1986.]
104885 UNE INTRODUCTION A QUELQUES TECHNIQUES DU CONTROLE DISTRIBUE ATRAVERS
UN EXEMPLE.
N. Plouzeau, M. Raynal, and J.-P. Verjus.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 522. 1986.]
104886 VERSO: A DATA BASE MACHINE BASED ON NON 1NF RELATIONS.
J. Verso.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 523. 1986.]
104887 SYSTEMES REACTIFS ET PROGRAMMATION SYNCHRONE.
G. Berry, P. Couronne, and G. Gonthier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 524. 1986.]
104888 A NEW MATRIX MULTIPLICATION SYSTOLIC ARRAY.
P. Quinton, B. Jionnault, and P. Gachet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 525. 1986. Also issued as Publication
interne 290, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104889 DISTRIBUTED SYNCHRONIZATION OF PARALLEL PROGRAMS: WHY AND HOW?
P. Quinton and J.-P. Verjus.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 526. 1986. Also issued as Publication
interne 292, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104890 ADDRESS SYNCHRONIZED MULTIPROCESSOR ARCHITECTURE.
A. Seznec and Y. Jegou.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 527. 1986. Also issued as Publication
interne 301, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104891 A SIMPLE APPLICATIVE LANGUAGE: MINI-ML.
D. Clement et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 529. 1986.]
104892 THE CALCULUS OF CONSTRUCTIONS.
T. Coquand and G. Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 530. 1986.]
104893 AN ANALYSIS OF GIRARD'S PARADOX.
T. Coquand.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 531. 1986.]
104894 CONTEXT-DEPENDENT DETERMINERS IN LOGIC PROGRAMMING: SEMANTIC
REPRESENTATIONS AND PROPERTIES.
P. Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 532. 1986. Also issued as Publication
interne 297, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
104895 APPROXIMATE ALGORITHMS FOR PARTITIONING AND ASSIGNMENT PROBLEMS.
M. A. Iqbal.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-40. 1986.]
104896 DYNAMIC REMAPPING OF PARALLEL COMPUTATIONS WITH VARYING RESOURCE
DEMANDS.
D. M. Nicol and J. H. Saltz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-45. 1986.]
104897 STATISTICAL METHODOLOGIES FOR THE CONTROL OF DYNAMIC REMAPPING.
J. H. Saltz and D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-46. 1986.]
104898 OPTIMAL PARTITIONING OF RANDOM PROGRAMS ACROSS TWO PROCESSORS.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-53. 1986.]
104899 THE FORCE ON THE FLEX: GLOBAL PARALLELISM AND PORTABILITY.
H. F. Jordan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-54. 1986.]
104900 EXPECTED PERFORMANCE OF M-SOLUTION BACKTRACKING.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-55. 1986.]
104901 DYNAMIC REMAPPING DECISIONS IN MULTI-PHASE PARALLEL COMPUTATIONS.
D. M. Nicol and P. F. Reynolds.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-58. 1986.]
104902 EFFECTIVE CONCURRENT RECOVERY MECHANISMS FOR SOFT ERRORS IN MINS.
B. D. Rathi et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11614. 1985.]
104903 SELF-CHECKING PARITY CHECKER FOR MULTIPLE INDEPENDENT DATA PATHS.
A. M. Johnson Jr., M. Malek, and B. D. Rathi.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11616. n.d.]
104904 YODA: AN ADVANCED DISPLAY FOR PERSONAL COMPUTERS.
S. Gupta et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11618. 1986.]
104905 ON THE IMPLICATIONS OF PARALLEL LANGUAGES FOR COMPILERS.
R. Cytron.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11723. 1986.]
104906 A VERTICAL PARTITIONING ALGORITHM FOR RELATIONAL DATABASES.
D. W. Cornell and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11762. 1986.]
104907 ESTIMATION OF PROBABILITIES FROM SPARSE DATA FOR THE LANGUAGE MODEL
COMPONENT OF A SPEECH RECOGNIZER.
S. M. Katz.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11767. 1986.]
104908 A FRAMEWORK FOR A THEORY OF REPRESENTATIONS.
W. Zadrozny.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11778. 1986.]
104909 EXPLICIT AND IMPLICIT BELIEFS.
W. Zadrozny.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11786. 1986. Preliminary edition: June
27, 1986.]
104910 SLS - A FAST SWITCH LEVEL SIMULATOR.
Z. Barzilai et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11787. 1985.]
104911 RANDOM REALS AND EXPONENTIAL DIOPHANTINE EQUATIONS.
G. J. Chaitin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11788. 1986.]
104912 A RECURSIVE SOLUTION METHOD TO ANALYZE THE PERFORMANCE OF STATIC
LOCKING SYSTEMS.
A. Thomasian and I. K. Ryu.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11790. 1986.]
104913 GEOMETRIC CONTINUITY OF CURVES IN COMPUTER AIDED GEOMETRIC DESIGN.
C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11800. 1986.]
104914 DESIGN OF A PROLOG-BASED MACHINE TRANSLATION SYSTEM.
M. C. McCord.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11801. 1986.]
104915 A GRAPHICS-ORIENTED MODELER'S WORKSTATION ENVIRONMENT FOR THE
RESEARCH QUEUEING PACKAGE (RESQ).
J. F. Kurose et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11803. 1986.]
104916 KNOWLEDGE, COMMUNICATION, AND TIME.
V. Nguyen and K. J. Perry.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11813. 1986.]
104917 DO WE REALLY KNOW WHAT KNOWLEDGE IS?
V. Nguyen and K. J. Perry.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11830. 1986.]
104918 HIGHLY AVAILABLE COMMUNICATION.
H. Aghili et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5068. 1986.]
104919 UNDERSTANDING HOUGH SPACE FOR POLYHEDRAL SCENE DECOMPOSITION.
H.-P. Biland and F. M. Wahl.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1458. 1986.]
104920 A NEW VERSION OF THE MERGE EXCHANGE SORT WITH AN EXPLANATORY PROOF.
C. K. Yuen.
[National University of Singapore. Department of Information Systems
and Computer Science. Technical report TR12/85. 1985.]
104921 INTEGRITY CONSTRAINT CHECK IN DEDUCTIVE DATABASES USING THE PROLOG
NOT-PREDICATE.
T. K. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. Technical report TRA7/86. 1986.]
104922 A NEW LOWER BOUND FOR THE SET PARTITION PROBLEM.
J. W. John.
[National University of Singapore. Department of Information Systems
and Computer Science. Technical report TRB7/86. 1986.]
104923 CK-LOG'S PROBLEM SOLVING SYSTEM, PART I: THE NATURAL DEDUCTION PROOF
SYSTEM FOR FIRST ORDER LOGIC.
C. V. Srinivasan.
[Rutgers. Department of Computer Science. DCS-TR-186. 1986.]
104924 PROBLEM SOLVING.
S. Amarel.
[Rutgers. Department of Computer Science. DCS-TR-188. 1986. Article
for "Encyclopedia of Artificial Intelligence."]
104925 CONDITIONS FOR INCREMENTAL ITERATION EXAMPLES AND COUNTEREXAMPLES.
T. Marlowe, M. C. Paull, and B. G. Ryder.
[Rutgers. Department of Computer Science. DCS-TR-190. 1986.]
104926 ON A CONJECTURE OF MEYNIEL.
C. T. Hoang.
[Rutgers. Department of Computer Science. DCS-TR-191. 1986.]
104927 ON BRITTLE GRAPHS II. GRAPHS WITH DILWORTH NUMBER AT MOST THREE.
C. T. Hoang.
[Rutgers. Department of Computer Science. DCS-TR-193. 1986.]
104928 EVALUATING THE SIZE OF A VERSION SPACE.
I. Nelken.
[Rutgers. Department of Computer Science. DCS-TR-194. 1986.]
104929 LOWER BOUNDS FOR THE QUADRATIC SEMI-ASSIGNMENT PROBLEM.
G. Gallo, E. M. Tomasin, and A. M. Sorato.
[Rutgers. Department of Computer Science. DCS-TR-195. 1986.]
104930 ADVANCED PLANNING SYSTEMS AND DEVELOPMENT OF PLANNING CONSULTANT FOR
NAVAL OPERATIONAL PLANNING.
C. V. Srinivasan.
[Rutgers. Department of Computer Science. DCS-TR-197. 1986.]
104931 ISOMORPHISMS AND 1-L REDUCTIONS.
E. W. Allender.
[Rutgers. Department of Computer Science. DCS-TR-199. 1986.]
104932 DECIDING WHAT TO LEARN.
R. M. Keller.
[Rutgers. Department of Computer Science. ML-TR-6. 1986.]
104933 TOWARDS EXPLICIT INTEGRATION OF KNOWLEDGE IN EXPERT SYSTEMS: AN
ANALYSIS OF MYCIN'S THERAPY SELECTION ALGORITHM.
J. Mostow and B. Swartout.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-81. 1986.]
104934 REAPPR - IMPROVING PLANNING EFFICIENCY VIA LOCAL EXPERTISE AND
REFORMULATION.
J. L. Bresina, S. C. Marsella, and C. F. Schmidt.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-82. 1986.]
104935 THE STABILITY OF THE GAUSS-CHEBYSHEV METHOD FOR CAUCHY SINGULAR
INTEGRAL EQUATIONS.
A. Gerasoulis and R. P. Srivastav.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-83. 1986.]
104944 ARITHMETIC FOR MICROCOMPUTERS - SOME RECENT TRENDS.
D. W. Matula.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-2. 1986.]
104945 IMPROVING EFFICIENCY AND FLEXIBILITY OF REASONING THROUGH AUTOMATIC
REORGANIZATION OF RULE-BASED KNOWLEDGE.
S. H. Myaeng, W. P.-C. Ho, and D. Y. Y. Yun.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-3. 1986.]
104946 BROWSER: A CONCEPT FOR VISUAL NAVIGATION OF A DATABASE.
R. R. Korfhage.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-4. 1986.]
104947 ASSOCIATIVE MEMORIES REVISITED: RECENT APPLICATIONS AND VLSI DESIGN.
B. Shirazi.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-5. 1986.]
104948 GRAPH PARTITIONING BY SPARSE CUTS AND MAXIMUM CONCURRENT FLOW.
D. W. Matula and F. Shahrokhi.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-6. 1986.]
104949 RANDOM GRAPHS: A FIRST-QUARTER CENTURY SURVEY.
M. Karonski and D. W. Matula.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-7. 1986.]
104950 AN EFFICIENT UNIFICATION PROCESSOR.
D. Y. Y. Yun, P. Biswas, and Y. R. Xu.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-9. 1986.]
104951 TOWARDS AN INTELLIGENT AND PERSONALIZED INFORMATION RETRIEVAL SYSTEM.
S. H. Myaeng and R. R. Korfhage.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-10. 1986.]
104952 MMDB RECOVERY.
M. H. Eich.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-11. 1986.]
104953 A FLOW REROUTING ALGORITHM FOR THE MAXIMUM CONCURRENT FLOW PROBLEM
WITH VARIABLE CAPACITIES AND DEMANDS, AND ITS APPLICATION TO CLUSTER
ANALYSIS.
B. J. Thompson and D. W. Matula.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-12. 1986.]
104954 CONSTRUCTIVE SOLID GEOMETRY: A SYMBOLIC COMPUTATION APPROACH.
L. Leff and D. Y. Y. Yun.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-14. 1986.]
104955 A CLASSIFICATION AND COMPARISON OF MAIN MEMORY DATABASE RECOVERY
TECHNIQUES.
M. H. Eich.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-15. 1986.]
104956 RANKING AND UNRANKING OF CHAIN AND POLYGON COLORINGS.
K. P. Duerre and P. Kelsen.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-16. 1986.]
104957 EXPOSE-AND-MERGE EXPLORATION AND THE CHROMATIC NUMBER OF A RANDOM
GRAPH.
D. W. Matula.
[Southern Methodist University. Department of Computer Science and
Engineering. Report no. 86-CSE-18. 1986.]
052058 COMPUTER AIDS FOR COMPARATIVE DICTIONARIES.
M. Johnson.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-58. August 1986.]
052060 GRAMMATICAL HIERARCHY AND LINEAR PRECEDENCE.
I. A. Sag.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-60. August 1986.]
104960 TRANSITION SYSTEMS, METRIC SPACES AND READY SETS IN THE SEMANTICS OF
UNIFORM CONCURRENCY.
J. W. de Bakker et al.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-04. 1986.]
104961 ON THE SCHUR DECOMPOSITION OF A MATRIX FOR PARALLEL COMPUTATION.
P. J. Eberlein.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-06. 1986.]
104962 PROTO-MAYA: A DISTRIBUTED SYSTEM AND ITS IMPLEMENTATION.
R. Bharadhwaj.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-07. 1986. Thesis (M.S.).]
104963 AN EXPERT SYSTEM FOR HARMONIZATION OF CHORALES IN THE STYLE OF J. S.
BACH.
K. Ebcioglu.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-09. 1986. Thesis (Ph.D.).]
104964 SYMMETRIC RELATIONS, INTENSIONAL INDIVIDUALS, AND VARIABLE BINDING.
S. C. Shapiro.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-10. 1986.]
104965 REPRESENTING DE RE AND DE DICTO BELIEF REPORTS IN DISCOURSE AND
NARRATIVE.
J. M. Wiebe and W. J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-14. 1986.]
104966 QUASI-INDICATORS, KNOWLEDGE REPORTS, AND DISCOURSE.
W. J. Rapaport, S. C. Shapiro, and J. M. Wiebe.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-15. 1986.]
104967 COMMENTS ON SOME PARALLEL JACOBI ORDERINGS.
P. J. Eberlein.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-16. 1986.]
104968 EVALUATION PARADIGMS FOR DEDUCTIVE DATABASES: FROM SYSTOLIC TO
AS-YOU-PLEASE.
U. Guentzer, W. Kiessling, and R. Bayer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8605. 1986.]
104969 UNTERSUCHUNG DES EINSCHWINGVERHALTENS DES M/G/1-SYSTEMS UNTER
NICHTSTATIONAERER LAST.
J. Scholz.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8606. 1986.]
104970 A WORKBENCH FOR MULTIGRID METHODS.
U. Ruede and Chr Zenger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8607. 1986.]
104971 DIE GRAPHIK-SICHTGERAETE GSG-12 UND GSG-15 / GSG-17: TECHNISCHE
BESCHREIBUNG, BENUTZERANLEITUNG, PROGRAMMIERANLEITUNG.
A. Raith and Th Schneider.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8608. 1986.]
104972 LINE-DRAWING ON A DISCRETE GRID.
R. Steinbrueggen.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8610. 1986.]
104978 CONTROLLER DESIGN FOR ROBOT ARM GUARDED AND COMPLIANT MOTIONS.
V. G. Gourishankar et al.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-01. 1986.]
104979 MULTI-LEVEL CONTROLLER DESIGN FOR ROBOT ARM MOTION.
V. G. Gourishankar et al.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-02. 1986.]
104980 AN ADAPTIVE ITERATIVE ALGORITHM FOR IMAGE RESTORATION.
Z. Q. Liu, V. G. Gourishankar, and T. M. Caelli.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-03. 1986.]
104981 LAGRANGIAN DYNAMICS OF FLEXIBLE MANIPULATORS USING ANGULAR VELOCITIES
INSTEAD OF TRANSFORMATION MATRICES.
J. King, V. G. Gourishankar, and R. E. Rink.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-04. 1986.]
104982 TOWARDS A COMPUTATIONAL SEMANTICS.
J. van Benthem.
[University of Amsterdam. Department of Mathmatics. Report no. 86-10.
1986.]
104983 NOTES ON MODAL DEFINABILITY.
J. van Benthem.
[University of Amsterdam. Department of Mathmatics. Report no. 86-11.
1986.]
104984 ON THE EXISTENCE OF EXTENSIONAL PARTIAL COMBINATORY ALGEBRAS.
I. Bethke.
[University of Amsterdam. Department of Mathmatics. Report no. 86-13.
1986.]
104985 APPROXIMATION BY PIECEWISE CUBIC C(SUPERSCRIPT 1)-SPLINES.
R. H. J. Gmelig Meyling.
[University of Amsterdam. Department of Mathmatics. Report no. 86-17.
1986.]
104986 FACTORING INTEGERS WITH ELLIPTIC CURVES.
H. W. Lenstra Jr..
[University of Amsterdam. Department of Mathmatics. Report no. 86-18.
1986.]
104987 ELLIPTIC CURVES AND NUMBER-THEORETIC ALGORITHMS.
H. W. Lenstra Jr..
[University of Amsterdam. Department of Mathmatics. Report no. 86-19.
1986.]
104988 ON AURIFEUILLIAN FACTORIZATIONS.
P. Stevenhagen.
[University of Amsterdam. Department of Mathmatics. Report no. 86-20.
1986.]
104989 LAYOUT FORMATTING LANGUAGE REFERENCE MANUAL.
[University of Edinburgh. Department of Computer Science.
CSR-196-1985. 1985. Copyright 1985, CLAN Systems Limited. Version
1.1, December 1985.]
104990 STANDARD ML.
R. Harper, D. MacQueen, and R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-2. 1986. "Part I...
supersedes the report 'The Standard ML Core Language,' [University of
Edinburgh Department of Computer Science report] CSR-168-84."
104991 THE SECOND ORDER BACKWARD DIFFERENTIATION FORMULA IS UNCONDITIONALLY
ZERO-STABLE.
R. D. Skeel.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1251. 1986.]
104992 A SOFTWARE INTERCONNECTION TECHNOLOGY TO SUPPORT SPECIFICATION OF
COMPUTATIONAL ENVIRONMENTS.
J. M. Purtilo.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1269. 1986. Thesis (Ph.D.).]
104993 INCREMENTAL ATTRIBUTE EVALUATION IN DISTRIBUTED LANGUAGE-BASED
ENVIRONMENTS.
S. M. Kaplan and G. E. Kaiser.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1294. 1986.]
104994 PLEASE: EXECUTABLE SPECIFICATIONS FOR INCREMENTAL SOFTWARE
DEVELOPMENT.
R. B. Terwilliger and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1295. 1986.]
104995 A TIGHT LOWER BOUND ON THE SIZE OF VISIBILITY GRAPHS.
X. Shen and H. Edelsbrunner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1299. 1986.]
104996 UPDATING PROPERTIES OF DIRECTED ACYCLIC GRAPHS ON A PARALLEL RANDOM
ACCESS MACHINE.
S. Pawagi and I. V. Ramakrishnan.
[University of Maryland. Department of Computer Science. CS-TR-1551.
1985. Also issued as CAR-TR-148, Center for Automation Research,
University of Maryland.]
104997 ATOMIC REMOTE PROCEDURE CALL.
K.-J. Lin.
[University of Maryland. Department of Computer Science. TR-1552.
1985. Thesis (Ph.D.).]
104998 FROM DETERMINACY TO SYSTALTIC ARRAYS.
D. P. O'Leary and G. W. Stewart.
[University of Maryland. Department of Computer Science. TR-1553.
1985.]
104999 MULTIPLE QUERY PROCESSING IN DEDUCTIVE DATABASES.
U. S. Chakravarthy and J. Minker.
[University of Maryland. Department of Computer Science. TR-1554.
1985.]
105000 A METHOD OF CURVE PARTITIONING USING ARC-CHORD DISTANCE.
T.-Y. Phillips and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-149.
1985. Also issued as CS-TR-1555, Department of Computer Science,
University of Maryland.]
105001 MATRIX COMPUTATION ON PROCESSORS IN ONE, TWO, AND THREE DIMENSIONS.
D. C. Fisher.
[University of Maryland. Department of Computer Science. Technical
report 1556. 1985. Thesis (Ph.D.).]
105002 TWO APPLICATIONS OF THE THEORY OF PARTIALLY ORDERED SETS TO DIGITAL
GEOMETRY.
R. A. Melter.
[University of Maryland. Department of Computer Science. CS-TR-1557.
1985. Also issued as CAR-TR-150, Center for Automation Research,
University of Maryland.]
105003 MULTIPLE-CAMERA CONTOUR STEREO.
M. Pietikaeinen and D. Harwood.
[University of Maryland. Center for Automation Research. CAR-TR-151.
1985. Also issued as CS-TR-1559, Department of Computer Science,
University of Maryland.]
105004 RECOGNITION AND CHARACTERIZATION OF DIGITIZED CURVES.
M. Werman, A. Y. Wu, and R. A. Melter.
[University of Maryland. Center for Automation Research. CAR-TR-152.
1985. Also issued as CS-TR-1560, Department of Computer Science,
University of Maryland.]
105005 ON SHUFFLE-EXCHANGE TYPE INTERCONNECTION NETWORKS FOR MULTIPROCESSOR
SYSTEMS.
S.-T. Huang.
[University of Maryland. Department of Computer Science. CS-TR-1561.
1985. Thesis (Ph.D.). Also issued as UMIACS-TR-85-8, Institute for
Advanced Computer Studies, University of Maryland.]
105006 A MULTIVERSION CONCURRENCY CONTROL SCHEME FOR REPLICATED DATABASES.
S. H. Son and A. K. Agrawala.
[University of Maryland. Department of Computer Science. CS-TR-1564.
1985.]
105007 ON PROJECTIVE GEOMETRY AND THE RECOVERY OF 3-D STRUCTURE.
A. Naeve and J.-O. Eklundh.
[University of Maryland. Department of Computer Science. CS-TR-1565.
1985. Also issued as CAR-TR-154, Center for Automation Research,
University of Maryland.]
105008 ON THE PARALLEL COMPLEXITY OF DISCRETE RELAXATION.
S. Kasif.
[University of Maryland. Center for Automation Research. CAR-TR-156.
1985. Also issued as CS-TR-1567, Department of Computer Science,
University of Maryland.]
105009 STRUCTURE AND MOTION OF A RIGID OBJECT HAVING UNKNOWN CONSTANT MOTION.
C.-H. Lee and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-157.
1985. Also issued as CS-TR-1568, Department of Computer Science,
University of Maryland.]
105010 CONTINUOUS REPRESENTATIONS OF DIGITAL IMAGES.
C.-N. Lee and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-158.
1985. Also issued as CS-TR-1569, Department of Computer Science,
University of Maryland.]
105011 IDENTIFICATION IS EASIER THAN DECODING.
J. Ja'Ja'.
[University of Maryland. Department of Computer Science. CS-TR-1570.
1985. Also issued as UMIACS-TR-85-1, Institute for Advanced Computer
Studies, University of Maryland.]
105012 OPTIMAL ALGORITHMS FOR MESH-CONNECTED PARALLEL PROCESSORS WITH SERIAL
MEMORIES.
J. Ja'Ja' and R. M. Owens.
[University of Maryland. Department of Computer Science. CS-TR-1571.
1985. Also issued as UMIACS-TR-85-2, Institute for Advanced Computer
Studies, University of Maryland.]
105013 A NOTE ON ARBITRARILY COMPLEX RECURSIVE FUNCTIONS.
C. H. Smith.
[University of Maryland. Department of Computer Science. CS-TR-1572.
1985. Also issued as UMIACS-TR-85-3, Institute for Advanced Computer
Studies, University of Maryland.]
105014 PARALLEL PROCESSING OF REGION BOUNDARIES.
A. Y. Wu, S. K. Bhaskar, and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1573.
1985. Also issued as CAR-TR-159, Center for Automation Research,
University of Maryland.]
105015 EVALUATING VARIATIONS ON PROGRAM SLICING FOR DEBUGGING.
J. R. Lyle.
[University of Maryland. Department of Computer Science. TR-1574.
1984. Thesis (Ph.D.).]
105016 ANALYSIS OF STRUCTURE AND MOTION FROM OPTICAL FLOW. PART I:
ORTHOGRAPHIC PROJECTION.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1576.
1985. Also issued as CAR-TR-160, Center for Automation Research,
University of Maryland.]
105017 ANALYSIS OF STRUCTURE AND MOTION FROM OPTICAL FLOW. PART II: CENTRAL
PROJECTION.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1577.
1985. Also issued as CAR-TR-161, Center for Automation Research,
University of Maryland.]
105018 TRANSFORMATION OF OPTICAL FLOW BY CAMERA ROTATION.
K. Kanatani.
[University of Maryland. Center for Automation Research. CAR-TR-163.
1985. Also issued as CS-TR-1580, Department of Computer Science,
University of Maryland.]
105019 STRUCTURE FROM MOTION WITHOUT CORRESPONDENCE: GENERAL PRINCIPLE.
K. Kanatani.
[University of Maryland. Center for Automation Research. CAR-TR-164.
1985. Also issued as CS-TR-1581, Department of Computer Science,
University of Maryland.]
105020 THE CONSTRAINTS ON IMAGES OF RECTANGULAR POLYHEDRA.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1582.
1985. Also issued as CAR-TR-165, Center for Automation Research,
University of Maryland.]
105021 EFFICIENT COMPUTATIONS OF TRANSIENT VIRTUAL WAITING TIME OF A SINGLE
SERVER EXPONENTIAL QUEUEING SYSTEM.
C. Kim and A. K. Agrawala.
[University of Maryland. Department of Computer Science. CS-TR-1584.
1985. Also issued as UMIACS-TR-85-7, Institute for Advanced Computer
Studies, University of Maryland.]
105022 EMBEDDING GRAPHS INTO BINARY TREES TO DERIVE EFFICIENT VLSI LAYOUTS.
D. D. Sherlekar and J. Ja'Ja'.
[University of Maryland. Department of Computer Science. CS-TR-1585.
1985. Also issued as UMIACS-TR-85-11, Institute for Advanced Computer
Studies, University of Maryland.]
105023 TIME-DEPENDENT DISTRIBUTED SYSTEMS: PROVING SAFETY, LIVENESS AND
REAL-TIME PROPERTIES.
A. U. Shankar and S. S. Lam.
[University of Maryland. Department of Computer Science. CS-TR-1586.
1985. Also issued as UMIACS-TR-85-4, Institute for Advanced Computer
Studies, University of Maryland.]
105024 WORKLOAD REPRESENTATION AND ITS IMPACT ON THE PERFORMANCE PREDICTION
USING QUEUEING NETWORK MODELS.
S. K. Tripathi and L. W. Dowdy.
[University of Maryland. Department of Computer Science. CS-TR-1587.
1985. Also issued as UMIACS-TR-85-10, Institute for Advanced Computer
Studies, University of Maryland.]
105025 PERFORMANCE ANALYSIS OF SYNCHRONIZATION FOR TWO COMMUNICATION
PROCESSES.
B. Plateau and S. K. Tripathi.
[University of Maryland. Department of Computer Science. CS-TR-1588.
1985. Also issued as UMIACS-TR-85-9, Institute for Advanced Computer
Studies, University of Maryland.]
105026 INTERPRETATION OF IMAGE MOTION FIELDS: A SPATIO-TEMPORAL APPROACH.
M. Subbarao.
[University of Maryland. Department of Computer Science. CS-TR-1589.
1985. Also issued as CAR-TR-167, Center for Automation Research,
University of Maryland.]
105027 FAST INCREMENTAL PARALLEL ALGORITHMS FOR GRAPH PROBLEMS ON PRAMS.
D. D. Sherlekar, S. Pawagi, and I. V. Ramakrishnan.
[University of Maryland. Department of Computer Science. CS-TR-1590.
1985.]
105028 HIERARCHICAL REPRESENTATION OF PROBLEM-SOLVING KNOWLEDGE IN A
FRAME-BASED PROCESS PLANNING SYSTEM.
D. S. Nau and T.-C. Chang.
[University of Maryland. Department of Computer Science. TR-1592.
1985.]
105029 PROGRAM COMPLEXITY USING HIERARCHICAL ABSTRACT COMPUTERS.
W. G. Bail and M. V. Zelkowitz.
[University of Maryland. Department of Computer Science. TR-1593.
1985.]
105030 THE DECOMPOSITION OF A RECTANGLE INTO RECTANGLES OF MINIMAL PERIMETER.
T. Y. Kong, D. M. Mount, and A. W. Roscoe.
[University of Maryland. Center for Automation Research. CAR-TR-169.
1986. Also issued as CS-TR-1595, Department of Computer Science,
University of Maryland.]
105031 MORE ON THE RANDOM ORACLE HYPOTHESIS: WHAT IS TRUE ALMOST ALWAYS IS
NOT NECESSARILY SO.
W. Gasarch.
[University of Maryland. Department of Computer Science. Technical
report 1596. 1985.]
105032 RELATIVIZED SPACE WITH IMMUNITY.
W. Gasarch.
[University of Maryland. Department of Computer Science. TR-1597.
n.d.]
105033 HOLES AND GENUS OF 3D DIGITAL IMAGES.
C.-N. Lee and A. Rosenfeld.
[University of Maryland. Center for Automation Research. CAR-TR-170.
1985. Also issued as CS-TR-1598, Department of Computer Science,
University of Maryland.]
105034 PICTURE PROCESSING: 1985.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1600.
1986. Also issued as CAR-TR-172, Center for Automation Research,
University of Maryland.]
105035 THE VISUAL POTENTIAL: ONE CONVEX POLYGON.
M. Werman, S. Baugher, and J. A. Gualtieri.
[University of Maryland. Center for Automation Research. CAR-TR-212.
1986. Also issued as CS-TR-1690, Department of Computer Science,
University of Maryland.]
105036 VECTORIZATION OF THE MULTIGRID METHOD: THE TWO-DIMENSIONAL POISSON
EQUATION.
D. Barkai and K. J. M. Moriarty.
[University of Minnesota. Supercomputer Institute. UMSI 86/45. 1986.]
105037 OPTIMIZATION OF THE FORTRAN CODE FOR THE THREE-DIMENSIONAL ISING
MODEL ON THE FPS-264.
D. Barkai, A. Marti, and K. J. M. Moriarty.
[University of Minnesota. Supercomputer Institute. UMSI 86/46. 1986.]
105038 TWO CLASSES OF PERFORMANCE BOUNDS FOR CLOSED QUEUEING NETWORKS.
C.-T. Hsieh and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-85-09. 1986. Revised: July 1986.]
105039 THE STOCHASTIC PETRI NET ANALYZER SYSTEM DESIGN TOOL FOR BIT-MAPPED
WORKSTATIONS.
M. K. Molloy and P. Riddle.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-12. 1986.]
105040 THE BOUNDEDNESS PROBLEM FOR CONFLICT-FREE VECTOR REPLACEMENT SYSTEMS
IS PTIME-COMPLETE.
R. R. Howell, L. E. Rosier, and H.-C. Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-13. 1986.]
105041 CONCURRENCY CONTROL FOR OBJECT ORIENTED PROGRAMMING ENVIRONMENTS.
H. Tirri.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-14. 1986.]
105042 A TRANSACTION MODEL FOR OBJECT-ORIENTED VLSI CAD.
H. Tirri.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-15. 1986.]
105043 A VIEW OF AUTOMATED PROOF CHECKING AND PROVING.
C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-16. 1986.]
105044 AN IMPLEMENTED METHOD FOR INCREMENTAL SYSTOLIC DESIGN.
C.-H. Huang and C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-17. 1986.]
105045 MAY SIMULATION LANGUAGE TUTORIAL.
M. A. Ellis et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-18. 1986.]
105046 A RELIABLE AND DEADLOCK-FREE MULTI-INDEXED B+-TREE.
A. M. Keller.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-19. 1986.]
105047 AN ABSTRACT MACHINE BASED EXECUTION MODEL FOR COMPUTER ARCHITECTURE
DESIGN AND EFFICIENT IMPLEMENTATION OF LOGIC PROGRAMS IN PARALLEL.
M. V. Hermenegildo.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-20. 1986. Thesis (Ph.D.).]
105048 FM8501: A VERIFIED MICROPROCESSOR.
W. A. Hunt Jr..
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. Technical report 47. 1985. Thesis (Ph.D.).
"The contents of this technical report originally appeared as the
author's dissertation."]
105049 PROVING AND DISCOVERING GEOMETRY THEOREMS USING WU'S METHOD.
S. Chou.
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. Technical report 49. 1985. Thesis (Ph.D.).]
105050 A COLLECTION OF GEOMETRY THEOREMS PROVED MECHANICALLY.
S. Chou.
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. Technical report 50. 1986.]
105051 GRID PROPERTIES WHICH PRESERVE PROPERTIES OF EUCLIDEAN GEOMETRY: A
STUDY OF GRAPHICS LINE DRAWING.
M. Luby.
[University of Toronto. Department of Computer Science. Technical
report 190/86. 1986.]
105052 SOME GCD AND DIVISIBILITY PROBLEMS FOR SPARSE POLYNOMIALS.
A. Quick.
[University of Toronto. Department of Computer Science. Technical
report 191/86. 1986. Thesis (M.S.).]
105053 NOTES ON BOOLEAN CIRCUIT COMPLEXITY.
F. E. Fich.
[University of Washington. Department of Computer Science. Technical
report 86-05-02. 1986. "These notes are from a graduate course on
Boolean circuit complexity [CSci 522]...taught at the University of
Washington in Autumn 1985."]
105054 USING FLOW EXPRESSIONS TO SPECIFY TIMING CONSTRAINTS IN CONCURRENT
PROGRAMS.
U. H. Chi and A. C. Shaw.
[University of Washington. Department of Computer Science. Technical
report 86-05-03. 1986.]
105055 AN INVESTIGATION INTO THE DESIGN COSTS OF A SINGLE CHIP MULTIGAUGE
MACHINE.
L. Snyder and C. Yang.
[University of Washington. Department of Computer Science. Technical
report 86-06-01. 1986.]
105056 HIGH PERFORMANCE CACHE COHERENCE PROTOCOLS FOR SHARED-BUS
MULTIPROCESSORS.
J. Archibald.
[University of Washington. Department of Computer Science. Technical
report 86-06-02. 1986.]
105057 DECLARATIVE DESCRIPTIONS FOR VLSI GENERATORS.
M.-C. Y. Liem.
[University of Washington. Department of Computer Science. Technical
report 86-06-03. 1986. Thesis (M.S.).]
105058 MODELLING ARCHITECTURAL FEATURES WITH PETRI NETS.
J.-L. Baer.
[University of Washington. Department of Computer Science. Technical
report 86-06-04. 1986.]
105059 EFFECTIVENESS OF REPLICATION IN DISTRIBUTED COMPUTER NETWORKS.
J. D. Noe and A. Andreassian.
[University of Washington. Department of Computer Science. Technical
report 86-06-05. 1986.]
105060 COORDINATE FREE LAP.
W. Beckett.
[University of Washington. Department of Computer Science. Technical
report 86-07-01. 1986.]
105061 MOS CIRCUIT MODELS IN NETWORK C.
W. Beckett.
[University of Washington. Department of Computer Science. Technical
report 86-07-02. 1986.]
105062 AN INVESTIGATION OF MULTIPLE INHERITANCE IN THE SMALLTALK-80
PROGRAMMING LANGUAGE.
A. C. Sauer.
[University of Washington. Department of Computer Science. Technical
report 86-07-04. 1986.]
105063 AN IMPROVED ADA RUNTIME SYSTEM.
T. P. Baker.
[University of Washington. Department of Computer Science. Technical
report 86-07-05. 1986.]
105064 AN ARCHITECTURAL ANALYSIS OF BRANCH INSTRUCTIONS.
J. A. DeRosa.
[University of Washington. Department of Computer Science. Technical
report 86-07-06. 1986. Thesis (M.S.).]
105065 THE USE OF TEMPORAL COHERENCE IN COMPUTER ANIMATION.
C. B. Bennett.
[University of Washington. Department of Computer Science. Technical
report 86-08-04. 1986. Thesis (Ph.D.).]
105066 USING RELATIVE VELOCITY INFORMATION TO CONSTRAIN THE MOTION
CORRESPONDENCE PROBLEM: PSYCHOPHYSICAL DATA AND A COMPUTATIONAL
MODEL.
M. Dawson and Z. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 20a. 1985. "This is a revision
of CogMem 20, 'The Natural Computation of Motion Correspondence' and
supersedes that memorandum."]
105067 "HERE" AND "THERE" IN THE VISUAL FIELD.
Z. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 23. 1985.]
105068 THE EFFECTS OF APPARENT INTERELEMENT DISTANCE AND THE CONSISTENCY OF
MOVEMENT ON THE VISIBILITY AND DIRECTION OF APPARENT MOTION.
M. Dawson and R. Wright.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 24. 1986.]
105069 THE HOMOGENEOUS FORM OF LOGIC PROGRAMS WITH EQUALITY.
W. Demopoulos.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 25. 1986.]
105070 SPATIO-TEMPORAL PARAMETERS AND THE THREE-DIMENSIONALITY OF APPARENT
MOTION: EVIDENCE FOR TWO TYPES OF PROCESSING.
R. Wright, M. Dawson, and Z. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 26. 1986.]
105071 USING RELATIVE VELOCITY AS A NATURAL CONSTRAINT FOR THE MOTION
CORRESPONDENCE PROBLEM.
M. Dawson.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 27. 1986. "This research is
part of a dissertation submitted to the University of Western
Ontario."]
105072 USING STATECHARTS FOR HARDWARE DESCRIPTION.
D. Drusinsky and D. Harel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-06. 1985.]
105073 FAIR TERMINATION WITH CRUEL SCHEDULERS.
I. Dayan and D. Harel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-07. 1985.]
105074 A PROTOTYPE EXPERT SYSTEM FOR CREDIT EVALUATION.
A. Ben-David and L. Sterling.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-08. 1985.]
105075 THE DESIGN AND IMPLEMENTATION OF FLAT CONCURRENT PROLOG.
C. Mierowsky et al.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-09. 1985.]
105076 THE USE AND USEFULNESS OF NUMERATION SYSTEMS.
A. S. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-10. 1985.]
105077 A GHC ABSTRACT MACHINE AND INSTRUCTION SET.
J. Levy.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-11. 1985.]
105078 PRESSING FOR PARALLELISM: A PROLOG PROGRAM MADE CONCURRENT.
L. Sterling and M. Codish.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-12. 1985.]
105079 K-WELTER - A GENERALIZATION OF WELTER'S GAME.
J. Kahane and A. S. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-13. 1985.]
105080 ROBUST TRANSMISSION OF UNBOUNDED STRINGS USING FIBONACCI
REPRESENTATIONS.
A. Apostolico and A. S. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-14. 1985.]
105081 THE GENERALIZED SPRAGUE-GRUNDY FUNCTION AND ITS INVARIANCES UNDER
CERTAIN MAPPINGS.
A. S. Fraenkel and Y. Yesha.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-15. 1985.]
105082 ROBUST UNIVERSAL COMPLETE CODES AS ALTERNATIVES TO HUFFMAN CODES.
A. S. Fraenkel and S. T. Klein.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-16. 1985.]
105083 A REALLY ABSTRACT CONCURRENT MODEL AND ITS TEMPORAL LOGIC.
H. Barringer, R. Kuiper, and A. Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-17. 1985.]
105084 COMPILING OR-PARALLELISM INTO AND-PARALLELISM.
M. Codish and E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-18. 1985.]
105085 IMPROVED HIERARCHICAL BIT-VECTOR COMPRESSION IN DOCUMENT RETRIEVAL
SYSTEMS.
Y. Choueka et al.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS85-19. 1985.]
105086 ON EVALUATING THE ADEQUACY OF A LANGUAGE FOR AN ARCHITECTURE.
E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-01. 1986.]
105087 STATECHARTS: A VISUAL APPROACH TO COMPLEX SYSTEMS.
D. Harel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-02. 1986. Revised: February 1986.]
105088 A NEW APPROACH FOR INTRODUCING PROLOG TO NAIVE USERS.
O. Maler, Z. Scherz, and E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-03. 1986.]
105089 AN OPTIMAL SORTING ALGORITHM FOR MESH CONNECTED COMPUTERS.
C. P. Schnorr and A. Shamir.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-04. 1986.]
105090 HUFFMAN CODING WITHOUT BIT-MANIPULATION.
Y. Choueka et al.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-05. 1986. "A first draft of this paper was presented at the '8th
Annual International ACM-SIGIR Conference (Montreal, Canada, 1985),'
and appeared in its proceedings, pp.122-130."]
105091 INTERPRETATION OF SCHEMATIC DIAGRAMS.
Y. Eran and A. Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-06. 1986.]
105092 BOUNDING THE DEPTH OF SEARCH TREES.
A. S. Fraenkel and S. T. Klein.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-07. 1986.]
105093 SIMPLIFYING CONDITIONAL TERM REWRITING SYSTEMS.
S. Kaplan.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-08. 1986.]
105094 A CHOPPY LOGIC.
R. Rosner and A. Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-09. 1986.]
105095 CONCURRENT PROLOG: A PROGRESS REPORT.
E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-10. 1986.]
105096 META INTERPRETERS FOR REAL.
S. Safra and E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-11. 1986.]
105097 STATECHARTS AS AN ABSTRACT MODEL FOR DIGITAL CONTROL UNITS.
D. Drusinsky and D. Harel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-12. 1986.]
105098 CONCURRENT PROLOG IMPLEMENTATIONS - TWO NEW SCHEMES.
J. Levy and N. Friedmann.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-13. 1986.]
105099 PARTIZAN OCTAL GAMES: PARTIZAN SUBTRACTION GAMES.
A. S. Fraenkel and A. Kotzig.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-14. 1986.]
105100 GEODETIC GAMES ON GRAPHS.
A. S. Fraenkel and F. Harary.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-15. 1986.]
105101 NOTES ON THE COMPLEXITY OF SYSTOLIC PROGRAMS.
S. Taylor et al.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-16. 1985.]
105102 A LAYERED METHOD FOR PROCESS AND CODE MAPPING.
S. Taylor, E. Av-Ron, and E. Y. Shapiro.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-17. 1986.]
105104 IMBALANCE BETWEEN GROWTH AND FUNDING IN ACADEMIC COMPUTER SCIENCE:
TWO TRENDS COLLIDING.
D. Gries et al.
[April 9, 1986. "A report endorsed by The Computer Science Board."
"Prepared by The Computer Science Board's Committee on Research
Funding in Computer Science: David Gries, Raymond Miller, Robert
Ritchie, Paul Young."]
105106 A REVIEW OF METHODS OF PERSONAL IDENTITY VERIFICATION.
W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 73/86. 1986.]
105107 SOME APPLICATIONS WITH INDUCTIVE EXPERT SYSTEM SHELLS.
P. Mowforth.
[Turing Institute. Occasional paper TIOP-86-002. 1986.]
105108 AN ANALYTICAL MODEL OF CACHE MEMORIES.
C. McCrosky.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-7. 1986.]
105109 FORMAL STRUCTURES FOR COMPUTATION AND DEDUCTION.
G. Huet.
[1986. "This document is the first edition of the notes for a
graduate-level course given in the Computer Science Department of
Carnegie-Mellon University during the Spring 1986." No issuing agency
indicated (author's address: INRIA, Domaine de Voluceau,
78150-Rocquencourt, France).]
105111 LITERATE PROGRAMMING.
M. Hines.
[1986. No issuing agency indicated (author's address: Department of
Physiology, Duke University Medical Center, Durham, NC 27710).]
105114 JOYCE - A PROGRAMMING LANGUAGE FOR DISTRIBUTED SYSTEMS.
P. Brinch Hansen.
[University of Copenhagen. Computer Science Department. Report no.
86/5. 1986.]
105116 THE SECOND LABOR OF HERCULES: AN ESSAY ON SOFTWARE ENGINEERING AND
THE STRATEGIC DEFENSE INITIATIVE.
D. B. Benson.
[Washington State University. Department of Computer Science.
CS-86-148. 1986.]
105119 HAIRY BRUSHES IN COMPUTER-GENERATED IMAGES.
S. Strassmann.
[Massachusetts Institute of Technology. 1986. Thesis (M.S.).
"Submitted to the Department of Architecture in partial fulfillment
of the requirements of the degree of Master of Science at the
Massachusetts Institute of Technology, June 1986."]
105121 RETIMING SYNCHRONOUS CIRCUITRY.
C. E. Leiserson and J. B. Saxe.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 13. 1986.]
105122 THE SYNTHESIZER GENERATOR REFERENCE MANUAL.
T. Reps and T. Teitelbaum.
[Cornell University. Department of Computer Science. 1985.]
105123 A NEW APPROACH TO LEAST SQUARES ESTIMATION, WITH APPLICATIONS.
S. A. van de Geer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. MS-R8602. 1986.]
105125 ADA COMPILER VALIDATION: AN EXAMPLE OF SOFTWARE TESTING THEORY AND
PRACTICE.
J. B. Goodenough.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-07. 1986.]
105126 FURTHER RESULTS ON INTERPOLATION SEARCHING OF DATABASES.
Z. J. Li and H. K. T. Wong.
[Lawrence Berkeley Laboratory. LBL-20708. 1986.]
105127 CONCURRENT, FAULT TOLERANT DETECTION OF 2-D MOTION.
S. Singer and B. A. Huberman.
[n.d. No issuing agency indicated (authors' addresses:
Stephanie Singer: Department of Computer Science, Stanford
University, Stanford, CA 94305; B. A. Huberman: Xerox Palo
Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
94304).]
VOL. 9, NO. 2 02/05/87
105129 ON IMPACT DYNAMICS OF ROBOTIC OPERATIONS.
Y. Wang.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-14. 1986.]
105130 TREATMENT AS HEURISTIC CONSTRUCTION: A CASE STUDY IN CUTTING FLUID
SELECTION.
J. E. Mogush et al.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-15. 1986.]
105131 A LISP COMPILER FOR THE DADO PARALLEL COMPUTER.
M. D. Lerner, M. van Biema, and G. Q. Maguire Jr..
[Columbia University. Department of Computer Science. CUCS-146-85.
1985.]
105132 EXECUTION OF OPS5 PRODUCTION SYSTEMS ON A MASSIVELY PARALLEL MACHINE.
B. K. Hillyer and D. E. Shaw.
[Columbia University. Department of Computer Science. CUCS-147-84.
1984.]
105136 A CURE FOR PATHOLOGICAL BEHAVIOR IN GAMES THAT USE MINIMAX.
B. Abramson.
[Columbia University. Department of Computer Science. CUCS-153-85.
1985.]
105137 TOWARDS THE PARALLEL EXECUTION OF RULES IN PRODUCTION SYSTEM PROGRAMS.
T. Ishida and S. J. Stolfo.
[Columbia University. Department of Computer Science. CUCS-154-85.
1985.]
105142 COMPLEXITY OF APPROXIMATELY SOLVED PROBLEMS.
J. F. Traub.
[Columbia University. Department of Computer Science. CUCS-161-85.
1985.]
105143 AN INTRODUCTION TO INFORMATION-BASED COMPLEXITY.
J. F. Traub.
[Columbia University. Department of Computer Science. CUCS-162-85.
1985.]
105155 A SIMPLE PREPROCESSING SCHEME TO EXTRACT AND BALANCE IMPLICIT
PARALLELISM IN THE CONCURRENT MATCH OF PRODUCTION RULES.
S. J. Stolfo, D. M. Miranker, and R. C. Mills.
[Columbia University. Department of Computer Science. CUCS-174-85.
1985.]
105156 MORE RULES MAY MEAN FASTER PARALLEL EXECUTION.
S. J. Stolfo, D. M. Miranker, and R. C. Mills.
[Columbia University. Department of Computer Science. CUCS-175-85.
1985.]
105158 UNIFYING REPRESENTATION AND GENERALIZATION: UNDERSTANDING
HIERARCHICALLY STRUCTURED OBJECTS.
K. H. Wasserman.
[Columbia University. Department of Computer Science. CUCS-177-85.
1985. Thesis (Ph.D.).]
105160 A PRIVATE INTERACTIVE TEST OF A BOOLEAN PREDICATE AND
MINIMUM-KNOWLEDGE PUBLIC-KEY CRYPTOSYSTEMS.
Z. Galil, S. Haber, and M. M. Yung.
[Columbia University. Department of Computer Science. CUCS-179-85.
1985. "Extended abstract."]
105161 DISTRIBUTED ALGORITHMS IN SYNCHRONOUS BROADCASTING NETWORKS.
Z. Galil, G. M. Landau, and M. M. Yung.
[Columbia University. Department of Computer Science. CUCS-180-85.
1985.]
105162 A SURVEY OF INFORMATION-BASED COMPLEXITY.
H. Wozniakowski.
[Columbia University. Department of Computer Science. CUCS-181-85.
1985.]
105163 CONTRIBUTIONS TO INFORMATION-BASED COMPLEXITY, IMAGE UNDERSTANDING,
AND LOGIC CIRCUIT DESIGN.
D. Lee.
[Columbia University. Department of Computer Science. CUCS-182-85.
1985. Thesis (Ph.D.).]
105164 OPTIMAL ALGORITHMS FOR IMAGE UNDERSTANDING: CURRENT STATUS AND FUTURE
PLANS.
D. Lee.
[Columbia University. Department of Computer Science. CUCS-183-85.
1985.]
105165 INTEGRATING SENSORY DATA FOR OBJECT RECOGNITION TASKS.
P. K. Allen and R. Bajcsy.
[Columbia University. Department of Computer Science. CUCS-184-85.
1985.]
105166 MISS MANNERS: A SPECIALIZED SILICON COMPILER FOR SYNCHRONIZERS.
T. S. Balraj and M. J. Foster.
[Columbia University. Department of Computer Science. CUCS-185-85.
1985.]
105171 GENERALIZING LOGIC CIRCUIT DESIGNS BY ANALYZING PROOFS OF CORRECTNESS.
T. Ellman.
[Columbia University. Department of Computer Science. CUCS-190-85.
1985.]
105172 SYMMETRIC PUBLIC-KEY ENCRYPTION.
Z. Galil, S. Haber, and M. M. Yung.
[Columbia University. Department of Computer Science. CUCS-191-85.
1985.]
105176 A KNOWLEDGE-BASED EXPERT SYSTEMS PRIMER AND CATALOG.
B. K. Hillyer.
[Columbia University. Department of Computer Science. CUCS-195-85.
1985.]
105180 STORY TELLING AS PLANNING AND LEARNING.
M. Lebowitz.
[Columbia University. Department of Computer Science. CUCS-202-85.
1985.]
105181 AN AUTOMATED PERFORMANCE ANALYSIS OF A TWO PHASE LOCKING PROTOCOL.
N. Nounou and Y. Yemini.
[Columbia University. Department of Computer Science. CUCS-205-85.
1985.]
105182 A METHODOLOGY FOR SPECIFICATION-BASED PERFORMANCE ANALYSIS OF
COMMUNICATION PROTOCOLS.
N. Nounou and Y. Yemini.
[Columbia University. Department of Computer Science. CUCS-206-85.
1985.]
105183 GUIDE TO THE UNIFICATION PROCESS AND ITS IMPLEMENTATION. PROGRESS
REPORT ON EXTENDING THE GRAMMAR.
C. L. Paris and T. L. Kwee.
[Columbia University. Department of Computer Science. CUCS-208-85.
1985.]
105184 TOWARDS MORE GRACEFUL INTERACTION: A SURVEY OF QUESTION-ANSWERING
PROGRAMS.
C. L. Paris.
[Columbia University. Department of Computer Science. CUCS-209-85.
1985.]
105185 EQUIVALENT DESCRIPTIONS OF GENERALIZED CYLINDERS.
K. S. Roberts.
[Columbia University. Department of Computer Science. CUCS-210-85.
1985.]
105186 ALLOCATION AND MANIPULATION OF RECORDS IN THE NON-VON SUPERCOMPUTER.
D. E. Shaw and B. K. Hillyer.
[Columbia University. Department of Computer Science. CUCS-211-83.
1983.]
105187 THE DADO PRODUCTION SYSTEM MACHINE.
S. J. Stolfo and D. P. Miranker.
[Columbia University. Department of Computer Science. CUCS-213-84.
1984.]
105188 A SIMPLE SCHEME FOR A FAULT TOLERANT DADO MACHINE.
S. J. Stolfo.
[Columbia University. Department of Computer Science. CUCS-214-85.
1985.]
105189 CLOCKING SCHEMES FOR HIGH SPEED DIGITAL SYSTEMS.
S. H. Unger and C.-J. Tan.
[Columbia University. Department of Computer Science. CUCS-215-85.
1985.]
105190 COMPLEXITY OF DIFFERENTIAL AND INTEGRAL EQUATIONS.
A. G. Werschulz.
[Columbia University. Department of Computer Science. CUCS-216-85.
1985.]
105191 ANALYZING USER PLANS TO PRODUCE INFORMATIVE RESPONSES BY A
PROGRAMMER'S CONSULTANT.
U. Wolz.
[Columbia University. Department of Computer Science. CUCS-218-85.
1985.]
105192 GENERATING ADMISSIBLE HEURISTICS BY CRITICIZING SOLUTIONS TO RELAXED
MODELS.
O. Hansson, A. E. Hayer, and M. M. Yung.
[Columbia University. Department of Computer Science. CUCS-219-85.
1985.]
105193 OBJECT RECOGNITION USING VISION AND TOUCH.
P. K. Allen.
[Columbia University. Department of Computer Science. CUCS-220-85.
1985. Thesis (Ph.D.). "Presented to the Faculties of the University
of Pennsylvania in partial fulfillment of the requirements for the
degree of Doctor of Philosophy, September 1985."]
105194 ON THE APPLICATION OF MASSIVELY PARALLEL SIMD TREE MACHINES TO
CERTAIN INTERMEDIATE-LEVEL VISION TASKS.
H. A. H. Ibrahim, J. R. Kender, and D. E. Shaw.
[Columbia University. Department of Computer Science. CUCS-221-85.
1985.]
105195 SIMD TREE ALGORITHMS FOR IMAGE CORRELATION.
H. A. H. Ibrahim, J. R. Kender, and D. E. Shaw.
[Columbia University. Department of Computer Science. CUCS-222-86.
1986.]
105196 OSSI - A PORTABLE OPERATING SYSTEM INTERFACE AND UTILITY LIBRARY FOR
MODULA-2.
E. Biagioni et al.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 67. 1986.]
105197 SCAN CONVERTING POLYGONS BASED ON PLANE-SWEEP.
G. Beretta and A. Meier.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 68. 1986.]
105198 THE FEDERATIVE DATABASE SERVER.
R. P. Braegger et al.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 69. 1986. Edited by Andreas Diener and
Carl August Zehnder.]
105199 ERROR ANALYSIS OF SPATIAL REPRESENTATION AND ESTIMATION OF MOBILE
ROBOTS.
C. M. Wang.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5573. 1986.]
105200 GAUSSIAN FILTERS AND EDGE DETECTION.
B. G. Schunck.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5586. 1986.]
105201 DYNAMIC LOAD SHARING IN DISTRIBUTED DATABASE ENVIRONMENTS.
P. S. Yu, S. Balsamo, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11505. 1985.]
105205 TOWARDS A THEORY OF DECLARATIVE KNOWLEDGE.
K. R. Apt, H. Blair, and A. Walker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11681. 1986.]
105207 PROLOG-II AS AN INSTANCE OF THE LOGIC PROGRAMMING LANGUAGE SCHEME.
J. Jaffar, J.-L. Lassez, and M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11707. 1986.]
105216 CHARACTERIZATION OF BRANCH AND DATA DEPENDENCIES IN PROGRAMS FOR
EVALUATING PIPELINE PERFORMANCE.
P. G. Emma and E. S. Davidson.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11733. 1986.]
105220 SCHEDULING PARALLEL MACHINES WITH SETUPS.
R. J. Wittrock.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11740. 1986.]
105221 CONSTRUCTIVE INTERFERENCE IN PARALLEL ALGORITHMS.
C. C. Douglas and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11742. 1986.]
105223 PERFORMANCE ANALYSIS OF THE FFT ALGORITHM ON A SHARED-MEMORY PARALLEL
ARCHITECTURE.
Z. Cvetanovic.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11749. 1986.]
105236 SYSTOLIC SUPER SUMMATION.
P. R. Cappello and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11826. 1986.]
105238 SOME ISSUES AND TRENDS IN THE SEMANTICS OF LOGIC PROGRAMMING.
J. Jaffar, J.-L. Lassez, and M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11833. 1986.]
105242 OPTIMIZING DEPTH-FIRST SEARCH OF AND-OR TREES.
K. S. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11842. 1986.]
105246 FPT: A FUNCTIONAL PARALLEL LANGUAGE.
V. Nguyen, A. Demers, and B. Hailpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11858. 1986.]
105250 MEASURING PARALLELISM IN COMPUTATION-INTENSIVE SCIENTIFIC/ENGINEERING
APPLICATIONS.
M. Kumar.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11870. 1986.]
105252 CATEGORIES, DATA TYPES, AND IMPERATIVE LANGUAGES.
E. G. Wagner.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11879. 1986.]
105253 PARALLELIZATION OF QUICKSORT USING FETCH-AND-ADD.
A. Norton.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11884. 1986.]
105254 PARALLELIZATION AND PERFORMANCE ANALYSIS OF THE COOLEY-TUKEY FFT
ALGORITHM FOR SHARED-MEMORY ARCHITECTURES.
A. Norton and A. Silberger.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11885. 1986.]
105257 SUPERCOMPUTER PERFORMANCE EVALUATION: STATUS AND DIRECTIONS.
J. L. Martin and D. Mueller-Wichards.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11893. 1986.]
105260 ADVANCES IN RETE PATTERN MATCHING.
M. I. Schor et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11899. 1986.]
105266 ON GREEDY ALGORITHMS FOR SERIES PARALLEL GRAPHS.
A. J. Hoffman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11914. 1986.]
105270 A GENERALIZED OBJECT MODEL.
V. Nguyen and B. Hailpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11924. 1986.]
105275 AN 1.44...NLOGN ALGORITHM FOR DISTRIBUTED LEADER FINDING IN
BIDIRECTIONAL RINGS OF PROCESSORS.
S. Moran, M. Shalom, and S. Zaks.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11933. 1986.]
105278 AN INTRODUCTION TO THE IBM RESEARCH PARALLEL PROCESSOR PROTOTYPE
(RP3).
G. F. Pfister et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11948. 1986.]
105280 OFFICE-BY-EXAMPLE: AN INTEGRATED OFFICE SYSTEM AND DATABASE MANAGER.
K.-Y. Whang et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11966. 1986.]
105281 BRAINS, MODELS AND INTELLIGENCE: INSIGHTS FROM EPILEPSY RESEARCH.
R. D. Traub.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11969. 1986.]
105288 SLOWING SEQUENTIAL ALGORITHMS FOR OBTAINING FAST DISTRIBUTED AND
PARALLEL ALGORITHMS: MAXIMUM MATCHINGS.
B. Schieber and S. Moran.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11979. 1986.]
105289 SOFTENING UP HARD SCIENCE: REPLY TO NEWELL AND CARD.
J. M. Carroll and R. L. Campbell.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11983. 1986.]
105290 INTERFACE DESIGN ISSUES FOR ADVICE-GIVING EXPERT SYSTEMS.
J. M. Carroll and J. McKendree.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11984. 1986.]
105295 PERFORMANCE OF COMPLEX QUERIES IN MAIN MEMORY DATABASE SYSTEMS.
D. Bitton, M. B. Hanrahan, and C. Turbyfill.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11994. 1986.]
105298 STATISTICAL AC TEST COVERAGE.
D. M. Wu, C. E. Radke, and J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12004. 1986.]
105299 FEATURE ANALYSIS FOR SYMBOL RECOGNITION BY ELASTIC MATCHING.
J. M. Kurtzberg.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12006. 1986.]
105300 CYCLES, CENTERS AND HYPERBOLIC POINTS IN TIME-DISCRETE DYNAMICAL
SYSTEMS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12008. 1986.]
105301 AN APPROXIMATION OF THE PROCESSING TIME FOR A RANDOM GRAPH MODEL OF
PARALLEL COMPUTATION.
E. Gelenbe et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12018. 1986.]
105302 VLSI CIRCUIT ANALYSIS, TIMING VERIFICATION AND OPTIMIZATION.
A. E. Ruehli and D. L. Ostapko.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12022. 1986.]
105303 VARIATIONS ON THE D-ALGORITHM.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12024. 1986.]
105304 A FAST IMPLEMENTATION OF POLYNOMIAL FACTORIZATION.
M. Lucks.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12026. 1986.]
105305 THE ANSWER IS IN THE QUESTION: A PROTOCOL STUDY OF INTELLIGENT HELP.
A. Aaronson and J. M. Carroll.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12034. 1986.]
105306 COMPUTER GRAPHICS REVEAL PATTERNS IN HAILSTONE (3N+1) NUMBERS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12036. 1986.]
105307 PROMPTING, FEEDBACK AND ERROR CORRECTION IN THE DESIGN OF A SCENARIO
MACHINE.
J. M. Carroll and D. S. Kay.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12047. 1986.]
105308 THE USE AND MANAGEMENT OF A LARGE COMPUTER CONFERENCING SYSTEM.
D. M. Chess and G. A. Whittico.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12048. 1986.]
105309 TRIMMED SURFACE ALGORITHMS FOR THE EVALUATION AND INTERROGATION OF
SOLID BOUNDARY REPRESENTATIONS.
R. T. Farouki.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12052. 1986.]
105310 EFFICIENT SEARCH TECHNIQUES - AN EMPIRICAL STUDY OF THE N-QUEENS
PROBLEM.
H. S. Stone and J. M. Stone.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12057. 1986.]
105311 A CLASS OF ALGORITHMS FOR CONVEX POLYGON QUERIES.
W.-J. Hsu, C.-C. Wang, and K.-T. Huang.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12064. 1986.]
105312 THE WORD AND GENERATOR PROBLEMS FOR LATTICES.
S. S. Cosmadakis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12067. 1986.]
105316 SORTING AND SELECTING IN ROUNDS.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5044. 1986.]
105323 THE COMPLEMENTATION PROBLEM FOR BUECHI AUTOMATA WITH APPLICATIONS TO
TEMPORAL LOGIC.
A. P. Sistla, M. Y. Vardi, and P. Wolper.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5084. 1986.]
105327 COMPLETENESS OF REWRITE RULES AND REWRITE STRATEGIES FOR FP.
J. Y. Halpern, J. H. Williams, and E. L. Wimmers.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5099. 1986.]
105329 NON-BLOCKING NETWORKS.
P. Feldman, J. Friedman, and N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5117. 1986. Preliminary version
(4/22/86).]
105330 SYSTEMS PROGRAMMING: COPING WITH PARALLELISM.
R. K. Treiber.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5118. 1986.]
105333 A PROPOSITIONAL MODAL LOGIC OF TIME INTERVALS.
J. Y. Halpern and Y. Shoham.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5130. 1986.]
105334 PARALLEL HASHING - AN EFFICIENT IMPLEMENTATION OF SHARED MEMORY.
A. R. Karlin and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5133. 1986.]
105335 KNOWLEDGE AND COMMON KNOWLEDGE IN A BYZANTINE ENVIRONMENT I: CRASH
FAILURES.
C. Dwork and Y. Moses.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5136. 1986.]
105336 DETERMINISTIC SELECTION IN O(LOGLOG N) PARALLEL TIME.
M. Ajtai et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5137. 1986.]
105337 EXPANDING GRAPHS CONTAIN ALL SMALL TREES.
J. Friedman and N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5145. 1986.]
105338 ON THE EXPRESSIVE POWER OF DATA DEPENDENCIES.
J. A. Makowsky and M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5147. 1986.]
105339 AN AUTOMATA-THEORETIC APPROACH TO AUTOMATIC PROGRAM VERIFICATION.
M. Y. Vardi and P. Wolper.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5148. 1986.]
105340 REASONING ABOUT FAIR CONCURRENT PROGRAMS.
C. Courcoubetis, M. Y. Vardi, and P. Wolper.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5149. 1986. "Extended abstract."]
105349 ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE
AGREEMENT.
F. Cristian et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5244. 1986. "An earlier version [of this
report] was published as [IBM research report] RJ 4540."]
105350 THE TOKEN DISTRIBUTION PROBLEM.
D. Peleg and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5245. 1986.]
105351 FAULT TOLERANCE IN NETWORKS OF BOUNDED DEGREE.
C. Dwork et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5246. 1986.]
105352 ISSUES IN LOGICAL DATABASES.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5247. 1986.]
105353 POLLSTER: A DOCUMENT ANNOTATION SYSTEM FOR DISTRIBUTED ENVIRONMENTS.
L.-F. Cabrera and E. Mowat.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5249. 1986.]
105354 ON THE COMPLEXITY OF POLYHEDRAL SEPARABILITY.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5252. 1986.]
105355 ON THE ROAD COLORING PROBLEM.
J. Friedman.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5253. 1986.]
105363 COMMUNICATION SUPPORT FOR DISTRIBUTED PROCESSING: DESIGN AND
IMPLEMENTATION ISSUES.
L. Svobodova.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1501. 1986.]
099091 MASTIF - A WORKSTATION APPROACH TO INTEGRATED CIRCUIT PROCESS AND
-325 DEVICE DESIGN.
D. S. Boning.
[1986. Thesis (M.S.).]
099091 METHODOLOGY VERIFICATION OF HIERARCHICALLY DESCRIBED VLSI CIRCUITS.
-327 I. L. Bain and L. A. Glasser.
[1986.]
099091 CHARACTERIZATION OF ERRORS IN CIRCUIT SIMULATION PROGRAMS.
-330 A. E. Stevens.
[1986. Thesis (B.S.).]
105377 A MIXED-INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY
SOLVABLE.
C. E. Leiserson and J. B. Saxe.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-284. 1985.]
105378 TWO UNDECIDABILITY RESULTS IN PROBABILISTIC AUTOMATA THEORY.
J. J. Killian.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-285. 1985.]
105379 IMPROVEMENTS OF YAO'S RESULTS ON PARITY CIRCUITS.
J. Hastad.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-286. 1985.]
105380 NETWORK CONTROL BY BAYESIAN BROADCAST.
R. L. Rivest.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-287. 1985.]
105381 DSCRIBE: A SCRIBE SERVER.
J. C. Chung.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-288. 1985.]
105382 THE CAM-7 MULTIPROCESSOR: A CELLULAR AUTOMATA MACHINE.
T. Toffoli and N. Margolus.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-289. 1985.]
105383 DISTRIBUTED FIFO ALLOCATION OF IDENTICAL RESOURCES USING SMALL SHARED
SPACE.
M. J. Fischer et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-290. 1985.]
105384 A NEW MAX-FLOW ALGORITHM.
A. V. Goldberg.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-291. 1985.]
105385 PACKET TRAINS: MEASUREMENTS AND A NEW MODEL FOR COMPUTER NETWORK
TRAFFIC.
R. Jain and S. Routhier.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-292. 1985.]
105386 WIDTH-3 PERMUTATION BRANCHING PROGRAMS.
D. A. Barrington.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-293. 1985.]
105387 DATAFLOW ARCHITECTURES.
Arvind. and D. E. Culler.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-294. 1986.]
105388 ATOMIC DATA ABSTRACTIONS IN A DISTRIBUTED COLLABORATIVE EDITING
SYSTEM (EXTENDED ABSTRACT).
I. Greif, R. Selinger, and W. Weihl.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-295. 1985.]
020344 A GENERALIZED APPROACH TO EQUATIONAL UNIFICATION.
K. A. Yelick.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-344. 1985. Thesis (M.S.). "This thesis was
submitted to the Department of Electrical Engineering and Computer
Science on August 1, 1985 in partial fulfillment of the requirements
for the degrees of Bachelor of Science and Master of Science in
Computer Science."]
020345 ACCESS TO INTER-ORGANIZATION COMPUTER NETWORKS.
D. L. Estrin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-345. 1985. Thesis (Ph.D.).]
020346 EQUATIONAL THEORIES AND DATABASE CONSTRAINTS.
S. S. Cosmadakis.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-346. 1985. Thesis (Ph.D.).]
020347 A RELATIVE-MOTION MICROWORLD.
L. E. Morecroft.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-347. 1985. Thesis (M.S.).]
020348 ON PLAYING WELL IN A SUM OF GAMES.
L. Yedwab.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-348. 1985. Thesis (M.S.).]
020349 BOCHSER: AN INTEGRATED SCHEME PROGRAMMING SYSTEM.
M. A. Eisenberg.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-349. 1985. Thesis (M.S.).]
020350 DESIGN AND IMPLEMENTATION OF A DISTRIBUTED PROGRAM FOR COLLABORATIVE
EDITING.
R. Seliger.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-350. 1986. Thesis (M.S.).]
020351 THE COMPLEXITY OF GRAPH LAYOUT AND CHANNEL ROUTING FOR VLSI.
S. N. Bhatt.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-351. 1985. Thesis (Ph.D.).]
020352 BOSTON COMMUNITY INFORMATION SYSTEM USER MANUAL (VERSION 6.0).
J. M. Lucassen et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-352. 1986.]
020353 DATA BACKUP AND RECOVERY IN A COMPUTER ARCHITECTURE FOR FUNCTIONAL
PROGRAMMING.
S. Jagannathan.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-353. 1985. Thesis (M.S.).]
020354 REMOTE EVALUATION.
J. W. Stamos.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-354. 1986. Thesis (Ph.D.).]
020355 DATA STRUCTURE MANAGEMENT IN A DATA FLOW COMPUTER SYSTEM.
B. Guharoy.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-355. 1985. Thesis (M.S.).]
020356 LOGICAL STRUCTURES FOR FUNCTIONAL LANGUAGES.
M. J. Beckerle.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-356. 1986. Thesis (M.S.).]
020357 COMPUTATION MANAGEMENT IN A SINGLE ADDRESS SPACE SYSTEM.
J. C. Gibson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-357. 1986. Thesis (M.S.).]
020358 PRIMITIVES FOR REAL-TIME ANIMATION IN THREE DIMENSIONS.
C. J. Chiang.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-358. 1986. Thesis (M.S.).]
020359 A CATV-BASED HIGH-SPEED PACKET-SWITCHING NETWORK DESIGN.
D. C. Feldmeier.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-359. 1986. Thesis (M.S.).]
020360 INTELLIGENT PHYSIOLOGIC MODELING: AN APPLICATION OF KNOWLEDGE BASED
SYSTEMS TECHNOLOGY TO MEDICAL EDUCATION.
R. Kunstaetter.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-360. 1986. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on April
10, 1986 in partial fulfillment of the requirements for the degrees
of Electrical Engineer and Master of Science in Computer Science."]
105368 VERIFICATION BY MEANS OF OBSERVATIONAL EQUIVALENCE ON AUTOMATA.
D. Vergamini.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 501. 1986.]
105369 LIMITING DISTRIBUTIONS FOR TRIE PARAMETERS.
P. Jacquet and M. Regnier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 502. 1986.]
105370 DATA SYNCHRONIZED PIPELINE ARCHITECTURE: PIPELINING IN MULTIPROCESSOR
ENVIRONMENTS.
Y. Jegou and A. Seznec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 503. 1986.]
105371 AN OVERVIEW OF THE GOTHIC DISTRIBUTED OPERATING SYSTEM.
J.-P. Banatre, M. Banatre, and F. Ployette.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 504. 1986. Also issued as Publication
interne 284, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
105372 QUEUEING SYSTEM GI/M/M WITH BATCH SERVICE.
F.-J. Zhang and Y.-Y. Chen.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 506. 1986.]
105373 ON PERIODIC PHENOMENA OF QUEUEING SYSTEM M/G/1 WITH BULK ARRIVALS AND
BATCH SERVICES.
F.-J. Zhang and Y.-Y. Chen.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 507. 1986.]
105374 APPROXIMATE COUNTING: A MARTINGALE APPROACH.
W. A. Rosenkrantz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 508. 1986.]
105375 A SURVEY ON ATTRIBUTE GRAMMARS. PART II: REVIEW OF EXISTING SYSTEMS.
P. Deransart, M. Jourdan, and B. Lorho.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 510. 1986.]
105376 CONCURRENT PROGRAMMING AND NUMERICAL APPLICATIONS.
J. Erhel.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 67. 1986.]
105389 NON-SEQUENTIAL COMPUTATION AND LAWS OF NATURE.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8618. 1986.]
105390 NEEDED REDUCTION AND SPINE STRATEGIES FOR THE LAMBDA CALCULUS.
H. P. Barendregt et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8621. 1986.]
105391 A TECHNIQUE TO DESIGN DELAY-INSENSITIVE VLSI CIRCUITS.
J. C. Ebergen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8622. 1986.]
105392 SEGMENT GROUPING, AN EXTENSION TO THE GRAPHICAL KERNEL SYSTEM.
P. J. W. ten Hagen and M. M. de Ruiter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8623. 1986.]
105393 NOTES ON THE METHODOLOGY OF CCS AND CSP.
R. J. van Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8624. 1986.]
105394 FAILURES WITHOUT CHAOS: A NEW PROCESS SEMANTICS FOR FAIR ABSTRACTION.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8625. 1986.]
105395 A DENOTATIONAL SEMANTICS OF A PARALLEL OBJECT-ORIENTED LANGUAGE.
P. America et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8626. 1986.]
105396 A STUDY IN ALGEBRAIC SPECIFICATION: A LANGUAGE WITH GOTO-STATEMENTS.
N. W. P. van Diepen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8627. 1986.]
105397 ATOMIC SHARED REGISTER ACCESS BY ASYNCHRONOUS HARDWARE.
P. M. B. Vitanyi and B. Awerbuch.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8628. 1986. "Detailed abstract."]
105398 PROCESS ALGEBRA SEMANTICS OF POOL.
F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8629. 1986.]
105399 ANALYSIS OF SMOOTHING OPERATORS IN THE SOLUTION OF PARTIAL
DIFFERENTIAL EQUATIONS BY EXPLICIT DIFFERENCE SCHEMES.
P. J. van der Houwen, B. P. Semmeijer, and F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8617. 1986.]
105400 DISCRETIZED COLLOCATION AND ITERATED COLLOCATION FOR NONLINEAR
VOLTERRA INTEGRAL EQUATIONS OF THE SECOND KIND.
J. G. Blom and H. Brunner.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8618. 1986.]
105401 STABILITY AND CONVERGENCE IN THE PDE / STIFF ODE INTERPHASE.
J. M. Sanz-Serna and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8619. 1986.]
105402 EFFICIENT PARALLEL AND SERIAL APPROXIMATE STRING MATCHING.
G. M. Landau and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 101. 1986. Also
issued as Technical report 221, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
105403 PARALLEL EAR DECOMPOSITION SEARCH (EDS) AND ST-NUMBERING IN GRAPHS.
Y. Maon, B. Schieber, and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 102. 1986. Also
issued as Technical report 222, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
105404 TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING.
Y. Azar and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 103. 1986. Also
issued as Technical report 223, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
105405 THE ADD-AND-LAMBDA OPERATION: AN EXTENSION OF F&A.
M. C. Harrison.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 104. 1986.]
105406 EFFICIENT SYNCHRONIZATION ON MULTIPROCESSORS WITH SHARED MEMORY.
C. P. Kruskal, L. Rudolph, and M. Snir.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 105. 1986.]
105407 A UNIFIED THEORY OF INTERCONNECTION NETWORK STRUCTURE.
C. P. Kruskal and M. Snir.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 106. 1986.
Revised: June 1986.]
105408 THE EFFICIENT TERMINATION OF ADA TASKS IN A DISTRIBUTED ENVIRONMENT.
S. Flynn, E. Schonberg, and E. Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 107. 1986.]
105409 THE ACCELERATED CENTROID DECOMPOSITION TECHNIQUE FOR OPTIMAL PARALLEL
TREE EVALUATION IN LOGARITHMIC TIME.
R. Cole and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 108. 1986. Also
issued as Technical report 242, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
105410 NOTE ON THE AKS SORTING NETWORK.
R. Cole and C. O'Dunlaing.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 109. n.d.
"Expository note." Also issued as Technical report 243, Computer
Science Department, Courant Institute of Mathematical Sciences, New
York University.]
105411 A CLASS OF BRITTLE GRAPHS.
C. T. Hoang and N. Khouzam.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-192. 1986.]
025122 A COMPUTATIONAL MODEL OF REASONING FROM THE CLINICAL LITERATURE.
G. D. Rennels.
[Stanford University. Department of Computer Science.
STAN-CS-86-1122. June 1986. Thesis (Ph.D.).]
025123 BLACKBOARD SYSTEMS.
H. P. Nii.
[Stanford University. Department of Computer Science.
STAN-CS-86-1123. June 1986. Also issued as KSL-86-18, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025124 EFFICIENT MATCHING ALGORITHMS FOR THE SOAR/OPS5 PRODUCTION SYSTEM.
D. J. Scales.
[Stanford University. Department of Computer Science.
STAN-CS-86-1124. June 1986. Also issued as KSL-86-47, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025125 THE CAOS SYSTEM.
E. Schoen.
[Stanford University. Department of Computer Science.
STAN-CS-86-1125. March 1986. Also issued as KSL-86-22, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025126 CAREL: A VISIBLE DISTRIBUTED LISP.
B. Davies.
[Stanford University. Department of Computer Science.
STAN-CS-86-1126. March 1986. Also issued as KSL-86-14, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025127 NONCLAUSAL LOGIC PROGRAMMING.
Y. Malachi.
[Stanford University. Department of Computer Science.
STAN-CS-86-1127. March 1986. Thesis (Ph.D.).]
025128 PREEMPTABLE REMOTE EXECUTION FACILITIES FOR LOOSELY-COUPLED
DISTRIBUTED SYSTEMS.
M. M. Theimer.
[Stanford University. Department of Computer Science.
STAN-CS-86-1128. June 1986. Thesis (Ph.D.). Also issued as Technical
report 86-302, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025129 BETA OPERATIONS: EFFICIENT IMPLEMENTATION OF A PRIMITIVE PARALLEL
OPERATION.
E. R. Cohn and R. W. Haddad.
[Stanford University. Department of Computer Science.
STAN-CS-86-1129. August 1986.]
025130 ON DETECTING EDGES.
V. S. Nalwa and T. O. Binford.
[Stanford University. Department of Computer Science.
STAN-CS-86-1130. March 1986.]
025131 PROCESSOR RENAMING IN ASYNCHRONOUS ENVIRONMENTS.
A. Bar-Noy and D. Peleg.
[Stanford University. Department of Computer Science.
STAN-CS-86-1131. September 1986.]
105412 ON PROJECTED NEWTON BARRIER METHODS FOR LINEAR PROGRAMMING AND AN
EQUIVALENCE TO KARMARKAR'S PROJECTIVE METHOD.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-11R. May 1986.
Revised.]
105413 A THEORY ON EXTENDING ALGORITHMS FOR PARAMETRIC PROBLEMS.
B. C. Eaves and U. G. Rothblum.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 85-13. August 1985.]
105414 USER'S GUIDE FOR LSSOL (VERSION 1.0): A FORTRAN PACKAGE FOR
CONSTRAINED LINEAR LEAST-SQUARES AND CONVEX QUADRATIC PROGRAMMING.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-1. January 1986.]
105415 USER'S GUIDE FOR NPSOL (VERSION 4.0): A FORTRAN PACKAGE FOR NONLINEAR
PROGRAMMING.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-2. January 1986.
"Replaces [Systems Optimization Laboratory report] SOL 84-7."]
105416 A CONSTRUCTIVE CHARACTERIZATION OF Q SUBSCRIPT 0-MATRICES WITH
NONNEGATIVE PRINCIPAL MINORS.
M. Aganagic and R. W. Cottle.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-3. January 1986.]
105417 AN IMPLICIT ENUMERATION ALGORITHM WITH BINARY-VALUED CONSTRAINTS.
Y.-H. Wan.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-5. March 1986.
Thesis (Ph.D.).]
105418 SOME THEORETICAL PROPERTIES OF AN AUGMENTED LAGRANGIAN MERIT FUNCTION.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-6R. September 1986.]
105419 A NOTE ON NONLINEAR APPROACHES TO LINEAR PROGRAMMING.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-7. April 1986.]
105420 MAINTAINING LU FACTORS OF A GENERAL SPARSE MATRIX.
P. E. Gill et al.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-8. May 1986.]
105421 A SINGLE-PHASE METHOD FOR QUADRATIC PROGRAMMING.
S. C. Hoyle.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-9. April 1986.]
105422 AN ALGORITHM FOR RESCALING A MATRIX POSITIVE DEFINITE.
H. Hu.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-10. April 1986.]
105423 NEED TO DO PLANNING UNDER UNCERTAINTY AND THE POSSIBILITY OF USING
PARALLEL PROCESSORS FOR THIS PURPOSE.
G. B. Dantzig.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-11. April 1986.]
105424 AN ALGORITHM FOR POSITIVE DEFINITE LEAST SQUARE ESTIMATION OF
PARAMETERS.
H. Hu.
[Stanford University. Department of Operations Research. Systems
Optimization Laboratory. Technical report SOL 86-12. May 1986.]
105425 A PATTERN-MATCHING LABORATORY: PART I - AN ANIMATED DISPLAY OF STRING
PATTERN MATCHING.
K. Walker and R. E. Griswold.
[University of Arizona. Department of Computer Science. TR 86-1.
1986.]
105426 THE MLP SYSTEM USER'S MANUAL.
S. W. Manweiler, R. Hayes, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 86-4.
1986.]
105427 THE DESIGN OF THE SAGUARO DISTRIBUTED OPERATING SYSTEM.
G. R. Andrews et al.
[University of Arizona. Department of Computer Science. TR 86-5a.
1986.]
105428 AN OVERVIEW OF THE SR LANGUAGE AND IMPLEMENTATION.
G. R. Andrews et al.
[University of Arizona. Department of Computer Science. TR 86-6a.
1986.]
105429 DYNAMIC ENVIRONMENTS - A GENERALIZATION OF ICON STRING SCANNING.
K. Walker.
[University of Arizona. Department of Computer Science. TR 86-7.
1986.]
105430 OPTIMIZATION OF ARGUMENT EVALUATION ORDER.
C. W. Fraser and D. R. Hanson.
[University of Arizona. Department of Computer Science. TR 86-14.
1986.]
105431 A FILE REPLICATION MECHANISM FOR BERKELEY UNIX.
T. D. M. Purdin, R. D. Schlichting, and G. R. Andrews.
[University of Arizona. Department of Computer Science. TR 86-16.
1986.]
105432 DISTRIBUTIONAL SENSITIVITY OF FFI BIN-PACKING.
P. J. Downey.
[University of Arizona. Department of Computer Science. TR 86-17.
1986.]
105434 PRINTING COMMON WORDS.
D. R. Hanson.
[University of Arizona. Department of Computer Science. TR 86-18.
1986.]
105435 ROW REPLACEMENT ALGORITHMS FOR SCREEN EDITORS.
E. W. Myers and W. Miller.
[University of Arizona. Department of Computer Science. TR 86-19.
1986.]
105436 A GRAPHICAL SIMULATION SYSTEM FOR MANUFACTURING SYSTEMS.
B. Zamanzadeh.
[University of California, Los Angeles. Computer Science Department.
CSD-860036. 1986. Thesis (Ph.D.).]
105437 A METHODOLOGY, SPECIFICATION LANGUAGE AND AUTOMATED SUPPORT
ENVIRONMENT FOR COMPUTER-AIDED DESIGN SYSTEMS.
D. Worley.
[University of California, Los Angeles. Computer Science Department.
CSD-860038. 1986. Thesis (Ph.D.).]
105438 DISTRIBUTED REVISION OF BELIEF COMMITMENT IN MULTI-HYPOTHESIS
INTERPRETATION.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860045. 1986.]
105439 ON THE LOGIC OF REPRESENTING DEPENDENCIES BY GRAPHS.
J. Pearl and A. Paz.
[University of California, Los Angeles. Computer Science Department.
CSD-860047. 1986. Also issued as R-56, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105440 PROPERTIES OF GREEDILY OPTIMIZED ORDERING PROBLEMS.
R. Dechter and A. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-860048. 1986. Also issued as R-57, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105441 LEARNING WHILE SEARCHING IN CONSTRAINT-SATISFACTION PROBLEMS.
R. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-860049. 1986. Also issued as R-58, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105442 PARTITIONING AND ALLOCATION OF FUNCTIONAL PROGRAMS FOR DATA FLOW
PROCESSORS.
T. M. Ravi.
[University of California, Los Angeles. Computer Science Department.
CSD-860063. 1986. Thesis (M.S.).]
105443 A UNIPROCESSOR IMPLEMENTATION OF FP FUNCTIONAL LANGUAGE.
L. Alkalaj.
[University of California, Los Angeles. Computer Science Department.
CSD-860064. 1986. Thesis (M.S.).]
105444 WAVEFORM BOUNDS FOR LINEAR RC MESH CIRCUITS WITH LEAKAGE PATHS TO THE
GROUND.
P. K. Chan.
[University of California, Los Angeles. Computer Science Department.
CSD-860065. 1986.]
105445 MULTIPROCESSOR SYSTEM EVALUATION AND PROGRAMMING ENVIRONMENT.
M. D. Ercegovac.
[University of California, Los Angeles. Computer Science Department.
CSD-860066. 1986. Principal investigator: Prof. M.D. Ercegovac.
Associated faculty: Prof. T. Lang, Prof. R.M. Montz. Graduate
Research Assistants: P.K. Chan, T.M. Ravi.]
105446 THE WORLD'S SHORTEST PROLOG COMPILER.
C. Dolan and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-860068. 1986.]
105447 TLOG - YET ANOTHER LOGIC SYSTEM IN LISP?
W. Read and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-860070. 1986.]
105448 LEARNING PLANNING HEURISTICS THROUGH OBSERVATION.
C. Dolan and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-860071. 1986.]
105449 PRECEDENT-BASED LEGAL REASONING IN CONTRACT LAW.
S. R. Goldman, M. G. Dyer, and M. Flowers.
[University of California, Los Angeles. Computer Science Department.
CSD-860072. 1986.]
105450 ANALOGY RECOGNITION AND COMPREHENSION IN EDITORIALS.
S. E. August and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-860073. 1986.]
105451 ENCODING PLANNING KNOWLEDGE FOR RECOGNITION, CONSTRUCTION, AND
LEARNING.
C. Dolan and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-860074. 1986.]
105452 EXPLANATION AND GENERALIZATION BASED MEMORY.
M. J. Pazzani.
[University of California, Los Angeles. Computer Science Department.
CSD-860080. 1986.]
105453 TEACHING INFERENCING STRATEGIES.
R. G. Feifer, M. G. Dyer, and M. Flowers.
[University of California, Los Angeles. Computer Science Department.
CSD-860085. 1986.]
105454 UNDERSTANDING AND ADVICE GIVING IN AQUA.
A. E. Quilici, M. G. Dyer, and M. Flowers.
[University of California, Los Angeles. Computer Science Department.
CSD-860086. 1986.]
105455 EDISON: AN ENGINEERING DESIGN INVENTION SYSTEM OPERATING NAIVELY.
M. G. Dyer, M. Flowers, and J. Hodges.
[University of California, Los Angeles. Computer Science Department.
CSD-860087. 1986.]
105456 ASSIGNMENT OF FUNCTIONAL RESPONSIBILITY IN PERCEPTRONS.
R. A. Verstraete.
[University of California, Los Angeles. Computer Science Department.
CSD-860090. 1986. Thesis (Ph.D.).]
105457 ADAPTIVE SELF-ORGANIZING LOGIC NETWORKS.
T. R. Martinez.
[University of California, Los Angeles. Computer Science Department.
CSD-860093. 1986. Thesis (Ph.D.).]
105458 A VERY LARGE SCALE INTEGRATION IMPLEMENTATION OF AN ON-LINE
ARITHMETIC UNIT.
D. M. Tullsen.
[University of California, Los Angeles. Computer Science Department.
CSD-860094. 1986. Thesis (M.S.).]
105459 LEARNING LINK PROBABILITIES IN CAUSAL TREES.
I. Roizen and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860095. 1986.]
105460 COMPREHENSION DRIVEN GENERATION OF META-TECHNICAL UTTERANCES IN MATH
TUTORING.
I. Zukerman and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860096. 1986.]
105461 RELEVANCE BASED PROPAGATION IN BAYESIAN NETWORKS.
J. A. Pinto.
[University of California, Los Angeles. Computer Science Department.
CSD-860098. 1986. Thesis (M.S.).]
105462 JEFFREY'S RULE AND THE PROBLEM OF AUTONOMOUS INFERENCE AGENTS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860099. 1986. Also issued as R-62, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105463 A MECHANIZED PROOF OF CORRECTNESS OF A SIMPLE COUNTER.
A. Cohn and M. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 94.
1986.]
105464 EVENT STRUCTURES.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 95.
1986. "Lecture notes for the Advanced Course on Petri Nets...July
11th, 1986."]
105465 PERFORMANCE EVALUATION OF PACKET SWITCHED REDUNDANT PATH NETWORKS.
K. Padmanabhan and D. H. Lawrie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 455. 1984.]
105466 THE PARAFRASE DISTRIBUTION TAPE AND ITS DOCUMENTATION.
H. Husmann.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 500. 1986. Also issued as
PR-85-1.]
105467 AN OVERVIEW OF THE STRUCTURE OF PARAFRASE.
W. Harrison.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 501. 1985. Also issued as
PR-85-2.]
105468 PARAFRASE PROGRAMMING CONVENTIONS AND PL/I LANGUAGE EXTENSIONS.
B. Leasure.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 502. 1985. Also issued as
PR-85-3.]
105469 BRIEF DESCRIPTION OF THE DATA STRUCTURES USED BY PARAFRASE.
B. Leasure.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 503. 1985. Also issued as
PR-85-4.]
105470 THE PARAFRASE PROJECT'S FORTRAN ANALYZER MAJOR MODULE DOCUMENTATION.
B. Leasure.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 504. 1985. Also issued as
PR-85-5.]
105471 UNDERSTANDING PARAFRASE OUTPUT LISTINGS.
M. Wolfe, B. Leasure, and J. Davies.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 505. 1985. Also issued as
PR-85-6.]
105472 PARAFRASE PUBLICATIONS AND THESES.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 506. 1985. Also issued as
PR-85-7.]
105473 SOME NOTES ON ARRAY DATA DEPENDENCE TESTING IN PARAFRASE.
H. Husmann.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 510. 1986. Also issued as
PR-85-8.]
105474 NON-LINEAR RECURRENCES AND EISPACK.
T. A. McDaniel.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 511. 1985.]
105475 A TECHNIQUE FOR REDUCING DATA SYNCHRONIZATION IN MULTIPROCESSED LOOPS.
Z. Li.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 521. 1985. Thesis (M.S.).]
105476 DATA MOVEMENT IN DOALL LOOPS.
D. T. Jackson.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 524. 1985. Thesis (M.S.).]
105477 CONVERSION OF PARAFRASE OUTPUT TO ALLIANT'S CONCURRENT FORTRAN.
L. M. Pawlowski.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 532. 1985. Thesis (M.S.).]
105478 INTERPROCEDURAL ANALYSIS FOR PROGRAM RESTRUCTURING WITH PARAFRASE.
R. Triolet.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 538. 1985.]
105479 EXPERIMENTAL RESULTS FOR VECTOR PROCESSING ON THE ALLIANT FX/8.
W. Abu-Sufah and A. D. Malony.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 539. 1986.]
105480 EMULATING MULTITASKING SYSTEM CALLS FOR A MULTICLUSTER MACHINE.
A. Kolchinsky.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 560. 1986. Thesis (M.S.).]
105481 COMPILING LISP FOR EVALUATION ON A TIGHTLY COUPLED MULTIPROCESSOR.
W. L. Harrison III.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 565. 1986.]
105482 A DIRECT PARALLELIZATION OF CALL STATEMENTS - A REVIEW.
U. Banerjee.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 576. 1986.]
105483 CEDAR PERFORMANCE MEASUREMENTS.
A. D. Malony.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 579. 1986.]
105484 CEDAR PERFORMANCE EVALUATION TOOLS: A STATUS REPORT.
A. D. Malony.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 582. 1986.]
105485 AUTOMATIC GENERATION OF SYNCHRONIZATION INSTRUCTIONS FOR PARALLEL
PROCESSORS.
S. P. Midkiff.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 588. 1986. Thesis (M.S.).]
105486 THE STRUCTURED MEMORY ACCESS ARCHITECTURE: AN IMPLEMENTATION AND
PERFORMANCE-EVALUATION.
J. Cyr.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 597. 1986. Thesis (M.S.).]
105487 CEDAR: A LARGE SCALE MULTIPROCESSOR.
D. Gajski et al.
[University of Illinois, Urbana-Champaign. Laboratory for Advanced
Supercomputers. Cedar Project. Cedar document 6. 1983.]
105488 FAST PURE LISP EVALUATION.
D. Kuck.
[University of Illinois, Urbana-Champaign. Laboratory for Advanced
Supercomputers. Cedar Project. Cedar document 13. 1983. Preliminary
version: March 6, 1983.]
105489 FAULT TOLERANT DESIGN AND RELIABILITY CONSIDERATIONS FOR THE
INTERCONNECTION NETWORK IN CEDAR.
K. Padmanabhan.
[University of Illinois, Urbana-Champaign. Laboratory for Advanced
Supercomputers. Cedar Project. Cedar document 37. 1984.]
105490 WRINGER - A CEDAR MACHINE EMULATION PROGRAM.
S. Abraham and C. P. Kruskal.
[University of Illinois, Urbana-Champaign. Laboratory for Advanced
Supercomputers. Cedar Project. Cedar document 44. 1984.]
105491 CONSTRUCTION OF A LARGE-SCALE MULTIPROCESSOR.
D. Kuck et al.
[University of Illinois, Urbana-Champaign. Office for Supercomputing
Research and Development. Cedar Project. Cedar document 45. 1984.]
105492 FORM PERCEPTION USING TRANSFORMATION NETWORKS: POLYHEDRA.
D. H. Ballard.
[University of Rochester. Department of Computer Science. TR 148.
1986.]
105493 A NOTE ON LINEAR SEARCH HEURISTICS.
E. Maekinen.
[University of Tampere. Department of Mathematical Sciences. C45.
1986.]
105494 EGS: A TRANSFORMATIONAL APPROACH TO AUTOMATIC EXAMPLE GENERATION.
M. W. Kim.
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. Technical report 46. 1985.]
105495 INTEGRATING DECISION PROCEDURES INTO HEURISTIC THEOREM PROVERS: A
CASE STUDY OF LINEAR ARITHMETIC.
R. S. Boyer and J. S. Moore.
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. ICSCA-CMP-44. 1985.]
105496 PROVING GYPSY PROGRAMS.
R. M. Cohen.
[University of Texas, Austin. Institute for Computing Science and
Computer Applications. Technical report 51. 1986.]
105497 A SCHEDULING ALGORITHM FOR THE PIPELINED IMAGE-PROCESSING ENGINE.
C. V. Stewart and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 664. 1986.]
105498 COMPARATIVE TIMINGS FOR A NEURON RECOGNITION PROGRAM ON SERIAL AND
PYRAMID COMPUTERS.
Z.-N. Li and L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 665. 1986.]
105499 AUTOMATIC GENERATION OF USER INTERFACES.
P. Dewan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 666. 1986. Thesis (Ph.D.).]
105500 HARDWARE SUPPORT FOR INTERPROCESS COMMUNICATION.
U. Ramachandran.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 667. 1986. Thesis (Ph.D.).]
105501 IMAGE PROCESSING ALGORITHMS FOR THE PIPELINED IMAGE-PROCESSING ENGINE.
G. Verghese, S. Mehta, and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 668. 1986.]
105502 A COMPARISON OF PERFORMANCE PETRI NETS AND QUEUEING NETWORK MODELS.
M. Vernon, J. Zahorjan, and E. D. Lazowska.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 669. 1986.]
105503 AUTOMATIC GENERATION OF COMMUNICATION PROTOCOLS.
B. S. Rosenburg.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 670. 1986. Thesis (Ph.D.).]
VOL. 9, NO. 3 03/30/87
105504 GENERALIZED FISHEYE VIEWS.
G. W. Furnas.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-103. 1986.]
105505 SELF-ORGANIZING SEQUENTIAL SEARCH AND HILBERT'S INEQUALITIES.
F. R. K. Chung, D. J. Hajela, and P. D. Seymour.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-109. 1986.]
105506 MINIMUM-WEIGHT TWO-CONNECTED SPANNING NETWORKS.
C. L. Monma, B. S. Munson, and W. R. Pulleyblank.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-115. 1986.]
105507 INTERSECTION GRAPHS OF PATHS IN A TREE.
C. L. Monma and V. K. Wei.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-118. 1986.]
105508 ON THE WIDTHS OF FINITE DISTRIBUTIVE LATTICES.
J. Kahn and M. Saks.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-119. 1986.]
105509 HELLY TYPE THEOREMS FOR FINITE AUTOMATA.
M. Saks and R. Statman.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-120. 1986.]
105510 LARGEST INDUCED SUBORDERS SATISFYING THE CHAIN CONDITION.
M. Saks, N. Linial, and P. Shor.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-121. 1986.]
105511 THE SMALLEST N-UNIFORM HYPERGRAPH WITH POSITIVE DISCREPANCY.
N. Alon et al.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-122. 1986.]
105512 GRAPH MINORS - A SURVEY.
N. Robertson and P. D. Seymour.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-126. 1986.]
105513 SOME RESULTS ON THE PANEX PUZZLE.
M. Manasse, D. Sleator, and V. K. Wei.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-129. 1986.]
105514 A LOCALLY ADAPTIVE DATA COMPRESSION SCHEME.
J. L. Bentley et al.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-130. 1985.]
105515 USING SIMULATED ANNEALING TO DESIGN GOOD CODES.
A. El Gamal et al.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-131. 1986.]
105516 ZIPPER CMOS.
C. M. Lee and E. W. Szeto.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-136. 1986.]
105517 COMPACTED CHANNEL ROUTING.
D. N. Deutsch.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-143. 1985. Also
issued as TM-ARH-000-803, Bell Communications Research, Inc.]
105518 SERVER SHARING WITH A LIMITED NUMBER OF SERVICE POSITIONS AND
SYMMETRIC QUEUES.
B. Avi-Itzhak and S. Halfin.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-144. 1986.]
105519 PERFORMANCE OF AN ALGORITHM FOR COMPUTING THE STATIONARY DISTRIBUTION
OF A MARKOV CHAIN.
D. P. Heyman.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-147. 1986.]
105520 THE EFFECTS OF RANDOM MESSAGE SIZES ON THE PERFORMANCE OF THE CSMA/CD
PROTOCOL.
D. P. Heyman.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-149. 1984. Also
issued as TM-ARH-000-312, Bell Communications Research, Inc.]
105521 DELAYS IN QUEUES, PROPERTIES AND APPROXIMATIONS.
S. Halfin.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-155. 1986.]
105522 THE SHORTEST QUEUE PROBLEM.
S. Halfin.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-156. 1986.]
105523 ON THE SINGLE SERVER QUEUE WITH INDEPENDENT "M/G" AND "D/G" INPUT
STREAMS.
T. J. Ott.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-157. 1985. Also
issued as TM-ARH-000-983, Bell Communications Research, Inc.]
105524 THE USE OF LEVEL CROSSING ANALYSIS TO RELATE CUSTOMER AND TIME
AVERAGES.
D. P. Heyman.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-159. 1985. Also
issued as TM-ARH-001-207, Bell Communications Research, Inc.]
105525 THE GENERATION OF RANDOM, BINARY UNORDERED TREES.
G. W. Furnas.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-171. 1986.]
105526 SEND-AND-SPLIT METHOD FOR MINIMUM-CONCAVE-COST NETWORK FLOWS.
C. L. Monma, R. E. Erickson, and A. F. Veinott Jr..
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-172. 1986.]
105527 SIMPLE INEQUALITIES FOR THE D/G/1 QUEUE.
T. J. Ott.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-177. 1986.]
105528 CLOCKED OPERATING SYSTEMS, QUEUES, AND POWER SERIES.
T. J. Ott.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-178. 1986.]
105529 THE SINGLE SERVER QUEUE WITH INDEPENDENT "GI/G" AND "M/G" INPUT
STREAMS.
T. J. Ott.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-179. 1986.]
105530 ON THE STATIONARY WAITING TIME DISTRIBUTION IN THE GI/G/1 QUEUE, I:
TRANSFORM METHODS AND ALMOST PHASE TYPE DISTRIBUTIONS.
T. J. Ott.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-188. 1986.]
105531 TRANSPARENT INTERCONNECTION OF BROADCAST NETWORKS.
W. D. Sincoskie.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-190. 1986.]
105532 WAITING FOR GODOT: A PROCESS SCHEDULING PROBLEM.
M. L. Honig.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-193. 1986.]
105533 REDUCED COMPLEXITY SEARCHING FOR MULTI-LEVEL TRELLIS CODES.
M. L. Honig.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-194. 1986.]
105534 OPTIMIZATION OF MULTI-LEVEL TRELLIS CODES USING AN ERROR PROBABILITY
CRITERION.
M. L. Honig.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-195. 1986.]
105535 COMPLEXITY OF COORDINATION: THE RANK OF BOOLEAN FUNCTIONS.
B. Gopinath and V. K. Wei.
[Bell Communications Research, Inc. Mathematical, Communications, and
Computer Sciences Research Laboratory. Report no. 86-202. 1986.]
105536 INFEASIBLE COMPUTATION: AN INTRODUCTION TO NP-COMPLETENESS.
E. A. Lamagna.
[Brown University. Computer Science Department. Technical report
CS-86-08. 1986. Revised: October 1986.]
105537 FUSION: A FUNCTIONAL SIMULATOR FOR HIERARCHICALLY-STRUCTURED CIRCUITS.
C. L. Harkness and G. M. Baudet.
[Brown University. Computer Science Department. Technical report
CS-86-09. 1986.]
105538 MAIL SYSTEM INTERFACE ISSUES WITH A UNIX-MACINTOSH IMPLEMENTATION.
J. J. Bowe.
[Brown University. Computer Science Department. Technical report
CS-86-10. 1986. Thesis (M.S.).]
105539 THE OBJECT-ORIENTED CLASSIFICATION PARADIGM.
P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-86-11. 1986. Draft: July 1986.]
105540 RANDOM SAMPLING REVISITED.
J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-86-12. 1986.]
105541 TIME AND TENSE IN ENGLISH.
M. P. Harper.
[Brown University. Computer Science Department. Technical report
CS-86-14. 1986.]
105542 LARGE-SCALE TEMPORAL DATA BASES FOR PLANNING IN COMPLEX DOMAINS.
T. L. Dean.
[Brown University. Computer Science Department. Technical report
CS-86-15. 1986.]
105543 VISUAL LANGUAGES AND THE GARDEN SYSTEM.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-86-16. 1986.]
105544 AN OBJECT-ORIENTED FRAMEWORK FOR GRAPHICAL PROGRAMMING.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-86-17. 1986.]
105545 GARDEN TOOLS: SUPPORT FOR GRAPHICAL PROGRAMMING.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-86-18. 1986.]
105546 DISPLAYING PROGRAM AND DATA STRUCTURES.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-86-19. 1986.]
105547 A CONCEPTUAL PROGRAMMING ENVIRONMENT.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-86-20. 1986. Draft paper: August 1986.]
105548 COMPILER ASPECTS OF AN ENVIRONMENT FOR PROGRAMMING BY DEMONSTRATION.
R. V. Rubin, S. P. Reiss, and E. J. Golin.
[Brown University. Computer Science Department. Technical report
CS-86-21. 1986.]
105549 BOUNDS ON THE PROPAGATION OF SELECTION INTO LOGIC PROGRAMS.
F. Bancilhon et al.
[Brown University. Computer Science Department. Technical report
CS-86-22. 1986.]
105550 LOGIC PROGRAMMING AND PARALLEL COMPLEXITY.
P. C. Kanellakis.
[Brown University. Computer Science Department. Technical report
CS-86-23. 1986.]
105551 THE ROLE OF DATABASES IN KNOWLEDGE-BASED SYSTEMS.
M. S. Fox and J. McDermott.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-3. 1986.]
105552 A COMPARISON OF A MANUAL AND COMPUTER-INTEGRATED PRODUCTION PROCESS
IN TERMS OF PROCESS CONTROL DECISION-MAKING.
S. M. Miller and S. R. Bereiter.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-6. 1986.]
105553 AN O(N SUPERSCRIPT 2) SHORTEST PATH ALGORITHM FOR A NON-ROTATING
CONVEX BODY.
J. Hershberger and L. J. Guibas.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 14. 1986.]
105554 KNOWLEDGE BASED TECHNIQUES FOR ASSEMBLY LINE SEQUENCING.
U. Mukhopadhyay and J. D. Joyce.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5622. 1986. "Extended
abstract."]
105555 MULTIPROCESSING THE SIEVE OF ERATOSTHENES.
S. H. Bokhari.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-41. 1986.]
105556 FOURIER ANALYSIS OF THE SOR ITERATION.
R. J. LeVeque and L. N. Trefethen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-63. 1986.]
105557 PARALLEL SCHEDULING OF RECURSIVELY DEFINED ARRAYS.
T. J. Myers and M. B. Gokhale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-66. 1986.]
105558 PS: A NONPROCEDURAL LANGUAGE WITH DATA TYPES AND MODULES.
M. B. Gokhale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-67. 1986.]
105559 TIME DECAY OF SOLUTIONS TO THE CAUCHY PROBLEM FOR TIME-DEPENDENT
SCHROEDINGER-HARTREE EQUATIONS.
N. Hayashi and T. Ozawa.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-550. 1986.]
105560 REMARKS ON THE SPACE-TIME BEHAVIOR OF SCATTERING SOLUTIONS TO THE
SCHROEDINGER EQUATIONS.
T. Ozawa.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-551. 1986.]
105561 ON THE GLOBAL EXISTENCE OF REAL ANALYTIC SOLUTIONS AND HYPERFUNCTION
SOLUTIONS OF LINEAR DIFFERENTIAL EQUATIONS.
T. Kawai.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-555. 1986.]
105562 ON A CLOSED RANGE PROPERTY OF A LINEAR DIFFERENTIAL OPERATOR.
T. Kawai and Y. Takei.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-557. 1986.]
105563 ESSAYS ON HIGH TECHNOLOGY, EDUCATION AND SOCIETY.
C. K. Yuen.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication PPA8/86. 1986.]
105564 A GRAPH MODEL FOR CHECKING CONSISTENCY AND COMPLETENESS OF PRODUCTION
RULES.
E. L. Lim, W. W. Tsang, and J. McCallum.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRB8/86. 1986.]
105565 CLUSTERING ALGORITHMS BASED ON FUZZY MEASURE.
S. Wierzchon.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 570. 1985.]
105566 SEMANTICS OF QUERY LANGUAGES FOR THE ENTITY-RELATIONSHIP MODEL.
K. Subieta and M. Missala.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 572. 1986.]
105567 THE ALGORITHMS FOR DECISION MAKING IN FUZZY ENVIRONMENT.
S. Wierzchon.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 573. 1985.]
105568 COMMON KNOWLEDGE, SUBJECTIVE KNOWLEDGE, AND BAYESIAN PLAYERS IN
NONCOOPERATIVE GAMES.
S. Ambroszkiewicz.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 574. 1986.]
105569 ON GAMMA-ALMOST FIXED POINT THEOREMS.
A. Idzik.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 576. 1986.]
105570 RELATIONAL CALCULUS AND DATA DEPENDENCIES.
W. Buszkowski and E. Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 578. 1986.]
105571 HIGH-SPEED EXECUTION OF THE MULTIPLICATION AND ADDITION SEQUENCES.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 579. 1986.]
105572 SPOT FUNCTIONS AND PERIPHERALS: KREIN-MILMAN TYPE THEOREMS IN
ABSTRACT SETTING.
A. Wieczorek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 580. 1986.]
105573 TWO COMPLETENESS THEOREMS IN THE LOGIC FOR DATA ANALYSIS.
G. Gargov.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 581. 1986.]
105574 SEMANTIC CONSIDERATIONS ON RELEVANCE.
E. Orlowska and P. Weingartner.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 582. 1986.]
105575 STORED QUERIES - A DATA STRUCTURE FOR QUERY OPTIMIZATION.
W. Rzeczkowski and K. Subieta.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 583. 1986.]
105576 ROBUST DICTIONARY LOOKUP USING ASSOCIATIVE NETWORKS.
O. Ekeberg.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8520. 1985.]
105577 ANALYTICAL AND NUMERICAL STUDIES OF THE CONVERGENCE TO STEADY STATE
OF SOLUTIONS OF TWO MODEL PROBLEMS OF FLUID DYNAMICS.
G. Kreiss.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8603. 1986. "This thesis
consists of an introduction and...three papers (...Appendix A-C)."]
105578 FIRST-ORDER UNIFICATION IN COMBINATIONS OF EQUATIONAL THEORIES.
E. Tiden.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8604. 1986. Thesis (Ph.D.).
This report consists of an introduction and two papers (Appendices
A-B).]
105579 INCREMENTAL DATA FLOW ANALYSIS ALGORITHMS.
B. G. Ryder and M. C. Paull.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-131. 1986. Revised: October 1986.]
105580 ONLY THE COMPLEMENTS OF RECURSIVELY ENUMERABLE SETS CAN BE RELIABLY
IDENTIFIED IN THE LIMIT.
A. Van der Mude.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-168. 1986.]
105581 WAVE PROPAGATION ANALYSIS OF DIFFERENCE SCHEMES FOR HYPERBOLIC
EQUATIONS: A REVIEW.
R. Vichnevetsky.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-176. 1986. Revised: July 1986.]
105582 P-UNIFORM CIRCUIT COMPLEXITY.
E. W. Allender.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-198. 1986.]
105583 INTELLIGENT QUERY ANSWERING IN RULE BASED SYSTEMS.
T. Imielinski.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-200. 1986.]
105584 SELECTING SLOPES.
R. Cole, J. Salowe, and W. L. Steiger.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-203. 1986.]
105585 OPTIMAL PARALLEL SELECTION HAS COMPLEXITY O(LOGLOG N).
M. Ajtai et al.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-204. 1986.]
105586 REFINEMENT OF EXPERT SYSTEM KNOWLEDGE BASES: A METALINGUISTIC
FRAMEWORK FOR HEURISTIC ANALYSIS.
A. Ginsberg.
[Rutgers. Laboratory for Computer Science Research. Technical report
CBM-TR-147. 1986. Thesis (Ph.D).]
105587 A PROPOSAL FOR AUTOMATING SHIFTS OF REPRESENTATION.
P. J. Riddle.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-84. 1986.]
105588 FIXED POINT SEMANTICS AND TABLEAU PROOF PROCEDURES FOR A CLAUSAL
INTUITIONISTIC LOGIC.
L. T. McCarty.
[Rutgers. Laboratory for Computer Science Research. Technical report
LRP-TR-18. 1986.]
105589 PERMISSIONS AND OBLIGATIONS: AN INFORMAL INTRODUCTION.
L. T. McCarty.
[Rutgers. Laboratory for Computer Science Research. Technical report
LRP-TR-19. 1986.]
105590 OR-PARALLEL EXECUTION OF LOGIC PROGRAMS USING RISCY PROCESSING NODES.
P. Biswas and S.-C. Su.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 85-CSE-21. 1985.]
105591 A HIGHLY PARALLEL ARCHITECTURE FOR SYNTACTIC PATTERN RECOGNITION: A
PROPOSAL.
P. Biswas.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 86-CSE-8. 1986.]
105592 A STREAM BASED DATA DRIVEN MODEL FOR PARALLEL EXECUTION OF LOGIC
PROGRAMS.
P. Biswas and C. C. Tseng.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 86-CSE-19. 1986.]
025132 OPTIMIZING DATALOG PROGRAMS.
Y. Sagiv.
[Stanford University. Department of Computer Science.
STAN-CS-86-1132. March 1986.]
025133 DISTRIBUTED, REPLICATED COMPUTER BULLETIN BOARD SERVICE.
J. L. Edighoffer.
[Stanford University. Department of Computer Science.
STAN-CS-86-1133. June 1986. Thesis (Ph.D.). Also issued as Technical
report 86-311, Computer Systems Laboratory, Stanford Electronics
Laboratories, Stanford University.]
025134 UIO: A UNIFORM I/O SYSTEM INTERFACE FOR DISTRIBUTED SYSTEMS.
D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-86-1134. November 1986.]
025135 SEQUENTIALIZATION OF LOGIC PROGRAMS.
R. Treitel.
[Stanford University. Department of Computer Science.
STAN-CS-86-1135. November 1986. Thesis (Ph.D.).]
025136 AN EXPERIMENT IN KNOWLEDGE-BASED SIGNAL UNDERSTANDING USING PARALLEL
ARCHITECTURES.
H. D. Brown, E. Schoen, and B. A. Delagi.
[Stanford University. Department of Computer Science.
STAN-CS-86-1136. October 1986. Also issued as KSL-86-69, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
105593 FULL-COMMUTATION AND FAIR-TERMINATION IN EQUATIONAL (AND COMBINED)
TERM-REWRITING SYSTEMS.
S. Porat and N. Francez.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 393. 1986.]
105594 DECIDABILITY QUESTIONS FOR FINITE PROBABILISTIC PROPOSITIONAL DYNAMIC
LOGIC.
M. L. Tiomkin and J. A. Makowsky.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 394. 1986. Revised version: July 1985.]
105595 ON THE EQUIVALENCE OF WEAK SECOND ORDER AND NONSTANDARD TIME
SEMANTICS FOR VARIOUS PROGRAM VERIFICATION SYSTEMS.
J. A. Makowsky and I. Sain.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 395. 1986.]
105596 VECTOR SETS FOR EXHAUSTIVE TESTING OF LOGIC CIRCUITS.
G. Seroussi and N. H. Bshouty.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 396. 1986.]
105597 FAIR ALGORITHMS FOR MAXIMAL LINK ACTIVATION IN MULTI-HOP RADIO
NETWORKS.
I. Chlamtac and A. Lerner.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 397A. 1986.]
105598 DISTRIBUTED NODES ORGANIZATION ALGORITHM FOR CHANNEL ACCESS IN A
MULTIPLE-HOP DYNAMIC RADIO NETWORK.
I. Chlamtac and S. Pinter.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 397B. 1986.]
105599 ON PROVING PRIVACY IN MULTIUSER SYSTEMS.
Y. Yacoby.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 398. 1986.]
105600 SOLVING QUERIES BY TREE PROJECTIONS.
Y. Sagiv and O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 399. 1986.]
105601 ALGORITHM FOR DISTRIBUTED SPANNING TREE CONSTRUCTION IN DYNAMIC
NETWORKS.
E. Korach and M. Markowitz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 401. 1986.]
105602 A METHOD FOR LINEARLY SOLVING COMBINATORIAL OPTIMIZATION AND
RELIABILITY PROBLEMS ON SERIES PARALLEL DISTRIBUTED NETWORK.
E. Korach, S. Onn, and D. Rotem.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 402. 1986. "Extended abstract."]
105603 TEMPORARY STABILITY IN PARALLEL PROGRAMS.
S. Katz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 403. 1986.]
105604 THREE TREE CONNECTIVITY.
A. Zehavi and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 406. 1986.]
105605 THE NUMBER OF BUFFERS REQUIRED FOR SEQUENTIAL PROCESSING OF A DISK
FILE.
A. Itai and Y. Raz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 407. 1986.]
105606 AN EXTENDED IMPOSSIBILITY RESULT FOR ASYNCHRONOUS COMPLETE NETWORKS.
S. Moran and Y. Wolfstahl.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 408. 1986.]
105607 FAULT TOLERANT LEADER ELECTION WITH TERMINATION DETECTION, IN GENERAL
UNDIRECTED NETWORKS.
R. Bar-Yehuda and S. Kutten.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 409. 1986. "Extended abstract."]
105608 THE VIRTUES OF LOCKING BY SYMBOLIC NAMES.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 416. 1986.]
105609 DECIDABILITY AND EXPRESSIVENESS ASPECTS OF LOGIC QUERIES.
O. Shmueli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 420. 1986.]
105610 GENERATING EXPERT RULES FROM EXAMPLES IN PROLOG.
B. Arbab and D. Michie.
[Turing Institute. TIRM-85-010. 1985.]
105611 AN IMPLEMENTATION OF THE HOUGH TRANSFORM USING A LINEAR ARRAY
PROCESSOR IN CONJUNCTION WITH A PDP/11 MICROPROCESSOR.
V. F. Leavers and J. F. Boyce.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 74/86. 1986.]
105612 FLOATING POINT INTERVAL ARITHMETIC FOR VALIDATION.
B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 76/86. 1986.]
105613 NICHTDETERMINISTISCHE REDUKTIONEN UND LOGARITHMISCHE HIERARCHIEN.
K.-J. Lange.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 119. 1986.]
105614 ON THE CONCURRENT BEHAVIOUR OF PETRI NETS.
A. Kiehn.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 120. 1986.]
105615 UBER ERKENNBARE UND RATIONALE MENGEN IN FREIEN PARTIELL KOMMUTATIVEN
MONOIDEN.
W. Fischer.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 121. 1986.]
105616 REFORMULATION AND APPROXIMATIVE SOLUTION OF THE CAMERA CALIBRATION
PROBLEM.
L. Paquette, T. M. Caelli, and W. A. Davis.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-05. 1986.]
105617 PARSING SCALE-SPACE AND SPATIAL STABILITY ANALYSIS.
W. F. Bischof and T. M. Caelli.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-06. 1986.]
105618 AN AI APPLICATION FOR PROCESS REGULATION AND SERVO CONTROL.
N. R. Sripada, G. Fisher, and A. J. Morris.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 86-07. 1986.]
105619 GUIDING CONSTRUCTIVE INDUCTION FOR INCREMENTAL CONCEPT LEARNING FROM
EXAMPLES.
L. Watanabe and R. Elio.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-01. 1987.]
105620 A ONE-SIDED JACOBI ALGORITHM FOR COMPUTING THE SINGULAR VALUE
DECOMPOSITION ON A VECTOR COMPUTER.
P. P. M. de Rijk.
[University of Amsterdam. Department of Mathmatics. Report no. 86-21.
1986.]
105621 MODELS AND LOGIC OF MOS CIRCUITS.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 96.
1986. "Lectures for the Marktoberdorf Summerschool, August 1986."]
105622 A STUDY ON ABSTRACT INTERPRETATION AND "VALIDATING MICROCODE
ALGEBRAICALLY."
A. Mycroft.
[University of Cambridge. Computer Laboratory. Technical report 97.
1986.]
105623 POWER-DOMAINS, MODALITIES AND THE VIETORIS MONAD.
E. Robinson.
[University of Cambridge. Computer Laboratory. Technical report 98.
1986.]
105624 AN OVERVIEW OF THE POLY PROGRAMMING LANGUAGE.
D. C. J. Matthews.
[University of Cambridge. Computer Laboratory. Technical report 99.
1986.]
105625 PROVING A COMPUTER CORRECT IN HIGHER ORDER LOGIC.
J. Joyce, G. Birtwistle, and M. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 100.
1986.]
105626 A JOYCE IMPLEMENTATION.
P. B. Hansen.
[University of Copenhagen. Computer Science Department. Report no.
86/9. 1986.]
105627 THE JOYCE LANGUAGE REPORT.
P. B. Hansen.
[University of Copenhagen. Computer Science Department. Report no.
86/10. 1986.]
105628 THE POSTGRES PAPERS.
M. Stonebraker and L. A. Rowe.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. 1986. "This collection of papers describes
the design of the POSTGRES data base management system." Edited by
Michael Stonebraker and Lawrence A. Rowe.]
105628 THE DESIGN OF POSTGRES.
M. Stonebraker and L. A. Rowe.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. n.d. One of four POSTGRES papers issued
together as University of California Electronics Research Laboratory
memorandum no. UCB/ERL M86/85.]
105628 OBJECT MANAGEMENT IN POSTGRES USING PROCEDURES.
M. Stonebraker.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. n.d. One of four POSTGRES papers issued
together as University of California Electronics Research Laboratory
memorandum no. UCB/ERL M86/85.]
105628 THE DESIGN OF THE POSTGRES RULES SYSTEM.
M. Stonebraker, E. Hanson, and C.-H. Hong.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. n.d. One of four POSTGRES papers issued
together as University of California Electronics Research Laboratory
memorandum no. UCB/ERL M86/85.]
105628 A SHARED OBJECT HIERARCHY.
L. A. Rowe.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. n.d. One of four POSTGRES papers issued
together as University of California Electronics Research Laboratory
memorandum no. UCB/ERL M86/85.]
105629 HEURISTICS FOR ANALOGY MATCHING.
S. Owen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 280. 1986.]
105630 AN EDINBURGH PROLOG BLACKBOARD SHELL.
J. Jones and M. Millington.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 281. 1986.]
105631 ANALYTIC GOAL REGRESSION: PROBLEMS, SOLUTIONS AND ENHANCEMENTS.
R. Boswell.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 282. 1986.]
105632 A PROPOSED PROLOG STORY.
A. Bundy et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 283. 1986.]
105633 THE ALVEY LARGE SCALE DEMONSTRATOR PROJECT - "DESIGN TO PRODUCT."
T. Smithers.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 284. 1985.]
105634 IDENTITY INDEPENDENT OBJECT SEGMENTATION IN 2 1/2 D SKETCH DATA.
R. B. Fisher.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 285. 1986.]
105635 ENGINEERING DESIGN SUPPORT SYSTEMS.
R. Popplestone et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 286. 1986.]
105636 CRITERIA FOR CHOOSING REPRESENTATION LANGUAGES AND CONTROL REGIMES
FOR EXPERT SYSTEMS.
H. Reichgelt and F. van Harmelen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 287. 1986.]
105637 RULE-BASED SURFACE CLASSIFICATION USING SPECULAR SONAR REFLECTIONS.
J. C. T. Hallam, J. B. H. Kwa, and J. A. M. Howe.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 288. 1986.]
105638 A PARSER FOR GENERALISED PHASE-STRUCTURE GRAMMARS.
J. D. Phillips and H. S. Thompson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 289. 1986.]
105639 A FORMAL MODEL OF SYSTEMIC GRAMMAR.
T. Patten and G. Ritchie.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 290. 1986.]
105640 SOME ARCHITECTURAL IMPLICATIONS OF THE USE OF SENSORS.
C. A. Malcolm and A. P. Ambler.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 291. 1986.]
105641 APPROXIMATING THE SQUARE ROOT OF THE INVERSE OF A MATRIX.
B. Philippe.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 508. 1985.]
105642 FAULT-DIAGNOSIS IN A MULTIPLE-PATH INTERCONNECTION NETWORK.
N.-F. Tzeng, P.-C. Yew, and C.-Q. Zhu.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 518. 1985.]
105643 A FULLY PARALLEL ALGORITHM FOR THE SYMMETRIC EIGENVALUE PROBLEM.
J. J. Dongarra and D. C. Sorensen.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 542. 1986.]
105644 RESTRUCTURING NESTED LOOPS ON THE ALLIANT CEDAR CLUSTER: A CASE STUDY
OF GAUSSIAN ELIMINATION OF BANDED MATRICES.
D. Gannon.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 543. 1986.]
105645 PARALLEL BLOCK SCHEMES FOR LARGE SCALE LEAST SQUARES COMPUTATIONS.
G. H. Golub, R. J. Plemmons, and A. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 574. 1986.]
105646 COMPILER MEMORY MANAGEMENT AND COMPOUND FUNCTION DEFINITION FOR
MULTIPROCESSORS.
H. Husmann.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 575. 1986. Thesis (Ph.D.).]
105647 SUPERCOMPUTING TRADEOFFS AND THE CEDAR SYSTEM.
E. S. Davidson et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 577. 1986.]
105648 POLYNOMIAL PRECONDITIONING OF SYMMETRIC INDEFINITE SYSTEMS.
N. R. Nandakumar.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 580. 1986.]
105649 PARALLEL NUMERICAL ALGORITHMS ON THE CEDAR SYSTEM.
M. Berry et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 581. 1986.]
105650 SOME ISSUES IN GENERAL-PURPOSE SHARED MEMORY MULTIPROCESSING:
PARALLELISM EXPLOITATION AND MEMORY ACCESS COMBINING.
L. Gyungho.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 589. 1986. Thesis (Ph.D.).]
105651 THE SYMMETRIC EIGENVALUE PROBLEM ON A MULTIPROCESSOR.
S.-S. Lo and B. Philippe.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 590. 1986.]
105652 FAULT-TOLERANT MULTIPROCESSOR INTERCONNECTION NETWORKS AND THEIR
FAULT-DIAGNOSIS.
N.-F. Tzeng.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 594. 1986. Thesis (Ph.D.).]
105653 TASK ASSIGNMENT USING NETWORK FLOW METHODS FOR MINIMIZING
COMMUNICATION IN N-PROCESSOR SYSTEMS.
S. G. Abraham and E. S. Davidson.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 598. 1986.]
105654 MULTITASKING RUNTIME SYSTEMS FOR THE CEDAR MULTIPROCESSOR.
M. D. Guzzi.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. CSRD report 604. 1986. Thesis (M.S.).]
105655 LEARNING PHYSICAL DOMAINS: TOWARD A THEORETICAL FRAMEWORK.
K. D. Forbus and D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1247. 1986.]
105656 SUMMARY OF DESIGN APPROACHES FOR SYMMETRIC PARALLEL MULTIPLIERS.
A. L. Gordon.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1252. 1986. Thesis (M.S.).]
105657 A CLASS OF PARALLEL ITERATIVE METHODS IMPLEMENTED ON MULTIPROCESSORS.
A. Chronopoulos.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1267. 1986. Thesis (Ph.D.).]
105658 A NEW DESIGN FOR TWO'S COMPLEMENT ARRAY MULTIPLIERS.
J. E. Robertson.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1284. 1986.]
105659 ENCOMPASS: AN ENVIRONMENT FOR THE INCREMENTAL DEVELOPMENT OF SOFTWARE.
R. B. Terwilliger and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1296. 1986.]
105660 TOPICS IN THE DESIGN AND ANALYSIS OF COMBINATORIAL ALGORITHMS.
S. Kapoor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1297. 1986. Thesis (Ph.D.).]
105661 INPUT TRANSFORMATIONS AND RESOLUTION IMPLEMENTATION TECHNIQUES FOR
THEOREM PROVING IN FIRST-ORDER LOGIC.
S. Greenbaum.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1298. 1986. Thesis (Ph.D.).]
105662 TESTING THE NECKLACE CONDITION FOR SHORTEST TOURS AND OPTIMAL FACTORS
IN THE PLANE.
H. Edelsbrunner, G. Rote, and E. Welzl.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1301. 1986.]
105663 AN EXAMINATION OF THE THIRD STAGE IN THE ANALOGY PROCESS:
VERIFICATION-BASED ANALOGICAL LEARNING.
B. Falkenhainer.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1302. 1986.]
105664 BENCHMARKING HYPERCUBE HARDWARE AND SOFTWARE.
D. C. Grunwald and D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1303. 1986.]
105665 LOGIC LANGUAGES BASED ON FUNCTIONS: SEMANTICS AND IMPLEMENTATIONS.
U. S. Reddy.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1305. 1986. Thesis (Ph.D.). "A dissertation
submitted to the faculty of the University of Utah in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy, Department of Computer Science, The University of Utah,
August 1986."]
105666 PROBING CONVEX POLYGONS WITH X-RAYS.
H. Edelsbrunner and S. S. Skiena.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1306. 1986.]
105667 LES: A LAYOUT EXPERT SYSTEM.
Y.-L. S. Lin and D. D. Gajski.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1308. 1986.]
105668 TETRAHEDRIZING POINT SETS IN THREE DIMENSIONS.
H. Edelsbrunner, F. P. Preparata, and D. B. West.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1310. 1986.]
105669 A PROBABILISTIC REASONING-BASED APPROACH TO MACHINE LEARNING.
K. Purswani and L. Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1311. 1986.]
105670 ON THE NUMBER OF FURTHEST NEIGHBOUR PAIRS IN A POINT SET.
H. Edelsbrunner and S. S. Skiena.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1312. 1986.]
105671 MAPS - MULTIPLE PURPOSE DATA STRUCTURES.
D. R. Morrison.
[University of New Mexico. Department of Computer Science. Tech
report CS-8(83). 1983.]
105672 MULTI-LEVEL DEBUGGING USING INTERFACE MONITORING.
C. R. Snow.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 216. 1986.]
105673 EXCEPTION HANDLING IN REPLICATED SYSTEMS WITH VOTING.
L. Mancini and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 217. 1986.]
105674 DESIGN FAULT TOLERANCE.
B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 218. 1986.]
105675 MODELLING REAL-WORLD ISSUES IN DEPENDABLE COMMUNICATIONS SYSTEMS.
J. E. Dobson and M. J. Martin.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 219. 1986.]
105676 AN ARCHITECTURE OF UNIX UNITED.
J. P. Black, L. F. Marshall, and B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 220. 1986.]
105677 A MULTICAST TRANSMISSION TAXONOMY.
L. Hughes.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 221. 1986.]
105678 REPRESENTATION-SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE
STUDY USING N-QUEENS.
B. A. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-5-86.
1986.]
105679 THEORY-BASED SEARCH-ORDER SELECTION FOR CONSTRAINT SATISFACTION
PROBLEMS.
B. A. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-6-86.
1986.]
105680 HEURISTICS FOR DATA ALLOCATION IN LOCAL AREA NETWORKS.
J.-T. Park and T. J. Teorey.
[University of Michigan. Computing Research Laboratory. CRL-TR-7-86.
1986.]
105681 DIAGNOSIS OF MALICIOUS PROCESSORS IN A DISTRIBUTED COMPUTING SYSTEM.
K. Shin and P. Ramanathan.
[University of Michigan. Computing Research Laboratory. CRL-TR-8-86.
1986.]
105682 DATABASE ARCHITECTURES: AN EXTENSIVE STUDY.
O. Frieder, C. Baru, and M. Putz.
[University of Michigan. Computing Research Laboratory. CRL-TR-9-86.
1986.]
105683 IMPLEMENTING RELATIONAL DATABASE OPERATIONS IN A CUBE-CONNECTED
MULTICOMPUTER.
C. Baru and O. Frieder.
[University of Michigan. Computing Research Laboratory. CRL-TR-10-86.
1986.]
105684 DEVIEW PROJECT OVERVIEW (DEVELOPMENT OF AN INFORMATION SYSTEM
ENVIRONMENT WORKSTATION).
L. B. Protsko, P. G. Sorenson, and J. P. Tremblay.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-3. 1986.]
105685 ON-CHIP INSTRUCTION CACHES.
C. McCrosky and K. McDonald.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-8. 1986.]
105686 THE AMVA PRIORITY APPROXIMATION.
D. L. Eager and J. N. Lipscomb.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-9. 1986.]
105687 SPSL/SPSA VERSION 2.0 PRIMER.
L. B. Protsko, P. G. Sorenson, and J. P. Tremblay.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-10. 1986.]
105688 DEPICT: A SYSTEM ANALYST'S WORKSTATION.
G. P. A. Kurtenbach et al.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-11. 1986.]
105689 SPEEDUP VERSUS EFFICIENCY IN PARALLEL SYSTEMS.
D. L. Eager, J. Zahorjan, and E. D. Lazowska.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-12. 1986.]
105690 ACCURACY, SPEED, AND CONVERGENCE OF APPROXIMATE MEAN VALUE ANALYSIS.
J. Zahorjan, D. L. Eager, and H. Sweillam.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-13. 1986.]
105691 FIXED LENGTH MESSAGE ROUTING IN HYPERCUBE-CONNECTED MULTIPROCESSORS.
C. McCrosky and I. Reid.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-14. 1986.]
105692 PERFORMANCE ANALYSIS OF PARTIAL MATCH SEARCH ALGORITHMS FOR BD TREES.
S. P. Dandamudi and P. G. Sorenson.
[University of Saskatchewan. Department of Computational Science.
Report no. 86-15. 1986.]
105693 SPLAY TREES AS PRIORITY QUEUES.
E. Maekinen.
[University of Tampere. Department of Mathematical Sciences. A168.
1986.]
105694 ON DIALOGUE ENGINEERING RULES AND PROVERBS.
P. Jaervinen.
[University of Tampere. Department of Mathematical Sciences. A169.
1986.]
105695 NARA: A TWO-WAY SIMULTANEOUS INTERPRETATION SYSTEM BETWEEN KOREAN AND
JAPANESE - A METHODOLOGICAL STUDY.
H. S. Chung and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 86-03. 1986.]
105696 G-QUADTREE: A HIERARCHICAL REPRESENTATION OF GRAY-SCALE DIGITAL
IMAGES.
T. L. Kunii, I. Fujishiro, and X. Mao.
[University of Tokyo. Department of Information Science. Technical
report 86-04. 1986.]
105697 A SIMPLE METHOD FOR COMPUTING GENERAL POSITION IN DISPLAYING
THREE-DIMENSIONAL OBJECTS.
T. Kamada and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 86-05. 1986.]
105698 A SUFFICIENT CONDITION FOR A BIPARTITE GRAPH TO HAVE A K-FACTOR.
H. Enomoto and K. Ota.
[University of Tokyo. Department of Information Science. Technical
report 86-06. 1986.]
105699 THE NUMBER OF THE CONTRACTIBLE EDGES IN 3-CONNECTED GRAPHS.
K. Ota.
[University of Tokyo. Department of Information Science. Technical
report 86-07. 1986.]
105700 ON RANDOMLY N-CYCLIC DIGRAPHS.
Y. Egawa, T. Miyamoto, and S. Ruiz.
[University of Tokyo. Department of Information Science. Technical
report 86-08. 1986.]
105701 A GENERAL METHOD TO EXPAND FUNCTIONAL PROGRAMS.
P. Tang and N. Yoneda.
[University of Tokyo. Department of Information Science. Technical
report 86-09. 1986.]
105702 TECHNOLOGICAL INNOVATIONS AND THE VICISSITUDE OF JAPANESE LANGUAGE: A
VIEWPOINT FROM HUMAN INTERFACE.
H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 86-10. 1986. "A key note lecture at the International
Symposium on the History and the Future of Kanji-Based Cultures, May
19-20, 1986, Tokyo." IN JAPANESE.]
105703 MULTIWINDOW SCREENS WITHOUT WINDOW OVERLAPPING.
M. Maekawa.
[University of Tokyo. Department of Information Science. Technical
report 86-11. 1986.]
105704 IMPORTANCE OF DOCUMENTS AS A COMMUNICATION TOOL: A VIEW BASED ON
PERSONAL EXPERIENCE IN U.S.A.
H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 86-12. 1986. "A talk given at the First Documentation
Engineering Institute Seminar, Tokyo, August 20, 1986." IN JAPANESE.]
105705 SOME COGNITIVE ASPECTS OF HUMAN INTERFACE.
H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 86-13. 1986. "Keynote Lecture, The Second SICE Symposium on
Human Interface, Tokyo, October 29-30, 1986." IN JAPANESE.]
105706 CODES WITH GIVEN DISTANCES.
H. Enomoto et al.
[University of Tokyo. Department of Information Science. Technical
report 86-14. 1986.]
105707 OBJECT MANAGEMENT AND ADDRESS SPACE OF GALAXY HOLONIC PROCESSING
SYSTEM.
M. Maekawa et al.
[University of Tokyo. Department of Information Science. Technical
report 86-15. 1986.]
105708 EXTRAPOLATED BOUNDARY ELEMENT METHOD FOR THREE DIMENSIONAL INDUCTANCE
CALCULATION.
M. Hosoya, E. Goto, and T. Soma.
[University of Tokyo. Department of Information Science. Technical
report 86-16. 1986.]
105709 LOCAL AUTHENTICATION IN INSECURE ENVIRONMENTS.
S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 86-17. 1986.]
105710 SUFFICIENT CONDITIONS FOR THE EXISTENCE OF K-FACTORS.
H. Enomoto and Y. Egawa.
[University of Tokyo. Department of Information Science. Technical
report 86-18. 1986.]
105711 CPC (CYCLIC PIPELINE COMPUTER) - AN ARCHITECTURE SUITED FOR JOSEPHSON
AND PIPELINED-MACHINES.
K. Shimizu, E. Goto, and S. Ichikawa.
[University of Tokyo. Department of Information Science. Technical
report 86-19. 1986.]
105712 THE REPRESENTATION OF AMBIGUITY IN OPAQUE CONSTRUCTS.
B. Fawcett.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-178. 1986. Thesis (M.S.).]
105713 CYCLE TIME PROPERTIES OF THE FDDI TOKEN RING PROTOCOL.
K. C. Sevcik and M. J. Johnson.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-179. 1986.]
105714 PROPHET: A LAYERED ANALYTICAL MODEL FOR PERFORMANCE PREDICTION OF
DATABASE SYSTEMS.
I. R. Casas.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-180. 1986. Thesis (M.S.).]
105715 TOWARD A COMPUTATIONAL INTERPRETATION OF SITUATION SEMANTICS.
Y. Lesperance.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-181. 1986.]
105716 THE FORMAL SEMANTICS OF TURING PROGRAMS.
R. C. Holt and P. A. Matthews.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-182. 1986.]
105717 OFFICE AND DATABASE SYSTEMS RESEARCH '86.
J. P. F. Chui et al.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. 1986. "This report contains a collection
of [9] papers that represent the research directions of the Office
and Data Base Systems Group in the Computer Systems Research
Institute at the University of Toronto over the past year." Edited by
F. H. Lochovsky.]
105717 EXPLORING THE LINK BETWEEN OFFICE SUPPORT SYSTEMS AND DISTRIBUTED
PROBLEM SOLVING SYSTEMS.
M. S. Mazer.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 SUPPORTING DISTRIBUTED OFFICE PROBLEM SOLVING IN ORGANIZATIONS.
C. C. Woo and F. H. Lochovsky.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 INTEGRATING PROCEDURE-AUTOMATION AND PROBLEM-SOLVING APPROACHES TO
SUPPORTING OFFICE WORK.
C. C. Woo and F. H. Lochovsky.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 A LOGICALLY DISTRIBUTED PLANNING MODEL.
C. C. Woo and F. H. Lochovsky.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 AN OBJECT-ORIENTED PROTOCOL FOR MANAGING DATA.
S. P. Weiser.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 A WINDOW-BASED FRONT-END APPROACH FOR RELATIONAL DATABASE ACCESS.
J. P. F. Chui and F. H. Lochovsky.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 QUERY EVALUATION IN LOGICAL QUERY LANGUAGES.
P. T. Wood.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 A GRAPHICAL QUERY LANGUAGE SUPPORTING RECURSION.
A. O. Mendelzon and P. T. Wood.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105717 FUNCTIONAL DEPENDENCIES IN HORN CLAUSE QUERIES.
A. O. Mendelzon and P. T. Wood.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-183. n.d. One of nine Office and Data Base
Systems Group papers issued together as technical report CSRI-183.]
105718 AN OVERVIEW OF KNOWLEDGE ACQUISITION METHODS.
S. Becker and B. Selman.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-184. 1986.]
105719 A MATHEMATICAL SEMANTICS AND THEORY OF RASTER GRAPHICS.
E. L. Fiume.
[Universitry of Toronto. Computer Systems Research Institute.
Technical report CSRI-185. 1986. Thesis (Ph.D.).]
105720 UNIVERSAL CHAINS AND WIRING LAYOUTS.
M. S. Paterson.
[University of Warwick. Department of computer Science. Research
report 74. 1986.]
105721 ON THE COMPLEXITY OF PARALLEL PARSING OF GENERAL CONTEXT-FREE
LANGUAGES.
W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 75. 1986.]
105722 METRIC DOMAINS FOR COMPLETENESS.
S. G. Matthews.
[University of Warwick. Department of Computer Science. Research
report 76. 1986. Thesis (Ph.D.). "A dissertation submitted for the
degree of Doctor of Philosophy...March 1985."]
105723 AN OPTIMAL PARALLEL ALGORITHM FOR DYNAMIC EXPRESSION EVALUATION AND
ITS APPLICATIONS.
A. Gibbons and W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 77. 1986.]
105724 ARCA - A NOTATION FOR DISPLAYING AND MANIPULATING COMBINATORIAL
DIAGRAMS.
M. Beynon.
[University of Warwick. Department of Computer Science. Research
report 78. 1986.]
105725 ON THE DECIDABILITY OF SOME PROBLEMS ABOUT RATIONAL SUBSETS OF FREE
PARTIALLY COMMUTATIVE MONOIDS.
A. Gibbons and W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 79. 1986.]
105726 A FAST PARALLEL ALGORITHM FOR OPTIMAL EDGE-COLOURING OF OUTERPLANAR
GRAPHS.
A. Gibbons and W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 80. 1986.]
105727 FAST PARALLEL ALGORITHMS FOR OPTIMALLY EDGE AND VERTEX COLOURING
HALIN GRAPHS.
A. Gibbons and W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 83. 1986.]
105728 A NOTE ON OPTIMAL PARALLEL TRANSFORMATIONS OF REGULAR EXPRESSIONS TO
NONDETERMINISTIC FINITE AUTOMATA.
W. Rytter.
[University of Warwick. Department of Computer Science. Research
report 84. 1986.]
105729 OPTIMAL PARALLEL PARSING OF BRACKET LANGUAGES.
W. Rytter and R. Giancarlo.
[University of Warwick. Department of Computer Science. Research
report 85. 1985.]
105730 BOUNDED PARALLELISM IN COMPUTER ALGEBRA.
S. M. Watt.
[University of Waterloo. Department of Computer Science. Research
report CS-86-12. 1986. Thesis (Ph.D.).]
105731 POLYMORPHISM IN A COMPILED LANGUAGE.
G. V. Cormack and A. K. Wright.
[University of Waterloo. Department of Computer Science. CS-86-27.
1986.]
105732 TYPES ARE NOT CLASSES.
G. V. Cormack, M. Judd, and A. K. Wright.
[University of Waterloo. Department of Computer Science. CS-86-28.
1986.]
105733 A SIMPLE UNIVERSAL CELLULAR AUTOMATON AND IT'S ONE-WAY TOTALISTIC
VERSION.
J. Albert and K. Culik II.
[University of Waterloo. Department of Computer Science. CS-86-29.
1986.]
105734 LOCAL CORRECTION OF HELIX(K) LISTS.
I. J. Davis.
[University of Waterloo. Department of Computer Science. CS-86-30.
1986.]
105735 GLOBAL CONVERGENCE OF A CLASS OF TRUST REGION ALGORITHMS FOR
OPTIMIZATION WITH SIMPLE BOUNDS.
A. R. Conn, N. I. M. Gould, and Ph. L. Toint.
[University of Waterloo. Department of Computer Science. Research
report CS-86-31. 1986.]
105736 AN EXPERT SYSTEM FOR EDUCATIONAL DIAGNOSIS USING THEORIST.
J. B. Tubman.
[University of Waterloo. Department of Computer Science. CS-86-32.
1986. Thesis (Master of Mathematics in Computer Science).]
105737 EXHUMING THE CRITICISM OF THE LOGICIST.
R. G. Goebel.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-33. 1986.]
105738 THEORY PREFERENCE BASED ON PERSISTENCE.
S. D. Goodwin and R. G. Goebel.
[University of Waterloo. Department of Computer Science. Technical
report CS-86-34. 1986.]
105739 TIME- AND SPACE-OPTIMAL CONTOUR COMPUTATION FOR A SET OF RECTANGLES.
P. Widmayer and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-35.
1986.]
105740 RESTRICTED-ORIENTATION CONVEXITY.
G. J. E. Rawlins and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-36.
1986.]
105741 INCORPORATING USER MODELS INTO EXPERT SYSTEMS FOR EDUCATIONAL
DIAGNOSIS.
R. Cohen and M. Jones.
[University of Waterloo. Department of Computer Science. Research
report CS-86-37. 1986.]
105742 INCREMENTAL EVALUATION FOR ATTRIBUTE GRAMMARS WITH UNRESTRICTED
MOVEMENT BETWEEN TREE MODIFICATIONS.
T. Reps.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 671. 1986.]
105743 DATAFLOW QUERY PROCESSING USING MULTIPROCESSOR HASH-PARTITIONED
ALGORITHMS.
R. H. Gerber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 672. 1986. Thesis (Ph.D.).]
105744 EXPERIENCE WITH CRYSTAL, CHARLOTTE, AND LYNX: THIRD REPORT.
R. Finkel et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 673. 1986.]
105745 ADDING RELATIONAL DATABASES TO EXISTING SOFTWARE SYSTEMS: IMPLICIT
RELATIONS AND A NEW RELATIONAL QUERY EVALUATION METHOD.
S. Horwitz.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 674. 1986.]
105746 A SCALED TRUST REGION METHOD FOR A CLASS OF CONVEX OPTIMIZATION
PROBLEMS.
R. J. Chen and R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 675. 1986.]
105747 GENERATING EXECUTION FACILITIES FOR INTEGRATED PROGRAMMING
ENVIRONMENTS.
A. A. Pal.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 676. 1986. Thesis (Ph.D.).]
105748 IMPLEMENTATION OF VISUAL UNIX PROCESS CONNECTOR.
M. Bhattacharyya, D. Cohrs, and B. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 677. 1986.]
105749 PYRAMID VISION USING KEY FEATURES TO INTEGRATE IMAGE-DRIVEN BOTTOM-UP
AND MODEL-DRIVEN TOP-DOWN PROCESSES.
Z.-N. Li and L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 678. 1986.]
105750 MULTISCALE IMAGE UNDERSTANDING.
C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 679. 1986.]
105751 YACC REFERENCE MANUAL.
B. M. Sullivan.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-12. 1986.]
105752 A SIMPLE BOUNDED DISORDER FILE ORGANIZATION WITH GOOD PERFORMANCE.
D. B. Lomet.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-13. 1986.]
105753 PROGRAMMING OF MULTIPLE ROBOT SYSTEMS.
H. Gomaa.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-86-15. 1986.]
105754 ARCHITECTURAL ELEMENTS FOR BITMAP GRAPHICS.
C. D. Kornfeld.
[Xerox Corporation. Palo Alto Research Center. CSL-85-2. 1985. Thesis
(Ph.D.). "This report reproduces a dissertation submitted to the
Department of Electrical Engineering and the Committee on Graduate
Studies of Stanford University in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
105755 A STRUCTURAL VIEW OF THE CEDAR PROGRAMMING ENVIRONMENT.
D. C. Swinehart et al.
[Xerox Corporation. Palo Alto Research Center. CSL-86-1. 1986.]
105756 SHARED VIRTUAL MEMORY ON LOOSELY COUPLED MULTIPROCESSORS.
K. Li.
[Yale University. Department of Computer Science. YALEU/DCS/RR-492.
1986. Thesis (Ph.D.).]
105757 THE PICTEX MANUAL.
M. J. Wichura.
[1986. No issuing agency indicated (author's address: Department of
Statistics, University of Chicago).]
VOL. 9, NO. 4 04/20/87
105758 CONCURRENT PROGRAM SCHEMES.
A. J. Kfoury and P. Urzyczyn.
[Boston University. Department of Computer Science. Tech report
86-009. 1986.]
105759 HONEST POLYNOMIAL DEGREES AND P=? NP.
S. Homer and T. J. Long.
[Boston University. Department of Computer Science. Tech report
86-011. 1986.]
105760 METAPHORS AND ANALOGIES: AN INTERDISCIPLINARY PERSPECTIVE.
B. Indurkhya.
[Boston University. Department of Computer Science. Tech report
86-012. 1986.]
105761 AUTOMATIC RULE DERIVATION FOR SEMANTIC QUERY OPTIMIZATION.
M. Siegel.
[Boston University. Department of Computer Science. Tech report
86-013. 1986.]
105762 AN OVERVIEW OF DECO - A DEVICE COMPILATION SYSTEM.
B. A. Dalio and J. E. Savage.
[Brown University. Computer Science Department. Technical report
CS-86-24. 1986.]
105763 INCREMENTAL CAUSAL REASONING.
T. Dean and M. Boddy.
[Brown University. Computer Science Department. Technical report
CS-87-01. 1987.]
105764 AN INVERSE LIMIT CONSTRUCTION OF A DOMAIN OF INFINITE LISTS.
Y. Choo.
[California Institute of Technology. Computer Science Department.
Report no. 5204:TR:85. 1985. Supersedes report no. 5188:TR:85.]
105765 DEADLOCK FREE MESSAGE ROUTING IN MULTIPROCESSOR INTERCONNECTION
NETWORKS.
W. J. Dally and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5206:TR:86. 1986.]
105766 SELF-TIMED FIFO: AN EXERCISE IN COMPILING PROGRAMS INTO VLSI CIRCUITS.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5211:TR:86. 1986.]
105767 ON SEITZ' ARBITER.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5212:TR:86. 1986.]
105768 ANALOG: A FUNCTIONAL SIMULATOR FOR VLSI NEURAL SYSTEMS.
J. P. Lazzaro.
[California Institute of Technology. Computer Science Department.
Report no. 5229:TR:86. 1986. Thesis (M.S.).]
105769 MONTE CARLO METHODS FOR 2-D COMPACTION.
R. C. Mosteller.
[California Institute of Technology. Computer Science Department.
Report no. 5230:TR:86. 1986. Thesis (Ph.D.).]
105770 SOME RESULTS ON KOLMOGOROV-CHAITIN COMPLEXITY.
D. L. Schweizer.
[California Institute of Technology. Computer Science Department.
Report no. 5233:TR:86. 1986. Thesis (M.S.).]
105771 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 MARCH 1986 TO 15 NOVEMBER 1986.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5235:TR:86. 1986. Principal investigator: Charles L.
Seitz. Faculty investigators: James T. Kajiya, Alain J. Martin,
Robert J. McEliece, Martin Rem, Charles L. Seitz.]
105772 AN APPROACH TO CONCURRENT SEMANTICS USING COMPLETE TRACES.
K. S. Van Horn.
[California Institute of Technology. Computer Science Department.
Report no. 5236:TR:86. 1986. Thesis (M.S.).]
105773 ON OPTIMIZING BACKTRACK SEARCH FOR ALL SOLUTIONS TO CONJUNCTIVE
PROBLEMS.
K. S. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 11982. 1986.]
105774 SWITCH-LEVEL SIMULATION FOR MEMORY MAPPED GENERAL PURPOSE PARALLEL
PROCESSORS.
D. Beece, J. Goren, and R. Villani.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12021. 1986.]
105775 READING FROM CRT DISPLAYS CAN BE AS FAST AS READING FROM PAPER.
J. D. Gould et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12083. 1986.]
105776 MEMORY ACCESS PATTERNS OF PARALLEL SCIENTIFIC PROGRAMS.
F. Darema-Rogers, D. F. Pfister, and K. So.
[International Business Machines Corporation (IBM). Research
Division. RC 12086. 1986.]
105777 AN EFFICIENT DISTRIBUTED KNOT DETECTION ALGORITHM.
I. Cidon.
[International Business Machines Corporation (IBM). Research
Division. RC 12099. 1986.]
105778 AN EXTENDABLE SIMULATOR FOR MULTIPROCESSOR MACHINES.
S. C. Hsieh.
[International Business Machines Corporation (IBM). Research
Division. RC 12100. 1986.]
105779 MATRIX MULTIPLICATION VIA BEHREND'S THEOREM.
D. Coppersmith and S. Winograd.
[International Business Machines Corporation (IBM). Research
Division. RC 12104. 1986.]
105780 A NEW TEST FOR THE QUALITY OF RANDOM NUMBER GENERATORS.
S. Pilpel.
[International Business Machines Corporation (IBM). Research
Division. RC 12112. 1986.]
105781 META-INTERPRETER DIRECTED COMPILATION OF LOGIC PROGRAMS INTO PROLOG.
G. Neumann.
[International Business Machines Corporation (IBM). Research
Division. RC 12113. 1986.]
105782 STATISTICAL ENCOUNTERS WITH B-SPLINES.
W. Dahman and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12117. 1986.]
105783 ALGEBRAIC PROPERTIES OF DISCRETE BOX SPLINES.
W. Dahmen and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12118. 1986.]
105784 ON LOCALLY SUPPORTED BASIS FUNCTIONS FOR THE REPRESENTATION OF
GEOMETRICALLY CONTINUOUS CURVES.
N. Dyn, A. Edelman, and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12119. 1986.]
105785 RESEQUENCING DELAY ANALYSIS FOR A QUEUEING SYSTEM WITH TWO
HETEROGENEOUS SERVERS UNDER A THRESHOLD TYPE SCHEDULING.
I. Iliadis and Y.-C. Lien.
[International Business Machines Corporation (IBM). Research
Division. RC 12120. 1986.]
105786 SUBDIVISION ALGORITHMS FOR CURVES AND SURFACES.
C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12122. 1986.]
105787 IMPLEMENTING AN ENTITY-RELATIONSHIP LANGUAGE ON A RELATIONAL DATA
BASE.
A. Malhotra et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12134. 1986.]
105788 OPTIMAL DYNAMIC CONTROL OF RESOURCES IN A DISTRIBUTED SYSTEM.
K. G. Shin, C. M. Krishna, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. RC 12135. 1986.]
105789 CORNER CUTTING ALGORITHMS FOR THE BEZIER REPRESENTATION OF FREE FORM
CURVES.
T. N. T. Goodman and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12139. 1986.]
105790 DATA COMMUNICATIONS: THE IMPLICATIONS OF COMMUNICATIONS SYSTEMS ON
PROTOCOL DESIGN.
B. C. Goldstein and J. M. Jaffe.
[International Business Machines Corporation (IBM). Research
Division. RC 12145. 1986.]
105791 A NEW PEBBLE GAME THAT CHARACTERIZES PARALLEL COMPLEXITY CLASSES.
H. Venkateswaran and M. Tompa.
[International Business Machines Corporation (IBM). Research
Division. RC 12158. 1986.]
105792 ON VLSI LAYOUT COMPACTION WITH GRID AND MIXED CONSTRAINTS.
J. Lee and D. T. Tang.
[International Business Machines Corporation (IBM). Research
Division. RC 12163. 1986.]
105793 MECHANICAL TRANSLATION OF SET THEORETIC PROBLEM SPECIFICATIONS INTO
EFFICIENT RAM CODE - A CASE STUDY.
R. Paige and F. Henglein.
[International Business Machines Corporation (IBM). Research
Division. RC 12169. 1986.]
105794 COMPUTING CURVES INVARIANT UNDER HALVING.
C. A. Micchelli and H. Prautzsch.
[International Business Machines Corporation (IBM). Research
Division. RC 12170. 1986.]
105795 OPTIMAL DISTRIBUTED T-RESILIENT ELECTION IN COMPLETE NETWORKS.
S. Kutten, Y. Wolfstahl, and S. Zaks.
[International Business Machines Corporation (IBM). Research
Division. RC 12177. 1986.]
105796 A CATEGORICAL TREATMENT OF PRE- AND POST-CONDITIONS.
E. G. Wagner.
[International Business Machines Corporation (IBM). Research
Division. RC 12181. 1986.]
105797 DATAFLOW PRINCIPLES IN MULTI-PROCESSOR SYSTEMS.
R. Buehrer and K. Ekanadham.
[International Business Machines Corporation (IBM). Research
Division. RC 12190. 1986.]
105798 MATHEMATICS AND BEAUTY II: SPIRALS AND "STRANGE" SPIRALS IN
CIVILIZATION, NATURE, SCIENCE, AND ART.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12196. 1986.]
105799 AN IMPROVED DEL-STYLE EXECUTION ARCHITECTURE FOR FP.
T. Huynh and B. Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 12202. 1986.]
105800 EMBEDDING MULTIPLE PRIORITY ORDERINGS INTO A BALANCED TREE.
Y. Tanaka.
[International Business Machines Corporation (IBM). Research
Division. RC 12220. 1986.]
105801 FOOTPRINTS IN THE CACHE.
D. Thiebaut and H. S. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12221. 1986.]
105802 ADAPTIVE SEARCH: AN APPROACH TO OPTIMIZE SEARCH EFFORT FOR PROBLEM
SOLVING.
K. S. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. RC 12228. 1986.]
105803 PARALLEL APPLICATIONS DEVELOPMENT FOR SHARED MEMORY SYSTEMS.
F. Darema-Rogers.
[International Business Machines Corporation (IBM). Research
Division. RC 12229. 1986.]
105804 A PERFORMANCE COMPARISON OF MULTI-MICRO AND MAINFRAME DATABASE
ARCHITECTURES.
P. Heidelberger and M. S. Lakshmi.
[International Business Machines Corporation (IBM). Research
Division. RC 12230. 1986. Revised.]
105805 EMBEDDING.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12232. 1986.]
105806 PROBABILISTIC ANALYSIS OF DEADLOCK FREQUENCIES IN DATABASE SYSTEMS.
I. K. Ryu and A. Thomasian.
[International Business Machines Corporation (IBM). Research
Division. RC 12240. 1986.]
105807 HOW PEOPLE CREATE SPREADSHEETS.
P. S. Brown and J. D. Gould.
[International Business Machines Corporation (IBM). Research
Division. RC 12247. 1986.]
105808 TEMPORAL PERSISTENCE: A TEMPORAL APPROACH TO DEFAULT REASONING.
V. Nguyen.
[International Business Machines Corporation (IBM). Research
Division. RC 12255. 1986.]
105809 LOAD DISTRIBUTION IN PACKET-SWITCHED NETWORKS.
P. M. Gopal, B. K. Kadaba, and G. Wieber.
[International Business Machines Corporation (IBM). Research
Division. RC 12256. 1986.]
105810 ANALYSIS OF A NONPREEMPTIVE PRIORITY MULTISERVER QUEUE.
H. R. Gail, S. L. Hantler, and B. A. Taylor.
[International Business Machines Corporation (IBM). Research
Division. RC 12260. 1986. "An earlier version was published as [IBM
Research Report] RC 11951."]
105811 DESIGN OF A MULTIPARADIGM LANGUAGE.
B. Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 12261. 1986.]
105812 FUN.
J. M. Carroll and J. C. Thomas.
[International Business Machines Corporation (IBM). Research
Division. RC 12267. 1986.]
105813 SYNCHRONIZING ASYNCHRONOUS BOUNDED DELAY NETWORKS.
C.-T. Chou et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12274. 1986.]
105814 LINEAR BROADCAST ROUTING.
C.-T. Chou and I. S. Gopal.
[International Business Machines Corporation (IBM). Research
Division. RC 12275. 1986.]
105815 PROGRAM DEVELOPMENT BY QUERY.
B. Leavenworth.
[International Business Machines Corporation (IBM). Research
Division. RC 12279. 1986.]
105816 COMPUTERS, PATTERN, CHAOS AND BEAUTY.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12281. 1986.]
105817 MATHEMATICS AND BEAUTY III: TEXTURES AND TILING PATTERNS COMPUTED
FROM TRUNCATED SINUSOIDS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12282. 1986.]
105818 BEHAVIORAL EXPERIMENTS ON HANDMARKINGS.
J. D. Gould and J. Salaun.
[International Business Machines Corporation (IBM). Research
Division. RC 12290. 1986.]
105819 MULTIPLIER AND CONTRACTIVITY TECHNIQUES FOR LINEAR MULTISTEP METHODS.
F. Odeh, O. Nevanlinna, and W. Liniger.
[International Business Machines Corporation (IBM). Research
Division. RC 12303. 1986.]
105820 MULTI-TASKING ON A DATAFLOW-LIKE ARCHITECTURE.
K. Ekanadham.
[International Business Machines Corporation (IBM). Research
Division. RC 12307. 1986.]
105821 AN EXECUTABLE SPECIFICATION OF EQUALITY THEOREM PROVING WITHIN PROLOG.
S. Haridi et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12308. 1986.]
105822 REMARKS ON THE CONVERGENCE OF WAVEFORM RELAXATION METHOD.
O. Nevanlinna and F. Odeh.
[International Business Machines Corporation (IBM). Research
Division. RC 12309. 1986.]
105823 TRIM: TESTABILITY RANGE BY IGNORING THE MEMORY.
L. Carter, L. M. Huisman, and T. W. Williams.
[International Business Machines Corporation (IBM). Research
Division. RC 12333. 1986.]
105824 MATHEMATICS AND BEAUTY IV: COMPUTER GRAPHICS AND WILD MONOPODIAL
TENDRIL PLANT GROWTH.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12334. 1986.]
105825 MINIMAL NORM INTERPOLATION IN H SUPERSCRIPT 2 WITH NONNEGATIVE REAL
PART.
S. D. Fisher and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12351. 1986.]
105826 ADMISSIBLE SLOPES FOR MONOTONE AND CONVEX INTERPOLATION.
A. Edelman and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12352. 1986.]
105827 CONSTRAINTS IN CONSTRUCTIVE SOLID GEOMETRY.
J. R. Rossignac.
[International Business Machines Corporation (IBM). Research
Division. RC 12356. 1986.]
105828 AREA EFFICIENT FLOORPLANNING OF MIXED CUSTOM/STANDARD-CELL DESIGNS.
D. P. LaPotin and S. S. Weiner.
[International Business Machines Corporation (IBM). Research
Division. RC 12357. 1986.]
105829 SMARTHELP: A DYNAMIC PROTOTYPING TOOL FOR INTELLIGENT ADVISORY DIALOG.
J. C. Checco and J. M. Carroll.
[International Business Machines Corporation (IBM). Research
Division. RC 12371. 1986.]
105830 PERFORMANCE ESTIMATES FOR APPLICATIONS: AN ALGEBRAIC FRAMEWORK.
D. Mueller-Wichards.
[International Business Machines Corporation (IBM). Research
Division. RC 12391. 1986.]
105831 A MODEL FOR DISTRIBUTED INFORMATION NETWORKS.
H. M. Gladney.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5220. 1986.]
105832 DATA STRUCTURES ON PARALLEL MACHINES WITH FEW PROCESSORS.
F. Meyer auf der Heide and B. Simons.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5240. 1986.]
105833 THE INFLUENCE OF WORKLOAD ON LOAD BALANCING STRATEGIES.
L.-F. Cabrera.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5271. 1986.]
105834 USER-PROCESS COMMUNICATION PERFORMANCE IN NETWORKS OF COMPUTERS.
L.-F. Cabrera et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5276. 1986.]
105835 NEW APPROACHES TO LINEAR PROGRAMMING.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5278. 1986.]
105836 RELIABLE COMPUTATION IN THE PRESENCE OF NOISE.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5282. 1986.]
105837 EXTENDING NC AND RNC ALGORITHMS.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5294. 1986.]
105838 PATHWAYS TO THE OPTIMAL SET IN LINEAR PROGRAMMING.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5295. 1986.]
105839 HUMAN COMPUTER INTERACTION: WHAT IS IT AND WHAT RESEARCH IS NEEDED?
P. Reisner.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5308. 1986.]
105840 A PROBABILISTIC APPROACH TO THE LOAD SHARING PROBLEM IN DISTRIBUTED
SYSTEMS.
E. Shamir and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5315. 1986.]
105841 TOOLS FOR BUILDING ADVANCED USER INTERFACES.
J. L. Bennett.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5316. 1986.]
105842 BOUNDARY BEHAVIOR OF INTERIOR POINT ALGORITHMS IN LINEAR PROGRAMMING.
N. Megiddo and M. Shub.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5319. 1986.]
105843 DETERMINISTIC SIMULATION IN LOGSPACE.
M. Ajtai, J. Komlos, and E. Szemeredi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5320. 1986.]
105844 A TIGHTER UPPER BOUND ON THE WORST CASE BEHAVIOR OF CONWAY'S PARALLEL
SORTING ALGORITHM.
A. A. Schaffer.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5327. 1986.]
105845 PARALLEL ALGORITHMS FOR TERM MATCHING.
C. Dwork, P. Kanellakis, and L. Stockmeyer.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5328. 1986.]
105846 REGENERATIVE GENERALIZED SEMI-MARKOV PROCESSES.
P. J. Haas and G. S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5330. 1986.]
105847 FL LANGUAGE MANUAL (PRELIMINARY VERSION).
J. Backus, J. H. Williams, and E. L. Wimmers.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5339. 1986.]
105848 RELIABLE COMPUTATION BY FORMULAE IN THE PRESENCE OF NOISE.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5342. 1986.]
105849 THE DISTRIBUTED FIRING SQUAD PROBLEM.
B. A. Coan et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5343. 1986.]
105850 A RULE-BASED VIEW OF QUERY OPTIMIZATION.
J. C. Freytag.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5349. 1986.]
105851 A LOWER BOUND ON THE AREA OF PERMUTATION LAYOUTS.
A. Aggarwal et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5356. 1986.]
105852 GEOMETRIC APPLICATIONS OF A MATRIX SEARCHING ALGORITHM.
A. Aggarwal et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5357. 1986.]
105853 A STUDY ON NEURAL NETWORKS.
J. Bruck and J. Sanz.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5403. 1986.]
105854 LINEAR PROGRAMMING (1986).
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5405. 1986.]
105855 EARLY STOPPING IN BYZANTINE AGREEMENT.
D. Dolev, R. Reischuk, and H. R. Strong.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5406. 1986.]
105856 LOCAL AREA NETWORKS - MAJOR TECHNOLOGIES AND TRENDS.
K. Kuemmerle and M. Reiser.
[International Business Machines Corporation (IBM). Research
Division. RZ 1515. 1986.]
105857 LOCAL-AREA NETWORK RELIABILITY MODELS.
J. D. Spragins.
[International Business Machines Corporation (IBM). Research
Division. RZ 1518. 1986.]
105858 OSI COMMUNICATION SERVICES IN A LOCAL-AREA NETWORK.
L. Svobodova and O. Drobnik.
[International Business Machines Corporation (IBM). Research
Division. RZ 1522. 1986.]
105859 TOOLS FOR PROTOCOLS DRIVEN BY FORMAL SPECIFICATIONS.
H. Rudin.
[International Business Machines Corporation (IBM). Research
Division. RZ 1525. 1986.]
099091 CRYPTOLOGY AND VLSI (A TWO-PART DISSERTATION): I. DETECTING AND
-343 EXPLOITING ALGEBRAIC WEAKNESSES IN CRYPTOSYSTEMS. II. ALGORITHMS FOR
PLACING MODULES ON A CUSTOM VLSI CHIP.
A. T. Sherman.
[1986. Thesis (Ph.D.).]
099091 A HIGH-PERFORMANCE VLSI QUATERNARY SERIAL MULTIPLIER.
-344 W. J. Dally.
[1986.]
099091 WIRE-EFFICIENT VLSI MULTIPROCESSOR COMMUNICATION NETWORKS.
-345 W. J. Dally.
[1986.]
099091 LAZY EVENT-DRIVEN SIMULATION.
-346 W. J. Dally.
[1986.]
099091 THE SEMICONDUCTOR INDUSTRY IN THE AMERICAN ECONOMY: ECONOMIC ANALYSIS
-347 AND IMPLICATIONS.
C. Ferguson.
[1986.]
099091 COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS.
-349 B. M. Maggs.
[1986. Thesis (M.S.).]
099091 A SURVEY OF PROBLEMS AND RESULTS FOR CHANNEL ROUTING.
-350 T. Leighton.
[1986. Extended abstract.]
099091 NEARLY OPTIMAL ALGORITHMS AND BOUNDS FOR MULTILAYER CHANNEL ROUTING.
-351 B. Berger et al.
[1986. Preliminary draft: December 1986.]
099091 A NEW APPROACH TO THE MAXIMUM FLOW PROBLEM.
-353 A. V. Goldberg and R. E. Tarjan.
[1986. Preliminary version: December 1986.]
099091 OPTIMAL SIMULATIONS OF TREE MACHINES.
-354 S. Bhatt et al.
[1986. Preliminary version: December 1986.]
099091 PARALLEL (DELTA + 1) COLORING OF CONSTANT-DEGREE GRAPHS.
-355 A. V. Goldberg and S. A. Plotkin.
[1986.]
105860 TOWARDS AN OBJECT-CENTERED DATABASE LANGUAGE.
M. L. Kersten and F. H. Schippers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8630. 1986.]
105861 USING THE GUARDIAN PROGRAMMING PARADIGM TO SUPPORT DATABASE EVOLUTION.
M. L. Kersten and F. H. Schippers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8631. 1986.]
105862 DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING
CONTEXT-FREE LANGUAGES.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8632. 1986.]
105863 A SYNTAX DEFINITION FORMALISM.
J. Heering and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8633. 1986.]
105864 BOUNDED NONDETERMINISM AND THE APPROXIMATION INDUCTION PRINCIPLE IN
PROCESS ALGEBRA.
R. J. van Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8634. 1986.]
105865 MODULARIZATION AND REUSABILITY IN CURRENT PROGRAMMING LANGUAGES.
P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8635. 1986.]
105866 INTERTABLE.
J. C. van Vliet and J. B. Warmer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8636. 1986.]
105867 ON SIMPLE MOVING GRID METHODS FOR ONE-DIMENSIONAL EVOLUTIONARY
PARTIAL DIFFERENTIAL EQUATIONS.
J. G. Blom, J. M. Sanz-Serna, and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8620. 1986.]
105868 A NON-LINEAR MULTIGRID METHOD FOR THE STEADY EULER EQUATIONS.
P. W. Hemker and B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8621. 1986.]
105869 MULTIGRID AND DEFECT CORRECTION FOR THE EFFICIENT SOLUTION OF THE
STEADY EULER EQUATIONS.
B. Koren and S. P. Spekreijse.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8622. 1986.]
105870 THE USE OF DEFECT-CORRECTION FOR THE SOLUTION OF THE 2-D COMPRESSIBLE
NAVIER-STOKES EQUATIONS WITH LARGE REYNOLDS NUMBER.
J. J. Rusch.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8623. 1986.]
105880 A LOAD BALANCING IMPLEMENTATION FOR A LOCAL AREA NETWORK OF
WORKSTATIONS.
R. Alonso, P. Goldman, and P. Potrebic.
[Princeton University. Department of Computer Science. CS-TR-018-86.
1986.]
105881 SUPERPOSED PARALLEL BUSES: A SYSTOLIC AREA-TIME OPTIMAL VLSI
INTERCONNECTION.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-019-86.
1986.]
105882 THE TOTAL DNA HOMOLOGY EXPERIMENT.
R. J. Lipton, D. Lopresti, and J. D. Welsh.
[Princeton University. Department of Computer Science. CS-TR-020-86.
1986.]
105883 THE ROTATION GRAPH OF BINARY TREES IS HAMILTONIAN.
J. Lucas.
[Princeton University. Department of Computer Science. CS-TR-021-86.
1986.]
105884 USING RESIDUE ARITHMETIC TO SIMPLIFY VLSI PROCESSOR ARRAYS FOR
DYNAMIC PROGRAMMING.
R. J. Lipton and D. Lopresti.
[Princeton University. Department of Computer Science. CS-TR-022-86.
1986.]
105885 A WEINBERGER ARRAY GENERATOR.
W. W. Lin, S. S. Yeh, and A. S. LaPaugh.
[Princeton University. Department of Computer Science. CS-TR-023-86.
1986.]
105886 PERMUTATIONS ON SUPERPOSED PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-024-86.
1986. Version 2: May 1986.]
105887 INTERSECTION OF CONVEX OBJECTS IN TWO AND THREE DIMENSIONS.
B. Chazelle and D. P. Dobkin.
[Princeton University. Department of Computer Science. CS-TR-025-86.
1986.]
105888 COMPARING LONG STRINGS ON A SHORT SYSTOLIC ARRAY.
R. J. Lipton and D. Lopresti.
[Princeton University. Department of Computer Science. CS-TR-026-86.
1986.]
105889 PRACTICAL VARIATIONS OF SHELLSORT.
J. Incerpi and R. Sedgewick.
[Princeton University. Department of Computer Science. CS-TR-027-86.
1986.]
105890 RELIABLE SCHEDULING IN A TMR DATABASE SYSTEM.
F. M. Pittelli and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-028-86.
1986.]
105891 DISTRIBUTED COMPUTING RESEARCH AT PRINCETON - 1985.
[Princeton University. Department of Computer Science. CS-TR-029-86.
1986. Researchers: R. Abbott, R. Alonso, D. Barbara, R. Cordon, H.
Garcia-Molina, P. Goldman, M. Karol, J. Kent, B. Kogan, F. Pitteli,
P. Potrebic, S. Scheatz, P. Simpson, A. Spauster, M. Sotessl, S.
Verdu.]
105892 OPTIMIZATION OF ONE BIT FULL ADDERS EMBEDDED IN REGULAR STRUCTURES.
K. Iwano and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-031-86.
1986.]
105893 A NEW APPROACH TO FAST CONTROL OF PERMUTATION NETWORKS.
B. W. Arden and A. Youssef.
[Princeton University. Department of Computer Science. CS-TR-032-86.
1986.]
105894 THE OPTIMAL UNIFORM SCHEDULES OF ARBITRARY STATIC PERMUTATIONS ON
SUPERPOSED PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-033-86.
1986.]
105895 CRASH RECOVERY MECHANISMS FOR MAIN STORAGE DATABASE SYSTEMS.
K. Salem and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-034-86.
1986.]
105896 THE DESIGN OF LOAD BALANCING STRATEGIES FOR DISTRIBUTED SYSTEMS.
R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-035-86.
1986.]
105897 MASSIVE MEMORY MEANS MASSIVE PERFORMANCE.
A. Park.
[Princeton University. Department of Computer Science. CS-TR-036-86.
1986.]
105898 PROTOCOLS FOR DYNAMIC VOTE REASSIGNMENT.
D. Barbara, H. Garcia-Molina, and A. Spauster.
[Princeton University. Department of Computer Science. CS-TR-037-86.
1986.]
105899 THREE PARTITION REFINEMENT ALGORITHMS.
R. Paige and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-038-86.
1986.]
105900 LINEAR TIME ALGORITHMS FOR VISIBILITY AND SHORTEST PATH PROBLEMS
INSIDE SIMPLE POLYGONS.
L. Guibas et al.
[Princeton University. Department of Computer Science. CS-TR-039-86.
1986.]
105901 K-WAY BITONIC SORT.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-040-86.
1986.]
105902 BUS PARTITIONABILITY AND PARALLEL PERMUTATIONS.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-041-86.
1986.]
105903 ARRAY ACCESS BOUNDS FOR BLOCK STORAGE MEMORY SYSTEMS.
A. Park, K. Balasubramanian, and R. J. Lipton.
[Princeton University. Department of Computer Science. CS-TR-042-86.
1986.]
105904 ACHIEVING HIGH AVAILABILITY IN DISTRIBUTED DATABASES.
H. Garcia-Molina and B. Kogan.
[Princeton University. Department of Computer Science. CS-TR-043-86.
1986.]
105905 SOLITON PHASE SHIFTS IN A DISSIPATIVE LATTICE.
N. Islam and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-044-86.
1986.]
105906 GARBAGE COLLECTION CAN BE FASTER THAN STACK ALLOCATION.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-045-86.
1986.]
105907 OPTIMAL PARALLEL SORTING ON A LINEAR PROCESSOR ARRAY.
A. Park and K. Balasubramanian.
[Princeton University. Department of Computer Science. CS-TR-046-86.
1986.]
105908 RELIABLE DISTRIBUTED DATABASE MANAGEMENT.
H. Garcia-Molina and R. K. Abbott.
[Princeton University. Department of Computer Science. CS-TR-047-86.
1986.]
105909 IMPROVED SORTING ALGORITHMS FOR PARALLEL COMPUTERS.
A. Park and K. Balasubramanian.
[Princeton University. Department of Computer Science. CS-TR-048-86.
1986.]
105910 ONE-PROCESSOR SCHEDULING OF TASKS WITH PREFERRED STARTING TIMES.
M. R. Garey, R. E. Tarjan, and G. T. Wilfong.
[Princeton University. Department of Computer Science. CS-TR-049-86.
1986.]
105911 A NEW APPROACH TO THE MAXIMUM FLOW PROBLEM.
A. V. Goldberg and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-050-86.
1986.]
105912 DECOMPOSITION AND INTERSECTION OF SIMPLE SPLINEGONS.
D. P. Dobkin, D. L. Souvaine, and C. J. Van Wyk.
[Princeton University. Department of Computer Science. CS-TR-051-86.
1986.]
105913 A O(N LOG LOG N)-TIME ALGORITHM FOR TRIANGULATING SIMPLE POLYGONS.
R. E. Tarjan and C. J. Van Wyk.
[Princeton University. Department of Computer Science. CS-TR-052-86.
1986.]
105914 A SEMIRING ON CONVEX POLYGONS AND ZERO-SUM CYCLE PROBLEMS.
K. Iwano and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-053-86.
1986.]
105915 ROBUST CONTOUR TRACING.
D. P. Dobkin, W. P. Thurston, and A. R. Wilks.
[Princeton University. Department of Computer Science. CS-TR-054-86.
1986.]
105916 LOWER BOUNDS ON THE COMPLEXITY OF MULTIDIMENSIONAL SEARCHING.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-055-86.
1986.]
105917 INCREASING AVAILABILITY UNDER MUTUAL EXCLUSION CONSTRAINTS WITH
DYNAMIC VOTE REASSIGNMENT.
D. Barbara, H. Garcia-Molina, and A. Spauster.
[Princeton University. Department of Computer Science. CS-TR-056-86.
1986.]
105918 PROVIDING FAULT TOLERANCE IN PARALLEL SECONDARY STORAGE SYSTEMS.
A. Park and K. Balasubramanian.
[Princeton University. Department of Computer Science. CS-TR-057-86.
1986.]
105919 FINDING THE OPTIMAL VARIABLE ORDERING FOR BINARY DECISION DIAGRAMS.
S. J. Friedman and K. J. Supowit.
[Princeton University. Department of Computer Science. CS-TR-058-86.
1986.]
105920 RECOGNIZING CIRCLE GRAPHS IN POLYNOMIAL TIME.
C. P. Gabor, W.-L. Hsu, and K. J. Supowit.
[Princeton University. Department of Computer Science. CS-TR-059-86.
1986.]
105921 OPTIMAL PERMUTATIONS ON SUPERPOSED PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-060-86.
1986.]
105922 MORE PARALLELISM INTO THE MONTE CARLO SOLUTION OF PARTIAL
DIFFERENTIAL EQUATIONS.
B. W. Arden and A. S. Youssef.
[Princeton University. Department of Computer Science. CS-TR-061-86.
1986.]
105923 LINEAR SPACE DATA STRUCTURES FOR TWO TYPES OF RANGE SEARCH.
B. Chazelle and H. Edelsbrunner.
[Princeton University. Department of Computer Science. CS-TR-062-86.
1986.]
105924 BITONIC SORTING ON SUPERPOSED PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-063-86.
1986.]
105925 MAINTAINING AVAILABILITY OF REPLICATED DATA IN A DYNAMIC FAILURE
ENVIRONMENT.
D. Barbara, H. Garcia-Molina, and B. Kogan.
[Princeton University. Department of Computer Science. CS-TR-064-86.
1986.]
105926 DATA CACHING IN AN INFORMATION RETRIEVAL SYSTEM.
H. Garcia-Molina et al.
[Princeton University. Department of Computer Science. CS-TR-065-86.
1986.]
105927 PLANARITY TESTING OF DOUBLY PERIODIC INFINITE GRAPHS.
K. Iwano and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-066-86.
1986.]
105928 MODELS AND MEASUREMENTS OF FILE SYSTEM PERFORMANCE.
A. Park and R. J. Lipton.
[Princeton University. Department of Computer Science. CS-TR-067-86.
1986.]
105929 OPTIMAL COMPACTION OF MULTIPLE TWO COMPONENT CHANNELS UNDER RIVER
ROUTING.
F. L. Heng and A. S. LaPaugh.
[Princeton University. Department of Computer Science. CS-TR-068-86.
1986.]
105930 DESIGNING ALGORITHMS.
R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-069-86.
1986.]
105931 DATA APPROXIMATION BY SPLINES IN ONE AND TWO INDEPENDENT VARIABLES.
M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 77/86. 1986.]
105932 THE IMPORTANCE OF TIME IN THE SPECIFICATION OF OSI PROTOCOLS: AN
OVERVIEW AND BRIEF SURVEY OF THE FORMALISMS.
B. Cohen, D. H. Pitt, and J. C. P. Woodcock.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 78/86. 1986.]
105933 AUTOMATIC SHAPE PARAMETRISATION IN MACHINE VISION.
V. F. Leavers and J. F. Boyce.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 79/86. 1986.]
105934 CALCULATION OF THE EFFECT OF A POINT IMPACT ON AN INFINITE ELASTIC
PLATE ADJACENT TO A SEMI-INFINITE FLUID.
A. G. P. Warham.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 80/86. 1986.]
105936 POOPS: OBJECT ORIENTED PROGRAMMING IN PROLOG.
J. G. Vaucher and G. Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 565. 1986.]
105939 REDUCED REACHABILITY ANALYSIS OF COMMUNICATION PROTOCOLS: A NEW
APPROACH.
Z. Zhao and G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 570. 1986.]
105940 AN ALGEBRAIC MODEL FOR ASYNCHRONOUS CIRCUITS VERIFICATION.
C. Berthet and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 571. 1986. Revised: December 1986.]
105941 APPLICATION LAYER TESTING AND ASN1 SUPPORT TOOLS.
G. v. Bochmann, M. Deslaurier, and S. Bessette.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 572. 1986.]
105942 DERIVING PROTOCOL SPECIFICATIONS FROM SERVICE SPECIFICATIONS: AN
EXTENDED ALGORITHM.
R. Gotzhein and G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 574. 1986.]
105943 USER INTERFACE FOR AN OBJECT ORIENTED VLSI CAD SYSTEM.
S. Pothier and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 575. 1986.]
105944 SWITCH-LEVEL SIMULATION WITH LINEAR AND MAGNITUDE NETWORK MODELS.
E. Cerny and N. C. Rumin.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 576. 1986.]
105947 AN INTEGRATED VLSI DESIGN SYSTEM WITH SYMBOLIC LAYOUT TOOLS.
L.-P. Demers et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 585. 1986.]
105949 SPECIFICATION AND VERIFICATION OF SERVICES AND SYSTEM BEHAVIOR AS
APPLIED TO A BUFFER MANAGEMENT SYSTEM.
R. Gotzhein and S. Keramidis.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 588. 1986.]
105951 FAULT ANALYSIS IN SWITCH-LEVEL NETWORKS BY IMPLICIT ENUMERATION.
M. Aboulhamid et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 592. 1986.]
105953 CHESHIRE: AN OBJECT-ORIENTED INTEGRATION OF VLSI CAD TOOLS.
L.-P. Demers et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 595. 1986.]
105954 METHODS AND TOOLS FOR THE DESIGN AND VALIDATION OF PROTOCOL
SPECIFICATIONS AND IMPLEMENTATIONS.
G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 596. 1986.]
105955 OPTIMAL BLOCK REPLACEMENT POLICIES WITH MULTIPLE CHOICE AT FAILURE.
D. Ait and R. Cleroux.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 597. 1986.]
105956 HIERARCHICAL MULTI-NETWORK INTERCONNECTION USING PUBLIC DATA NETWORKS.
C. Kawa and G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 598. 1987.]
105957 THE INSTITUTE FOR LANGUAGE, LOGIC AND INFORMATION (ITLI).
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). ITLI prepublication series, no. 86-01. 1986.]
105958 A SEMANTICAL MODEL FOR INTEGRATION AND MODULARIZATION OF RULES.
P. van Emde Boas.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). ITLI prepublication series, no. 86-02. 1986.]
105959 CATEGORIAL GRAMMAR AND LAMBDA CALCULUS.
J. van Benthem.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). ITLI prepublication series, no. 86-03. 1986.]
105960 A RELATIONAL FORMULATION OF THE THEORY OF TYPES.
R. Muskens.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). ITLI prepublication series, no. 86-04. 1986.]
105961 SOME COMPLETE LOGICS FOR BRANCHED TIME. PART I: WELL-FOUNDED TIME,
FORWARD LOOKING OPERATORS.
K. A. Bowen and D. H. J. de Jongh.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). ITLI prepublication series, no. 86-05. 1986.]
054280 BINARY SPACE PARTITIONING FOR PREVIEWING UNIGRAFIX SCENES.
Z. Gigus.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/280. 1985.]
054282 HIDDEN FEATURE REMOVAL AND DISPLAY OF INTERSECTING OBJECTS IN
UNIGRAFIX.
N. Gal.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/282. 1986.]
054283 ALANA: AUGMENTABLE LANGUAGE ANALYZER.
C. A. Cox.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/283. 1986.]
054284 PARTITIONING POLYHEDRAL OBJECTS INTO NON-INTERSECTING PARTS.
M. Segal.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/284. 1986.]
054285 TRANSISTOR SIZING.
J. Pincus.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/285. 1986. Thesis (M.S.).]
054286 CELL DESIGN IN PROLOG.
A. A. Butt.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/286. 1986.]
054287 THE DESIGN AND EVALUATION OF A HIGH PERFORMANCE SMALLTALK SYSTEM.
D. M. Ungar.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/287. 1986. Thesis (Ph.D.).]
054288 EVERYTHING YOU EVER WANTED TO KNOW ABOUT "AN INTRODUCTION TO
COMPUTERS."
D. A. Patterson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/288. 1986.]
054289 THE MEMORY ARCHITECTURE AND THE CACHE AND MEMORY MANAGEMENT UNIT FOR
THE FAIRCHILD CLIPPER PROCESSOR.
J. Cho, A. J. Smith, and H. Sachs.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/289. 1986.]
054290 CPU CACHE CONSISTENCY WITH SOFTWARE SUPPORT AND USING "ONE TIME
IDENTIFIERS."
A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/290. 1986.]
054291 AN OBSTACLE-AVOIDING ROUTER FOR CUSTOM VLSI.
G. T. Hamachi.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/291. 1986. Thesis (Ph.D.).]
054292 A BROWSER FOR DIRECTED GRAPHS.
L. A. Rowe et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/292. 1986.]
054293 CLUSTER: AN APPROACH TO CONTEXTUAL LANGUAGE UNDERSTANDING.
Y. Arens.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/293. 1986. Thesis (Ph.D.).]
054294 SOME PROBLEMS AND PROPOSALS FOR KNOWLEDGE REPRESENTATION.
R. Wilensky.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/294. 1986.]
054295 KNOWLEDGE-BASED DISTRIBUTED SYSTEMS MANAGEMENT.
J. Pasquale.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/295. 1986. Also issued as PROGRES report 86.1, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054296 QUERY OPTIMIZATION IN DISTRIBUTED DATABASES THROUGH LOAD BALANCING.
R. Alonso.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/296. 1986. Thesis (Ph.D.). Also issued as PROGRES report
86.2, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054297 SMALLTALK-80 TO SOAR CODE.
W. R. Bush.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/297. 1986.]
054298 AN EXPERIMENTAL ASSESSMENT OF RESOURCE QUEUE LENGTHS AS LOAD INDICES.
S. Zhou.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/298. 1986. Also issued as PROGRES report 86.3, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054299 THE NETWORK EVENT MANAGER.
Y.-F. Chen, A. Prakash, and C. V. Ramamoorthy.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/299. 1986.]
054300 THE C INFORMATION ABSTRACTOR.
Y.-F. Chen and C. V. Ramamoorthy.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/300. 1986.]
054301 VIRTUAL MEMORY FOR THE SPRITE OPERATING SYSTEM.
M. N. Nelson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/301. 1986.]
054302 THE SPRITE REMOTE PROCEDURE CALL SYSTEM.
B. B. Welch.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 86/302. 1986.]
054303 UC - A PROGRESS REPORT.
R. Wilensky et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/303. 1986.]
054304 ISSUES IN ADAPTIVE PLANNING.
R. Alterman.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/304. 1986.]
054305 A TRACE-DRIVEN SIMULATION STUDY OF DYNAMIC LOAD BALANCING.
S. Zhou.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/305. 1986. Also issued as PROGRES report 86.4, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054306 A GREEDY HEURISTIC FOR THE RECTILINEAR STEINER TREE PROBLEM.
M. Bern and M. de Carvalho.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/306. 1986.]
054307 THE SPUR INSTRUCTION UNIT: AN ON-CHIP INSTRUCTION CACHE MEMORY FOR A
HIGH PERFORMANCE VLSI MULTIPROCESSOR.
R. R. Duncombe.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/307. 1986.]
054308 SPUR COPROCESSOR INTERFACE DESCRIPTION.
P. M. Hansen and S. I. Kong.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/308. 1986.]
054309 FAST PARALLEL ALGORITHMS FOR FINDING HAMILTONIAN PATHS AND CYCLES IN
A TOURNAMENT.
D. Soroker.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/309. 1986.]
054310 THE COMPLEXITY OF PARALLEL SEARCH.
R. M. Karp, E. Upfal, and A. Wigderson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/310. 1986.]
054311 FUNCTIONAL SPECIFICATION AND SIMULATION OF A FLOATING POINT
CO-PROCESSOR FOR SPUR [1].
G. D. Adams.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/311. 1986.]
054312 RANDOMIZED ROUNDING AND DISCRETE HAM-SANDWICH THEOREMS: PROVABLY GOOD
ALGORITHMS FOR ROUTING AND PACKING PROBLEMS.
P. Raghavan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/312. 1986.]
054313 INTERPOLATING PATCHES BETWEEN CUBIC BOUNDARIES.
L. Longhi.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/313. 1986.]
054314 SPECIAL OR GENERAL-PURPOSE HARDWARE FOR PROLOG: A COMPARISON.
G. Borriello et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/314. 1986.]
054316 GNU EMACS TEX MODE - VERSION 1.5.
P. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/316. 1986.]
054317 GNU EMACS BIBTEX MODE - VERSION 1.5.
P. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/317. 1986.]
054318 DATA PATH DESIGN CONSIDERATIONS FOR A HIGH PERFORMANCE VLSI
MULTIPROCESSOR.
D. Lee.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/318. 1986. Thesis (M.S.).]
054319 SYMMETRIC INTERPOLATION OF TRIANGULAR AND QUADRILATERAL PATCHES
BETWEEN CUBIC BOUNDARIES.
L. A. Shirman.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/319. 1986.]
054320 DEFERRED DATA STRUCTURING.
R. M. Karp, R. Motwani, and P. Raghavan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/320. 1986.]
054321 PROCEDURAL SPLINE INTERPOLATION IN UNICUBIX.
C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/321. 1986.]
054322 A GREMLIN TUTORIAL FOR THE SUN WORKSTATION.
M. Opperman, J. Thompson, and Y.-F. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/322. 1986.]
054323 VLSI DESIGN STRATEGIES.
C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/323. 1987.]
054324 DESIGN AND LAYOUT GENERATION AT THE SYMBOLIC LEVEL.
C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/324. 1987.]
054325 FAULT TOLERANT VLSI MULTICOMPUTERS.
C. H. Sequin and Y. Tamir.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/325. 1987.]
054326 COLLABORATIVE SYSTEMS AND MULTI-USER INTERFACES: COMPUTER-BASED TOOLS
FOR COOPERATIVE PROBLEM SOLVING.
G. Foster.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/326. 1986. Thesis (Ph.D.).]
054327 TUTORIAL ON THE C INFORMATION ABSTRACTION SYSTEM.
M. Nishimoto and Y.-F. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/327. 1987.]
054328 A BASIS FOR SECURE COMMUNICATION IN LARGE DISTRIBUTED SYSTEMS.
D. P. Anderson and P. V. Rangan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/328. 1987. Also issued as PROGRES report 86.5, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054329 THE FAIRCHILD CLIPPER: INSTRUCTION SET ARCHITECTURE AND PROCESSOR
IMPLEMENTATION.
W. Hollingsworth, H. Sachs, and A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/329. 1987.]
054330 ON NEGATIONS AND ALGEBRAS IN FUZZY SET THEORY.
F. Esteva.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/330. 1986.]
054331 REPRESENTATION OF FUZZY SYMMETRIC RELATIONS.
L. Valverde and S. V. Ovchinnikov.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/331. 1986.]
054332 REPRESENTATION THEOREMS FOR SYMMETRIC AND INTUITIONISTIC ALGEBRAS BY
CLASSICAL SETS.
F. Esteva.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/332. 1986.]
054333 FUZZY QUERIES WITH LINGUISTIC QUANTIFIERS FOR INFORMATION RETRIEVAL
FROM DATA BASES.
M. Uszynski.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/333. 1986.]
054334 USING EXPERT SYSTEMS TO MANAGE DISTRIBUTED COMPUTER SYSTEMS.
J. Pasquale.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/334. 1987. Also issued as PROGRES report 86.6, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054335 DECAYING CONFIDENCE FUNCTIONS FOR AGING KNOWLEDGE IN EXPERT SYSTEMS.
J. Pasquale.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/335. 1987. Also issued as PROGRES report 86.9, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054336 AN EXPERIMENTAL STUDY OF LOAD BALANCING PERFORMANCE.
S. Zhou and D. Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/336. 1987. Also issued as PROGRES report 86.8, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054337 THE ACCURACY OF THE CLOCK SYNCHRONIZATION ACHIEVED BY TEMPO IN
BERKELEY UNIX 4.3BSD.
R. Gusella and S. Zatti.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/337. 1987. Also issued as PROGRES report 86.7, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054338 THE DASH PROJECT: ISSUES IN THE DESIGN OF VERY LARGE DISTRIBUTED
SYSTEMS.
D. P. Anderson et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/338. 1987. Also issued as PROGRES report 86.10, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054339 UNIFIED THEORY OF INFERENCE FOR TEXT UNDERSTANDING.
P. Norvig.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/339. 1987. Thesis (Ph.D).]
054340 RECOVERING THREE DIMENSIONAL SHAPE FROM A SINGLE IMAGE OF CURVED
OBJECTS.
J. Malik.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/340. 1987.]
105962 SET CONTAINMENT INFERENCE.
P. Atzeni and D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-860012. 1986.]
105963 RESPONSE TIME AND PARALLELISM IN PARALLEL PROCESSING SYSTEMS WITH
CERTAIN SYNCHRONIZATION CONSTRAINTS.
A. Belghith.
[University of California, Los Angeles. Computer Science Department.
CSD-860015. 1986. Thesis (Ph.D.).]
105964 FORMAL PROPERTIES OF PROBABILISTIC DEPENDENCIES AND THEIR GRAPHICAL
REPRESENTATIONS.
J. Pearl and T. Verma.
[University of California, Los Angeles. Computer Science Department.
CSD-860019. 1986. "Extended abstract."]
105965 LEGITIMIZING CAUSAL REASONING IN DEFAULT LOGICS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860020. 1986. Also issued as R-69, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105966 EVIDENTIAL REASONING USING STOCHASTIC SIMULATION OF CAUSAL MODELS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860021. 1986. Also issued as R-68-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
105967 THE CYCLE-CUTSET METHOD FOR IMPROVING SEARCH PERFORMANCE IN AI
APPLICATIONS.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860022. 1986. Also issued as R-67, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105968 DISTRIBUTED DIAGNOSIS OF SYSTEMS WITH MULTIPLE FAULTS.
H. Geffner and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860023. 1986. Also issued as R-66, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105969 MARKOV AND BAYES NETWORKS: A COMPARISON OF TWO GRAPHICAL
REPRESENTATIONS OF PROBABILISTIC KNOWLEDGE.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-860024. 1986. Also issued as R-46, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
105970 SYMBOLIC STRUCTURAL TRANSFORMATIONS AND COMPILATION TECHNIQUES FOR FP.
J. N. C. Arabe.
[University of California, Los Angeles. Computer Science Department.
CSD-860025. 1986.]
105971 A DYNAMIC MEMORY MANAGEMENT POLICY FOR FP.
J. Alkalaj, M. D. Ercegovac, and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-860026. 1986.]
105972 STATIC ALLOCATION FOR A DATA FLOW MULTIPROCESSOR SYSTEM.
T. M. Ravi et al.
[University of California, Los Angeles. Computer Science Department.
CSD-860028. 1986.]
105973 A COMPLEXITY THEORY BASED ON INFINITELY OFTEN CONDITIONS.
J. D. P. Rolim.
[University of California, Los Angeles. Computer Science Department.
CSD-860029. 1986. Thesis (Ph.D.).]
105974 MULTIPROCESSOR SIMULATION OF THE DYNAMICS OF SPACE STRUCTURES.
S. Dimitriadis.
[University of California, Los Angeles. Computer Science Department.
CSD-860030. 1986. Thesis (Ph.D.).]
105975 ON LINE SCHEME FOR COMPUTING ROTATION FACTORS.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-860031. 1986.]
105976 AN APPROACH TO COMPILER CORRECTNESS USING INTERPRETATION BETWEEN
THEORIES.
B. H. Levy.
[University of California, Los Angeles. Computer Science Department.
CSD-860032. 1986. Thesis (Ph.D.).]
105977 RESPONSE TIME IN PARALLEL PROCESSING SYSTEMS WITH CERTAIN
SYNCHRONIZATION CONSTRAINTS.
A. Belghith.
[University of California, Los Angeles. Computer Science Department.
CSD-860033. 1986.]
105978 DISTRIBUTED ALGORITHMS FOR MULTI-CHANNEL BROADCAST NETWORKS.
J. M. Marberg.
[University of California, Los Angeles. Computer Science Department.
CSD-860034. 1986. Thesis (Ph.D.).]
105979 CONCURRENCY IN SYSTEMS WITH NEIGHBORHOOD CONSTRAINTS.
V. C. Barbosa.
[University of California, Los Angeles. Computer Science Department.
CSD-860035. 1986. Thesis (Ph.D.).]
105980 LAYOUT FROM A TOPOLOGICAL DESCRIPTION.
M. D. F. Schlag.
[University of California, Los Angeles. Computer Science Department.
CSD-860039. 1986. Thesis (Ph.D.).]
105981 DISTRIBUTED DATA BASE MANAGEMENT FOR REAL-TIME BMD APPLICATIONS.
FINAL REPORT FOR PERIOD: MAY 29, 1985 TO MAY 28, 1986.
W. W. Chu et al.
[University of California, Los Angeles. Computer Science Department.
CSD-860040. 1986.]
105982 COMPILER CONSIDERATIONS AND RUN-TIME STORAGE MANAGEMENT FOR A
FUNCTIONAL PROGRAMMING SYSTEM.
J. N. C. Arabe.
[University of California, Los Angeles. Computer Science Department.
CSD-860041. 1986. Thesis (Ph.D.).]
105983 MULTIPLE STRONGLY TYPED EVALUATION PHASES: A PROGRAMMING LANGUAGE
NOTION.
D. Booth.
[University of California, Los Angeles. Computer Science Department.
CSD-860042. 1986. Thesis (Ph.D.).]
105984 SORTING IN CONSTANT NUMBER OF ROW AND COLUMN PHASES ON A MESH.
J. M. Marberg and E. Gafni.
[University of California, Los Angeles. Computer Science Department.
CSD-860043. 1986.]
105985 ROUTING, FLOW CONTROL AND FAIRNESS IN COMPUTER NETWORKS.
H.-W. Chan.
[University of California, Los Angeles. Computer Science Department.
CSD-860067. 1986. Thesis (Ph.D.).]
105986 THE QUALITATIVE PROCESS ENGINE.
K. D. Forbus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1288. 1986.]
105987 THE LOGIC OF OCCURRENCE.
K. D. Forbus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1300. 1986.]
105988 DIFFERENTIAL-ALGEBRAIC EQUATION INDEX TRANSFORMATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1314. 1986.]
105989 CONCEPT ACQUISITION FROM EXAMPLES: MEASUREMENT OF SYSTEM PERFORMANCE
AND SUGGESTION FOR IMPROVED DESIGN.
L. Rendell, P. Benedict, and H. Cho.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1315. 1987.]
105990 COMPLETENESS RESULTS FOR CONFLICT-FREE VECTOR REPLACEMENT SYSTEMS.
R. R. Howell and L. E. Rosier.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-21. 1986.]
105991 EVALUATION OF PARALLEL PROGRAMMING LANGUAGES.
M. K. McShea.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-22. 1986.]
105992 IMPROVED WORLD SPACE RENDERING.
G. C. Fossum.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-23. 1986.]
105993 IMPLEMENTATION CONCEPTS FOR AN EXTENSIBLE DATA MODEL AND DATA
LANGUAGE.
D. S. Batory and T. Y. Leung.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-24. 1986.]
105994 REDUCING LINEAR RECURSION TO TRANSITIVE CLOSURE.
L. Ness.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-25. 1986.]
105995 ILMON: A UNIX NETWORK MONITORING FACILITY.
L. Barnett and M. K. Molloy.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-26. 1986.]
105996 THE DESIGN OF NON 1NF RELATIONAL DATABASES INTO NESTED NORMAL FORM.
M. A. Roth and H. F. Korth.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-27. 1986.]
105997 CONSERVATIVE METHODS FOR SINGULAR PERTURBATION PROBLEMS ON IRREGULAR
GRIDS.
L. Abrahamsson and B. Gustafsson.
[University of Uppsala. Department of Computer Science. Report no.
103. 1986.]
105998 ANALYSIS OF THE SOR ITERATION FOR THE 9-POINT LAPLACIAN.
L. M. Adams, R. J. LeVeque, and D. M. Young.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-81. 1986.]
105999 MULTIPLE STRONGLY TYPED EVALUATION PHASES.
D. Booth.
[University of Southern California. Information Sciences Institute.
RR-86-165. 1986.]
106000 DEVELOPING A SOFTWARE ENGINEERING METHODOLOGY FOR KNOWLEDGE-BASED
SYSTEMS.
R. J. K. Jacob and J. N. Froscher.
[United States. Naval Research Laboratory. NRL report 9019. 1986.]
106001 THE DESIGN OF THE LANGUAGE PROCESSOR GENERATOR HLP84.
K. Koskimies et al.
[University of Helsinki. Department of Computer Science. A-1986-4.
1986.]
106002 THE BETA PROGRAMMING LANGUAGE. PART 1: ABSTRACTION MECHANISMS. PART
2: MULTI-SEQUENTIAL EXECUTION.
B. B. Kristensen et al.
[1986. Draft: October 30, 1986. No issuing agency indicated (authors'
affiliations: Bent Bruun Kristensen, Aalborg University Centre. Ole
Lehrmann Madsen, Aarhus University. Birger Moller-Pedersen, Norwegian
Computing Center. Kristen Nygaard, Oslo University).]
106003 A SIMPLE APPROACH TO SPECIFYING CONCURRENT SYSTEMS.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 15. 1986.]
106004 ON THE TOPOLOGY OF ALGORITHMS, I.
S. Smale.
[n.d. No issuing agency indicated (author's address: Prof. Stephen
Smale, Department of Mathematics, University of California, Berkeley,
Calif. 94720).]
VOL. 9, NO. 5 05/20/87
106006 CHEM - A PROGRAM FOR TYPESETTING CHEMICAL DIAGRAMS: USER MANUAL.
J. L. Bentley, L. W. Jelinski, and B. W. Kernighan.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 122. 1986.]
106007 NON-PARAMETRIC DIGITIZATION ALGORITHMS.
J. D. Hobby.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 125. 1986.]
106008 PERFORMANCE TESTING OF MIXED-FONT, VARIABLE-SIZE CHARACTER
RECOGNIZERS.
S. W. Lam and H. S. Baird.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 126. 1986.]
106009 MAINTAINING CROSS REFERENCES IN MANUSCRIPTS.
A. V. Aho and R. Sethi.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 127. 1986.]
106010 TOOLS FOR PRINTING INDEXES.
J. L. Bentley and B. W. Kernighan.
[AT&T Bell Laboratories. Computer Science. Computing science
technical report 128. 1986.]
106011 DECLARATIVE PROGRAMMING LANGUAGES - AN OVERVIEW AND ASSESSMENT OF
MERITS.
F. Golshani.
[Arizona State University. Computer Science Department. TR-86-002.
1986.]
106012 ANALOGICAL REASONING BY INTELLIGENT ROBOTS.
N. V. Findler and L. N. Ihrig.
[Arizona State University. Computer Science Department. TR-86-003.
1986.]
106013 DESIGN AND IMPLEMENTATION OF A DISTRIBUTED OPERATING SYSTEM FOR
WORKSTATIONS CONNECTED BY A LOCAL AREA NETWORK.
B. R. Millard and D. S. Miller.
[Arizona State University. Computer Science Department. TR-86-006.
1986.]
106014 DYNAMIC HIERARCHICAL CONTROL FOR DISTRIBUTED PROBLEM SOLVING.
N. V. Findler and J. Gao.
[Arizona State University. Computer Science Department. TR-86-007.
1986.]
106015 LUCID BIBLIOGRAPHY.
D. DeForest.
[Arizona State University. Computer Science Department. TR-86-009.
1986.]
106016 KNOWLEDGE BASED SYSTEM FOR RELATIONAL NORMALIZATION OF GDBMS
CONCEPTUAL SCHEMAS.
A. Bayle and E. Ozkarahan.
[Arizona State University. Computer Science Department. TR-87-001.
1987. Revised edition.]
106017 A SCALABLE ARCHITECTURE FOR EXPLOITING DEMAND-DRIVEN AND DATA-DRIVEN
PARALLEL COMPUTATION.
A. A. Faustini, E. A. Ashcroft, and R. Jagannathan.
[Arizona State University. Computer Science Department. TR-87-002.
1987.]
106018 TWO PAPERS ON DYNAMIC HUFFMAN CODES.
J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-86-13. 1986. Revised: December 1986.]
106019 COMPLETE AND INFINITE TRACES: A DESCRIPTIVE MODEL OF COMPUTING AGENTS.
K. S. Van Horn.
[California Institute of Technology. Computer Science Department.
Report no. 5207:TR:86. 1986.]
106020 ASK IS TRANSPORTABLE IN HALF A DOZEN WAYS.
B. H. Thompson and F. B. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5214:TR:86. 1986.]
106021 HOW TO GET A LARGE NATURAL-LANGUAGE SYSTEM INTO A PERSONAL COMPUTER.
B. H. Thompson and F. B. Thompson.
[California Institute of Technology. Computer Science Department.
Report no. 5215:TR:86. 1986.]
106022 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 SEPTEMBER 1985 TO 15 MARCH 1986.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5220:TR:86. 1986. Principal investigator: Charles L.
Seitz. Faculty investigators: James T. Kajiya, Alain J. Martin,
Robert J. McEliece, Martin Rem, Charles L. Seitz.]
106023 THE SYNC MODEL: A PARALLEL EXECUTION METHOD FOR LOGIC PROGRAMMING.
P.-Y. P. Li and A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5221:TR:86. 1986.]
106024 DEADLOCK-FREE MESSAGE ROUTING IN MULTIPROCESSOR INTERCONNECTION
NETWORKS.
W. J. Dally and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5231:TR:86. 1986.]
106025 MEASURING TIME IN CM*.
T. H. Kong, A. Z. Spector, and D. P. Siewiorek.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-136. 1986.]
106026 MULTIRPC: A PARALLEL REMOTE PROCEDURE CALL MECHANISM.
M. Satyanarayanan and E. H. Siegel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-139. 1986.]
106027 ERROR MODELLING IN STEREO NAVIGATION.
L. Matthies and S. A. Shafer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-140. 1986.]
106028 GENERATING AN INTERPRETATION TREE FROM A CAD MODEL TO REPRESENT
OBJECT CONFIGURATION FOR BIN-PICKING TASKS.
K. Ikeuchi.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-144. 1986.]
106029 THE DIAMETER OF PERMUTATION GROUPS. FULLY PERSISTENT SEARCH TREES.
J. R. Driscoll.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-145. 1986. "This thesis comprises two disjoint topics: the
diameter of permutation groups and fully persistent search trees."]
106030 DYNAMIC QUORUM ADJUSTMENT FOR PARTITIONED DATA.
M. P. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-147. 1986.]
106031 A HISTORY MECHANISM AND UNDO/REDO/REUSE SUPPORT IN ALOE.
C. Linxi and A. N. Habermann.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-148. 1986.]
106032 PAST: A PROGRAM-SPECIFIC AND ARCHITECTURE-SPECIFIC SIMULATION TOOL.
B. S. Siegell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-149. 1986. M.S. Project report.]
106033 AXIOMS FOR CONCURRENT OBJECTS.
M. P. Herlihy and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-154. 1986.]
106034 REASONING ABOUT NETWORKS WITH MANY IDENTICAL FINITE-STATE PROCESSES.
E. M. Clarke, O. Grumberg, and M. C. Browne.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-155. 1986.]
106035 AN IMPROVED ALGORITHM FOR THE AUTOMATIC VERIFICATION OF FINITE STATE
SYSTEMS USING TEMPORAL LOGIC.
M. C. Browne.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-156. 1986.]
106036 A STRONG SEPARATION BETWEEN K AND K-1 ROUND COMMUNICATION COMPLEXITY
FOR A CONSTRUCTIVE LANGUAGE.
L. A. McGeoch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-157. 1986.]
106037 A PERFORMANCE EVALUATION OF THE INTEGRATION OF VIRTUAL MEMORY
MANAGEMENT AND INTER-PROCESS COMMUNICATION IN ACCENT.
R. P. Fitzgerald.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-158. 1986. Thesis (Ph.D.).]
106038 COMPILATION FOR A PROCESSOR CONTAINING PIPELINED REGISTER FILES.
A. Sussman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-161. 1986.]
106039 EXTENDING MULTIVERSION TIMESTAMPING PROTOCOLS TO EXPLOIT TYPE
INFORMATION.
M. P. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-163. 1986.]
106040 COMPETITIVE SNOOPY CACHING.
A. R. Karlin et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-164. 1986.]
106041 INDUSTRIAL MACHINE VISION: LESSONS AND CHALLENGES.
S. W. Holland and R. B. Tilove.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5617. 1987.]
106042 SILICON COMPILATION ENHANCES DESIGNER PRODUCTIVITY.
M. A. Majewski and S. Pichumani.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5654. 1987.]
106043 THE SONAR RING: OBSTACLE AVOIDANCE FOR AN AUTONOMOUS MOBILE ROBOT.
S. A. Walter.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5691. 1987.]
106044 AN AUTOMOTIVE ENGINEER'S GUIDE TO THE EFFECTIVE USE OF SCALAR,
VECTOR, AND PARALLEL COMPUTERS.
M. Ginsberg.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5736. 1987.]
106045 KABU-WAKE: A NEW PARALLEL INFERENCE METHOD AND ITS EVALUATION.
K. Kumon et al.
[Institute for New Generation Computer Technology (ICOT). TR-150.
1986.]
106046 FEATURES OF A META-UNIFICATION BASED LANGUAGE TALOS.
T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-151.
1985.]
106047 COMPUTATION BY META-UNIFICATION WITH CONSTRUCTORS.
T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-152.
1985.]
106048 PARALLEL CONTROL TECHNIQUES FOR DEDICATED RELATIONAL DATABASE ENGINES.
H. Itoh et al.
[Institute for New Generation Computer Technology (ICOT). TR-182.
1986.]
106049 COMPILING HORN CLAUSE QUERIES IN DEDUCTIVE DATABASES: A HORN CLAUSE
TRANSFORMATION APPROACH.
N. Miyazaki, H. Yokota, and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-183.
1986.]
106050 ON PARALLEL PROGRAMMING METHODOLOGY IN GHC.
K. Takahashi and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-184.
1986.]
106051 ALGORITHMIC DEBUGGING OF GHC PROGRAMS AND ITS IMPLEMENTATION IN GHC.
A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-185.
1986.]
106052 A FRAMEWORK FOR DEBUGGING GHC.
J. Lloyd and A. Takeuchi.
[Institute for New Generation Computer Technology (ICOT). TR-186.
1986.]
106053 A FRAMEWORK FOR INTERACTIVE PROBLEM SOLVING BASED ON INTERACTIVE
QUERY REVISION.
M. Ohki, A. Takeuchi, and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-188.
1986.]
106054 RESEARCH ACTIVITIES ON NATURAL LANGUAGE PROCESSING OF THE FGCS
PROJECT.
T. Yokoi et al.
[Institute for New Generation Computer Technology (ICOT). TR-190.
1986.]
106055 RESEARCH AND DEVELOPMENT ON KNOWLEDGE BASE SYSTEMS AT ICOT.
H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-191.
1986.]
106056 "KABU-WAKE" PARALLEL INFERENCE MECHANISM AND ITS EVALUATION.
H. Masuzawa et al.
[Institute for New Generation Computer Technology (ICOT). TR-193.
1986.]
106057 FACTORIZATION OF UNI-VARIATE POLYNOMIALS OVER FINITE FIELDS.
K. Yokoyama and T. Takeshima.
[Institute for New Generation Computer Technology (ICOT). TR-194.
1986.]
106058 TOWARD THE PARALLEL INFERENCE MACHINE.
S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TR-196.
1986.]
106059 TOWARD A HIGH PERFORMANCE PARALLEL INFERENCE MACHINE - THE
INTERMEDIATE STAGE PLAN OF PIM.
A. Goto and S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TR-201.
1986.]
106060 KNOWLEDGE ACQUISITION AND LEARNING IN CASE STUDIES OF EXPERT SYSTEM
DEVELOPMENT.
S. Kunifuji et al.
[Institute for New Generation Computer Technology (ICOT). TR-204.
1986.]
106061 GUARDED HORN CLAUSES: A PARALLEL LOGIC PROGRAMMING LANGUAGE WITH THE
CONCEPT OF A GUARD.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-208.
1986.]
106062 INTRODUCTION TO GUARDED HORN CLAUSES.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-209.
1986.]
106063 CURRENT RESEARCH STATUS OF PIM: PARALLEL INFERENCE MACHINE.
A. Goto and S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TM-0140.
1985.]
106064 GHC PROCESS FUSION BY PROGRAM TRANSFORMATION.
K. Furukawa and K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TM-0141.
1985.]
106065 MENDEL: A PROLOG BASED CONCURRENT OBJECT ORIENTED LANGUAGE.
S. Honiden, N. Uchihira, and T. Kasuya.
[Institute for New Generation Computer Technology (ICOT). TM-0144.
1985.]
106066 A PROOF CONSTRUCTOR FOR INTENSIONAL LOGIC - WITH S5 DECISION
PROCEDURE.
H. Sawamura.
[Institute for New Generation Computer Technology (ICOT). TM-0154.
1986.]
106067 TOWARD MECHANIZATION OF DEDUCTIVE, INDUCTIVE AND ABDUCTIVE INFERENCE.
K. Tsurumaki et al.
[Institute for New Generation Computer Technology (ICOT). TM-0158.
1986.]
106068 ON THE OPERATIONAL SEMANTICS OF GUARDED HORN CLAUSES.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TM-0160.
1986.]
106069 PARTIAL EVALUATION OF PROLOG PROGRAMS AND ITS APPLICATION TO META
PROGRAMMING.
A. Takeuchi and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TM-0164.
1986.]
106070 A LOGICAL TREATMENT OF SECONDARY STORAGE.
I. T. Foster and A. J. Kusalik.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/1. 1986.]
106071 A SEQUENTIAL IMPLEMENTATION OF PARLOG.
I. T. Foster et al.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/2. 1986.]
106072 USING NARROWING TO DO ISOLATION IN SYMBOLIC EQUATION SOLVING - AN
EXPERIMENT IN AUTOMATED REASONING.
A. J. J. Dick and R. J. Cunningham.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/3. 1986.]
106073 MODAL PROVABILITY INTERPRETATION FOR NEGATION BY FAILURE.
D. Gabbay.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/4. 1986. Second draft: April 1986.]
106074 LOGIC PROGRAMMING ENVIRONMENT.
F. G. McCabe et al.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/5. 1986.]
106075 HUMAN AND ORGANIZATIONAL FACTORS AND ENVIRONMENTS FOR INFORMATION
SYSTEM DESIGN.
C. Potts.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/6. 1986.]
106076 STRUCTURED COMMON SENSE: THE ELICITATION AND FORMALIZATION OF SYSTEM
REQUIREMENTS.
A. Finkelstein and C. Potts.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/7. 1986.]
106077 LLARMA IS MORE LOGICAL THAN YACC: A PROLOG PARSER-GENERATOR FOR
NATURAL LANGUAGE ANALYSIS.
J. V. Pitt and R. J. Cunningham.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/8. 1986.]
106078 LOGIC AND OBJECTS.
F. G. McCabe.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/9. 1986.]
106079 THE BRITISH NATIONALITY ACT AS A LOGIC PROGRAM.
M. J. Sergot et al.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/10. 1985.]
106080 AN APPLICATION OF GENERAL PURPOSE THEOREM-PROVING TO DATABASE
INTEGRITY.
F. Sadri and R. A. Kowalski.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/11. 1986.]
106081 DATABASE UPDATES IN THE EVENT CALCULUS.
R. A. Kowalski.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/12. 1986.]
106082 LOGIC-BASED TOOLS FOR BUILDING EXPERT AND KNOWLEDGE BASED SYSTEMS:
SUCCESSES AND FAILURES OF TRANSFERRING THE TECHNOLOGY.
P. Hammond.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/13. 1986.]
106083 META-LEVEL REASONING FOR DECLARATIVE CONTROL.
K. Eshghi.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/14. 1986.]
106084 MODAL AND TEMPORAL LOGIC PROGRAMMING.
D. Gabbay.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/15. 1986. Second draft: June 1986.]
106085 THE TREATMENT OF LOOPS IN LOGIC PROGRAMMING.
D. R. Brough and C. J. Hogger.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/16. 1986.]
106086 ADA FOR DISTRIBUTED SYSTEMS - A COMPILER INDEPENDENT APPROACH.
C. Atkinson and S. J. Goldsack.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/17. 1986.]
106087 A SAFE APPROACH TO PARALLEL COMBINATOR REDUCTION.
C. Hankin, G. Burn, and S. P. Jones.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/18. 1986.]
106088 THE FOSSIL EXPERT SYSTEM.
D. R. Brough and I. F. Alexander.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/19. 1985.]
106089 A SUMMARY OF IL, AN INTERMEDIATE PROGRAMMING LANGUAGE FOR BUILDING
MODULES.
M. R. Levy.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/20. 1986.]
106090 DOMAIN BASED ACCESS CONTROL FOR DISTRIBUTED COMPUTING SYSTEMS.
D. C. Robinson and M. S. Sloman.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/21. 1986.]
106091 GRAMMAR-RELATED TRANSFORMATIONS OF LOGIC PROGRAMS.
D. R. Brough and C. J. Hogger.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/22. 1986.]
106092 THREE RECENT APPROACHES TO TEMPORAL REASONING.
F. Sadri.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 86/23. 1986. Revised: November 1986.]
044053 THE LAWS OF OCCAM PROGRAMMING.
A. W. Roscoe and C. A. R. Hoare.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-53. 1986.]
044054 EXPLOITING PARALLELISM IN THE GRAPHICS PIPELINE.
T. A. Theoharis.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-54. 1986. Thesis (M.S.). "A dissertation submitted for the degree
of Master of Science in the University of Oxford, September 1985."]
044055 FUNCTIONAL PROGRAMMING WITH SIDE-EFFECTS.
M. B. Josephs.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-55. 1986. Thesis (Ph.D.). "A thesis submitted for the degree of
D.Phil at the University of Oxford, June 1986."]
044056 AN INTRODUCTION TO THE THEORY OF LISTS.
R. S. Bird.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-56. 1986.]
044057 THE PURSUIT OF DEADLOCK FREEDOM.
A. W. Roscoe and N. Dathi.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-57. 1986.]
044058 FORMAL METHODS APPLIED TO A FLOATING POINT NUMBER SYSTEM.
G. Barrett.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-58. 1987.]
044060 THE FORMAL SPECIFICATION OF A MICROPROCESSOR INSTRUCTION SET.
J. Bowen.
[Oxford University. Computing Laboratory. Programming Research Group.
PRG-60. 1987.]
106093 MINIMUM COST NETWORK FLOW PROBLEM ON SPANNING TREES AND 1-TREES.
B. Kalantari and I. Kalantari.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-87. 1987.]
106094 APPROXIMATING THE DIAMETER OF A SET OF POINTS IN THE EUCLIDEAN SPACE.
O. Egecioglu and B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-86. 1987.]
106095 REPRESENTATION SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE
STUDY USING N-QUEENS.
B. A. Nadel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-208. 1987.]
106096 DOMAIN ABSTRACTION AND LIMITED REASONING.
T. Imielinski.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-207. 1986.]
106097 COMPLEXITY OF QUERY PROCESSING IN THE DEDUCTIVE DATABASES WITH
INCOMPLETE INFORMATION.
T. Imielinski.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-206. 1986.]
106098 RELATIVE KNOWLEDGE IN A DISTRIBUTED DATABASE.
T. Imielinski.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-205. 1986.]
106099 ON THE SUPERMODULAR KNAPSACK PROBLEM.
G. Gallo and B. Simeone.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-202. 1986.]
106100 SOME FORMAL PROPERTIES OF VERSION SPACES.
A. Van der Mude.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-201. 1986.]
106101 AN EXPERT SYSTEMS METHODOLOGY FOR CONTROL AND INTERPRETATION OF
APPLICATIONS SOFTWARE.
C. V. Apte and S. M. Weiss.
[Rutgers. Department of Computer Science. Technical report
CBM-TR-149. 1986.]
106102 AUTOMATIC KNOWLEDGE BASE REFINEMENT FOR CLASSIFICATION SYSTEMS.
A. Ginsberg, S. M. Weiss, and P. Politakis.
[Rutgers. Department of Computer Science. Technical report
CBM-TR-148. 1986.]
106103 NYSTROEM'S ITERATIVE VARIANT METHODS FOR THE SOLUTION OF CAUCHY
SINGULAR INTEGRAL EQUATIONS.
A. Gerasoulis.
[Rutgers. Laboratory for Computer Science Research. Technical report
LCSR-TR-88. 1987.]
106104 THE ROLE OF EXPLICIT CONTEXTUAL KNOWLEDGE IN LEARNING CONCEPTS TO
IMPROVE PERFORMANCE.
R. M. Keller.
[Rutgers. Department of Computer Science. Technical report ML-TR-7.
1987. Thesis (Ph.D.).]
035313 A MACROSCOPIC PROFILE OF PROGRAM COMPILATION AND LINKING.
M. A. Linton and R. W. Quong.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-313. February 1987.]
035314 POST-GAME ANALYSIS - AN INITIAL EXPERIMENT FOR HEURISTIC-BASED
RESOURCE MANAGEMENT IN CONCURRENT SYSTEMS.
J. C. Yan.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-314. February 1987.]
035316 PERFORMANCE OF DEMAND ASSIGNMENT MULTIPLE ACCESS SCHEMES IN BROADCAST
BUS NETWORKS.
M. Fine.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-316. March 1987. Thesis (Ph.D.).]
035317 COMPARATIVE PERFORMANCE OF BROADCAST BUS LOCAL AREA NETWORKS WITH
VOICE AND DATA TRAFFIC.
T. A. Gonsalves.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-317. March 1987. Thesis (Ph.D.).]
035319 THOUGHPUT PERFORMANCE OF SPREAD SPECTRUM MULTIPLE ACCESS PACKET RADIO
NETWORKS.
J. S. Storey.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-319. March 1987. Thesis (Ph.D.).]
035320 PERFORMANCE EVALUATION OF MULTIHOP PACKET RADIO NETWORKS BY
SIMULATION.
D. H. Shur.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-320. March 1987. Thesis (Ph.D.).]
035321 CONCURRENT COMMUNICATION AMONG MULTI-TRANSCEIVER STATIONS OVER SHARED
MEDIA.
Y. Birk.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-321. March 1987. Thesis (Ph.D.).]
035322 CHANNEL ACCESS SCHEMES AND FIBER OPTIC CONFIGURATIONS FOR
INTEGRATED-SERVICES LOCAL AREA NETWORKS.
M. M. Nassehi.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-322. March 1987. Thesis (Ph.D.).]
035323 IMPROVING GARBAGE COLLECTOR PERFORMANCE IN VIRTUAL MEMORY.
R. A. Shaw.
[Stanford University. Computer Systems Laboratory. Technical report
CSL-TR-87-323. March 1987.]
038307 PREPRINTS.
[Stanford University. Center for Reliable Computing. Report no.
86-18. December 1986. "This technical report contains preprints of
papers to be presented at the IEEE Pheonix Conference on Computers
and Communications, Scottsdale, AZ, February 25-27, 1987." Also
issued as Technical note 86-307, Computer Systems Laboratory,
Stanford University.]
038308 DELAY TESTING OF DIGITAL CIRCUITS USING PSEUDORANDOM INPUT SEQUENCES.
K. D. Wagner.
[Stanford University. Center for Reliable Computing. Report no.
86-19. December 1986. Revised version of Center for Reliable
Computing report no. 86-12. Also issued as Technical note 86-308,
Computer Systems Laboratory, Stanford University.]
038309 A SURVEY OF CLOCK DISTRIBUTION TECHNIQUES IN HIGH-SPEED COMPUTER
SYSTEMS.
K. D. Wagner.
[Stanford University. Center for Reliable Computing. Report no.
86-20. December 1986. Also issued as Technical note 86-309, Computer
Systems Laboratory, Stanford University.]
038310 EFFECT OF SUPPLY VOLTAGE ON CIRCUIT PROPAGATION DELAY AND TEST
APPLICATIONS.
K. D. Wagner and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
86-21. December 1986. Also issued as Technical note 86-310, Computer
Systems Laboratory, Stanford University.]
038311 AN INVESTIGATION ON SWITCHING-RATE INDUCED ELECTROMIGRATION.
M. L. Cortes and R. K. Iyer.
[Stanford University. Center for Reliable Computing. Report no.
86-22. December 1986. Also issued as Technical note 86-311, Computer
Systems Laboratory, Stanford University.]
038312 PROPERTIES OF TRANSIENT ERRORS DUE TO POWER SUPPLY DISTURBANCES.
M. L. Cortes et al.
[Stanford University. Center for Reliable Computing. Report no.
86-23. December 1986. Also issued as Technical note 86-312, Computer
Systems Laboratory, Stanford University.]
038313 BIBLIOGRAPHY OF 1986 CRC PUBLICATIONS.
D. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 87-0.
January 1987. Also issued as Technical note 87-313, Computer Systems
Laboratory, Stanford University.]
038314 FUNCTIONAL TEST PATTERN GENERATION FOR RANDOM LOGIC.
J. Sakov and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 87-1.
February 1987. Also issued as Technical note 87-314, Computer Systems
Laboratory, Stanford University.]
038315 CIRCUIT SEGMENTATION FOR PSEUDO-EXHAUSTIVE TESTING VIA SIMULATED
ANNEALING.
I. Shperling and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 87-2.
February 1987. Also issued as Technical note 87-315, Computer Systems
Laboratory, Stanford University.]
038316 MINIMUM PHYSICAL REQUIREMENTS FOR PARALLEL ARITHMETIC EXPRESSION
EVALUATION: VECTOR INNER PRODUCT EVALUATION.
R. J. Meier Jr.
[Stanford University. Computer Systems Laboratory. Technical note
87-316. October 1986.]
038317 MINIMUM PHYSICAL REQUIREMENTS FOR PARALLEL EXECUTION OF THE
DECIMATION IN FREQUENCY FAST FOURIER TRANSFORM.
R. J. Meier Jr.
[Stanford University. Computer Systems Laboratory. Technical note
87-317. August 1986.]
038318 TEST SET GENERATION FOR PSEUDO-EXHAUSTIVE BIST.
J. G. Udell Jr.
[Stanford University. Center for Reliable Computing. Report no. 87-3.
February 1987. Also issued as Technical note 87-318, Computer Systems
Laboratory, Stanford University.]
038319 RECONFIGURABLE HARDWARE FOR PSEUDO-EXHAUSTIVE TEST.
J. G. Udell Jr.
[Stanford University. Center for Reliable Computing. Report no. 87-4.
February 1987. Also issued as Technical note 87-319, Computer Systems
Laboratory, Stanford University.]
038320 PREPRINTS.
[Stanford University. Center for Reliable Computing. Report no. 87-5.
March 1987. "This technical report contains [2] preprints." Also
issued as Technical note 87-320, Computer Systems Laboratory,
Stanford University.]
038321 SHORT PSEUDORANDOM TEST SEQUENCES.
E. J. McCluskey and K. D. Wagner.
[Stanford University. Center for Reliable Computing. Report no. 87-6.
February 1987. Also issued as Technical note 87-321, Computer Systems
Laboratory, Stanford University.]
038322 AN EXPERIMENT ON INTERMITTENT-FAILURE MECHANISMS.
M. L. Cortes and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 87-7.
March 1987. Also issued as Technical note 87-322, Computer Systems
Laboratory, Stanford University.]
106105 EIN ZUTEILUNGSMODELL FUER MULTIPROZESSOR-ECHTZEITSYSTEME.
G. Schrott.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8609. 1986.]
106106 DESCRIBING SEMANTIC DOMAINS WITH SPROUTS.
G. Schmidt, R. Berghammer, and H. Zierer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8611. 1986.]
106107 TRANSFORMING TEMPORAL LOGIC SPECIFICATIONS.
H. Schlingloff and F. Kroeger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8612. 1986.]
106108 EFFIZIENTE ALGORITHMEN FUER RELATIONALE DATENBANKSYSTEME MIT
REKURSION.
J. Heigert.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8613. 1986.]
106109 THE STEP FAILURE SEMANTICS.
D. Taubner and W. Vogler.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8614. 1986.]
106110 A TRANSFORMATIONAL DEVELOPMENT OF SEVERAL ALGORITHMS FOR TESTING THE
EXISTENCE OF CYCLES IN A DIRECTED GRAPH.
R. Berghammer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8615. 1986.]
106111 PARMOD: A LANGUAGE FOR PROGRAMMING WITH PARALLEL MODULES.
S. Eichholz.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8616. 1986.]
106112 TIME OPTIMAL LEFT TO RIGHT CONSTRUCTION OF POSITION TREES.
M. Kempf, R. Bayer, and U. Guentzer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8617. 1986.]
106113 LISP - PROLOG - YAPS (EINE VERGLEICHENDE UNTERSUCHUNG).
S. Bocionek.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8618. 1986.]
106114 SIMULIERTE ZEIT UND DAS ADA RENDEZVOUS.
W. Pohlmann.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8619. 1986.]
106115 ISSUES IN DISTRIBUTED PROGRAMMING LANGUAGES: THE EVOLUTION OF SR.
R. A. Olsson.
[University of Arizona. Department of Computer Science. TR 86-21.
1986. Thesis (Ph.D.).]
106116 PRESERVING CONTEXT INFORMATION IN AN IPC ABSTRACTION.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 86-23.
1986.]
106117 CLUSTER-BASED ADDRESSING IN AN INTERNET.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 86-24.
1986.]
106118 FLOW ANALYSIS OF A SIMPLE CLASS OF DYNAMIC LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 86-27.
1986.]
106119 PLISP: A LISP TO POSTSCRIPT COMPILER.
J. C. Peterson.
[University of Arizona. Department of Computer Science. TR 86-29.
1986.]
106120 AN INFORMATION-BASED METHODOLOGY FOR THE DESIGN OF CONCURRENT SYSTEMS.
M. J. Jipping.
[University of Iowa. Department of Computer Science. Technical report
86-01. 1986. Thesis (Ph.D.).]
106121 AN EXTENDED ABSTRACT DATA TYPE SPECIFICATION MECHANISM.
H. I. Mathkour.
[University of Iowa. Department of Computer Science. Technical report
86-02. 1986. Thesis (Ph.D.).]
106122 EXPERIMENTATION WITH AN ADAPTIVE SEARCH STRATEGY FOR SOLVING A
KEYBOARD DESIGN-CONFIGURATION PROBLEM.
D. E. Glover.
[University of Iowa. Department of Computer Science. Technical report
86-03. 1986. Thesis (Ph.D.).]
106123 DESIGNING AN OPERATING SYSTEM KERNEL BASED ON CONCURRENT GARBAGE
COLLECTION.
W. Pan.
[University of Iowa. Department of Computer Science. Technical report
86-04. 1986. Thesis (M.S.).]
106124 A COMPARISON OF CONCURRENCY CONTROL ALGORITHMS FOR DISTRIBUTED DATA
ACCESS.
B. C. Wenhardt.
[University of Iowa. Department of Computer Science. Technical report
86-05. 1986. Thesis (M.S.).]
106125 AN EXECUTION COST ANALYSIS OF MULTIPLE PROCESSOR JOIN METHODS.
R. Shultz and I. Miller.
[University of Iowa. Department of Computer Science. Technical report
86-06. 1986.]
106126 CONTROLLING TESTBED DATABASE CHARACTERISTICS.
R. Shultz.
[University of Iowa. Department of Computer Science. Technical report
86-07. 1986.]
106127 DYNAMIC BINDING OF SEPARATELY COMPILED OBJECTS UNDER PROGRAM CONTROL.
R. E. Gantenbein.
[University of Iowa. Department of Computer Science. Technical report
86-08. 1986. Thesis (Ph.D.).]
106128 A MODEL FOR MODULAR SYSTEM BUILDS BASED ON ATTRIBUTE GRAMMARS.
M. P. Pfreundschuh and R. Ford.
[University of Iowa. Department of Computer Science. Technical report
86-09. 1986.]
106129 MEMORY CAPACITY IN MULTIPLE PROCESSOR JOINS.
R. Shultz and I. Miller.
[University of Iowa. Department of Computer Science. Technical report
86-10. 1986.]
106130 A MODEL FOR BUILDING MODULAR SYSTEMS BASED ON ATTRIBUTE GRAMMARS.
M. P. Pfreundschuh.
[University of Iowa. Department of Computer Science. Technical report
86-11. 1986. Thesis (Ph.D.).]
106138 TOTALLY SELF-CHECKING CIRCUITS AND TESTABLE CMOS CIRCUITS.
N. K. Jha.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-51. 1986. Thesis (Ph.D.).]
106139 THE DESIGN AND SIMULATION OF A FAULT-TOLERANT INTERCONNECTION NETWORK
FOR MULTIPROCESSOR SYSTEMS.
A. Dugar.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-52. 1986. Thesis (M.S.).]
106140 WRAP: AN ALGORITHM FOR HIERARCHICAL COMPRESSION OF FAULT SIMULATION
PRIMITIVES.
J. F. Guzolek.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-53. 1986. Thesis (M.S.).]
106141 FAULT AND ERROR LATENCY UNDER REAL WORKLOAD - AN EXPERIMENTAL STUDY.
R. Chillarege.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-55. 1986. Thesis (Ph.D.).]
106142 PARALLEL TESTING FOR PATTERN SENSITIVE FAULTS IN SEMICONDUCTOR RANDOM
ACCESS MEMORY.
P. Mazumder and J. H. Patel.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-56. 1986.]
106143 DYNAMIC FAULT COLLAPSING IN FAULT SIMULATION.
S. J. Chandra.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-57. 1986. Thesis (M.S.).]
106144 ON THE C-TESTABILITY OF GENERALIZED COUNTERS.
A. Chatterjee and J. A. Abraham.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-58. 1986.]
106145 AUTOMATIC DETECTION OF ERROR PATTERNS IN COMPUTER SYSTEMS.
D. E. Sanders.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-59. 1986. Thesis (M.S.).]
106146 A PARALLEL SIMULATED ANNEALING ALGORITHM FOR STANDARD CELL PLACEMENT
ON A HYPERCUBE COMPUTER.
M. H. Jones.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-60. 1987. Thesis (M.S.).]
106147 A MEASUREMENT-BASED STUDY OF CONCURRENCY IN A MULTIPROCESSOR.
P. J. McGuire.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-61. 1987. Thesis (M.S.).]
106148 COMPLEXITIES OF LAYOUTS IN THREE-DIMENSIONAL VLSI CIRCUITS.
M. A. Aboelaze and B. W. Wah.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-63. 1987.]
106149 A KNOWLEDGE-BASED DESIGN AID FOR THE CONSTRUCTION OF SOFTWARE SYSTEMS.
M. D. Lubars.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1304. 1986. Thesis (Ph.D.).]
106150 EVIDENCE FOR A STRUCTURE-MAPPING THEORY OF ANALOGY AND METAPHOR.
D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-86-1316. 1986.]
106151 CONCEPTUAL KNOWLEDGE ACQUISITION IN SEARCH.
L. Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1317. 1987.]
106152 A METHOD FOR THE SPATIAL DISCRETIZATION OF PARABOLIC EQUATIONS IN ONE
SPACE VARIABLE.
R. D. Skeel and M. Berzins.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1319. 1987.]
106153 'COMPLETENESS' AND 'FULL PARALLELISM' OF PARALLEL LOGIC PROGRAMMING
SCHEMES.
L. V. Kale.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1321. 1987.]
106154 RECOVERY POINT SELECTION ON A REVERSE BINARY TREE TASK MODEL.
S. K. Chen, W. T. Tsai, and M. B. Thuraisingham.
[University of Minnesota. Computer Science Department. TR-86-43.
1987. Revised: January 1987.]
106155 A CHARACTERIZATION OF FAULT DIAGNOSABLE SYSTEMS.
V. Raghavan, S. Dong, and A. Tripathi.
[University of Minnesota. Computer Science Department. TR-86-49.
1986.]
106156 ON ASYNCHRONOUS RECOVERY PROTOCOLS FOR DISTRIBUTED SYSTEMS.
K. W. Hwang and W. T. Tsai.
[University of Minnesota. Computer Science Department. TR-86-51.
1986.]
106157 MULTIPROCESSOR EVALUATION OF ATTRIBUTE GRAMMARS.
R. Herndon and V. Berzins.
[University of Minnesota. Computer Science Department. TR-86-60.
1986.]
106158 SIMULATION OF A DISTRIBUTED SYNCHRONOUS RECOVERY SCHEME.
S. H. Jauw, W. T. Tsai, and K. W. Hwang.
[University of Minnesota. Computer Science Department. TR-86-65.
1986.]
106159 TWO-DIMENSIONAL CONVOLUTION ON A PYRAMID COMPUTER.
J. H. Chang et al.
[University of Minnesota. Computer Science Department. TR-87-1. 1987.]
106160 MATCHING TOPOGRAPHIC STRUCTURES IN STEREO VISION.
T.-C. Pong.
[University of Minnesota. Computer Science Department. TR-87-2. 1987.]
106161 ROLLBACK RECOVERY SUPPORT FOR DISTRIBUTED PROCESSING: PROBLEMS AND
PERSPECTIVES.
W. T. Tsai, K. W. Hwang, and S. H. Jauw.
[University of Minnesota. Computer Science Department. TR-87-3. 1987.]
106162 TWO NP-HARD INTERCHANGEABLE TERMINAL PROBLEMS.
S. Sahni and S.-Y. Wu.
[University of Minnesota. Computer Science Department. TR-87-4. 1987.]
106163 A RELIABLE DESIGN OF PARALLEL PROCESSOR SYSTEMS.
R. B. Shu and H. C. Du.
[University of Minnesota. Computer Science Department. TR-87-5. 1987.]
106164 MAZE ROUTING ON A HYPERCUBE MULTIPROCESSOR COMPUTER.
Y. Won and S. Sahni.
[University of Minnesota. Computer Science Department. TR-87-13.
1987.]
106165 ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.
J.-F. Jenq and S. Sahni.
[University of Minnesota. Computer Science Department. TR-87-14.
1987.]
106166 A HYPERCUBE ALGORITHM FOR THE 0/1 KNAPSACK PROBLEM.
J. Lee, E. Shragowitz, and S. Sahni.
[University of Minnesota. Computer Science Department. TR-87-15.
1987.]
106167 OBSTACLE AVOIDANCE HEURISTIC FOR THREE DIMENSIONAL MOVING OBJECTS.
J. Gil de Lamadrid.
[University of Minnesota. Computer Science Department. TR-87-16.
1987.]
106168 REPLICATED DISTRIBUTED PROCESSING.
S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 222. 1986.]
106169 EXPLOITING TYPE INHERITANCE FACILITIES TO IMPLEMENT RECOVERABILITY IN
OBJECT BASED SYSTEMS.
G. N. Dixon and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 223. 1986.]
106170 DESIGN CONCEPTS FOR ROBUST SOFTWARE.
S. Pfleger.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 224. 1986.]
106171 A RECURSIVE ARCHITECTURE SUPPORTING CONTROL FLOW, DATA AND REDUCTION.
R. P. Hopkins.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 225. 1986.]
106172 CONTEXT-FREE PARSING IN CONNECTIONIST NETWORKS.
M. Fanty.
[University of Rochester. Department of Computer Science. TR 174.
1985.]
106173 INTERPOLATION CODING: A REPRESENTATION FOR NUMBERS IN NEURAL MODELS.
D. H. Ballard.
[University of Rochester. Department of Computer Science. TR 175.
1986. Revised: September 1986.]
106174 SHORT-TERM FILE REFERENCE PATTERNS IN A UNIX ENVIRONMENT.
R. Floyd.
[University of Rochester. Department of Computer Science. TR 177.
1986.]
106175 DIRECTORY REFERENCE PATTERNS IN A UNIX ENVIRONMENT.
R. Floyd.
[University of Rochester. Department of Computer Science. TR 179.
1986.]
106176 INTERFACE BETWEEN DISTRIBUTED OPERATING SYSTEM AND HIGH-LEVEL
PROGRAMMING LANGUAGE.
M. L. Scott.
[University of Rochester. Department of Computer Science. TR 182.
1986. Revised: September 1986.]
106177 LANGUAGE SUPPORT FOR LOOSELY-COUPLED DISTRIBUTED PROGRAMS.
M. L. Scott.
[University of Rochester. Department of Computer Science. TR 183.
1986. Revised: September 1986.]
106178 OPTIMAL LIKELIHOOD GENERATORS FOR EDGE DETECTION UNDER GAUSSIAN
ADDITIVE NOISE.
D. Sher.
[University of Rochester. Department of Computer Science. TR 185.
n.d.]
106179 OBSERVATIONS ON MULTI-PEG TOWERS OF HANOI.
R. Newman-Wolfe.
[University of Rochester. Department of Computer Science. TR 187.
1986.]
106180 A MODEL FOR AUTOMATIC DESIGN OF DIGITAL CIRCUITS.
D. Baldwin.
[University of Rochester. Department of Computer Science. TR 188.
1986.]
106181 NEURAL REPRESENTATION OF CONCEPTUAL KNOWLEDGE.
J. A. Feldman.
[University of Rochester. Department of Computer Science. TR 189.
1986.]
106182 DEFEAT AMONG ARGUMENTS: A SYSTEM OF DEFEASIBLE INFERENCE.
R. P. Loui.
[University of Rochester. Department of Computer Science. TR 190.
1986. Revised: December 1986.]
106183 REAL RULES OF INFERENCE: ACCEPTANCE AND NON-MONOTONICITY IN AI.
R. P. Loui.
[University of Rochester. Department of Computer Science. TR 191.
1986.]
106184 EVIDENCE COMBINATION USING LIKELIHOOD GENERATORS.
D. Sher.
[University of Rochester. Department of Computer Science. TR 192.
1987.]
106185 SELF-CALIBRATION STRATEGIES FOR ROBOT MANIPULATORS.
A. Mukerjee.
[University of Rochester. Department of Computer Science. TR 193.
1986. Thesis (Ph.D.). "This work was submitted in partial fulfillment
of the requirements for the degree Doctor of Philosophy in Mechanical
and Aerospace Sciences."]
106186 DEBUGGING PARALLEL PROGRAMS WITH INSTANT REPLAY.
T. J. LeBlanc and J. M. Mellor-Crummey.
[University of Rochester. Department of Computer Science. TR 194.
1986.]
106187 ADVANCED LIKELIHOOD GENERATORS FOR BOUNDARY DETECTION.
D. Sher.
[University of Rochester. Department of Computer Science. TR 197.
1987.]
106188 COMMUNICATION ISSUES IN PARALLEL COMPUTATION.
R. E. Newman-Wolfe.
[University of Rochester. Department of Computer Science. TR 200.
1986. Thesis (Ph.D.).]
106189 DECISION EXPRESSION OPTIMIZATION.
J. R. B. Cockett.
[University of Tennessee. Computer Science Department. CS-85-59.
1985.]
106190 PRIME RULES BASED METHODOLOGIES GIVE INADEQUATE CONTROL.
J. R. B. Cockett and J. Herrera.
[University of Tennessee. Computer Science Department. CS-85-60.
1985.]
106191 DATABASE QUERYING SCHEMES WITH FUZZY LINGUISTIC QUANTIFIERS.
J. Kacprzyk and A. Ziolkowski.
[University of Tennessee. Computer Science Department. CS-86-61.
1986.]
106192 ENHANCING ALGORITHMIC/PROCEDURAL "HUMAN CONSISTENCY" OF CONTROL
MODELS BY USING SOME REPRESENTATION OF COMMONSENSE KNOWLEDGE.
J. Kacprzyk.
[University of Tennessee. Computer Science Department. CS-86-62.
1986.]
106193 TOWARDS A MORE REALISTIC MODELING OF INTERNATIONAL ECONOMIC
COOPERATION VIA FUZZY MATHEMATICAL PROGRAMMING AND COOPERATIVE GAMES.
J. Kacprzyk and J. Holubiec.
[University of Tennessee. Computer Science Department. CS-86-63.
1986.]
106194 TOWARDS "HUMAN CONSISTENT" DECISION SUPPORT SYSTEMS THROUGH
COMMONSENSE KNOWLEDGE BASED DECISION MAKING AND CONTROL MODELS: A
FUZZY LOGIC APPROACH.
J. Kacprzyk.
[University of Tennessee. Computer Science Department. CS-86-64.
1986.]
106195 A GENERALIZATION OF DISCOUNTED MULTISTAGE DECISION MAKING AND CONTROL
THROUGH FUZZY LINGUISTIC QUANTIFIERS: AN ATTEMPT TO INTRODUCE
COMMONSENSE KNOWLEDGE.
J. Kacprzyk and C. Iwanski.
[University of Tennessee. Computer Science Department. CS-86-65.
1986.]
106196 FINDING ALL THE OPTIMAL FORMS OF A DECISION TREE.
J. A. Herrera and J. R. B. Cockett.
[University of Tennessee. Computer Science Department. CS-86-66.
1986.]
106197 SYSTEMS OF EQUATIONS OVER A FINITELY GENERATED FREE MONOID HAVING AN
EFFECTIVELY FINDABLE EQUIVALENT FINITE SUBSYSTEM.
K. Culik II and J. Karhumaeki.
[University of Waterloo. Department of Computer Science. CS-86-38.
1986.]
106198 A TIME- AND SPACE-OPTIMAL ALGORITHM FOR BOOLEAN MASK OPERATIONS FOR
ORTHOGONAL POLYGONS.
P. Widmayer and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-39.
1986.]
106199 THE NODE VISIT COST OF BROTHER TREES.
R. Klein and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-40.
1986.]
106200 A MODEL FOR USER-SPECIFIC EXPLANATIONS FROM EXPERT SYSTEMS.
P. G. van Beek.
[University of Waterloo. Department of Computer Science. CS-86-42.
1986. Thesis (Master of Mathematics in Computer Science).]
106201 THE FIFTH GENERATION: MAKING COMPUTERS EASIER TO USE?
R. Goebel.
[University of Waterloo. Department of Computer Science. CS-86-43.
1986.]
106202 VARIABLES IN HYPOTHESES.
D. Poole.
[University of Waterloo. Department of Computer Science. CS-86-44.
1986.]
106203 TESTING A CLASS OF METHODS FOR SOLVING MINIMIZATION PROBLEMS WITH
SIMPLE BOUNDS ON THE VARIABLES.
A. R. Conn, N. I. M. Gould, and Ph. L. Toint.
[University of Waterloo. Department of Computer Science. CS-86-45.
1986.]
106204 COEFFICIENT GROWTH BOUNDS FOR ALGORITHMS OF POLYNOMIALS OVER
ALGEBRAIC EXTENSION FIELDS.
T. J. Smedley.
[University of Waterloo. Department of Computer Science. CS-86-46.
1986.]
106205 NUMERICAL INTEGRATION IN A SYMBOLIC CONTEXT [1].
K. O. Geddes.
[University of Waterloo. Department of Computer Science. CS-86-47.
1986.]
106206 CHOREOSCRIBE: A GRAPHICS EDITOR TO DESCRIBE BODY POSITION AND
MOVEMENT USING BENESH MOVEMENT NOTATION.
D. O. K. Dransch, J. C. Beatty, and R. S. Ryman.
[University of Waterloo. Department of Computer Science. CS-86-48.
1986. Thesis (Master of Mathematics). "This work was originally
submitted in fulfillment of the requirements for the degree of
Masters of Mathematics to the Faculty of Mathematics of the
University of Waterloo by the first author (Detlef O. K. Dransch)."]
106207 HOLE PROBLEMS FOR RECTANGLES IN THE PLANE.
G. J. E. Rawlins, P. Widmayer, and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-49.
1986.]
106208 PARALLEL GRADIENT PROJECTION SUCCESSIVE OVERRELAXATION FOR SYMMETRIC
LINEAR COMPLEMENTARITY PROBLEMS AND LINEAR PROGRAMS.
O. L. Mangasarian and R. De Leone.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 659. 1986.]
106209 EXPERIENCES WITH DISTRIBUTED LONGEST PATH ALGORITHMS.
B. P. Miller and C.-Q. Yang.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 681. 1987.]
106210 THE ASP: A CONTINUOUS VIEWER-CENTERED REPRESENTATION FOR 3D OBJECT
RECOGNITION.
H. Plantinga and C. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 682. 1987.]
106211 THE ASPECT REPRESENTATION.
H. Plantinga and C. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 683. 1987.]
106212 SELECTIVE RESET IN THE AND PROCESS.
W. Winsborough.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 684. 1987.]
106213 A SIMPLE CHARACTERIZATION OF SOLUTION SETS OF CONVEX PROGRAMS.
O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 685. 1987.]
106214 LEAST NORM SOLUTION OF NON-MONOTONE LINEAR COMPLEMENTARITY PROBLEMS.
O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 686. 1987.]
106215 THE EXODUS OPTIMIZER GENERATOR.
G. Graefe and D. J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 687. 1987.]
106216 HIGHLY PARALLEL, HIERARCHICAL, RECOGNITION CONE PERCEPTUAL STRUCTURES.
L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 688. 1987.]
VOL. 9, NO. 6 07/10/87
106217 INCORPORATING TIME IN THE NEW WORLD OF COMPUTING SYSTEM.
H. L. Poh.
[California Institute of Technology. Computer Science Department.
Report no. 5238:TR:87. 1986. Thesis (Master's).]
106218 TRACE THEORY AND SYSTOLIC COMPUTATIONS.
M. Rem.
[California Institute of Technology. Computer Science Department.
Report no. 5239:TR:87. 1987.]
106219 A VARIATIONAL PRINCIPLE FOR QUASISTATIC MECHANICS.
M. A. Peshkin and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-16. 1986.]
106220 ON LEARNING BOOLEAN FUNCTIONS.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-17. 1986.]
106221 ON DETECTING THE ORIENTATION OF POLYGONS AND POLYHEDRA.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-86-18. 1986.]
106222 INSPECTING MONEY: HOW TO AVOID NEGATIVE BUCKS.
R. Thibadeau.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-1. 1987.]
106223 PROBLEMS OF AUTOMATIC VECTORIZATION OF ARTWORK.
R. Thibadeau.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-2. 1987.]
106224 PROTOTYPE SOFTWARE FOR AUTOMATIC GENERATION OF ON-LINE CONTROL
PROGRAMS FOR DISCRETE MANUFACTURING PROCESSES.
G. Ekberg and B. H. Krogh.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-3. 1987.]
106225 EXPERIMENTAL EVALUATION OF NONLINEAR FEEDBACK AND FEEDFORWARD CONTROL
SCHEMES FOR MANIPULATORS.
P. K. Khosla and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-4. 1987.]
106226 CHOOSING SAMPLING RATES FOR ROBOT CONTROLS.
P. K. Khosla.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-5. 1987.]
106227 REAL-TIME IMPLEMENTATION AND EVALUATION OF COMPUTED-TORQUE SCHEME.
P. K. Khosla and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-6. 1987.]
106228 AN ALGORITHM TO ESTIMATE MANIPULATOR DYNAMICS PARAMETERS.
P. K. Khosla and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-7. 1987.]
106229 ESTIMATION OF ROBOT DYNAMICS PARAMETERS: THEORY AND APPLICATION.
P. K. Khosla.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-8. 1987.]
106230 HARDWARE DESCRIPTION OF THE WORKSTATION CERES.
H. Eberle.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 70. 1987.]
106231 HOST: AN ABSTRACT MACHINE FOR MODULA-2 PROGRAMS.
M. Kiener and A. Ultsch.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 73. 1987.]
106232 PROGEO: DARSTELLUNG UND MANIPULATION GEOWISSENSCHAFTLICHER OBJEKTE.
H.-J. Appelrath and H. Lorek.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Technical report 74. 1987.]
106233 INDUSTRIAL MACHINE VISION: LESSONS AND CHALLENGES.
S. W. Holland and R. B. Tilove.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5617R. 1987.]
106234 NETFT: A NETWORK FILE TRANSFER SYSTEM.
M. A. Webb, J. C. VanHoorne, and K. A. Dickey.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5798. 1987.]
106235 LOGIC PROGRAMMING AND RAPID PROTOTYPING.
H. J. Komorowski and J. Maluszynski.
[Harvard University. Center for Research in Computing Technology.
TR-01-86. 1986.]
106236 USING TRANSFORMATIONS TO SPEED UP A CRITICAL ROUTINE.
J. G. Townley.
[Harvard University. Center for Research in Computing Technology.
TR-03-86. 1986.]
106237 MULTIRELATIONS IN RELATIONAL DATABASES.
A. Klausner.
[Harvard University. Center for Research in Computing Technology.
TR-04-86. 1986. Thesis (Ph.D.).]
106238 COMPUTATIONAL LIMITATIONS ON LEARNING FROM EXAMPLES.
L. Pitt and L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-05-86. 1986.]
106239 A DECLARATIVE LOGIC PROGRAMMING ENVIRONMENT.
H. J. Komorowski.
[Harvard University. Center for Research in Computing Technology.
TR-06-86. 1986.]
106240 IMPLEMENTING LOTOS IN PARLOG.
D. R. Gilbert.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 87/1. 1987. "This report is a condensed version
of the Author's MSc thesis, with the same title, submitted in 1986 in
partial fulfillment of the requirements for the MSc degree in
Engineering of the University of London."]
106241 COMPILING ASSOCIATIVITY INTO LOGIC PROGRAMS.
D. R. Brough and C. J. Hogger.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 87/2. 1987.]
106242 TOOL SUPPORT FOR REQUIREMENTS ANALYSIS.
J. Kramer et al.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 87/3. 1987.]
106243 THE SEMANTICS OF QUERIES AND UPDATES IN RELATIONAL DATABASES.
C. Lecluse and N. Spyratos.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 561. 1986.]
106244 A NEW COMPUTATIONAL MODEL AND ITS DISCIPLINE OF PROGRAMMING.
J.-P. Banatre and D. Le Metayer.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 566. 1986. Also issued as Publication
interne 305, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
106245 STABILIZATION OF FAST RECURSIVE LEAST-SQUARES TRANSVERSAL FILTERS.
J.-L. Botto and G. V. Moustakides.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 570. 1986. Also issued as Publication
interne 306, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
106246 LINEAR LOGIC AND LAZY COMPUTATION.
J.-Y. Girard and Y. Lafont.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 588. 1986.]
106247 DE LA NECESSITE DE SPECIFIER DES PROPRIETES POUR LA VERIFICATION DES
ALGORITHMES DISTRIBUES.
C. Jard and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 590. 1986.]
106248 SURVEY OF THE STATUS OF FINITE ELEMENT METHODS FOR PARTIAL
DIFFERENTIAL EQUATIONS.
R. Temam.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 86-77. 1986.]
106249 PERFORMANCE STUDIES OF THE MULTIGRID ALGORITHMS IMPLEMENTED ON
HYPERCUBE MULTIPROCESSOR SYSTEMS.
V. K. Naik and S. Ta'asan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-5. 1987.]
106250 A SYSTEM FOR ROUTING ARBITRARY DIRECTED GRAPHS ON SIMD ARCHITECTURES.
S. Tomboulian.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-14. 1987.]
106251 EXPLOITING LOOP LEVEL PARALLELISM IN NONPROCEDURAL DATAFLOW PROGRAMS.
M. B. Gokhale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-23. 1987.]
106252 THE JOURNAL OF CHOAS AND GRAPHICS, VOL. 1, APRIL 1987.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RA 186. 1987. "Volume 1...contains articles by 11 authors,
8 of whom are from IBM." Clifford A. Pickover, editor.]
106253 WHAT'S IN A NAME? OR THE VALUE OF RENAMING FOR PARALLELISM DETECTION
AND STORAGE ALLOCATION.
J. Ferrante.
[International Business Machines Corporation (IBM). Research
Division. RC 12157. 1987.]
106254 SPAN - A SPEEDUP ANALYZER FOR PARALLEL PROGRAMS [TUTORIAL].
K. So et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12186. 1986.]
106255 RELATION ASSIGNMENT IN DISTRIBUTED TRANSACTION PROCESSING ENVIRONMENT.
D. W. Cornell and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 12304. 1986.]
106256 EFFECT OF STORAGE ALLOCATION/RECLAMATION METHODS ON PARALLELISM AND
STORAGE REQUIREMENTS.
M. Kumar.
[International Business Machines Corporation (IBM). Research
Division. RC 12347. 1986.]
106257 OPTIMAL SEARCH POLICIES FOR SEARCHES WITH I/O BOUND TASKS.
H. S. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12350. 1986.]
106258 THE GF11 PARALLEL COMPUTER.
J. Beetem, M. Denneau, and D. Weingarten.
[International Business Machines Corporation (IBM). Research
Division. RC 12364. 1986.]
106259 SMARTHELP: A DYNAMIC PROTOTYPING TOOL FOR INTELLIGENT ADVISORY DIALOG.
J. C. Checco and J. M. Carroll.
[International Business Machines Corporation (IBM). Research
Division. RC 12371. 1986.]
106260 SYNCHRONOUSLY INTERLEAVED DISK SYSTEMS WITH THEIR APPLICATION TO THE
VERY LARGE FFT.
M. Y. Kim.
[International Business Machines Corporation (IBM). Research
Division. RC 12372. 1986.]
106261 MATHEMATICS AND BEAUTY V: TURBULENT COMPLEX CURLS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12377. 1986.]
106262 VERIFICATION OF COMPUTER COMPLEXES.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12382. 1986.]
106263 HARDWARE COMPILATION AND VERIFICATION OF ALGORITHMS.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12383. 1986.]
106264 NEW ALGORITHM FOR AC TEST GENERATION.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12384. 1986.]
106265 CALCULATING AVAILABILITY AND PERFORMABILITY MEASURES.
E. de Souza e Silva and H. R. Gail.
[International Business Machines Corporation (IBM). Research
Division. RC 12386. 1986.]
106266 UNIFICATION REVISITED.
J.-L. Lassez, M. J. Maher, and K. G. Marriott.
[International Business Machines Corporation (IBM). Research
Division. RC 12394. 1986.]
106267 EQUIVALENCES OF LOGIC PROGRAMS.
M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. RC 12395. 1986.]
106268 EXPECTED PERFORMANCE OF PARALLEL OR-SEARCH.
K. S. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. RC 12396. 1986.]
106269 MOVING OBJECTS FOR REAL TIME ANIMATION.
C. J. Evangelisti.
[International Business Machines Corporation (IBM). Research
Division. RC 12406. 1986.]
106270 CONCURRENCY CONTROL SCHEMES TO SUPPORT THE CONCURRENT PROCESSING OF
UPDATE TRANSACTIONS AND READ-ONLY QUERIES.
A. Thomasian.
[International Business Machines Corporation (IBM). Research
Division. RC 12420. 1986.]
106271 LEARNING PROCEDURES IN ARITHMETIC: THE PRINCIPLE OF COGNITIVE VIGOR.
R. Bhaskar and N. Haas.
[International Business Machines Corporation (IBM). Research
Division. RC 12423. 1986.]
106272 AN IMPLEMENTATION OF ADAPTIVE SEARCH.
T. Sakuragawa.
[International Business Machines Corporation (IBM). Research
Division. RC 12425. 1987.]
106273 ALGORITHMIC LOGIC PROGRAMMING.
M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. RC 12428. 1986.]
106274 MATHEMATICS AND BEAUTY VI: TILED EGGS COMPUTED FROM TRUNCATED
SINUSOIDS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12431. 1986.]
106275 HIGH PERFORMANCE REDUCED INSTRUCTION SET PROCESSORS.
T. Agerwala and J. Cocke.
[International Business Machines Corporation (IBM). Research
Division. RC 12434. 1987.]
106276 A PARALLEL LAMBDA-CALCULUS INTERPRETER.
J. M. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12441. 1987.]
106277 'PARALLEL PROCESSOR' ARCHITECTURE.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12445. 1987.]
106278 VLSI IN COMPUTERS.
R. W. Keyes.
[International Business Machines Corporation (IBM). Research
Division. RC 12451. 1987.]
106279 A SEMANTIC EXPERT USING AN ONLINE STANDARD DICTIONARY.
J.-L. Binot and K. Jensen.
[International Business Machines Corporation (IBM). Research
Division. RC 12455. 1987.]
106280 PERFORMANCE OF PRIORITY PROTOCOLS ON HIGH SPEED TOKEN RING NETWORKS.
A. Goyal and D. Dias.
[International Business Machines Corporation (IBM). Research
Division. RC 12457. 1986.]
106281 MODELING AND ANALYSIS OF COMPUTER SYSTEM AVAILABILITY.
A. Goyal and S. S. Lavenberg.
[International Business Machines Corporation (IBM). Research
Division. RC 12458. 1986.]
106282 MONTE CARLO SIMULATION OF COMPUTER SYSTEM AVAILABILITY/RELIABILITY
MODELS.
A. E. Conway and A. Goyal.
[International Business Machines Corporation (IBM). Research
Division. RC 12459. 1986.]
106283 HOP-BY-HOP WINDOW FLOW CONTROL ON UNRELIABLE CONNECTIONS.
M.-S. Chen and B. Kadaba.
[International Business Machines Corporation (IBM). Research
Division. RC 12463. 1986.]
106284 ALGORITHMIC INFORMATION THEORY.
G. J. Chaitin.
[International Business Machines Corporation (IBM). Research
Division. RC 12470. 1987.]
106285 PERFORMANCE ANALYSIS OF PARALLEL PROCESSING SYSTEMS.
R. Nelson, D. Towsley, and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 12474. 1986.]
106286 A MODEL FOR OBJECT-BASED INHERITANCE.
B. Hailpern and V. Nguyen.
[International Business Machines Corporation (IBM). Research
Division. RC 12481. 1987.]
106287 PROGRAM VERIFICATION.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 12485. 1987.]
106288 A ROBUST SCHEME FOR ACCESS PATH SELECTION IN RELATIONAL DATABASE
SYSTEMS.
M. S. Lakshmi and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 12488. 1987.]
106289 POLYMORPHIC-TORUS ARCHITECTURE FOR COMPUTER VISION.
H. Li and M. Maresca.
[International Business Machines Corporation (IBM). Research
Division. RC 12492. 1987.]
106290 USER-FRIENDLINESS, CONSISTENCY AND OTHER HARD-TO-DEFINE TERMS AND
PRINCIPLES: INTERVIEWS WITH DESIGNERS.
S. Maass, M. B. Rosson, and W. A. Kellogg.
[International Business Machines Corporation (IBM). Research
Division. RC 12493. 1987.]
106291 A BEHAVIORAL STUDY OF A COMPUTER HAND PRINT RECOGNITION SYSTEM.
J. W. Schoonard et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12494. 1987.]
106292 MIXING COLLISION RESOLUTION ALGORITHMS EXPLOITING INFORMATION OF
SUCCESSFUL MESSAGES.
I. Kessler and M. Sidi.
[International Business Machines Corporation (IBM). Research
Division. RC 12495. 1986.]
106293 ASYNCHRONOUS DISK INTERLEAVING.
M. Y. Kim and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 12497. 1987.]
106294 A THEORY OF DEFAULT REASONING.
W. Zadrozny.
[International Business Machines Corporation (IBM). Research
Division. RC 12498. 1987.]
106295 THE YORKTOWN SILICON COMPILER SYSTEM.
R. K. Brayton et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12500. 1986.]
106296 HERMITE INTERPOLATION BY C(SUPERSCRIPT)1 PIECEWISE POLYNOMIALS ON
TRIANGULATIONS.
E. Nadler.
[International Business Machines Corporation (IBM). Research
Division. RC 12507. 1987.]
106297 TUTORIAL FOR EPEX/FORTRAN PROGRAM PARALLELIZATION AND EXECUTION.
T. Bolmarcich and F. Darema-Rogers.
[International Business Machines Corporation (IBM). Research
Division. RC 12515. 1987.]
106298 MULTIPURPOSE PARALLELISM IN VLSI COMPUTER-AIDED DESIGN: A CASE STUDY.
F. Darema-Rogers and G. F. Pfister.
[International Business Machines Corporation (IBM). Research
Division. RC 12516. 1987.]
106299 SENSITIVITY ANALYSIS OF CONTINUOUS TIME MARKOV CHAINS USING
UNIFORMIZATION.
P. Heidelberger and A. Goyal.
[International Business Machines Corporation (IBM). Research
Division. RC 12520. 1987.]
106300 THE USE OF HAND-DRAWN GESTURES FOR TEXT-EDITING.
C. G. Wolf and P. Morrel-Samuels.
[International Business Machines Corporation (IBM). Research
Division. RC 12523. 1987.]
106301 A UNIFIED INTERPRETATION OF SEVERAL COMBINATORIAL DUALITIES.
R. G. Bland and B. L. Dietrich.
[International Business Machines Corporation (IBM). Research
Division. RC 12527. 1987.]
106302 RELIABILITY AND FAULT-TOLERANCE IN MULTISTAGE INTERCONNECTION
NETWORKS.
C. S. Raghavendra and A. Varma.
[International Business Machines Corporation (IBM). Research
Division. RC 12528. 1987.]
106303 FAULT-TOLERANT ROUTING IN MULTISTAGE INTERCONNECTION NETWORKS.
A. Varma and C. S. Raghavendra.
[International Business Machines Corporation (IBM). Research
Division. RC 12529. 1986.]
106304 EXPLETIVE NOUN PHRASES IN SUBCATEGORIZED POSITIONS.
P. M. Postal and G. K. Pullum.
[International Business Machines Corporation (IBM). Research
Division. RC 12539. 1987.]
106305 DISTRIBUTED DEADLOCK RESOLUTION.
J. M. Jaffe and M. Sidi.
[International Business Machines Corporation (IBM). Research
Division. RC 12541. 1987.]
106306 AN OPTIMAL RECOVERY VIEW OF WALSH'S EQUICONVERGENCE THEOREM.
C. A. Micchelli and T. J. Rivlin.
[International Business Machines Corporation (IBM). Research
Division. RC 12542. 1987.]
106307 A SPEEDUP ANALYZER FOR PARALLEL PROGRAMS.
K. So et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12546. 1987.]
106308 APPROXIMATE ALGORITHMS FOR THE KNAPSACK PROBLEM ON PARALLEL COMPUTERS.
P. S. Gopalakrishnan, I. V. Ranakrishnan, and L. N. Kanal.
[International Business Machines Corporation (IBM). Research
Division. RC 12549. 1987.]
106309 COMBINATORIAL DESIGN OF BUS-BASED INTERCONNECTION STRUCTURES.
A. Varma.
[International Business Machines Corporation (IBM). Research
Division. RC 12550. 1986.]
106310 LEARNING A WORD PROCESSING SYSTEM WITH TRAINING WHEELS AND GUIDED
EXPLORATION.
R. Catrambone and J. M. Carroll.
[International Business Machines Corporation (IBM). Research
Division. RC 12551. 1986.]
106311 COMPARISON OF ERROR-CORRECTING TECHNIQUES FOR MULTISTAGE
INTERCONNECTION NETWORKS.
M. Malek, A. M. Johnson Jr., and B. D. Rathi.
[International Business Machines Corporation (IBM). Research
Division. RC 12554. 1987.]
106312 ERROR DETECTION FOR CONTROL LINES IN MULTICOMPUTER NETWORKS.
K. Yau et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12555. 1987.]
106313 RENDERING OF THE SHROUD OF TURIN USING SINUSOIDAL PSEUDO-COLOR AND
OTHER IMAGE PROCESSING TECHNIQUES.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12558. 1987.]
106314 ANALYSIS OF PREEMPTIVE PRIORITY MULTISERVER QUEUE.
H. R. Gail, S. L. Hantler, and B. A. Taylor.
[International Business Machines Corporation (IBM). Research
Division. RC 12562. 1987.]
106315 DISTRIBUTED ASSIGNMENT ALGORITHMS FOR MULTI-HOP PACKET-RADIO NETWORKS.
I. Cidon and M. Sidi.
[International Business Machines Corporation (IBM). Research
Division. RC 12563. 1987.]
106316 A FRAMEWORK FOR AGREEMENT.
K. J. Perry.
[International Business Machines Corporation (IBM). Research
Division. RC 12565. 1987.]
106317 AN EXTENDED DISJUNCTIVE NORMAL FORM APPROACH FOR PROCESSING RECURSIVE
LOGIC QUERIES IN LOOSELY COUPLED ENVIRONMENTS.
K.-Y. Whang and S. B. Navathe.
[International Business Machines Corporation (IBM). Research
Division. RC 12567. 1987.]
106318 POLYMORPHIC-TORUS NETWORK FOR SUPERCOMPUTING.
H. Li and M. Maresca.
[International Business Machines Corporation (IBM). Research
Division. RC 12568. 1987.]
106319 SELF-SCHEDULING IN THE RUNTIME ENVIRONMENT.
A. Norton and W.-L. Chang.
[International Business Machines Corporation (IBM). Research
Division. RC 12572. 1987.]
106320 HOST ACCESS CONTROL FOR LAN BASED PERSONAL COMPUTERS.
R. J. LeMaster.
[International Business Machines Corporation (IBM). Research
Division. RC 12574. 1987.]
106321 RECONFIGURABLE SPECIAL-PURPOSE COMPUTERS.
Y. E. Ma et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12581. 1987.]
106322 COMPARING TWO FUNCTIONAL PROGRAMMING SYSTEMS.
B. Hailpern, T. Huynh, and G. Revesz.
[International Business Machines Corporation (IBM). Research
Division. RC 12598. 1987.]
106323 ENTROPY IN THE MULTIGRID ALGORITHM, WITH AN APPENDIX ON PARALLEL
MULTIGRID ALGORITHMS.
P. T. Kan and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. RC 12600. 1987.]
106324 AN EXPERIMENT IN COMPUTATIONAL DISCRIMINATION OF ENGLISH WORD SENSES.
E. W. Black.
[International Business Machines Corporation (IBM). Research
Division. RC 12601. 1987.]
106325 DESIGN AND APPLICATION OF AN EXPERIMENTAL MULTIPROCESSOR.
W. W. Wilcke et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12604. 1987.]
106326 MATHEMATICS AND BEAUTY VII: QUATERNIONIC IMAGES.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12623. 1987.]
106327 THE RELIABILITY OF SINGLE-ERROR PROTECTED COMPUTER MEMORIES.
M. Blaum, R. Goodman, and R. McEliece.
[International Business Machines Corporation (IBM). Research
Division. RJ 5318. 1986.]
106328 INTERACTIVE CONSISTENCY.
R. Strong.
[International Business Machines Corporation (IBM). Research
Division. RJ 5404. 1986.]
106329 CONTROL-FREE LOW-LEVEL IMAGE SEGMENTATION: THEORY, ARCHITECTURE AND
EXPERIMENTATION.
W. E. Blanz, J. L. C. Sanz, and D. Petkovic.
[International Business Machines Corporation (IBM). Research
Division. RJ 5433. 1986.]
106330 THE COMPLEXITY OF PARALLEL SEARCH.
E. Upfal, R. M. Karp, and A. Wigderson.
[International Business Machines Corporation (IBM). Research
Division. RJ 5434. 1986.]
106331 JOINS IN A GENERIC DATABASE MACHINE.
J.-J. Daudenarde.
[International Business Machines Corporation (IBM). Research
Division. RJ 5446. 1986.]
106332 THE COMPLEXITY OF COMPUTATIONS BY NETWORKS.
N. Pippinger.
[International Business Machines Corporation (IBM). Research
Division. RJ 5454. 1987.]
106333 HANDSHAKE PROTOCOLS.
R. Strong et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 5457. 1987.]
106334 THEOREMS AND EXPERIMENTS ON IMAGE RECONSTRUCTION FROM ZERO CROSSINGS.
J. L. C. Sanz and T. T. Huang.
[International Business Machines Corporation (IBM). Research
Division. RJ 5460. 1987.]
106335 DOCUMENT MANAGEMENT AND HANDLING.
D. M. Choy et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 5490. 1987.]
106336 SHIFTING GEARS: CHANGING ALGORITHMS ON THE FLY TO EXPEDITE BYZANTINE
AGREEMENT.
C. Dwork et al.
[International Business Machines Corporation (IBM). Research
Division. RJ 5511. 1987.]
106337 SIMD MESH ARRAY ALGORITHMS FOR IMAGE COMPONENT LABELING.
J. L. C. Sanz, R. E. Cypher, and L. Snyder.
[International Business Machines Corporation (IBM). Research
Division. RJ 5515. 1987.]
106338 THE DECISION PROBLEM FOR THE PROBABILITIES OF HIGHER-ORDER PROPERTIES.
P. G. Kolaitis and M. Vardi.
[International Business Machines Corporation (IBM). Research
Division. RJ 5517. 1987.]
106339 USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS.
J. Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. RJ 5522. 1987.]
106340 HANDLING HOT SPOT DATA IN DB-SHARING SYSTEMS.
T. Haerder.
[International Business Machines Corporation (IBM). Research
Division. RJ 5523. 1987.]
106341 REMOTE EVALUATION.
J. W. Stamos and D. K. Gifford.
[International Business Machines Corporation (IBM). Research
Division. RJ 5527. 1987.]
106342 IMPLEMENTING REMOTE EVALUATION: MAKING APPLY BE A REMOTE PROCEDURE.
J. W. Stamos and D. K. Gifford.
[International Business Machines Corporation (IBM). Research
Division. RJ 5528. 1987.]
106343 THE GENERALIZED PACKET ROUTING PROBLEM.
E. Upfal and D. Peleg.
[International Business Machines Corporation (IBM). Research
Division. RJ 5529. 1987.]
106344 CONCEPTS FOR TRANSACTION RECOVERY IN NESTED TRANSACTIONS.
T. Haerder and K. Rothermel.
[International Business Machines Corporation (IBM). Research
Division. RJ 5534. 1987.]
106345 GRAPHICS IN AN APPLICATIVE CONTEXT.
P. Lucas and S. N. Zilles.
[International Business Machines Corporation (IBM). Research
Division. RJ 5542. 1987.]
106346 FUNCTIONAL PORT CLASSES: A COMMUNICATION CONCEPT FOR DISTRIBUTED
TRANSACTION-ORIENTED SYSTEM.
K. Rothermel.
[International Business Machines Corporation (IBM). Research
Division. RJ 5543. 1987.]
106347 ANALYSIS OF ERROR CORRECTION BY MAJORITY VOTING.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. RJ 5544. 1987.]
106348 SCHEDULING LOOPS ON PROCESSORS: ALGORITHMS AND COMPLEXITY.
B. Simons and A. A. Munshi.
[International Business Machines Corporation (IBM). Research
Division. RJ 5546. 1987.]
106349 AN ALGEBRA FOR STRUCTURED OFFICE DOCUMENTS.
R. H. Gueting, R. Zicari, and D. M. Choy.
[International Business Machines Corporation (IBM). Research
Division. RJ 5559. 1987.]
106350 MULTIPLE BURST-CORRECTING ARRAY CODES.
M. Blaum and H. van Tilborg.
[International Business Machines Corporation (IBM). Research
Division. RJ 5565. 1987.]
106351 ON T-ERROR CORRECTING/ALL UNIDIRECTIONAL ERROR DETECTING CODES.
M. Blaum and H. van Tilborg.
[International Business Machines Corporation (IBM). Research
Division. RJ 5566. 1987.]
106352 CONSTRUCTING DISJOINT PATHS ON EXPANDER GRAPHS.
E. Upfal and D. Peleg.
[International Business Machines Corporation (IBM). Research
Division. RJ 5568. 1987.]
106353 TRELLIS-CODED MODULATION WITH REDUNDANT SIGNAL SETS. PART I:
INTRODUCTION.
G. Ungerboeck.
[International Business Machines Corporation (IBM). Research
Division. RZ 1551. 1986.]
106354 TRELLIS-CODED MODULATION WITH REDUNDANT SIGNAL SETS. PART II: STATE
OF THE ART.
G. Ungerboeck.
[International Business Machines Corporation (IBM). Research
Division. RZ 1552. 1986.]
106355 TREE-FORMING REVERSIBLE ROUTES IN COMMUNICATION NETWORKS.
A. A. R. Cockburn.
[International Business Machines Corporation (IBM). Research
Division. RZ 1568. 1987.]
106356 DISCRETE-TIME ANALYSIS OF POLLING SYSTEMS WITH RENEWAL INPUTS.
P. Tran-Gia.
[International Business Machines Corporation (IBM). Research
Division. RZ 1570. 1987.]
106357 IMPACT OF NEW TECHNOLOGIES ON THE STRUCTURE OF COMMUNICATION SYSTEMS.
M. Reiser.
[International Business Machines Corporation (IBM). Research
Division. RZ 1575. 1987.]
106358 DISPLAY ARCHITECTURE FOR VLSI-BASED GRAPHICS WORKSTATIONS.
P. J. W. ten Hagen, A. A. M. Kuijk, and C. G. Trienekens.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8637. 1986.]
106359 ORDER AND METRIC IN THE STREAM SEMANTICS OF ELEMENTAL CONCURRENCY.
J. W. de Bakker and J.-J. Ch Meyer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8638. 1986.]
106360 ANOTHER LOOK AT ABSTRACTION IN PROCESS ALGEBRA.
J. C. M. Baeten and R. J. van Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8701. 1987.]
106361 INFORM: AN INTERACTIVE SYNTAX-DIRECTED FORMULAE-EDITOR.
S. van Egmond, F. C. Heeman, and J. C. van Vliet.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8702. 1987.]
106362 INTRODUCTION TO DIALOGUE CELLS.
R. van Liere and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8703. 1987.]
106363 ATOMIC MULTIREADER REGISTER.
L. M. Kirousis, E. Kranakis, and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8704. 1987.]
106364 ASF - AN ALGEBRAIC SPECIFICATION FORMALISM.
J. A. Bergstra, J. Heering, and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8705. 1987.]
106365 NUMVEC FORTRAN LIBRARY MANUAL. CHAPTER: ELLIPTIC PDES. ROUTINE: MGD1V
AND MGD5V.
P. M. de Zeeuw.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8624. 1986.]
106366 THE ODD-EVEN HOPSCOTCH PRESSURE CORRECTION SCHEME FOR THE COMPUTATION
OF FREE CONVECTION IN A SQUARE CAVITY.
J. H. M. ten Thije Boonkkamp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8701. 1987.]
106367 TRANSLATION OF ALGORITHM 539: BASIC LINEAR ALGEBRA SUBPROGRAMS FOR
FORTRAN USAGE IN FORTRAN 200 FOR THE CYBER 205.
M. Louter-Nool.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8702. 1987.]
106368 APPROXIMATE PARALLEL SCHEDULING. PART I: THE BASIC TECHNIQUE WITH
APPLICATIONS TO OPTIMAL PARALLEL LIST RANKING IN LOGARITHMIC TIME.
R. Cole and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 110. 1986. Also
issued as Technical report 244, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106369 PARALLEL CONSTRUCTION OF A SUFFIX TREE.
G. M. Landau, B. Schieber, and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 111. 1986. Also
issued as Technical report 252, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106370 A GROUP LOCK ALGORITHM, WITH APPLICATIONS.
I. Dimitrovsky.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 112. 1986.]
106371 A NOTE ON RANDOM NUMBER GENERATOR OF CHUNG ET. AL.
O. E. Percus.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 113. 1986.]
106372 RANDOM NUMBER GENERATORS FOR ULTRACOMPUTERS.
O. E. Percus and M. H. Kalos.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 114. 1987.]
106373 PARALLEL MERGE SORT.
R. Cole.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 115. 1987. Also
issued as Technical report 278, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106374 ULTRAPROLOG.
M. C. Harrison, N. Markantonatos, and G. Papadopoulos.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 116. 1987.]
106375 BEARINGS PROBLEM IN NONDETERMINISTIC INFORMATION SYSTEMS.
A. Abramowicz.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 584. 1986.]
106376 TOWARDS A DATA FLOW BASED VERSION OF CCS.
J. Winkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 585. 1986.]
106377 HIGH-SPEED NONRESTORING BINARY DIVISION.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 586. 1986.]
106378 HIGH-SPEED GENERATION OF SOME CONIC CURVES.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 588. 1986.]
106379 THREE PROCEDURES SEARCHING MINIMIZERS.
G. Zielinski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 590. 1986.]
106380 ON GAMMA-ALMOST FIXED POINT THEOREMS: THE MULTIVALUED CASE.
A. Idzik.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 591. 1986.]
106381 HIGH-SPEED NONRESTORING BINARY SQUARE-ROOTING.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 592. 1986.]
106382 PSEUDO-UTILITIES.
A. Wieczorek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 593. 1986.]
106383 LOGIC FOR REASONING ABOUT KNOWLEDGE.
E. Orlowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 594. 1986.]
106387 A HYBRID, DECIDABLE, LOGIC-BASED KNOWLEDGE REPRESENTATION SYSTEM.
P. F. Patel-Schneider.
[Schlumberger Computer Aided Systems. AI technical report 49. 1986.]
106388 A PROLOG PROCESSOR BASED ON A PATTERN MATCHING MEMORY DEVICE.
I. Robinson.
[Schlumberger Computer Aided Systems. AI technical report 52. n.d.]
106389 A CMOS CELL ARCHITECTURE AND LIBRARY.
R. R. Schediwy.
[Schlumberger Computer Aided Systems. Technical report 54. 1986.
Thesis (M.S.). "A thesis submitted to the Faculty of Graduate Studies
in partial fulfillment of the requirements for the degree of Master
of Science, Department of Computer Science, University of Calgary,
December 1986."]
106390 P.I.E.S.: AN ENGINEER'S "DO-IT-YOURSELF" KNOWLEDGE SYSTEM FOR
INTERPRETATION OF PARAMETRIC TEST DATA.
J. Y.-C. Pan and J. M. Tenenbaum.
[Schlumberger Computer Aided Systems. Technical report 58. 1986.]
106391 FAIM-1: THE GENERAL ARCHITECTURE.
J. M. Anderson et al.
[Schlumberger Computer Aided Systems. Technical report 61. 1986.]
106392 TEMPLATE MATCHING.
H. G. Barrow and J. M. Tenenbaum.
[Schlumberger Computer Aided Systems. Technical report 63. 1986.]
025138 AUTOMATIC DESIGN OF GRAPHICAL PRESENTATIONS.
J. D. Mackinlay.
[Stanford University. Department of Computer Science.
STAN-CS-86-1138. December 1986. Thesis (Ph.D.).]
025139 LOCAL SHAPE FROM SPECULARITY.
G. Healey and T. O. Binford.
[Stanford University. Department of Computer Science.
STAN-CS-86-1139. June 1986.]
025140 SOAR: AN ARCHITECTURE FOR GENERAL INTELLIGENCE.
J. E. Laird, A. Newell, and P. S. Rosenbloom.
[Stanford University. Department of Computer Science.
STAN-CS-86-1140. December 1986. Also issued as KSL-86-70, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025141 HOW TO CLEAR A BLOCK: A THEORY OF PLANS.
Z. Manna and R. Waldinger.
[Stanford University. Department of Computer Science.
STAN-CS-87-1141. December 1986.]
025142 A HEURISTIC REFINEMENT FOR SPACIAL CONSTRAINT SATISFACTION PROBLEMS.
J. F. Brinkley et al.
[Stanford University. Department of Computer Science.
STAN-CS-87-1142. January 1987. Also issued as KSL-87-05, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025143 UPDATING DATABASES WITH INCOMPLETE INFORMATION.
M. S. Winslett.
[Stanford University. Department of Computer Science.
STAN-CS-87-1143. January 1987. Thesis (Ph.D.).]
025144 CONSIDERATIONS FOR MULTIPROCESSOR TOPOLOGIES.
G. T. Byrd and B. A. Delagi.
[Stanford University. Department of Computer Science.
STAN-CS-87-1144. January 1987. Also issued as KSL-87-07, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025145 NETWORK MEASUREMENT OF THE VMTP REQUEST-RESPONSE PROTOCOL IN THE V
DISTRIBUTED SYSTEM.
D. R. Cheriton and C. L. Williamson.
[Stanford University. Department of Computer Science.
STAN-CS-87-1145. February 1987.]
025146 A POINT-TO-POINT MULTICAST COMMUNICATIONS PROTOCOL.
G. T. Byrd, R. Nakano, and B. A. Delagi.
[Stanford University. Department of Computer Science.
STAN-CS-87-1146. January 1987. Also issued as KSL-87-02, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025147 A LAYERED ENVIRONMENT FOR REASONING ABOUT ACTION.
B. Hayes-Roth et al.
[Stanford University. Department of Computer Science.
STAN-CS-87-1147. November 1986. Also issued as KSL-86-38, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025148 AN INSTRUMENTED ARCHITECTURAL SIMULATION SYSTEM.
B. A. Delagi et al.
[Stanford University. Department of Computer Science.
STAN-CS-87-1148. January 1987. Also issued as KSL-86-36, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
106393 HIERARCHICAL DESIGN OF VLSI SYSTEMS USING ALGEBRAIC SPECIFICATIONS
AND TEMPORAL LOGIC: ON AUTOMATIC SYNTHESIS OF CONTROLLERS FOR VLSI
MODULES FROM THEIR FUNCTIONAL SPECIFICATIONS.
G. C. Gopalakrishnan, M. K. Srivas, and D. R. Smith.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/01. 1986.]
106394 FAULT-TOLERANT MULTIPIPELINE COMPUTERS: A RECONFIGURATION ALGORITHM
AND PROBABILISTIC BOUNDS ON DELAY AND YIELD.
R. Gupta, A. Zorat, and I. V. Ramakrishnan.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/02. 1986.]
106395 MODE INFERENCE AND ABSTRACT INTERPRETATION.
S. K. Debray.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/05. 1986.]
106396 USING LOGIC PROGRAMMING FOR VLSI TESTING.
R. Gupta.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/07. 1986.]
106397 EXTENSIONS TO INCREMENTAL TREE TRANSFORMATIONS FOR SYNTAX-DIRECTED
EDITING.
P. C. Willnauer.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/11. 1986.]
106398 AN EFFICIENT PARALLEL ALGORITHM FOR TERM MATCHING.
R. M. Verma, T. Krishnaprasad, and I. V. Ramakrishnan.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/12. 1986.]
095196 FROM ALGEBRAIC SPECIFICATIONS TO CORRECT VLSI CIRCUITS.
G. C. Gopalakrishnan, D. R. Smith, and M. K. Srivas.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/13. 1986.]
106399 FUNCTION DEFINITIONS IN TERM REWRITING AND APPLICATIVE PROGRAMMING.
C. K. Mohan and M. K. Srivas.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/14. 1986.]
106400 DENOTATIONAL AND OPERATIONAL SEMANTICS FOR PROLOG.
S. K. Debray and P. Mishra.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/15. 1986.]
106401 A THEORY OF MODULES FOR PROLOG.
W. Chen.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/16. 1986. "In partial fulfillment of the
Research Proficiency Examination Requirement for the PhD."]
106402 ENHANCEMENTS TO THE PICTURE ENVIRONMENT OF LATEX.
S. Podar.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/17. 1986.]
106403 TOWARDS A LOGICAL THEORY OF DATABASE UPDATES.
S. Manchanda and D. S. Warren.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/19. 1986.]
106404 TERM MATCHING ON PARALLEL COMPUTERS.
R. Ramesh et al.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/20. 1986.]
106405 CONCURRENT OPERATIONS ON B-TREES.
P. Gupta and A. J. Bernstein.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/21. 1986.]
106406 COMPUTING DOMINATORS IN PARALLEL.
S. Pawagi, P. S. Gopalakrishnan, and I. V. Ramakrishnan.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/24. 1986.]
106407 MAXIMUM WEIGHT INDEPENDENT SET IN TREES.
S. Pawagi.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/25. 1986.]
106408 A THEORY OF MODULES BASED ON HIGHER-ORDER LOGIC I.
W. Chen and D. S. Warren.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/27. 1986.]
106409 CONCURRENT UPDATES IN A PROLOG DATABASE SYSTEM.
S. Manchanda, S. Sengupta, and D. S. Warren.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/28. 1986.]
106410 ON AUTOMATIC LEARNING.
A. Wasilewska.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/32. 1986.]
106411 KNOWLEDGE REPRESENTATION SYSTEMS AND STATIC LEARNING.
A. Wasilewska.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/33. 1986.]
106412 APPROXIMATE LEARNING.
A. Wasilewska.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/34. 1986.]
106413 BUGNET: A REAL TIME DISTRIBUTED DEBUGGING SYSTEM.
S. H. Jones, R. H. Barkan, and L. D. Wittie.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/35. 1986.]
106414 AN OPTIMAL SHORTEST-PATH ROUTING POLICY FOR NETWORK COMPUTERS WITH
REGULAR MESH-CONNECTED TOPOLOGIES.
H. G. Badr and S. Podar.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 86/36. 1986.]
106415 ON PROOFS IN SYSTEMS OF EQUATIONS AND INEQUATIONS.
C. K. Mohan, M. K. Srivas, and D. Kapur.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 87/02. 1987.]
106416 PARALLEL ALGORITHM FOR MAXIMUM WEIGHT MATCHING IN TREES.
S. Pawagi.
[State University of New York, Stony Brook. Department of Computer
Science. Technical report 87/04. 1987.]
106417 CONSTRUCTING A REAL TIME SKELETAL EMULATOR FOR A PUMA ROBOT ARM.
A. Khatib-Shahidi.
[Turing Institute. TIOP-87-003. 1987.]
106418 AN INVESTIGATION INTO VOCAL COMMUNICATION BETWEEN INDUSTRIAL ROBOTS.
S. Gilbert.
[Turing Institute. TIOP-87-004. 1987.]
106419 VEHICLE RECOGNITION USING RULE BASED METHODS.
J. P. Siebert.
[Turing Institute. TIRM-87-018. 1987.]
106420 EXPLORING STRUCTURES: AN EXERCISE IN MODEL-BASED INTERPRETATION.
I. Bratko.
[Turing Institute. TIRM-87-019. 1987.]
106421 FORMAL METHODS IN SOFTWARE ENGINEERING: A TUTORIAL SURVEY.
C. A. R. Hoare.
[Turing Institute. TIRM-87-020. 1987.]
106422 BINEYE: A FLEXIBLE EXPERIMENTAL ROBOT VISION SYSTEM INCORPORATING
INDUCTIVE LEARNING.
B. Shepherd.
[Turing Institute. TIRM-87-021. 1987.]
106423 THE NATIONAL PHYSICAL LABORATORY'S DATA APPROXIMATION SUBROUTINE
LIBRARY.
G. T. Anthony and M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 71/86. 1986.]
106424 DATA APPROXIMATION BY SPLINES IN ONE AND TWO INDEPENDENT VARIABLES.
M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 77/86. 1986.]
106425 NAG ALGORITHMS FOR THE APPROXIMATION OF FUNCTIONS AND DATA.
J. G. Hayes.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 83/86. 1986.]
106426 A SIMULATION STUDY OF AN AUTONOMOUS STEERING SYSTEM FOR ON-ROAD
OPERATION OF AUTOMOTIVE VEHICLES.
R. B. McGhee, M. J. Zyda, and C. H. Tan.
[U.S. Naval Postgraduate School. NPS52-86-025. 1986. Thesis (M.S.).
"This report represents the MS thesis work of the third author
[Michael J. Zyda]."]
106427 COMPUTER GRAPHICS INTERACTIVE WORKSHOP FOR TWO-DIMENSIONAL FRACTALS.
L. G. Mason, R. R. Rautenberg, and M. J. Zyda.
[U.S. Naval Postgraduate School. NPS52-87-001. 1987.]
106428 ELECTROSTATIC INTERPRETATION OF ZEROS.
E. Hendriksen and H. van Rossum.
[University of Amsterdam. Department of Mathmatics. Report no. 86-30.
1986.]
106429 REHABILITATION OF THE GAUSS-JORDAN ALGORITHM.
T. J. Dekker and W. Hoffmann.
[University of Amsterdam. Department of Mathmatics. Report no. 86-28.
1986.]
106430 ELLIPTIC CURVES AND FACTORIZATION ALGORITHMS.
J. van der Lingen.
[University of Amsterdam. Department of Mathmatics. Report no. 87-2.
1987.]
106445 SYSTEM ARCHITECT'S APPRENTICE (SARA) AS THE FOUNDATION FOR A
METHODOLOGY-ORIENTED ADA PROGRAMMING SUPPORT ENVIRONMENT.
E. A. Krell.
[University of California, Los Angeles. Computer Science Department.
CSD-870001. 1987. Thesis (Ph.D.).]
106446 AN O(N SUPERSCRIPT 2 TIMES M SUPERSCRIPT 1/2) DISTRIBUTED MAX-FLOW
ALGORITHM.
J. M. Marberg.
[University of California, Los Angeles. Computer Science Department.
CSD-870002. 1987.]
106447 ANALYSIS OF THE NUMBER OF OCCUPIED PROCESSORS IN A MULTIPROCESSING
SYSTEM.
A. Belghith and L. Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-870003. 1987.]
106448 THE LOGIC OF REPRESENTING DEPENDENCIES BY DIRECTED GRAPHS.
J. Pearl and T. Verma.
[University of California, Los Angeles. Computer Science Department.
CSD-870004. 1987. Also issued as R-79, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
106449 TAXONOMY, STRUCTURE, AND IMPLEMENTATION OF EVIDENTIAL REASONING
MODELS.
M. Ben-Bassat.
[University of California, Los Angeles. Computer Science Department.
CSD-870005. 1987. Also issued as R-78, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
106450 REMOVING REDUNDANCIES IN CONSTRAINT NETWORKS.
A. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-870006. 1987. Also issued as R-81, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
106451 MINIMAL CONSTRAINT GRAPHS.
A. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-870007. n.d. Also issued as R-74, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
106452 DECOMPOSITION OF BOOLEAN FUNCTIONS ON A NETWORK OF POLYFUNCTIONAL
NODES.
R. A. Verstraete and J. J. Vidal.
[University of California, Los Angeles. Computer Science Department.
CSD-870008. 1987.]
106453 A CONSTRAINT-NETWORK APPROACH TO TRUTH-MAINTENANCE.
R. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-870009. 1987. Also issued as R-80, Cognitive Systems Laboratory,
Computter Science Department, University of California, Los Angeles.]
106454 AN INTEGRATED STRATEGY FOR IMPROVED BACKTRACK.
R. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-870010. 1987. Also issued as R-77, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
106455 TOP-DOWN FUNCTIONAL DECOMPOSITION IN DIGITAL PERCEPTRONS.
G. Adler and J. J. Vidal.
[University of California, Los Angeles. Computer Science Department.
CSD-870014. 1987.]
106456 OBJECT-ORIENTED SIMULATION OF POOL BALL MOTION.
A. P. Goldberg.
[University of California, Los Angeles. Computer Science Department.
CSD-870016. 1987. Thesis (M.S.).]
106457 AN IMPROVED CONSTRAINT-PROPAGATION ALGORITHM FOR DIAGNOSIS.
J. Pearl and H. Geffner.
[Univeersity of California, Los Angeles. Computer Science Department.
Cognitive Systems Laboratory. R-73. 1987.]
106458 DECOMPOSING AN N-ARY RELATION INTO A TREE OF BINARY RELATIONS.
R. Dechter.
[University of California, Los Angeles. Computer Science Department.
Cognitive Systems Laboratory. R-76. 1987.]
106459 EXCEPTION FLOW ANALYSIS IN ADA.
D. A. Baker and S. M. Sutton.
[University of Colorado. Department of Computer Science.
CU-CS-319-86. 1986.]
106460 ON LIMITATIONS OF TRANSFORMATIONS BETWEEN COMBINATORIAL PROBLEMS.
W. Slough and K. Winklmann.
[University of Colorado. Department of Computer Science.
CU-CS-336-86. 1986.]
106461 CONNECTIONIST AI, SYMBOLIC AI, AND THE BRAIN.
P. Smolensky.
[University of Colorado. Department of Computer Science.
CU-CS-342-86. 1986.]
106462 DEMONS, CATASTROPHIES, AND COMMUNICATING PROCESSES.
M. G. Main.
[University of Colorado. Department of Computer Science.
CU-CS-343-86. 1986.]
106463 ORDER-THEORETIC TECHNIQUES FOR NONDETERMINISTIC PROGRAMS.
M. G. Main.
[University of Colorado. Department of Computer Science.
CU-CS-344-86. 1986.]
106464 EDGE-LABEL CONTROLLED GRAPH GRAMMARS.
M.G. Main and G. Rozenberg.
[University of Colorado. Department of Computer Science.
CU-CS-349-86. 1986. Preliminary version.]
106465 NON-MONOTONIC REASONING AND CONDITIONALS.
D. Nute.
[University of Georgia. Advanced Computational Methods Center. Report
no. 01-0002. n.d.]
106466 A NON-MONOTONIC LOGIC BASED ON CONDITIONAL LOGIC.
D. Nute.
[University of Georgia. Advanced Computational Methods Center. Report
no. 01-0007. n.d.]
106467 COULD NONMONOTONIC INFERENCE EVER BE DEDUCTIVELY VALID.
T. L. Rankin.
[University of Georgia. Advanced Computational Methods Center. Report
no. 01-0009. n.d.]
106468 LDR: A LOGIC FOR DEFEASIBLE REASONING.
D. Nute.
[University of Georgia. Advanced Computational Methods Center. Report
no. 01-0013. 1986.]
106469 THE AUTOMATION OF A PRACTICAL REASONING SYSTEM BASED ON CONCEPTS IN
DEONTIC LOGIC.
M. Lewis.
[University of Georgia. Advanced Computational Methods Center. Report
no. 01-0014. 1986.]
106470 THE COMPLEXITY OF CUTTING COMPLEXES.
B. Chazelle, H. Edelsbrunner, and L. J. Guibas.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1325. 1987.]
106471 A FUNCTIONAL PROGRAMMING INTERPRETER.
A. D. Robison.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1327. 1987. Thesis (M.S.).]
106472 EXPLICIT STIFF STABILITY VIA SPLITTING AND THE PARALLEL SOLUTION OF
ODES.
C. W. Gear and D. Wang.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1328. 1987.]
106473 TOWARDS A GENERAL-PURPOSE BELIEF MAINTENANCE SYSTEM.
B. Falkenhainer.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1329. 1987.]
106474 MANAGING SOFTWARE DEVELOPMENT.
A. W. Brown, D. S. Robinson, and R. A. Weedon.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 226 1986.]
106475 INTERACTIVE REMOTE SOURCE-LEVEL DEBUGGING TOOLS USING INTERFACE
MONITORING.
C. R. Snow and W. Y. P. Wong.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 228. 1987.]
106476 IMPLEMENTATION OF AN INTERACTIVE REMOTE SOURCE-LEVEL DEBUGGER FOR C
PROGRAMS.
W. Y. P. Wong and C. R. Snow.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 229. 1987.]
106477 MULTICAST GATEWAY DESIGN CONSIDERATIONS.
F. L. Hughes.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 231. 1987.]
106478 AN OPTIMAL RANGE SEARCH ALGORITHM FOR BD TREES.
S. P. Dandamudi and P. G. Sorenson.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-1. 1987.]
106479 AN ENVIRONMENT DEFINITION MODEL FOR METASYSTEM SUPPORT.
J. M. DeDourek et al.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-2. 1987.]
106480 DYNAMIC PLANNING OF BLACKBOARD FOCUS SHIFTS IN AN AUTOMATED DEBUGGING
SYSTEM.
T. H. Ng.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-3. 1987. Thesis (M.S.).]
106481 KNOWLEDGE REPRESENTATION ISSUES IN AUTOMATED TUTORING.
G. I. McCalla.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-4. 1987.]
106482 LEFT DISTANCE BINARY TREE REPRESENTATIONS.
E. Makinen.
[University of Tampere. Department of Computer Science. A-1987-1.
1987.]
106483 AUTOMATIC GENERATION OF TEST DATA FOR RELATIONAL QUERIES.
H. Mannila and K. Raiha.
[University of Tampere. Department of Computer Science. A-1987-2.
1987.]
106484 ON CIRCULAR LAYOUTS.
E. Makinen.
[University of Tampere. Department of Computer Science. A-1987-3.
1987.]
106485 A SIMPLIFYING TRANSFORMATION FOR ATTRIBUTE GRAMMARS.
J. Tarhio and K. Raiha.
[University of Tampere. Department of Computer Science. A-1987-4.
1987.]
106486 A SYSTEMATIC SPECIFICATION SCHEMA BASED ON ATTRIBUTE GRAMMARS FOR
MULTI-LEVEL DATABASE APPLICATIONS.
T. Niemi.
[University of Tampere. Department of Computer Science. A-1987-5.
1987.]
106487 ALADDIN: A TOOL FOR GENERATING ALGORITHM ANIMATIONS.
A. Hyrskykari and K. Raiha.
[University of Tampere. Department of Computer Science. A-1987-6.
1987.]
106488 TWO COMPLEXITY MEASURES FOR CONTEXT-FREE LANGUAGES.
E. Makinen.
[University of Tampere. Department of Computer Science. A-1987-7.
1987.]
106489 NP-COMPLETENESS OF A COMBINATOR OPTIMIZATION PROBLEM.
M. S. Joy and V. J. Rayward-Smith.
[University of Warwick. Department of Computer Science. Research
report RR88. 1987.]
106490 IMPROVED SORTING NETWORKS WITH O(LOG N) DEPTH.
M. S. Paterson.
[University of Warwick. Department of Computer Science. Research
report RR89. 1987.]
106491 CASSANDRA-II: A DISTRIBUTED BLACKBOARD SYSTEM.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR90. 1987.]
106492 A DISTRIBUTED BLACKBOARD ARCHITECTURE.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR91. 1987.]
106493 AN OVERVIEW OF CASSANDRA-II.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR92. 1987.]
106494 DEFINITIVE PRINCIPLES FOR INTERACTIVE GRAPHICS.
M. Beynon.
[University of Warwick. Department of Computer Science. Research
report RR93. 1987.]
106495 THE BB-SR SYSTEM.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR94. 1987.]
106496 A STANDARD FOR A GRAPH REPRESENTATION FOR FUNCTIONAL PROGRAMS.
M. S. Joy and T. Axford.
[University of Warwick. Department of Computer Science. Research
report RR95. 1987.]
106497 SPECIFICATION AND VERIFICATION OF TOTAL CORRECTNESS OF DISTRIBUTED
PROGRAMS.
M. Joseph and P. Pandya.
[University of Warwick. Department of Computer Science. Research
report RR96. 1987.]
106498 CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES.
H. Venkateswaran.
[University of Washington. Department of Computer Science. Report no.
86-08-06. 1986. Thesis (Ph.D.).]
106499 CONSTRAINTS AND LOGIC PROGRAMMING.
K. Kahn and M. Miller.
[University of Washington. Department of Computer Science. Report no.
86-12-01. 1986.]
106500 A LOAD SHARING ALGORITHM FOR A WORKSTATION ENVIRONMENT.
R. Korry.
[University of Washington. Department of Computer Science. Report no.
86-10-03. 1986. Thesis (M.S.).]
106501 INTERCONNECTING HETEROGENEOUS COMPUTER SYSTEMS.
A. P. Black et al.
[University of Washington. Department of Computer Science. Report no.
87-01-02. 1987.]
106502 HEARTS: A DIALECT OF THE POKER PROGRAMMING ENVIRONMENT SPECIALIZED TO
SYSTOLIC COMPUTATION.
L. Snyder.
[University of Washington. Department of Computer Science. Report no.
86-10-01. 1986.]
106503 SIMPLE UNIVERSAL PARALLEL COMPUTERS BASED ON HYPERCUBE
INTERCONNECTIONS.
W. L. Ruzzo.
[University of Washington. Department of Computer Science. Report no.
86-09-11. 1986. Detailed abstract.]
106504 A LACE FOR ADA'S CORSET.
T. P. Baker and K. Jeffay.
[University of Washington. Department of Computer Science. Report no.
86-09-06. 1986.]
106505 ACCURACY, SPEED, AND CONVERGENCE OF APPROXIMATE MEAN VALUE ANALYSIS.
J. Zahorjan, D. L. Eager, and H. Swelliam.
[University of Washington. Department of Computer Science. Report no.
86-08-07. 1986.]
106506 HYPERBOLIC APPROXIMATIONS FOR A CAUCHY PROBLEM FOR THE HEAT EQUATION.
L. Elden.
[Uppsala University. Department of Computer Science. Report no. 105.
1987.]
106507 STABILITY OF DIFFERENCE APPROXIMATIONS OF HYPERBOLIC SYSTEMS ON
SUBSTRUCTURED DOMAINS.
M. Thune.
[Uppsala University. Department of Computer Science. Report no. 106.
1986.]
106508 DANCE AND COMPUTERS.
D. Herbison-Evans.
[University of Waterloo. Department of Computer Science. CS-86-51.
1985.]
106509 COMPUTER ANIMATION OF THE HUMAN FIGURE USING BENESH NOTATION.
D. Herbison-Evans.
[University of Waterloo. Department of Computer Science. CS-86-50.
1986.]
106510 AVL TREES, ON-THE-FLY RESTRUCTURING, AND CONCURRENCY.
E. Soisalon-Soininen and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-52.
1986.]
106511 PARTITION AND SEPARATING SETS OF ORTHOGONAL POLYGONS.
T. Ottman, E. Soisalon-Soininen, and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-53.
1986.]
106512 THE DEFINITION, EDITING, AND CONTOURING OF SURFACES FOR THE ANALYSIS
OF FIELD PROBLEMS.
R. D. Dickinson and R. H. Bartels.
[University of Waterloo. Department of Computer Science. CS-86-54.
1986.]
106513 USING B-SPLINES FOR RE-SIZING IMAGES.
R. V. Klassen and R. H. Bartels.
[University of Waterloo. Department of Computer Science. CS-86-55.
1986.]
106514 SOLVING QUARTICS AND CUBICS FOR GRAPHICS.
D. Herbison-Evans.
[University of Waterloo. Department of Computer Science. CS-86-56.
1986.]
106515 THE ORTHOGONAL CONVEX SKULL PROBLEM.
D. Wood and C. K. Yap.
[University of Waterloo. Department of Computer Science. CS-86-57.
1986.]
106516 ON RECTANGULAR VISIBILITY.
M. Overmars and D. Wood.
[University of Waterloo. Department of Computer Science. CS-86-58.
1986.]
106517 SINGLE-VALUED FINITE TRANSDUCTION.
J. H. Johnson.
[University of Waterloo. Department of Computer Science. CS-86-59.
1986.]
106518 MEASURING THE EFFECTIVENESS OF PERSONAL DATABASE STRUCTURES.
D. R. Raymond et al.
[University of Waterloo. Department of Computer Science. CS-86-60.
1986.]
106519 A SURVEY OF RESEARCH IN COMPUTER-BASED MENUS.
D. R. Raymond.
[University of Waterloo. Department of Computer Science. CS-86-61.
1986.]
106520 PROGRAMMING THE ELECTROHOME QUICKPEL GRAPHICS BOARD.
D. R. Raymond and V. Boggild.
[University of Waterloo. Department of Computer Science. CS-86-62.
1986.]
106521 GRAPHICAL SPECIFICATION OF KEYWORD QUERIES TO VIDEOTEX DATABASES.
V. Boggild.
[University of Waterloo. Department of Computer Science. CS-86-63.
1986.]
106522 ROTATIONS AND THE BENESH MOVEMENT NOTATION.
D. Herbison-Evans.
[University of Waterloo. Department of Computer Science. CS-86-64.
1986.]
106523 THE IM RASTER TOOLKIT: DESIGN, IMPLEMENTATION, AND USE.
A. W. Paeth.
[University of Waterloo. Department of Computer Science. CS-86-65.
1986.]
106524 CRASH RECOVERY FOR BINARY TREES.
D. J. Taylor.
[University of Waterloo. Department of Computer Science. CS-86-66.
1986.]
106525 A TRIVIAL ALGORITHM WHOSE ANALYSIS ISN'T: A CONTINUATION.
R. A. Baeza-Yates.
[University of Waterloo. Department of Computer Science. CS-86-67.
1986.]
106526 THE EXPECTED BEHAVIOR OF B+-TREES.
R. A. Baeza-Yates.
[University of Waterloo. Department of Computer Science. CS-86-68.
1986.]
106527 PROCESSOR UTILIZATION IN A LINEARLY CONNECTED PARALLEL PROCESSING
SYSTEM.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-85-140.
1985.]
106528 ENCODING GRAPHS IN GRAPHS.
M. R. Fellows.
[Washington State University. Computer Science Department. CS-85-141.
1985. Thesis (Ph.D.).]
106529 A CATEGORY OF GRAPHS FOR MULTIPROCESSING.
M. R. Fellows.
[Washington State University. Computer Science Department. CS-85-142.
1984.]
106530 STABLE DUPLICATE-KEY EXTRACTION WITH OPTIMAL TIME AND SPACE BOUNDS.
B. Huang and M. A. Langston.
[Washington State University. Computer Science Department. CS-86-145.
1986.]
106531 STIRLING GRAPHS AND THEIR PROPERTIES.
S. K. Das and N. Deo.
[Washington State University. Computer Science Department. CS-86-146.
1986.]
106532 PRACTICAL IN-PLACE MERGING.
B. Huang and M. A. Langston.
[Washington State University. Computer Science Department. CS-86-150.
1986.]
106533 LESSA: AN ARRAY TO SOLVE A SET OF LINEAR EQUATIONS.
D. Sarkar.
[Washington State University. Computer Science Department. CS-86-154.
1986.]
106534 BIN PACKING: ON OPTIMIZING THE NUMBER OF PIECES PACKED.
D. K. Friesen and M. A. Langston.
[Washington State University. Computer Science Department. CS-86-155.
1986.]
106535 THE KNAPSACK PROBLEM WITH DISJOINT MULTIPLE CHOICE CONSTRAINTS.
V. Aggarwal, N. Deo, and D. Sarkar.
[Washington State University. Computer Science Department. CS-86-156.
1986.]
106536 PROBLEMS OF POSTING SENTRIES.
R. Krishnaswamy and C. E. Kim.
[Washington State University. Computer Science Department. CS-86-159.
1986.]
106537 ON FINDING OPTIMAL AND NEAR-OPTIMAL LINEAL SPANNING TREES.
M. R. Fellows, D. K. Friesen, and M. A. Langston.
[Washington State Univeristy. Department of Computer Science.
CS-86-160. 1986.]
106538 THE NUMERICAL EVALUATION OF MULTIPLE INTEGRALS ON PARALLEL COMPUTERS.
A. Genz.
[Washington State University. Department of Computer Science.
CS-86-161. 1986.]
106539 THE END OF INNOCENCE IN POLYNOMIAL-TIME COMPLEXITY.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-86-162.
1986.]
106540 A SYSTOLIC PARSING ALGORITHM FOR A VISUAL PROGRAMMING LANGUAGE.
A. W. Bojanczyk and K. D. Takayuki.
[Washington University. Department of Computer Science. Technical
report WUCS-86-7. 1986.]
106541 TOWARD COMPREHENSIVE SPECIFICATION OF DISTRIBUTED SYSTEMS.
G. Roman et al.
[Washington University. Department of Computer Science. Technical
report WUCS-86-8. 1986.]
106542 THE COMPLEXITY OF THE SHORTEST COMMON MATCHING STRING PROBLEM.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-86-9. 1986.]
106543 PERFORMANCE OF A BROADCAST PACKET SWITCH.
R. G. Bubenik and J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-86-10. 1986.]
106544 APPROXIMATION ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING PROBLEM.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-86-16. 1986.]
106545 LOGIC SIMULATION: STATISTICS AND MACHINE DESIGN.
K. F. Wong and M. A. Franklin.
[Washington University. Department of Computer Science. Technical
report WUCS-86-17. 1986.]
106546 PERFORMANCE ANALYSIS AND DESIGN OF A LOGIC SIMULATION MACHINE.
K. F. Wong and M. A. Franklin.
[Washington University. Department of Computer Science. Technical
report WUCS-86-19. 1986.]
106547 A UNIFIED APPROACH TO MIXED-MODE SIMULATION.
R. D. Chamberlain and M. A. Franklin.
[Washington University. Department of Computer Science. Technical
report WUCS-86-20. 1986.]
106548 A LAYERED METHOD FOR PROCESS AND CODE MAPPING.
S. Taylor, E. Av-Ron, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS86-17. 1986.]
106549 LAYERS OF PROTECTION AND CONTROL IN THE LOGIX SYSTEM.
M. Hirsch, W. Silverman, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS86-19. n.d.]
106550 A SEQUENTIAL ABSTRACT MACHINE FOR FLAT CONCURRENT PROLOG.
A. Houri and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS86-20. 1986.]
106551 THE LOGIX SYSTEM USER MANUAL.
W. Silverman et al.
[Weizmann Institute of Science. Department of Computer Science.
CS86-21. 1986.]
106552 APPLICATIONS OF TEMPORAL LOGIC TO THE SPECIFICATION AND VERIFICATION
OF REACTIVE SYSTEMS: A SURVEY OF CURRENT TRENDS.
A. Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-22. 1986.]
106553 SPECIFICATION AND IMPLEMENTATION OF CONCURRENTLY ACCESSED DATA
STRUCTURES: AN ABSTRACT DATA TYPE APPROACH.
S. Kaplan and A. Pnueli.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-23. 1986.]
106554 PARTIAL EVALUATION OF CONCURRENT PROLOG AND ITS IMPLICATIONS.
S. Safra.
[Weizmann Institute of Science. Department of Computer Science.
CS86-24. 1986. Thesis (M.S.).]
106555 HARDWARE DESCRIPTION AND SIMULATION USING CONCURRENT PROLOG.
D. Weinbaum and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS86-25. 1986.]
095197 PROBLEMS AND RESULTS IN COMPLEXITY OF COMBINATORIAL GAMES.
A. E. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-26. 1986.]
106556 THE NUMBER OF FIXED POINTS OF THE MAJORITY RULE.
Z. Agur, A. S. Fraenkel, and S. T. Klein.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-27. 1986.]
106557 CFL -- A CONCURRENT FUNCTIONAL LANGUAGE EMBEDDED IN A CONCURRENT
LOGIC PROGRAMMING ENVIRONMENT.
J. Levy.
[Weizmann Institute of Science. Department of Computer Science.
CS86-28. 1986.]
106558 SHARED MEMORY EXECUTION OF COMMITTED-CHOICE LANGUAGES.
J. Levy.
[Weizmann Institute of Science. Department of Computer Science.
CS86-29. 1986.]
106559 PROPERTIES OF K-WELTER'S GAME.
D. Duvdevani and A. S. Fraenkel.
[Weizmann Institute of Science. Department of Applied Mathematics.
CS86-30. 1986.]
106560 A GENERALIZATION OF DIJKSTRA'S CALCULUS.
G. Nelson.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 16. 1987.]
106561 RACCO: A MODAL-LOGIC PROGRAMMING LANGUAGE FOR WRITING MODELS OF
REAL-TIME PROCESS-CONTROL SYSTEMS: TOWARD COMPUTER-AIDED GENERATION
OF REALTIME SYSTEM SOFTWARE.
T. Hattori et al.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-558. 1986.]
106562 ADAPTIVE FINITE DIFFERENCE METHODS IN FLUID DYNAMICS.
M. J. Berger.
[New York University. Courant Mathematics and Computing Laboratory.
Research and development report UC-32. 1987.]
106563 PARALLEL DIVISION CIRCUITS FOR SMALL DIVISORS.
R. W. Doran.
[University of Auckland. Department of Computer Science. Report no.
38. 1987.]
054315 A VALIDATION SUBSYSTEM OF A VERSION SERVER FOR COMPUTER-AIDED DESIGN
DATA.
R. Bhateja and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/315. 1986.]
106564 DATABASE SYSTEM SUPPORT FOR SOFTWARE ENGINEERING.
P. A. Bernstein.
[Wang Institute of Graduate Studies. School of Information
Technology. TR-87-01. 1987.]
VOL. 9, NO. 7 07/27/87
106565 ON UNDERSTANDING TYPES, DATA ABSTRACTION, AND POLYMORPHISM.
L. Cardelli and P. Wegner.
[Brown Univeristy. Department of Computer Science. CS-85-14. 1985.
Revised: January 1986.]
106566 A FUNCTIONAL APPROACH TO DATA STRUCTURES AND ITS USE IN
MULTIDIMENSIONAL SEARCHING.
B. Chazelle.
[Brown University. Department of Computer Science. CS-85-16. 1985.]
106567 SUM AMUSEMENTS: A CASE STUDY FROM THE ANALYSIS OF ALGORITHMS.
E. A. Lamanga and R. A. Ravenscroft Jr.
[Brown University. Department of Computer Science. CS-86-13. 1986.]
106568 MANAGEMENT OF TEMPORARY CONSTRAINTS FOR FACTORY SCHEDULING.
C. Le Pape and S. F. Smith.
[Carnegie Mellon University. The Robotics Institute. CMU-RI-TR-87-13.
1987.]
106569 WIN AND SIN: PREDICATE TRANSFORMERS FOR CONCURRENCY.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 17. 1987.]
106570 IMPACT OF COMMUNICATION NETWORKS ON FAULT-TOLERANT DISTRIBUTED
COMPUTING.
R. Drummond.
[Cornell University. Department of Computer Science. TR-86-748. 1986.
Thesis (Ph.D.).]
106571 IMPLEMENTATION ISSUES IN CLOCK SYNCHRONIZATION.
M. Beck, T. K. Srikanth, and S. Toueg.
[Cornell University. Department of Computer Science. TR-86-749. 1986.]
106572 PREDICTING STRUCTURE IN SPARSE MATRIX COMPUTATIONS.
J. R. Gilbert.
[Cornell University. Department of Computer Science. TR-86-750. 1986.]
106573 THE EFFICIENCY OF INVERTED INDEX AND CLUSTER SEARCHES.
E. M. Voorhees.
[Cornell University. Department of Computer Science. TR-86-751. 1986.]
106574 IMPLEMENTING NUMBER THEORY: AN EXPERIMENT WITH NUPRL.
D. J. Howe.
[Cornell University. Department of Computer Science. TR-86-752. 1986.]
106575 COMMUNICATION SUPPORT FOR RELIABLE DISTRIBUTED COMPUTING.
K. P. Birman and T. A. Joseph.
[Cornell University. Department of Computer Science. TR-86-753. 1986.]
106576 RELIABLE BROADCAST PROTOCOLS AND NETWORK ARCHITECTURE: TRADEOFFS AND
LOWER BOUNDS.
O. Babaoglu, R. Drummond, and P. Stephenson.
[Cornell University. Department of Computer Science. TR-86-754. 1986.]
106577 ENGINEERING FAULT-TOLERANT DISTRIBUTED COMPUTING SYSTEMS.
O. Babaoglu.
[Cornell University. Department of Computer Science. TR-86-755. 1986.]
106578 STOPPING TIMES OF DISTRIBUTED CONSENSUS PROTOCOLS: A PROBABILISTIC
ANALYSIS.
O. Babaoglu.
[Cornell University. Department of Computer Science. TR-86-756. 1986.
Revised: October 1986.]
106579 EXTRACTING EFFICIENT CODE FROM CONSTRUCTIVE PROOFS.
J. T. Sasaki.
[Cornell University. Department of Computer Science. TR-86-757. 1986.
Thesis (Ph.D.).]
106580 THE GEOMETRY OF PROJECTIVE BLENDING SURFACES.
C. Hoffmann and J. Hopcroft.
[Cornell University. Department of Computer Science. TR-86-758. 1986.]
106581 DISCUSSION OF PARALLEL ALGORITHMS.
A. Moitra and S. S. Iyengar.
[Cornell University. Department of Computer Science. TR-86-759. 1986.]
106582 IMPREDICATIVE STRONG EXISTENTIAL EQUIVALENT TO TYPE:TYPE.
J. G. Hook and D. J. Howe.
[Cornell University. Department of Computer Science. TR-86-760. 1986.]
106583 EXACT COUNTING IS AS EASY AS APPROXIMATE COUNTING.
J. Cai and L. A. Hemachandra.
[Cornell University. Department of Computer Science. TR-86-761. 1986.]
106584 A CHORDAL PRECONDITIONER FOR LARGE SCALE OPTIMIZATION.
T. F. Coleman.
[Cornell University. Department of Computer Science. TR-86-762. 1986.]
106585 COMPUTATION OF ALIASES AND SUPPORT SETS.
A. Neirynck, P. Panagaden, and A. J. Demers.
[Cornell University. Department of Computer Science. TR-86-763. 1986.]
106586 FIRST- AND SECOND-ORDER LAMBDA CALCULI WITH RECURSIVE TYPES.
N. P. Mendler.
[Cornell University. Department of Computer Science. TR-86-764. 1986.]
106587 IMPLEMENTING AGGLOMERATIVE HIERARCHIC CLUSTERING ALGORITHMS FOR USE
IN DOCUMENT RETRIEVAL.
E. M. Voorhees.
[Cornell University. Department of Computer Science. TR-86-765. 1986.]
106588 COMPLETENESS AND INCOMPLETENESS OF TRACE-BASED NETWORK PROOF SYSTEMS.
J. Widom, D. Gries, and F. B. Schneider.
[Cornell University. Department of Computer Science. TR-86-766. 1986.
Revised: September 1986.]
106589 SOME NESTED DISSECTION ORDER IS NEARLY OPTIMAL.
J. R. Gilbert.
[Cornell University. Department of Computer Science. TR-86-767. 1986.]
106590 THE PRL MATHEMATICS ENVIRONMENT: A KNOWLEDGE BASED MEDIUM.
J. Bates.
[Cornell University. Department of Computer Science. TR-86-768. 1986.
"Extended abstract."]
106591 ADAPTIVE BITONIC SORTING: AN OPTIMAL PARALLEL ALGORITHM FOR SHARED
MEMORY MACHINES.
G. Bilardi and A. Nicolau.
[Cornell University. Department of Computer Science. TR-86-769. 1986.]
106592 ON ALGEBRAIC SURFACES MEETING WITH GEOMETRIC CONTINUITY.
J. D. Warren.
[Cornell University. Department of Computer Science. TR-86-770. 1986.
Thesis (Ph.D.).]
106593 DETERMINISTIC POLYNOMIAL TIME WITH O(LOG N) QUERIES.
J. Kadin.
[Cornell University. Department of Computer Science. TR-86-771. 1986.]
106594 PROGRAMMING WITH SHARED BULLETIN BOARDS IN ASYNCHRONOUS DISTRIBUTED
SYSTEMS.
K. P. Birman et al.
[Cornell University. Department of Computer Science. TR-86-772. 1986.
Revised: December 1986.]
106595 POLYNOMIAL DECOMPOSITION ALGORITHMS.
D. Kozen and S. Landau.
[Cornell University. Department of Computer Science. TR-86-773. 1986.]
106596 THE AUTOMATED DESIGN OF PARTS ORIENTERS.
B. K. Natarajan.
[Cornell University. Department of Computer Science. TR-86-774. 1986.]
106597 ON MOVING AND ORIENTING OBJECTS.
B. K. Natarajan.
[Cornell University. Department of Computer Science. TR-86-775. 1986.
Thesis (Ph.D.).]
106598 RESOURCE BOUNDED KOLMOGOROV COMPLEXITY, A LINK BETWEEN COMPUTATIONAL
COMPLEXITY AND INFORMATION THEORY.
L. Longpre.
[Cornell University. Department of Computer Science. TR-86-776. 1986.
Thesis (Ph.D.).]
106599 THE SKY IS FALLING: THE STRONG EXPONENTIAL HIERARCHY COLLAPSES.
L. A. Hemachandra.
[Cornell University. Department of Computer Science. TR-86-777. 1986.]
106600 ON SOME MOST PROBABLE SEPARATIONS OF COMPLEXITY CLASSES.
J. Cai.
[Cornell University. Department of Computer Science. TR-86-778. 1986.
Thesis (Ph.D.).]
106601 CONSTRUCTIVE AUTOMATA THEORY IMPLEMENTED WITH THE NUPRL PROOF
DEVELOPMENT SYSTEM.
C. Kreitz.
[Cornell University. Department of Computer Science. TR-86-779. 1986.]
106602 DEVELOPING A LINEAR ALGORITHM FOR CUBING A CYCLIC PERMUTATION.
J. Xue and D. Gries.
[Cornell University. Department of Computer Science. TR-86-780. 1986.]
106603 EFFICIENT CONCURRENCY CONTROL FOR LIBRARIES OF TYPED OBJECTS.
T. Raeuchle.
[Cornell University. Department of Computer Science. TR-86-781. 1986.
Thesis (Ph.D.).]
106604 A PROOF SYSTEM FOR DATAFLOW NETWORKS WITH INDETERMINATE MODULES.
A. Moitra and P. Panangaden.
[Cornell University. Department of Computer Science. TR-86-782. 1986.]
106605 SPARSE PARTIAL PIVOTING IN TIME PROPORTIONAL TO ARITHMETIC OPERATIONS.
J. R. Gilbert and T. Peierls.
[Cornell University. Department of Computer Science. TR-86-783. 1986.]
106606 OUTPUT-SIZE SENSITIVE ALGORITHMS FOR CONSTRUCTIVE PROBLEMS IN
COMPUTATIONAL GEOMETRY.
R. Seidel.
[Cornell University. Department of Computer Science. TR-86-784. 1986.
Thesis (Ph.D.).]
106607 A DEVELOPMENT ENVIRONMENT FOR HORIZONTAL MICROCODE.
A. Aiken and A. Nicolau.
[Cornell University. Department of Computer Science. TR-86-785. 1986.]
106608 GENERATING A RANDOM CYCLIC PERMUTATION.
D. Gries and J. Xue.
[Cornell University. Department of Computer Science. TR-86-786. 1986.]
106609 CONSTRUCTING DISTRIBUTED SYSTEMS IN CONIC.
J. Magee, J. Kramer, and M. Sloman.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/4. 1987.]
106610 PARLOG AND ALICE: A MARRIAGE OF CONVENIENCE.
M. Lam and S. Gregory.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/7. 1987.]
106611 PARLOG AND PROLOG UNITED.
K. Clark and S. Gregory.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/8. 1987.]
106612 DISTRIBUTED SYSTEMS MANAGEMENT.
M. Sloman.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/6. 1987. Edited by M. Sloman.]
106613 A SOFTWARE ENGINEERING PERSPECTIVE.
R. J. Cunningham.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/9. 1987.]
106614 LOGIC OPERATING SYSTEMS: DESIGN ISSUES.
I. Foster.
[Imperial College of Science and Technology. Department of Computing.
DOC 87/10. 1987.]
106615 EXPLOITING LOOP LEVEL PARALLELISM IN NONPROCEDURAL DATAFLOW PROGRAMS.
M. B. Gokhale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-23. 1987.]
106616 PROBLEM SIZE, PARALLEL ARCHITECTURE, AND OPTIMAL SPEEDUP.
D. M. Nicol and F. H. Willard.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-7. 1987.]
106617 SINGULAR FINITE ELEMENT METHODS.
G. J. Fix.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-24. 1987.]
106618 INTENDED MODELS, CIRCUMSCRIPTION, AND COMMONSENSE REASONING.
W. W. Zadrozny.
[International Business Machines Corporation (IBM). Research
Division. RC 12397. 1987.]
106619 A MEASURE OF GUARANTEED AVAILABILITY AND ITS NUMERICAL EVALUATION.
A. Goyal and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 12518. 1987.]
106620 LOGIC PROGRAMMING WITH SETS.
G. M. Kuper.
[International Business Machines Corporation (IBM). Research
Division. RC 12624. 1987.]
106621 REPORT ON THE CHORAL PROJECT: AN EXPERT SYSTEM FOR HARMONIZING
FOUR-PART CHORALES.
K. Ebcioglu.
[International Business Machines Corporation (IBM). Research
Division. RC 12628. 1987.]
106622 MULTI-LAYER GRID EMBEDDINGS FOR VLSI.
A. Aggarwal and M. Klawe.
[International Business Machines Corporation (IBM). Research
Division. RJ 5467. 1987.]
106623 STOCHASTIC PETRI NETS WITH SIMULTANEOUS TRANSITION FIRINGS.
P. J. Haas and G. S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 5464. 1987.]
106624 TOWARDS A PERFORMANCE ESTIMATION ASSISTANT.
D. R. Smith and A. Goldberg.
[Kestrel Institute. KES.U.86.10. 1986.]
106625 KNOWLEDGE-BASED SYNTHESIS OF EFFICIENT STRUCTURES FOR CONCURRENT
COMPUTATION USING FAT-TREES AND PIPELINING.
R. King.
[Kestrel Institute. KES.U.86.11. 1986.]
106626 ON THE DESIGN OF GENERATE-AND-TEST ALGORITHMS: SUBSPACE GENERATORS.
D. R. Smith.
[Kestrel Institute. KES.U.86.6. 1986.]
106627 AN ENVIRONMENT SUPPORTING THE AUTOMATION OF SOFTWARE DEVELOPMENT.
T. Pressburger.
[Kestrel Institute. KES.U.86.7. 1986.]
106628 THE LOGIC OF PROBLEM REFORMULATION.
M. R. Lowry.
[Kestrel Institute. KES.U.86.9. 1986.]
106629 SPECIFICATION OF TIME DEPENDENCIES AND SYNTHESIS OF CONCURRENT
PROGRAMS.
P. Ladkin.
[Kestrel Institute. KES.U.87.1. 1987.]
106630 INTERACTIVE GENERATION OF FRACTAL OBJECTS.
J. A. Kaandorp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8706. 1987.]
106631 LOCALITY, COMMUNICATION AND INTERCONNECT LENGTH IN MULTICOMPUTERS.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8708. 1987.]
106632 SOLVING REFLEXIVE DOMAIN EQUATIONS IN A CATEGORY OF COMPLETE METRIC
SPACES.
P. America and J. J. M. M. Rutten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8709. 1987.]
106633 A PROOF-RULE FOR PROCESS-CREATION.
F. S. de Boer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8710. 1987.]
106634 USING DESIGN AXIOMS AND TOPOLOGY TO MODEL DATABASE SEMANTICS.
A. P. J. M. Siebes and M. L. Kersten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8711. 1987.]
106635 A PARSER GENERATOR FOR FINITELY AMBIGUOUS CONTEXT-FREE GRAMMARS.
J. Rekers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8712. 1987.]
106636 EXPLICIT-IMPLICIT METHODS FOR TIME-DEPENDENT PARTIAL DIFFERENTIAL
EQUATIONS.
E. D. de Goede and F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8703. 1987.]
106637 DIAGONALLY IMPLICIT RUNGE-KUTTA-NYSTROEM METHODS FOR OSCILLATORY
PROBLEMS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8704. 1987.]
106638 ANALYSIS OF SMOOTHING MATRICES FOR THE PRECONDITIONING OF ELLIPTIC
DIFFERENCE EQUATIONS.
P. J. van der Houwen, C. Boon, and F. W. Wubs.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8705. 1987.]
106639 A NOTE ON A DIAGONALLY IMPLICIT RUNGE-KUTTA-NYSTROEM METHOD.
B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8706. 1987.]
106640 IMPROVING THE STABILITY OF PREDICTOR-CORRECTOR METHODS BY RESIDUE
SMOOTHING.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8707. 1987.]
106641 A SURVEY OF HYPERTEXT.
J. Conklin.
[Microelectronics and Computer Technology Corporation (MCC).
Technical report STP-356-86, Rev. 1. 1987.]
106642 THE DYNAMICS OF BUBBLE GROWTH FOR RAYLEIGH-TAYLOR UNSTABLE INTERFACES.
C. Gardner et al.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-282. 1987.]
106643 PERFORMANCE OF PARALLEL PROCESSORS.
H. P. Flatt and K. Kennedy.
[Rice University. Department of Computer Science. TR85-22. 1987.
November 1985. Revised: January 1987.]
106644 TOWARD A LOGICAL THEORY OF PROGRAM DATA.
R. Cartwright.
[Rice University. Department of Computer Science. TR85-33. 1985.]
106645 AN IMPROVEMENT TO BOTTOM-UP TREE PATTERN MATCHING.
D. R. Chase.
[Rice University. Department of Computer Science. TR86-34. 1986.]
106646 EFFICIENT RECOMPILATION OF MODULE INTERFACES IN A SOFTWARE
DEVELOPMENT ENVIRONMENT.
H. A. Muller, R. Hood, and K. Kennedy.
[Rice University. Department of Computer Science. TR86-35. 1986.]
106647 RIGI- A MODEL FOR SOFTWARE SYSTEM CONSTRUCTION, INTEGRATION, AND
EVOLUTION BASED ON MODULE INTERFACE SPECIFICATIONS.
H. A. Muller.
[Rice University. Department of Computer Science. TR86-36. 1986.
Thesis (Ph.D.).]
106648 TOWARDS A DECLARATIVE SEMANTICS FOR INFINITE OBJECTS IN LOGIC
PROGRAMMING.
W. G. Golson.
[Rice University. Department of Computer Science. TR86-37. 1986.]
106649 AN IMPLEMENTATION OF INTERPROCEDURAL DATA FLOW ANALYSIS IN A
VECTORIZING FORTRAN COMPILER.
R. Allen, D. Callahan, and K. Kennedy.
[Rice University. Department of Computer Science. TR86-38. 1986.]
106650 PARALLEL ATTRIBUTE GRAMMAR EVALUATION.
H.-J. Boehm and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR86-39. 1986.]
106651 A GLOBAL APPROACH TO THE DETECTION OF PARALLELISM.
D. Callahan.
[Rice University. Department of Computer Science. TR86-40. 1986.]
106652 PARASOL: A LABORATORY FOR PARALLEL SOFTWARE TECHNOLOGY RESEARCH.
[Rice University. Department of Computer Science. TR86-41. 1986.
Principal investigators: Robert Cartwright, John E. Dennis, Robert T.
Hood, J. Robert Jump, Ken Kennedy, Willy Zwaenepoel. Contributing
investigators: Guy T. Almes, Robert E. Bixby, Hans-J. Boehm, C.
Sidney Burrus, Keith D. Cooper, R. J. P. de Figueiredo, Don H.
Johnson, Charles B. Lawrence, Lori L. Pollock, J. Bartlett Sinclair,
William W. Symes, Richard A. Tapia, Linda M. Torczon, Peter Varman,
Mary F. Wheeler.]
106653 AUTOMATIC DECOMPOSITION OF SCIENTIFIC PROGRAMS FOR PARALLEL EXECUTION.
R. Allen, D. Callahan, and K. Kennedy.
[Rice University. Department of Computer Science. TR86-42. 1986.]
106654 SENDER-BASED MESSAGE LOGGING: LOW-OVERHEAD FAULT TOLERANCE FOR
DISTRIBUTED SYSTEMS.
D. B. Johnson.
[Rice University. Department of Computer Science. TR86-43. 1986.]
106655 A COMPREHENSIVE FACILITY FOR EXECUTING AND DEBUGGING SCIENTIFIC
PROGRAMS.
R. Hood.
[Rice University. Department of Computer Science. TR86-44. 1986.]
106656 SHAPE REPRESENTATION BY MULTISCALE CONTOUR APPROXIMATION.
A. Bengtson, J.-O. Eklund, and J. Howako.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8607. 1986.]
106657 SYNTHESIZING SYNCHRONOUS SYSTEMS BY STATIC SCHEDULING IN SPACE-TIME.
B. Lisper.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8701. 1987.]
052051 NOUN PHRASE INTERPRETATION IN MONTAGUE GRAMMAR, FILE CHANGE
SEMANTICS, AND SITUATION SEMANTICS.
M. Rooth.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-51. August 1986.]
052062 A SHEAF-THEORETIC MODEL OF CONCURRENCY.
L. F. Monteiro and F. C. N. Pereira.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-62. October 1986.]
052063 DISCOURSE, ANAPHORA AND PARSING.
M. Johnson and E. Klein.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-63. October 1986.]
052064 TARSKI ON TRUTH AND LOGICAL CONSEQUENCE.
J. Etchemendy.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-64. October 1986.]
052065 THE LFG TREATMENT OF DISCONTINUITY AND THE DOUBLE INFINITIVE
CONSTRUCTION IN DUTCH.
M. Johnson.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-65. October 1986.]
052066 CATEGORICAL UNIFICATION GRAMMARS.
H. Uszkoreit.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-66. December 1986.]
052067 GENERALIZED QUANTIFIERS AND PLURALS.
G. Link.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-67. December 1986.]
052068 RADICAL LEXICALISM.
L. Karttunen.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-68. December 1986.]
052069 WHAT IS INTENTION?
M. E. Bratman.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-69. January 1987.]
052070 "UNDERSTANDING COMPUTERS AND COGNITION": FOUR REVIEWS AND A RESPONSE.
M. Stefik.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-70. January 1987. Contains four reviews of the
book, "Understanding Computers and Cognition" by Terry Winograd and
Fernando Flores, and a response by the authors. Mark Stefik, editor.]
052071 THE CORRESPONDENCE CONTINUUM.
B. C. Smith.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-71. January 1987.]
052072 THE ROLE OF PROPOSITIONAL OBJECTS OF BELIEF IN ACTION.
D. J. Israel.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-72. January 1987.]
052073 FROM WORLDS TO SITUATIONS.
J. Perry.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-73. January 1987.]
052074 TWO REPLIES.
J. Barwise.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-74. January 1987. Replies to criticisms of
Situation Semantics by Max Cresswell and Jerry Fodor.]
052077 THE PARTS OF PERCEPTION.
A. Pentland.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-77. February 1987.]
052083 THE SYNTHESIS OF DIGITIAL MACHINES WITH PROVABLE EPISTEMIC PROPERTIES.
S. J. Rosenschein and L. P. Kaelbling.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-83. March 1987.]
025137 THE LEAF FILE ACCESS PROTOCOL.
J. Mogul.
[Stanford University. Department of Computer Science.
STAN-CS-86-1137. December 1986.]
025149 PROCEEDING FROM THE NINETEENTH ANNUAL MEETING OF THE STANFORD
COMPUTER FORUM, FEBRUARY 1987, DEPARTMENT OF COMPUTER SCIENCE (PROF.
NILS NILSSON, CHAIRMAN) AND THE COMPUTER SYSTEMS LABORATORY (PROF.
JOHN HENNESSY, DIRECTOR).
K. MacMillen, A. Diaz-Barriga, and C. E. Tajnai.
[Stanford University. Department of Computer Science.
STAN-CS-87-1149. February 1987. Edited by Katie MacMillen, Ann
Diaz-Barriga, and Carolyn Tajnai. William F. Miller, Director.
Carolyn E. Tajnai, Manager. Terry Winograd, Program Chairman. Also
issued as CSL-TR-87-315, Computer Systems Laboratory, Stanford
University.]
025150 ANALOGICAL AND INDUCTIVE REASONING.
S. J. Russell.
[Stanford University. Department of Computer Science.
STAN-CS-87-1150. December 1986. Thesis (Ph.D.).]
025151 TEMPORAL-LOGIC THEOREM PROVING.
M. Abadi.
[Stanford University. Department of Computer Science.
STAN-CS-87-1151. March 1987. Thesis (Ph.D.).]
025152 INTERPRETING NATURAL LANGUAGE DATABASE UPDATES.
J. E. Davidson.
[Stanford University. Department of Computer Science.
STAN-CS-87-1152. April 1987. Thesis (Ph.D.).]
025153 OPTIMUM GRIP OF A POLYGON.
X. Markenscoff and C. H. Papadimitriou.
[Stanford University. Department of Computer Science.
STAN-CS-87-1153. April 1987.]
048086 REASONING ABOUT ACTION I: A POSSIBLE WORLDS APPROACH.
-65 M. L. Ginsberg and D. E. Smith.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-65. May 1987.]
048086 REASONING ABOUT ACTION II: THE QUALIFICATION PROBLEM.
-66 M. L. Ginsberg and D. E. Smith.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-66. May 1987.]
048086 CONTROLLING BACKWARD INFERENCE.
-68 D. E. Smith.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-68. March 1987.]
048087 QSOPS: A WORKBENCH ENVIRONMENT FOR THE QUALITATIVE SIMULATION OF THE
-37 PHYSICAL PROCESS.
A. D. Round.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-37. May 1987.]
106658 A LOGARITHMIC BOOLEAN TIME ALGORITHM FOR PARALLEL POLYNOMIAL DIVISION.
D. Bini and V. Pan.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-1. 1986.]
106659 POLYNOMIAL DIVISION AND ITS COMPUTATIONAL COMPLEXITY.
D. Bini and V. Pan.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-2. 1986.]
106660 APPLIED AND THEORETICAL MULTIDIMENSIONAL SEARCH ALGORITHMS BASED ON
THE APPLICATION OF SHEARED RETRIEVAL TO ORTHOGONAL RANGE QUERIES.
D. E. Willard.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-4. 1986.]
106661 THE ARITHMETIC COMPLEXITY OF THE SEQUENTIAL & PARALLEL EVALUATION OF
MATRIX POLYNOMIALS.
V. Pan.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-5. 1986.]
106662 ON COMPUTING RELIABILITY MEASURES FOR DIGITAL CIRCUITS.
S. Chakravarty and H. B. Hunt III.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-8. 1986.]
106663 THE GENERALIZED-CONCEPT APPROACH TO KNOWLEDGE REPRESENTATION: A
FRAMES LIKE INTERFACE TO LOGIC.
M. Balaban.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-13. 1986.]
106664 ON REPRESENTATIONS OF BOOLEAN FUNCTIONS FOR THE SYNTHESIS OF MOS
COMBINATIONAL CIRCUITS.
S. Chakravarty, H. B. Hunt III, and D. J. Rosenkrantz.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-11. 1986.]
106665 COMPLEXITY OF PARALLEL MATRIX COMPUTATIONS.
V. Pan.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-14. 1986.]
106666 APPLICATION OF PLANAR SEPARATOR THEOREM TO COUNTING PROBLEMS.
S. S. Ravi and H. B. Hunt III.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-19. 1986.]
106667 ON THE COMPLEXITY OF THE SATISFIABILITY PROBLEM AND THE STRUCTURE OF
NP.
R. E. Stearns and H. B. Hunt III.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-21. 1986.]
106668 ON THE COMPLEXITY OF EQUIVALENCE, NONLINEAR ALGEBRA, AND OPTIMIZATION
ON RINGS, SEMIRINGS, AND LATTICES.
H. B. Hunt III and R. E. Stearns.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-23. 1986. "Extended abstract."]
106669 TRANSLATION BETWEEN CIRCUIT SYNTHESIS FROM BOOLEAN FUNCTION
REPRESENTATIONS.
S. Chakravarty, H. B. Hunt III, and D. J. Rosenkrantz.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-24. 1986.]
106670 A FIRST-ORDER CALCULUS FOR TEMPORAL KNOWLEDGE.
M. Balaban and N. V. Murray.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-26. 1986.]
106671 THE GENERALIZE CONCEPT (G-C) FORMALISM -- AN OBJECT-ORIENTED, LOGIC
FRAMEWORK FOR KNOWLEDGE REPRESENTATION.
M. Balaban.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-27. 1986.]
106672 A SOLUTION TO AN OPEN PROBLEM DUE TO STEARNS AND HUNT.
S. S. Ravi.
[State University of New York, Albany. Department of Computer
Science. Report no. 86-29. 1986.]
095198 AN INTELLIGENT TOKEN FOR SECURE TRANSACTIONS.
B. J. Chorley and W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology and Computing. DITC 85/87. 1987.]
106673 A PROTOTYPE SYSTEM FOR THE VALIDATION OF PASCAL PROGRAMS.
P. T. Wilkinson et al.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology and Computing. DITC 86/87. 1987.]
106674 THE USE OF SPLINES IN THE MODELLING OF A PHOTODIODE RESPONSE.
P. M. Harris.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology and Computing. DITC 88/87. 1987.]
106675 DIE VERWENDUNG VON ZEICHENKETTENORDNUNGEN IM ZUSAMMENHANG MIT
SEMI-THUE SYSTEMEN.
C. Eschenbach.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 122. 1986.]
106676 AUSWIRKUNGEN VON EXPERTENSYSTEM ANSATZE EINER
TECHNOLOGIRFOLGENABSCHATZUNG AUF DEM GEBIET DER KUNSTLICHEN
INTELLIGENZ.
J. Koenemann.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 123. 1986.]
106677 CONSTRUCTION OF EQUALITY GRAPHS.
K.-H. Blasius.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-01. 1986.]
106678 SPECIFICATION, HORIZONTAL COMPOSITION AND PARAMETERIZATION OF
ALGEBRAIC IMPLEMENTATIONS.
C. Beierle and A. Voss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-02. 1986.]
106679 KAPRI: A RULE BASED NON-MONOTONIC INFERENCE ENGINE WITH AN INTEGRATED
MAINTENANCE SYSTEM.
M. T. Reinfrank et al.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-03. 1986.]
106680 RELFUN: A RELATIONAL/FUNCTIONAL INTEGRATION WITH VALUED CLAUSES.
H. Boley.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-04. 1986.]
106681 SOME RELATIONSHIPS BETWEEN UNIFICATION, RESTRICTED UNIFICATION, AND
MATCHING.
H.-J. Burckert.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-05. 1986.]
106682 COMPLETION OF GLOBALLY FINITE TERM REWRITING SYSTEMS FOR INDUCTIVE
PROOFS.
R. Goebel.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-06. 1986.]
106683 SOME UNDECIDABLE CLASSES OF CLAUSE SETS.
M. Schmidt-Schauss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-08. 1986.]
106684 THE AUGMENTATION OF OBJECT-ORIENTED PROGRAMMING BY CONCEPTS OF
ABSTRACT DATA TYPE THEORY: THE MODPASCAL EXPERIENCE.
W. Olthoff.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-09. 1986.]
106685 ON IMPLEMENTATIONS OF LOOSE ABSTRACT DATA TYPE SPECIFICATIONS AND
THEIR VERTICAL COMPOSITION.
C. Beierle and A. Voss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-14. 1986.]
106686 STEPWISE SOFTWARE DEVELOPMENT: COMBINING AXIOMATIC AND ALGORITHMIC
APPROACHES IN ALGEBRAIC SPECIFICATIONS.
C. Beierle and A. Voss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-15. 1986.]
106687 GROUND CONFLUENCE.
R. Goebel.
[Universitaet Kaiserslautern. Fachbereich Informatik. SR-86-18. 1986.]
106688 LOGICAL SYNTAX.
J. van Benthem.
[University of Amsterdam. Institute for Language, Logic, and
Information (ITLI). Report no. 86-06. 1986.]
106689 TYPE-SHIFTING RULES AND THE SEMANTICS OF INTERROGATIVES.
J. Groenendijk and M. Stokhof.
[University of Amsterdam. Institute for Language, Logic, and
Information (ITLI). Report no. 87-01. 1987.]
106690 BINARY ROUTING NETWORKS.
D. R. Milway.
[University of Cambridge. Computer Laboratory. Report no. 101. 1986.
Thesis (Ph.D.).]
106691 A PERSISTENT STORAGE SYSTEM FOR POLY AND ML.
D. C. J. Matthews.
[University of Cambridge. Computer Laboratory. Report no. 102. 1987.]
106692 A PROOF GENERATING SYSTEM FOR HIGHER-ORDER LOGIC.
M. Gordon.
[University of Cambridge. Computer Laboratory. Report no. 103. 1987.]
106693 A PROOF OF CORRECTNESS OF THE VIPER MICROPROCESSOR: THE FIRST LEVEL.
A. Cohn.
[University of Cambridge. Computer Laboratory. Report no. 104. 1987.]
106694 A MULTIPROCESSOR ALGORITHM FOR THE SYMMETRIC TRIDIAGONAL EIGENVALUE
PROBLEM.
S.-S. Lo, B. Philippe, and A. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 513. 1986.]
106695 COMPILING LISP FOR EVALUATION ON A TIGHTLY COUPLED MICROPROCESSOR.
W. L. Harrison III.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 565. 1986.]
106696 COMPILER MEMORY MANAGEMENT AND COMPOUND FUNCTION DEFINITION FOR
MULTIPROCESSORS.
H. Husmann.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 575. 1986. Thesis (Ph.D.).]
106697 A DIRECT PARALLELIZATION OF CALL STATEMENTS -- A REVIEW.
U. Banerjee.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 576. 1986.]
106698 SUPERCOMPUTING TRADEOFFS AND THE CEDAR SYSTEM.
E. Davidson et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 577. 1986.]
106699 POLYNOMIAL PRECONDITIONING OF SYMMETRIC INDEFINITE SYSTEMS.
N. R. Nandakumar.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 580. 1986.]
106701 PARALLEL ALGORITHMS ON THE CEDAR SYSTEM.
M. Berry et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 581. 1986. Thesis (Ph.D.).]
106702 ON PROGRAM RESTRUCTURING, SCHEDULING, AND COMMUNICATION FOR PARALLEL
PROCESSOR SYSTEMS.
C. D. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 595. 1986. Thesis (Ph.D.).]
106703 ALGORITHMS AND EXPERIMENTS FOR STRUCTURAL MECHANICS ON HIGH
PERFORMANCE ARCHITECTURES.
M. W. Berry and R. J. Plemmons.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 602. 1986.]
106704 MULTIPROCESSOR FFTS.
P. N. Swarztrauber.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 608. 1986.]
106705 A PROJECTION METHOD FOR SOLVING NONSYMMETRIC LINEAR SYSTEMS ON
MULTIPROCESSORS.
C. Kamath and A. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 611. 1986.]
106706 PSOLVE: A CONCURRENT ALGORITHM FOR SOLVING SPARSE SYSTEMS OF LINEAR
EQUATIONS.
T. A. Davis.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 612. 1986. Thesis (M.S.).]
106707 ON THE DESIGN OF PARALLEL NUMERICAL METHODS IN MESSAGE PASSING AND
SHARED MEMORY ENVIRONMENTS.
Y. Saad.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 614. 1987.]
106708 DISTRIBUTING HOT-SPOT ADDRESSING IN LARGE-SCALE MULTIPROCESSORS.
P.-C. Yew, N.-F. Tzeng, and D. H. Lawrie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 619. 1987.]
106709 PARALLEL GARBAGE COLLECTION ON A VIRTUAL MEMORY SYSTEM.
S. G. Abraham and J. H. Patel.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 620. 1987.]
106710 DEBUGGING PARALLEL FORTRAN ON A SHARED MEMORY MACHINE.
T. R. Allen and D. A. Padua.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 624. 1987.]
106711 DEADLOCK PREVENTION IN PROCESSOR SELF-SCHEDULING FOR PARALLEL NESTED
LOOPS.
P. Tang et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 626. 1987.]
106712 THE LAMBDA NETWORK: A NEW PERMUTATION NETWORK.
D. Lee.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 627. 1987.]
106713 AN ENHANCEMENT SCHEME FOR HYPERCUBE INTERCONNECTION NETWORKS.
W. T. Hsu, P.-C. Yew, and C.-Q. Zhu.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 628. 1987.]
106714 PARALLEL ACCESS TO SYNCHRONIZATION VARIABLES.
D. N. Jayasimha.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 630. 1987.]
106715 LOOP COALESCING: A COMPILER TRANSFORMATION FOR PARALLEL MACHINES.
C. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 635. 1987.]
106716 DYNAMIC PROCESSOR SELF-SCHEDULING FOR GENERAL PARALLEL NESTED LOOPS.
Z. Fang et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 637. 1987.]
106717 DATA PREFETCHING IN SHARED MEMORY MULTIPROCESSORS.
R. L. Lee, P.-C. Yew, and D. H. Lawrie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 639. 1987.]
106718 MULTIPROCESSOR CACHE DESIGN CONSIDERATIONS.
R. L. Lee, P.-C. Yew, and D. H. Lawrie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 640. 1987.]
106719 COMPILER ALGORITHMS FOR SYNCHRONIZATION.
S. P. Midkiff and D. A. Padua.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 643. 1987.]
106720 USING PROGRAM STRUCTURE TO ACHIEVE PREFETCHING FOR CACHE MEMORIES.
G. A. Brent.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 647. 1987. Thesis (Ph.D.).]
106721 PARALLEL DISCRETE EVENT SIMULATION: A SHARED MEMORY APPROACH.
D. A. Reed, A. D. Malony, and B. D. McCredie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 650. 1987.]
106722 MPF: A PORTABLE MESSAGE PASSING FACILITY FOR SHARED MEMORY
MULTIPROCESSORS.
A. D. Malony, A. R. Reed, and P. J. McGuire.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 651. 1987.]
106723 INCREMENTAL ATTRIBUTE EVALUATION ON NODE-LABEL CONTROLLED GRAPHS.
S. M. Kaplan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1309. 1987.]
106724 ABSTRACT PARTITIONING AND ROUTING OF LOGIC NETWORKS.
S. T. Healey.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1326. 1987. Thesis (Ph.D.).]
106725 EFFICIENT ALGORITHMS WITH NEURAL NETWORK BEHAVIOR.
S. M. Omohundro.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1331. 1987.]
106726 AUTOMATING THE SOFTWARE DEVELOPMENT PROCESS.
R. H. Campbell et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1333. 1987.]
106727 AN ABSTRACT MODEL FOR THE STEPWISE DEVELOPMENT OF PROGRAMS.
L. A. Benzinger.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1335. 1987.]
106728 A TYPE SYSTEM FOR SMALLTALK: AN OPTIMIZER'S VIEW.
R. Johnson.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1336. 1987.]
106729 ALGORITHMIC ASPECTS OF VLSI CIRCUIT LAYOUT.
M. D. F. Wong.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1337. 1987. Thesis (Ph.D.).]
106730 ER-EASY: A USER-FRIENDLY GRAPHIC ER-DIAGRAM EDITOR FOR INTERACTIVE
DATABASE SCHEME DESIGN.
R. John and A. Lewe.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1338. 1987.]
106731 A MODEL AND A METHOD FOR THE STEPWISE DEVELOPMENT OF VERIFIED
PROGRAMS.
L. Benzinger.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1339. 1987. Thesis (Ph.D.).]
106732 THE CROSS-ARCHITECTURE PROCEDURE CALL.
R. B. Essick IV.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1340. 1987. Thesis (Ph.D.).]
106733 SIMULATED ANNEALING APPLIED TO A PROBLEM IN COMBINATORIAL
OPTIMIZATION.
D. E. Godman.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1342. 1987. Thesis (M.S.).]
106734 DATABASE TECHNIQUES FOR TEXT MODELLING: THE DOCUMENT ARCHITECTURE OF
BRITISH STATUTES.
M. A. Heather and B. N. Rossiter.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
227. 1987.]
106735 IMPLEMENTATION OF AN INTERPRETER FOR C EXPRESSIONS.
W. Y. P. Wong.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
230. 1987.]
106736 SYSTEM DESIGN AND STRUCTURING FOR DEPENDABILITY.
B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Report no.
232. 1987.]
106737 CONNECTIONIST ARCHITECTURES.
D. H. Ballard, P. C. Gardner, and M. A. Srinivas.
[University of Rochester. Department of Computer Science. TR 167.
1987.]
106738 I3V: A PROGRAM PROOF MANAGEMENT SYSTEM.
R.-J. Back and P. Hietala.
[University of Tampere. Department of Mathematical Sciences. A136.
1986.]
106739 AN INCREMENTAL, MECHANICAL DEVELOPMENT OF SYSTOLIC SOLUTIONS TO THE
ALGEBRAIC PATH PROBLEM.
C.-H. Huang and C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-28. 1986.]
106740 THE ELUSIVE ATOMIC REGISTER.
J. H. Anderson, A. K. Singh, and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-29. 1986.]
106741 THE ELUSIVE ATOMIC REGISTER REVISITED.
A. K. Singh, J. H. Anderson, and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-30. 1986.]
106742 MODELING AND VERIFICATION OF REAL-TIME PROTOCOLS FOR BROADCAST
NETWORKS.
P. Jain and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-01. 1987.]
106743 VERTICALLY PARTITIONED OBJECT-ORIENTED SOFTWARE DESIGN FOR
DEPENDABILITY AND GOOD PERFORMANCE.
S. P. Hufnagel.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-02. 1987. Thesis (Ph.D.).]
106744 TREAT: A NEW AND EFFICIENT MATCH ALGORITHM FOR AI PRODUCTION SYSTEMS.
D. P. Miranker.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-03. 1987. Thesis (Ph.D.). "Submitted in partial fulfillment of
the requirements for the degree of Doctor of Philosophy in the
Graduate School of Art and Sciences, Columbia University, 1987."]
106745 DESIGN AND PERFORMANCE EVALUATION OF THE TEXAS OBJECT BASED SYSTEM.
G. J. Dafni.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-04. 1987. Thesis (Ph.D.).]
106746 PROTOCOL CONVERSION.
S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-05. 1987.]
106747 A DESIGN METHODOLOGY FOR ALGORITHM-SPECIFIC ARCHITECTURE.
S. R. Deshpande and J. C. Browne.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-06. 1987.]
106748 RECENT RESULTS ON THE COMPLEXITY OF PROBLEMS RELATED TO PETRI NETS.
R. R. Howell and L. E. Rosier.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-07. 1987.]
106749 ON THE CORRECTNESS OF A TERMINATION DETECTION ALGORITHM.
D. Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-08. 1987.]
106750 A THEOREM ON TERMINATION OF DISTRIBUTED SYSTEMS.
K. M. Chandy.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-09. 1987.]
106751 UNDERSTANDING PROBABILISTIC BYZANTINE AGREEMENT.
R. Turpin and J. Dutton.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-10. 1987.]
106752 A STEPWISE REFINEMENT HEURISTIC FOR PROTOCOL CONSTRUCTION.
A. U. Shankar and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-11. 1987.]
106754 ITERATIVE PRECONDITIONED GRADIENT - NEWTON TYPE METHODS FOR MODERN
SHOCK COMPUTATIONS.
Q. Q. Huynh.
[University of Uppsala. Department of Computer Science. Report no.
107. 1987.]
106755 OPEN BOUNDARY CONDITIONS FOR EXTERNAL FLOW PROBLEMS.
L. Ferm.
[University of Uppsala. Department of Computer Science. Report no.
108. 1987.]
106756 STABILITY OF A RUNGE-KUTTA METHOD FOR THE EULER EQUATIONS ON A
SUBSTRUCTURED DOMAIN.
K. Otto and M. Thune.
[University of Uppsala. Department of Computer Science. Report no.
109. 1987.]
106757 EMERALD: AN OBJECT-BASED LANGUAGE FOR DISTRIBUTED PROGRAMMING.
N. C. Hutchinson.
[University of Washington. Department of Computer Science. Report no.
87-01-01. 1987. Thesis (Ph.D.).]
106758 GARBAGE COLLECTION: AN EXERCISE IN DISTRIBUTED, FAULT-TOLERANT
PROGRAMMING.
S. C. Vestal.
[University of Washington. Department of Computer Science. Report no.
87-01-03. 1987. Thesis (Ph.D.). "This technical report is an
adaptation of a dissertation submitted in partial fulfillment of the
requirements for the degree of Doctor of Philosophy at the University
of Washington."]
106759 ARCHITECTURAL CHOICES FOR MULTI-LEVEL CACHE HIERARCHIES.
J.-L. Baer and W.-H. Wang.
[University of Washington. Department of Computer Science. Report no.
87-01-04. 1987.]
106760 NEAR-OPTIMAL SPEEDUP OF GRAPHICS ALGORITHMS USING MULTIGAUGE PARALLEL
COMPUTERS.
T. D. DeRose, L. Snyder, and C. Yang.
[University of Washington. Department of Computer Science. Report no.
87-01-06. 1987.]
106761 THE CACHE COHERENCE PROBLEM IN SHARED-MEMORY MULTIPROCESSORS.
J. K. Archibald.
[University of Washington. Department of Computer Science. Report no.
87-02-06. 1987. Thesis (Ph.D.).]
106762 INTEGRATING HIGH LEVEL AND LOW LEVEL COMPUTER VISION.
J. J. Pfeiffer.
[University of Washington. Department of Computer Science. Report no.
87-03-02. 1987. Thesis (Ph.D.).]
106763 USING THE SEMANTICS OF ABSTRACT DATA TYPES TO IMPROVE CONCURRENCY IN
TRANSACTION SYSTEMS.
D. M. Jacobson.
[University of Washington. Department of Computer Science. Report no.
87-03-05. 1987. Thesis (Ph.D.).]
106764 COMPUTATIONAL ANALOGY: AN ALGORITHM FOR DETECTING ANALOGIES.
K. Wellsch and M. Jones.
[University of Waterloo. Department of Computer Science. CS-87-01.
1987.]
106765 APPLYING THEORY FORMATION TO THE PLANNING PROBLEM.
R. G. Goebel and S. D. Goodwin.
[University of Waterloo. Department of Computer Science. CS-87-02.
1987.]
106766 ALGORITHMS AND CORRECTNESS PROOFS FOR VISIBILITY POLYGON COMPUTATIONS.
B. Joe and R. B. Simpson.
[University of Waterloo. Department of Computer Science. CS-87-03.
1987.]
106767 ANALYSIS OF B+-TREES WITH PARTIAL EXPANSIONS.
R. A. Baeza-Yates and P.-A. Larson.
[University of Waterloo. Department of Computer Science. CS-87-04.
1987.]
106768 DRAWING TREES NICELY WITH TEX.
A. Bruggermann-Klein and D. Wood.
[University of Waterloo. Department of Computer Science. CS-87-05.
1987.]
106769 ON THE PATH LENGTH OF BINARY TREES.
R. Klein and D. Wood.
[University of Waterloo. Department of Computer Science. CS-87-06.
1987.]
106770 KINETICS FOR KEY-FRAME INTERPOLATION.
R. H. Bartels and I. Hardtke.
[University of Waterloo. Department of Computer Science. CS-87-07.
1987.]
106771 FLOATING-POINT ERROR ANALYSIS USING SYMBOLIC ALGEBRAIC COMPUTATIONS.
M. P. W. Mutrie, R. H. Bartels, and B. W. Char.
[University of Waterloo. Department of Computer Science. CS-87-08.
1987.]
106772 EXPRESSION OPTIMIZATION USING HIGH-LEVEL KNOWLEDGE.
M. P. W. Mutrie, B. W. Char, and R. H. Bartels.
[University of Waterloo. Department of Computer Science. CS-87-09.
1987.]
106773 DESIGN OF THE PROGRAMMING LANGUAGE FORCE ONE.
A. K. Wright.
[University of Waterloo. Department of Computer Science. CS-87-10.
1987.]
106774 FIXED PREDICATES IN DEFAULT REASONING.
D. Poole.
[University of Waterloo. Department of Computer Science. CS-87-11.
1987.]
106775 PRIMAL METHODS ARE BETTER THAN DUAL METHODS FOR SOLVING
OVERDETERMINED LINEAR SYSTEMS IN THE L SUBSCRIPT INFINITY SENSE.
R. H. Bartels, A. R. Conn, and Y. Li.
[University of Waterloo. Department of Computer Science. CS-87-12.
1987.]
106776 MIND YOUR GRAMMAR: A NEW APPROACH TO MODELLING TEXT.
G. H. Gonnet and F. W. Tompa.
[University of Waterloo. Department of Computer Science. CS-87-13.
1987.]
106777 AN APPROACH TO THE DESIGN OF FULLY OPEN COMPUTING SYSTEMS.
Y. Artsy and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 689. 1987.]
106778 INTEGRATING NON-INTERFERING VERSIONS OF PROGRAMS.
S. Horwitz, J. Prins, and T. Reps.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 690. 1987.]
106779 CLAM -- AN OPEN SYSTEM FOR GRAPHICAL USER INTERFACES.
L. A. Call, D. L. Cohrs, and B. P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 691. 1987.]
106780 HIGH ACCURACY GEOMETRIC HERMITE INTERPOLATION.
C. de Boor, K. Hollig, and M. Sabin.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 692. 1987.]
106781 QUERY OPTIMIZATION BY SIMULATED ANNEALING.
Y. E. Ioannidis and E. Wong.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 693. 1987.]
106782 WHEN IS THE BEST LOAD SHARING ALGORITHM A LOAD BALANCING ALGORITHM?
P. Krueger and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 694. 1987.]
106783 ON THE NORM EQUIVALENCE OF SINGULARLY PERTURBED ELLIPTIC DIFFERENCE
OPERATORS.
C. I. Goldstein and S. V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 695. 1987.]
106784 ALGORITHMS FOR THE MAXIMUM INDUCED BIPARTITE SUBGRAPH PROBLEM ON
INTERVAL AND CIRCULAR-ARC GRAPHS.
R. Manber and G. Narasimhan.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 696. 1987.]
106785 PROFILING WORKSTATION'S AVAILABLE CAPACITY FOR REMOTE EXECUTION.
M. W. Mutka and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Report no. 697. 1987.]
VOL. 9, NO. 8 08/20/87
106786 PERSPECTIVES ON OBJECT-ORIENTED PROGRAMMING.
P. Wegner.
[Brown University. Computer Science Department. CS-86-25. 1986.
Second draft: December 1986.]
106787 INCREMENTAL CAUSAL REASONING.
T. Dean and M. Boddy.
[Brown University. Computer Science Department. CS-87-01. 1987.]
106788 GRAPH REACHABILITY PROBLEMS.
P. Z. Revesz.
[Brown University. Computer Science Department. CS-87-02. 1987.]
106789 ON THE REPRESENTATION AND QUERYING OF SETS OF POSSIBLE WORLDS.
S. Abiteboul, P. C. Kanellakis, and G. Grahne.
[Brown University. Computer Science Department. CS-87-03. 1987.]
106790 POLYNOMIAL-TIME IMPLICATION PROBLEMS FOR UNARY INCLUSION DEPENDENCIES.
S. S. Cosmadakis, P. C. Kanellakis, and M. Y. Vardi.
[Brown University. Computer Science Department. CS-87-04. 1987.]
106791 ALGORITHM ANIMATION.
M. H. Brown.
[Brown University. Computer Science Department. CS-87-05. 1987.
Thesis (Ph.D.).]
106792 A THREADS TUTORIAL.
T. W. Doeppner.
[Brown University. Computer Science Department. CS-87-06. 1987.]
106793 LOCATION OF PROTEIN ENCODINGS IN NUCLEIC ACIDS.
R. P. Hughey and D. P. Lopresti.
[Brown University. Computer Science Department. CS-87-09. 1987.]
106794 THREADS: A SYSTEM FOR THE SUPPORT OF CONCURRENT PROGRAMMING.
T. W. Doeppner Jr.
[Brown University. Computer Science Department. CS-87-11. 1987.]
106795 SUPERCOMPUTING WITH VLSI: SORTING.
G. M. Baudet and S. Manohar.
[Brown University. Computer Science Department. CS-87-12. 1987.]
106796 THE OBJECT-ORIENTED CLASSIFICATION PARADIGM.
P. Wegner.
[Brown University. Computer Science Department. CS-87-13. 1987.]
106797 EXTENDING A CAPABILITY BASED SYSTEM INTO A NETWORK ENVIRONMENT.
R. D. Sansom, D. P. Julin, and R. F. Rashid.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-115. 1987.]
106798 AUTOMATIC ROBOT INITIALIZATION USING A PLANAR TARGET SCANNED BY AN
OPTICAL REFLECTION SENSOR.
R. Q. Yang and M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-9.
1987.]
106799 USING GOAL INTERACTIONS TO GUIDE PLANNING: THE PROGRAM MODEL.
C. Hayes.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-10.
1987.]
106800 1986 YEAR END REPORT FOR ROAD FOLLOWING AT CARNEGIE MELLON.
C. Thorpe and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-11.
1987. Charles Thorpe and Takeo Kanade, Principal Investigators.]
106801 OPTIMAL DESIGN OF ROBOTIC MANIPULATOR TRAJECTORIES: A NONLINEAR
PROGRAMMING APPROACH.
M. L. Nagurka and V. Yen.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-12.
1987.]
106802 LISP AS A RAPID PROTOTYPING ENVIRONMENT: THE CHINESE TUTOR.
D. Guise.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-14.
1987.]
106803 END OF YEAR REPORT FOR PARALLEL VISION ALGORITHM DESIGN AND
IMPLEMENTATION.
T. Kanade and J. A. Webb.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-15.
1987.]
106804 IMPLEMENTATION AND PERFORMANCE OF A COMPLEX VISION SYSTEM ON A
SYSTOLIC ARRAY MACHINE.
E. Clune et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-16.
1987.]
106805 A PARALLEL TRIANGULAR SOLVER FOR A HYPERCUBE MULTIPROCESSOR.
G. Li and T. F. Coleman.
[Cornell University. Department of Computer Science. Technical report
86-787. 1986.]
106806 A PARALLEL ALGORITHM FOR FINDING FILL IN A SPARSE SYMMETRIC MATRIX.
J. R. Gilbert and H. Hafsteinsson.
[Cornell University. Department of Computer Science. Technical report
86-789. 1986.]
106807 SUBSTITUTING FOR REAL TIME AND COMMON KNOWLEDGE IN ASYNCHRONOUS
DISTRIBUTED SYSTEMS.
G. Neiger and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
86-790. 1986.]
106808 (ALMOST) NO COST CLOCK SYNCHRONIZATION.
O. Babaoglu and R. Drummond.
[Cornell University. Department of Computer Science. Technical report
86-791. 1986.]
106809 A FINE-GRAIN PARALLELIZING COMPILER.
A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
86-792. 1986.]
106810 A CATEGORY THEORETIC ANALYSIS OF PREDICATIVE TYPE THEORY.
M. I. Schwartzbach.
[Cornell University. Department of Computer Science. Technical report
86-793. 1986. Thesis (Ph.D.).]
106811 ON RANKING.
L. A. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
86-794. 1986.]
106812 CAN P AND NP MANUFACTURE RANDOMNESS?
L. A. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
86-795. 1986.]
106813 ONE-WAY FUNCTIONS, ROBUSTNESS, AND THE NON-ISOMORPHISM OF NP-COMPLETE
SETS.
J. Hartmanis and L. A. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
86-796. 1987.]
106814 A BLOCK QR FACTORIZATION SCHEME FOR LOOSELY COUPLED SYSTEMS OF ARRAY
PROCESSORS.
C. Van Loan.
[Cornell University. Department of Computer Science. Technical report
86-797. 1986.]
106815 COMPUTING THE SINGULAR VALUE DECOMPOSITION OF A DISTRIBUTED SYSTEM OF
VECTOR PROCESSORS.
C. Bischof.
[Cornell University. Department of Computer Science. Technical report
86-798. 1986.]
106816 NC ALGORITHMS FOR COMPARABILITY GRAPHS, INTERVAL GRAPHS, AND UNIQUE
PERFECT MATCHINGS.
D. Kozen, U. V. Vazirani, and V. V. Vazirani.
[Cornell University. Department of Computer Science. Technical report
86-799. 1986.]
106817 THE STATE MACHINE APPROACH: A TUTORIAL.
F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
86-800. 1986.]
106818 REPRESENTING GENERIC SOLID MODELS BY CONSTRAINTS.
L. A. Barford.
[Cornell University. Department of Computer Science. Technical report
86-801. 1986.]
106819 CONCURRENT COMMON KNOWLEDGE: A NEW DEFINITION OF AGREEMENT FOR
ASYNCHRONOUS SYSTEMS.
P. Panangaden and K. Taylor.
[Cornell University. Department of Computer Science. Technical report
86-802. 1986.]
106820 A PARALLEL GRAPH-PARTITIONING ALGORITHM FOR A MESSAGE-PASSING
MULTIPROCESSOR.
J. R. Gilbert and E. Zmijewski.
[Cornell University. Department of Computer Science. Technical report
87-803. 1987.]
106821 INTEGRATION CONSTRAINTS IN PARAMETRIC DESIGN OF PHYSICAL OBJECTS.
A. Paoluzzi.
[Cornell University. Department of Computer Science. Technical report
87-804. 1987.]
106822 SIZE-TIME COMPLEXITY OF BOOLEAN NETWORKS FOR PREFIX COMPUTATION.
G. Bilardi and F. P. Preparata.
[Cornell University. Department of Computer Science. Technical report
87-805. 1987.]
106823 LOW-LEVEL PROGRAMMING FOR A MASSIVELY PARALLEL FINE-GRAIN COMPUTER:
THE MICROFLOW APPROACH.
L. Hendren et al.
[Cornell University. Department of Computer Science. Technical report
87-806. 1987.]
106824 EPOCHS.
J. A. Solworth.
[Cornell University. Department of Computer Science. Technical report
87-807. 1987.]
106825 A NEW LANGUAGE-INDEPENDENT PRETTYPRINTING ALGORITHM.
W. W. Pugh and S. J. Sinofsky.
[Cornell University. Department of Computer Science. Technical report
87-808. 1987.]
106826 DENSE PATCH-ORIENTED MATRIX FACTORIZATION ON A HYPERCUBE
MULTIPROCESSOR.
D. Moore.
[Cornell University. Department of Computer Science. Technical report
87-809. 1987.]
106827 I-STRUCTURES: DATA STRUCTURES FOR PARALLEL COMPUTING.
Arvind, R. S. Nikhil, and K. K. Pingali.
[Cornell University. Department of Computer Science. Technical report
87-810. 1987.]
106828 EXPLOITING VIRTUAL SYNCHRONY IN DISTRIBUTED SYSTEMS.
K. P. Birman and T. A. Joseph.
[Cornell University. Department of Computer Science. Technical report
87-811. 1987.]
106829 A NEW METHOD FOR SOLVING TRIANGULAR SYSTEMS ON DISTRIBUTED MEMORY
MESSAGE-PASSING MULTIPROCESSORS.
G. Li and T. F. Coleman.
[Cornell University. Department of Computer Science. Technical report
87-812. 1987.]
106830 A GRAPHICAL, LANGUAGE-BASED EDITOR FOR GENERIC SOLID MODELS
REPRESENTED BY CONSTRAINTS.
L. A. Barford.
[Cornell University. Department of Computer Science. Technical report
87-813. 1987. Thesis (Ph.D.).]
106831 OPTIMAL TRIE COMPACTION IS NP-COMPLETE.
J. M. Dill.
[Cornell University. Department of Computer Science. Technical report
87-814. 1987.]
106832 A COUNTER-EXAMPLE FOR "A SIMPLER CONSTRUCTION FOR SHOWING THE
INTRINSICALLY EXPONENTIAL COMPLEXITY OF THE CIRCULARITY PROBLEM FOR
ATTRIBUTE GRAMMARS".
J. M. Dill.
[Cornell University. Department of Computer Science. Technical report
87-815. 1987.]
106833 MERGING AND SORTING NETWORKS WITH THE TOPOLOGY OF THE OMEGA NETWORK.
G. Bilardi.
[Cornell University. Department of Computer Science. Technical report
87-816. 1987.]
106834 SOME OBSERVATIONS ABOUT NP-COMPLETE SETS.
J. Hartmanis.
[Cornell University. Department of Computer Science. Technical report
87-817. 1987.]
106835 DEFINABILITY WITH BOUNDED NUMBER OF BOUND VARIABLES.
N. Immerman and D. Kozen.
[Cornell University. Department of Computer Science. Technical report
87-818. 1987.]
106836 PROVING BOOLEAN COMBINATIONS OF DETERMINISTIC PROPERTIES.
B. Alpern and F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
87-819. 1987.]
106837 THE COMPUTATIONAL BEHAVIOR OF GIRARD'S PARADOX.
D. J. Howe.
[Cornell University. Department of Computer Science. Technical report
87-820. 1987.]
106838 LOOP QUANTIFICATION: AN ANALYSIS AND ALGORITHM.
A. Aiken and A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
87-821. 1987.]
106839 PARTIAL OBJECTS IN CONSTRUCTIVE TYPE THEORY.
R. L. Constable and S. F. Smith.
[Cornell University. Department of Computer Science. Technical report
87-822. 1987.]
106840 EFFECTS OF MESSAGE LOSS ON DISTRIBUTED TERMINATION.
R. Koo and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
87-823. 1987.]
106841 LOAD BALANCED FFT IMPLEMENTATIONS ON THE INTEL IPSC.
C. Chu.
[Cornell University. Department of Computer Science. Technical report
87-824. 1987.]
106842 A SINE TRANSFORM ALGORITHM FOR THE HYPERCUBE.
C. Chu.
[Cornell University. Department of Computer Science. Technical report
87-825. 1987.]
106843 SYNCHRONIZING TIME SERVERS.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 18. 1987.]
106844 (1) XRS: EIN ERWEITERTES RELATIONALES DATENBANKSYSTEM ZUR VERWALTUNG
VON TECHNISCHEN OBJEKTEN UND VERSIONEN. (2) KONZEPT UND REALISIERUNG
EINER VERSIONENVERWALTUNG IN EINEM RELATIONALEN DATENBANKKERN.
A. Meier et al.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 76. 1987. This report consists of two papers,
the first ("XRS: Ein erweitertes relationales Datenbanksystem . . .")
by A. Meier, K. Durrer, G. Heiser, E. Petry, A. Waelchli, and C. A.
Zehnder and the second ("Konzept und Realisierung einer
Versionenverwaltung . . .") by E. Petry alone.]
106845 PORTING MEDOS-2 ONTO THE CERES WORKSTATION.
F. Peschel and M. Wille.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 78. 1987.]
106846 FLAT PARLOG: A BASIS FOR COMPUTATION.
I. Foster.
[Imperial College of Science and Technology. Department of Computing.
Research report DOC 87/5. 1987.]
106847 ANALYSE D'UN PROTOCOLE HYBRIDE MULTI-ACCES AVEC ARRIVEES LIBRES
DURANT LA RESOLUTION DES COLLISIONS.
P. Nain, N. D. Georganas, and W. J. Stewart.
[Institut National de Recherche en Informatique et en Automatique.
Rapport de recherche 597. 1986.]
106848 MATHEMATICAL TOOLS FOR AUTOMATIC PROGRAM ANALYSIS.
P. Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 603. 1987.]
106849 A PREDICATE TRANSITION NET FOR EVALUATING QUERIES AGAINST RULES IN A
DBMS.
C. de Maindreville and E. Simon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 604. 1987.]
106850 A LOGIC FOR DATA AND KNOWLEDGE BASES.
C. Lecluse and N. Spyratos.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 606. 1987.]
106851 RESTRUCTURING HIERARCHICAL DATABASE OBJECTS.
S. Abiteboul and R. Hull.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 615. 1987.]
106852 M/M/1 MULTICLASS FIFO QUEUES AND GENERALIZATIONS.
G. Rubino and R. Marie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 617. 1987. Also issued as Publication
interne 333, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
106853 HOW TO IMPROVE BRANCHING ALGORITHMS FOR DECIDING ON GRAMMARS
EQUIVALENCE.
D. Caucal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 618. 1987. Also issued as Publication
interne 334, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
106854 REAL-TIME, SYNCHRONOUS, DATA-FLOW PROGRAMMING: THE LANGUAGE SIGNAL
AND ITS MATHEMATICAL SEMANTICS.
P. Le Guernic and A. Benveniste.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 620. 1987. Also issued as Publication
interne 298, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
106855 A LOCAL BASED APPROACH FOR PATH PLANNING OF MANIPULATORS WITH A HIGH
NUMBER OF DEGREES OF FREEDOM.
B. Faverjon and P. Tournassoud.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 621. 1987.]
106856 UN SYSTEME DE VERIFICATION DE PROCESSUS PARALLELES ET COMMUNICANTS.
V. Lecompte, E. Madelaine, and D. Vergamini.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 83. 1987.]
106857 PROBLEM SIZE, PARALLEL ARCHITECTURE, AND OPTIMAL SPEEDUP.
D. M. Nicol and F. H. Willard.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-7. 1987.]
106858 ANALYSIS OF A PARALLELIZED NONLINEAR ELLIPTIC BOUNDARY VALUE PROBLEM
SOLVER WITH APPLICATION TO REACTING FLOWS.
D. E. Keyes and M. D. Smooke.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-21. 1987.]
106859 SOLVING THE CAUCHY-RIEMANN EQUATIONS ON PARALLEL COMPUTERS.
R. A. Fatoohi and C. E. Grosch.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-34. 1987.]
106860 A SYSTEM TRANSLATOR FOR CHINESE INFORMATION PROCESSING SYSTEMS.
H. R. Hwa, P. Chen, and L. Ye.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA2/87. 1987.]
106861 A SPACE SEARCHING METHOD FOR CHECKING THE CONSISTENCY AND
COMPLETENESS OF A RULEBASE.
W. W. Tsang et al.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA3/87. 1987.]
106862 ON THE DESIGN OF A VISUALLY ORIENTED DBMS.
T. S. Chua, W. N. Chin, and C. Homsilpakul.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB2/87. 1987.]
106863 A PRUNING ALGORITHM FOR FINDING OPTIMAL DECISION DIAGRAMS.
W. W. Tsang, N. V. Findler, and I. H. Ihrig.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB3/87. 1987.]
106864 A COURIER BASED PUBLIC-KEY CRYPTOSYSTEM.
J. W. John et al.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC3/87. 1987.]
106865 A PRELIMINARY DESIGN OF SARC: A STRUCTURED ARRAY COMPUTER WITH A
STACK AND REGISTER CONFIGURATION.
C. K. Yuen.
[National University of Singapore. Department of Information Systems
and Computer Science. TRD3/87. 1987.]
106866 INTRODUCTION TO THE GMW WINDOW SYSTEM.
M. Hagiya.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-565. 1987.]
106867 A STATISTICAL VIEWPOINT ON THE THEORY OF EVIDENCE.
R. A. Hummel and M. S. Landy.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 194. 1987. Revised:
February 1987. Also issued as Robotics report 57, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
106868 CONSTRAINTS IN REAL-TIME DATA ACQUISITION AND CONTROL.
H. J. Bernstein.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 195. 1985. Also issued
as Robotics report 59, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106869 THREE-DIMENSIONAL OBJECT RECOGNITION FROM SINGLE TWO-DIMENSIONAL
IMAGES.
D. G. Lowe.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 202. 1986. Also issued
as Robotics report 62, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106870 OBJECT RECOGNITION BY 3-DIMENSIONAL CURVE MATCHING.
C. M. Bastuscheck et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 203. 1986. Also issued
as Robotics report 63, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106871 SOLVING JIGSAW PUZZLES USING COMPUTER VISION.
A. Kalvin et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 205. 1986. Also issued
as Robotics report 65, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106872 SEPARATING TWO SIMPLE POLYGONS BY A SEQUENCE OF TRANSLATIONS.
R. Pollack, M. Sharir, and S. Sifrony.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 215. 1986. Also issued
as Robotics report 67, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106873 REVERSAL COMPLEXITY.
J. Chen and C.-K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 216. 1986. Also issued
as Robotics report 68, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106874 LINEAR TIME ALGORITHMS FOR VISIBILITY AND SHORTEST PATH PROBLEMS
INSIDE POLYGONS.
L. Guibas et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 218. 1986. Also issued
as Robotics report 69, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106875 MOTION-PLANNING WITH INERTIAL CONSTRAINTS.
C. O'Dunlaing.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 230. 1986. Also issued
as Robotics report 73, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106876 COMPUTING THE GEODESIC CENTER OF A SIMPLE POLYGON.
R. Pollack and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 231. 1986. Also issued
as Robotics report 74, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106877 A TIGHT LOWER BOUND FOR THE COMPLEXITY OF PATH-PLANNING FOR A DISC.
C. O'Dunlaing.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 234. 1986. Also issued
as Robotics report 75, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106878 HOW TO MOVE A CHAIR THROUGH A DOOR.
C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 238. 1986. Revised:
August 19, 1986. Also issued as Robotics report 76, Robotics
Research, Computer Science Division, Courant Institute of
Mathematical Sciences, New York University.]
106879 POLYGON OPTIMIZATION PROBLEMS.
J.-S. Chang.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 240. 1986. Thesis
(Ph.D.). Also issued as Robotics report 78, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
106880 MOTION PLANNING AND RELATED GEOMETRIC ALGORITHMS IN ROBOTICS.
J. T. Schwartz and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 241. 1986. Also issued
as Robotics report 79, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106881 THE VIEWPOINT CONSISTENCY CONSTRAINT.
D. G. Lowe.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 244. 1986. Also issued
as Robotics report 80, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106882 COMPLEX SYSTEM AND TOOL FOR FINE ROBOT ASSEMBLY.
G. Burdea.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 247. 1986. Also issued
as Robotics report 81, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106883 AN EFFICIENT MOTION PLANNING ALGORITHM FOR A CONVEX POLYGONAL OBJECT
IN 2-DIMENSIONAL POLYGONAL SPACE.
K. Kedem and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 253. 1986. Also issued
as Robotics report 90, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106884 ON CURVE MATCHING.
H. Wolfson.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 256. 1986. Also issued
as Robotics report 86, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106885 NOTES ON GROEBNER BASES.
B. Mishra and C.-K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 257. 1986. Also issued
as Robotics report 87, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106886 ADMISSIBLE ORDERINGS AND BOUNDS FOR GROEBNER BASIS NORMAL FORM
ALGORITHMS.
T. Dube, B. Mishra, and C.-K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 258. 1986. Also issued
as Robotics report 88, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106887 ON THE EXISTENCE AND SYNTHESIS OF MULTIFINGER POSITIVE GRIPS.
B. Mishra, J. T. Schwartz, and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 259. 1986. Also issued
as Robotics report 89, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106888 SIMULTANEOUS MATCHING OF CURVES IN THREE DIMENSIONS.
E. Kishon.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 263. 1986. Also issued
as Robotics report 91, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106889 VISIBILITY PROBLEMS FOR POLYHEDRAL TERRAINS.
R. Cole and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 266. 1986. Also issued
as Robotics report 92, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106890 DYNAMIC PROCESSOR ALLOCATION FOR PARALLEL ALGORITHMS IN IMAGE
PROCESSING.
R. A. Hummel and K. Zhang.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 268. 1987. Also issued
as Robotics report 94, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106891 THE GENERALIZED MAP MAKERS PROBLEM: OPTIMAL FLATTENING OF POLYHEDRAL
SURFACES.
E. L. Schwartz, A. Shaw, and E. Wolfson.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 273. 1987. Also issued
as Robotics report 95, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106892 ON THE STABILITY OF GRASPING: THREE FINGERS AND A PLANAR POLYGON.
C. M. Bastuscheck.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 276. 1987. Also issued
as Robotics report 98, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106893 THE UPPER ENVELOPE OF PIECEWISE LINEAR FUNCTIONS AND THE BOUNDARY OF
A REGION ENCLOSED BY CONVEX PLATES: COMBINATORIAL ANALYSIS.
J. Pach and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 279. 1987. Also issued
as Robotics report 99, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106894 THE MAXIMUM NUMBER OF WAYS TO STAB N CONVEX NON-INTERSECTING OBJECTS
IN THE PLANE 2N-2.
H. Edelsbrunner and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 281. 1987. Also issued
as Robotics report 101, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106895 AN EXPERIMENTER'S GUIDE TO THE FOUR-FINGER MANIPULATOR.
J. Fehlinger.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 282. 1987. Also issued
as Robotics report 102, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106896 3-D CURVE MATCHING.
E. Kishon and H. Wolfson.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 283. 1987. Also issued
as Robotics report 103, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106897 CEPSTRAL FILTERING ON A COLUMNAR IMAGE ARCHITECTURE: A FAST ALGORITHM
FOR BINOCULAR STEREO SEGMENTATION.
Y. Yeshurun and E. L. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 286. 1987. Also issued
as Robotics report 106, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106898 2 PIECE JIG-SAW PUZZLE ROBOT ASSEMBLY WITH VISION, POSITION, AND
FORCE FEEDBACK.
G. C. Burdea.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 290. 1987. Also issued
as Robotics report 107, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106899 A GLOBALLY CONVERGENT ALGORITHM FOR MINIMIZING OVER THE ROTATION
GROUP OF QUADRATIC FORMS.
C. Gurwitz and M. L. Overton.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 292. 1987. Also issued
as Robotics report 108, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106900 AN EXTREMAL PROBLEM ON K SUBSCRIPT R-FREE GRAPHS.
P. Frankl and J. Pach.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 296. 1987. Also issued
as Robotics report 110, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106901 RADIUS, DIAMETER, AND MINIMUM DEGREE.
P. Erdos et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 297. 1987. Also issued
as Robotics report 111, Robotics Research, Computer Science Division,
Courant Institute of Mathematical Sciences, New York University.]
106902 APPROXIMATE PARALLEL SCHEDULING. PART I: THE BASIC TECHNIQUE WITH
APPLICATIONS TO OPTIMAL PARALLEL LIST RANKING IN LOGARITHMIC TIME.
R. Cole and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 110. 1986. Also
issued as Technical report 244, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106903 PARALLEL CONSTRUCTION OF A SUFFIX TREE.
G. M. Landau, B. Schieber, and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 111. 1986. Also
issued as Technical report 252, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106904 A GROUP LOCK ALGORITHM, WITH APPLICATIONS.
I. Dimitrovsky.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 112. 1986.]
106905 A NOTE ON RANDOM NUMBER GENERATOR OF CHUNG ET. AL.
O. E. Percus.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 113. 1986.]
106906 RANDOM NUMBER GENERATORS FOR ULTRACOMPUTERS.
O. E. Percus and M. H. Kalos.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 114. 1987.]
106907 PARALLEL MERGE SORT.
R. Cole.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 115. 1987. Also
issued as Technical report 278, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
106908 ULTRAPROLOG.
M. C. Harrison, N. Markantonatos, and G. Papadopoulos.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 116. 1987.]
106909 THEORY FORMATION IN POSTULATING KINETIC MECHANISMS: REASONING WITH
CONSTRAINTS.
V.-W. Soo et al.
[Rutgers. Department of Computer Science. Technical report
CBM-TR-150. 1987.]
106910 EXPERIMENTS IN OPTIMIZING FP.
B. G. Ryder and J. S. Pendergrast.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-209. 1987.]
106911 LEARNING CONCEPTS WITH A PROTOTYPE-BASED MODEL FOR CONCEPT
REPRESENTATION.
D.-J. Nagel.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-211. 1987. Thesis (Ph.D.).]
106912 ALMOST SORTING IN ONE ROUND.
M. Ajtai et al.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-212. 1987.]
106913 RECENT RESULTS ON PERFECT GRAPHS.
V. Chvatal.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-210. 1987.]
106914 ON SETS OF NATURAL NUMBERS WHOSE DIFFERENCE SET CONTAINS NO SQUARES.
J. Pintz, W. L. Steiger, and E. Szemeredi.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-213. 1987.]
106915 THE PARALLEL COMPLEXITY OF ELEMENT DISTINCTNESS IS OMEGA (LOG N)
SUPERSCRIPT 1/2.
P. Radge et al.
[Rutgers. Department of Computer Science. Technical report
DCS-TR-214. 1987.]
106916 INCREMENTAL ITERATION: WHEN WILL IT WORK?
B. G. Ryder, T. J. Marlowe, and M. C. Paull.
[Rutgers. Department of Computer Science. Technical report
LCSR-TR-89. 1987.]
106917 INTELLIGENT LEGAL INFORMATION SYSTEMS: AN UPDATE.
L. T. McCarty.
[Rutgers. Department of Computer Science. Technical report LRP-TR-20.
1987.]
106918 FORMULATING CONCEPTS ACCORDING TO PURPOSE.
S. T. Kedar-Cabelli.
[Rutgers. Department of Computer Science. Technical report ML-TR-9.
1987.]
106919 EXPLANATION-BASED GENERALIZATION AS RESOLUTION THEOREM PROVING.
S. T. Kedar-Cabelli and L. T. McCarty.
[Rutgers. Department of Computer Science. Technical report ML-TR-10.
1987.]
106920 CONCEPT LEARNING IN CONTEXT.
R. M. Keller.
[Rutgers. Department of Computer Science. Technical report ML-TR-11.
1987.]
106921 DEFINING OPERATIONALITY FOR EXPLANATION-BASED LEARNING.
R. M. Keller.
[Rutgers. Department of Computer Science. Technical report ML-TR-12.
1987.]
106922 PROLEARN: TOWARD A PROLOG INTERPRETER THAT LEARNS.
A. E. Prieditis and J. Mostow.
[Rutgers. Department of Computer Science. Technical report ML-TR-13.
1987.]
106923 AUTOMATED REUSE OF DESIGN PLANS.
J. Mostow and M. Barley.
[Rutgers. Department of Computer Science. Technical report ML-TR-14.
1987.]
052058 COMPUTER AIDS FOR COMPARATIVE DICTIONARIES.
M. Johnson.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-58. August 1986.]
052060 GRAMMATICAL HIERARCHY AND LINEAR PRECEDENCE.
I. A. Sag.
[Stanford University. Center for the Study of Language and
Information. CSLI-86-60. August 1986.]
052075 SEMANTICS OF CLOCKS.
B. C. Smith.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-75. March 1987.]
052081 MUIR: A TOOL FOR LANGUAGE DESIGN.
T. Winograd.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-81. March 1987.]
052084 FORMAL THEORIES OF KNOWLEDGE IN AI AND ROBOTICS.
S. J. Rosenschein.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-84. March 1987.]
052085 AN ARCHITECTURE FOR INTELLIGENT REACTIVE SYSTEMS.
L. P. Kaelbling.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-85. March 1987.]
052087 MODULAR ALGEBRAIC SPECIFICATION OF SOME BASIC GEOMETRICAL
CONSTRUCTIONS.
J. A. Goguen.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-87. March 1987.]
052088 PERSISTENCE, INTENTION, AND COMMITMENT.
P. R. Cohen and H. J. Levesque.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-88. March 1987.]
052090 AN APPLICATION OF DEFAULT LOGIC TO SPEECH ACT THEORY.
C. R. Perrault.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-90. March 1987.]
052091 MODELS AND EQUALITY FOR LOGICAL PROGRAMMING.
J. A. Goguen and J. Meseguer.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-91. March 1987.]
052096 ONE, NONE, A HUNDRED THOUSAND SPECIFICATION LANGUAGES.
J. A. Goguen.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-96. March 1987.]
052097 CONSTITUENT COORDINATION IN HPSG.
D. Proudian and D. Goddeau.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-97. May 1987.]
048085 GRAPHICAL ACCESS TO MEDICAL EXPERT SYSTEMS: III. DESIGN OF A
-30 KNOWLEDGE-ACQUISITION ENVIRONMENT.
J. D. Walton et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-85-30. June 1987.]
048086 THE OZONE REFERENCE MANUAL.
-40 C. Lane.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-40. July 1986. Version 7.1]
048086 MEDICAL INFORMATICS: THE EMERGENCE OF A DISCIPLINE.
-54 E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-54. September 1986.]
048087 COMPUTATIONAL COSTS VERSUS BENEFITS OF CONTROL REASONING.
-11 A. Garvey, C. Cornelius, and B. Hayes-Roth.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-11. June 1987.]
048087 MEDICAL INFORMATICS: AN EMERGING ACADEMIC DISCIPLINE.
-26 R. A. Greenes and E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL 87-26. March 1987.]
048087 COMPUTER PROGRAMS TO SUPPORT CLINICAL DECISION MAKING.
-30 E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-30. May 1987.]
048087 A MULTI-PROCESSOR INTERRUPT-DRIVEN ARCHITECTURE FOR ADAPTIVE
-31 INTELLIGENT SYSTEMS.
B. Hayes-Roth.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-31. June 1987.]
048087 GUIDON MANAGE -- TUTORING FOR STRATEGIC KNOWLEDGE.
-38 N. S. Rodolitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-38. June 1987.]
048087 AN OBJECT-BASED INTERFACE TO A RELATIONAL DATABASE SYSTEM.
-41 T. Barsalou.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-41. June 1987.]
106924 AN EXPERT SYSTEM FOR STAFF ALLOCATION AND SEAT BOOKING ON AIRCRAFT.
A. Dibb.
[Turing Institute. TIOP-87-005. 1987.]
106925 APPLICATION FORM SCREENING: PROS AND CONS OF AN EXPERT SYSTEMS
APPROACH.
S. East.
[Turing Institute. TIOP-87-006. 1987.]
106926 EXPERT SYSTEM AIDS FOR CIRCUIT DESIGN MAINTENANCE AND MONITORING.
R. J. Scott-Wilson.
[Turing Institute. TIRM-87-022. 1987.]
106927 POLYNOMIAL SPACE RESTRICTED UNWIND PROPERTY OF AN ALGEBRA OF BINARY
WORDS.
V. Sperschneider.
[Universitaet Karlsruhe. Institut fuer Informatik. Report no. 11/86.
1986.]
106928 THE GEOGRAPHY OF BASIC COMPLEXITY CLASSES IN COMPUTATIONS BY PROGRAMS
OVER SIMPLE DATA-STRUCTURES.
V. Sperschneider.
[Universitaet Karlsruhe. Institut fuer Informatik. Report no. 12/86.
1986.]
106929 SEMANTIC TYPE CHANGE AND SYNTACTIC RECOGNITION.
J. van Benthem.
[University of Amsterdam. Department of Mathematics. Report no.
87-05. 1987.]
106930 ESTIMATING THE SPECTRAL NORM OF THE INVERSE OF A MATRIX WITH THE
GAUSS-JORDAN ALGORITHM.
W. Hoffman.
[University of Amsterdam. Department of Mathematics. Report no.
87-06. 1987.]
106931 USE OF A SIMULATOR FOR TEACHING LOGIC CIRCUITS.
R. W. Doran.
[University of Auckland. Department of Computer Science. Report no.
39. 1987.]
106932 THE POSTGRES PAPERS.
E. Hanson et al.
[University of California, Berkeley. Electronics Research Laboratory.
Memorandum UCB/ERL M86/85. 1987. "This collection of papers reports
on the design of the POSTGRES data base management system." Michael
Stonebraker and Lawrence A. Rowe (editors). Revised: 25 June 1987.]
106933 OUTLINE OF A THEORY OF USUALITY BASED ON FUZZY LOGIC.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 35.
1986.]
106934 COGNITIVE SEMANTICS.
G. Lakoff.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 36.
1986.]
106935 TWO METAMETAPHORICAL ISSUES. (1) THE MEANINGS OF "LITERAL." (2) A
FIGURE OF THOUGHT.
G. Lakoff.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 38.
1986.]
106936 ARGUMENT FORMS IN LEXICAL SEMANTICS.
G. Lakoff and C. Brugman.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 39.
1986.]
106937 SOME PROBLEMS AND PROPOSALS FOR KNOWLEDGE REPRESENTATION.
R. Wilensky.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 40.
1986.]
106938 COGNITIVE PRINCIPLES OF PROBLEM SOLVING AND INSTRUCTION.
J. G. Greeno et al.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 41.
1986.]
106939 IS PROBABILITY THEORY SUFFICIENT FOR DEALING WITH UNCERTAINTY IN AI:
A NEGATIVE VIEW.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 42.
1986.]
106940 OUTLINE OF A COMPUTATIONAL APPROACH TO MEANING AND KNOWLEDGE
REPRESENTATION BASED ON THE CONCEPT OF A GENERALIZED ASSIGNMENT
STATEMENT.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 43.
1986.]
106941 ISSUES IN ADAPTIVE PLANNING.
R. Alterman.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 44.
1986.]
106942 THE RELATION OF GRAMMAR TO COGNITION.
L. Talmy.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 45.
1986.]
106943 FIVE WAYS OF LEARNING HOW TO TALK ABOUT EVENTS: A CROSSLINGUISTIC
STUDY OF CHILDREN'S NARRATIVES.
R. A. Berman and D. I. Slobin.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 46.
1987.]
106944 1. LEXICALIZATION PATTERNS: SEMANTIC STRUCTURE IN LEXICAL FORMS [AND]
2. LEXICALIZATION PATTERNS: TYPOLOGIES AND UNIVERSALS.
L. Talmy.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 47.
1987. This report contains two papers. The first paper
("Lexicalization Patterns: semantic structure in lexical forms") has
been published (IN: T. Shopen (editor), "Language Typology and
Syntactic Description. Volume 3: Grammatical Categories and the
Lexicon." Cambridge University Press, 1985).]
106945 THE ROLE OF BEHAVIOUR IN VLSI DESIGN LANGUAGES.
B. S. Davie and G. J. Milne.
[University of Edinburgh. Department of Computer Science. CSR-199-86.
1986.]
106946 PARALLEL PARSING ON AN ARRAY OF PROCESSORS.
L. Langlois.
[University of Edinburgh. Department of Computer Science. CSR-200-86.
1986.]
106947 OC: A PORTABLE OCCAM COMPILER FIRST PASS.
R. M. Marshall.
[University of Edinburgh. Department of Computer Science. CSR-201-86.
1986.]
106948 MARKOV'S PRINCIPLE, ISOLS, AND DEDEKIND FINITE SETS.
C. McCarty.
[University of Edinburgh. Department of Computer Science. CSR-202-86.
1986.]
106949 CONSTRUCTIVE VALIDITY IS NONARITHMETIC.
C. McCarty.
[University of Edinburgh. Department of Computer Science. CSR-203-86.
1986.]
106950 GRAPHICAL DISPLAY OF A CONCURRENT DEVICE SIMULATION USING CIRCAL.
S. G. Johnston.
[University of Edinburgh. Department of Computer Science. CSR-204-86.
1986. "Computer Science Honours Project, June 1986."]
106951 ON THE GEOMETRIC INFORMATION OBTAINABLE FROM SIMULTANEOUS OBSERVATION
OF STEREO CONTOUR AND SHADING.
A. Blake.
[University of Edinburgh. Department of Computer Science. CSR-205-86.
1986.]
106952 SILVER -- THE LANGUAGE AND ITS IMPLEMENTATION.
N. Rothwell.
[University of Edinburgh. Department of Computer Science. CSR-206-86.
1986.]
106953 A SILICON PRE-COMPILER.
H. Sakuma.
[University of Edinburgh. Department of Computer Science. CSR-207-86.
1986.]
106954 IS COMPUTING AN EXPERIMENTAL SCIENCE?
R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-1. 1986. "Text of
the Inaugural Lecture of the Laboratory for the Foundations of
Computer Science." Also issued as CSR-208-86, Department of Computer
Science, University of Edinburgh.]
106955 FUNCTOR-CATEGORY SEMANTICS OF PROGRAMMING LANGUAGES AND LOGICS.
R. D. Tennent.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-3. 1986. Also issued
as CSR-210-86, Department of Computer Science, University of
Edinburgh.]
106956 SEMANTIC ANALYSIS OF SPECIFICATION LOGIC.
R. D. Tennent.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-5. 1986. Also issued
as CSR-211-86, Department of Computer Science, University of
Edinburgh.]
106957 QUANTIFICATION IN ALGOL-LIKE LANGUAGES.
R. D. Tennent.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-6. 1986. Also issued
as CSR-212-86, Department of Computer Science, University of
Edinburgh.]
106958 A COMPLETE AXIOMATISATION FOR OBSERVATIONAL CONGRUENCE OF
FINITE-STATE BEHAVIOURS.
R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-8. 1986. Also issued
as CSR-214-86, Department of Computer Science, University of
Edinburgh.]
106959 COMPUTING WITH CATEGORIES.
R. M. Burstall and D. Rydeheard.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-9. 1986. Also issued
as CSR-215-86, Department of Computer Science, University of
Edinburgh.]
106960 A STUDY IN THE FOUNDATIONS OF PROGRAMMING METHODOLOGY:
SPECIFICATIONS, INSTITUTIONS, CHARTERS AND PRACHMENTS.
J. A. Goguen and R. M. Burstall.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-10. 1986. Also
issued as CSR-216-86, Department of Computer Science, University of
Edinburgh.]
106961 MODULES AND PERSISTENCE IN STANDARD ML.
R. Harper.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-11. 1986. Also
issued as CSR-217-86, Department of Computer Science, University of
Edinburgh.]
106962 RESEARCH IN INTERACTIVE THEOREM PROVING AT EDINBURGH UNIVERSITY.
R. M. Burstall.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-12. 1986. Also
issued as CSR-218-86, Department of Computer Science, University of
Edinburgh.]
106963 A COMPLETE PROTOCOL VERIFICATION USING RELATIVIZED BISIMULATION.
K. G. Larsen and R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-13. 1986. Also
issued as CSR-219-86, Department of Computer Science, University of
Edinburgh.]
106964 FORMAL SPECIFICATION OF ML PROGRAMS.
D. Sannella.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-15. 1986. Also
issued as CSR-221-86, Department of Computer Science, University of
Edinburgh.]
106965 EXTENDED ML: AN INSTITUTION-INDEPENDENT FRAMEWORK FOR FORMAL PROGRAM
DEVELOPMENT.
D. Sannella and A. Tarlecki.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-16. 1986. Also
issued as CSR-222-86, Department of Computer Science, University of
Edinburgh.]
106966 TOWARD FORMAL DEVELOPMENT OF PROGRAMS FROM ALGEBRAIC SPECIFICATIONS:
IMPLEMENTATIONS REVISITED.
D. Sannella and A. Tarlecki.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-17. 1986. Also
issued as CSR-223-86, Department of Computer Science, University of
Edinburgh.]
106967 VERIFYING A CSMA/CD-PROTOCOL WITH CCS.
J. Parrow.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-18. 1986. Also
issued as CSR-224-87, Department of Computer Science, University of
Edinburgh.]
106968 THE TOPOLOGY, ALGORITHMS, AND ANALYSIS OF A SYNCHRONOUS OPTICAL
HYPERGRAPH ARCHITECTURE.
Y. Ofek.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1343. 1987. Thesis (Ph.D.).]
106969 ON OBTAINING A CONSISTENT SET OF INITIAL VALUES FOR A SYSTEM OF
DIFFERENTIAL-ALGEBRAIC EQUATIONS.
B. J. Leimkuhler, L. R. Petzold, and C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1344. 1987.]
106970 S-STEP ITERATIVE METHODS FOR SYMMETRIC LINEAR SYSTEMS.
A. T. Chronopoulos and C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1345. 1987.]
106971 IMPLEMENTATION OF S-STEP METHODS ON PARALLEL VECTOR ARCHITECTURES.
A. T. Chronopoulos and C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1346. 1987.]
106972 USING TEMPORAL LOGIC IN THE COMPOSITIONAL SPECIFICATION OF CONCURRENT
SYSTEMS.
H. Barringer.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-10-1. 1986.]
106973 THE DESIGN AND ANALYSIS OF PARALLEL ADAPTIVE ALGORITHMS FOR COMPOSITE
DECISION PROCESSES.
T. Tsao.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1606. 1985. Thesis (Ph.D.).]
106974 HOUGH TRANSFORM ALGORITHMS FOR MESH-CONNECTED SIMD PARALLEL
PROCESSORS.
A. Rosenfeld, J. Ornelas Jr., and Y. Hung.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1608. 1986. Also issued as CAR-TR-178,
Center for Automation Research, University of Maryland.]
106975 AN ARTIFICIAL INTELLIGENCE ENVIRONMENT FOR THE ANALYSIS AND
CLASSIFICATION OF ERRORS IN DISCRETE SEQUENTIAL PROCESSES.
S. B. Ahuja.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1609. 1986. Thesis (Ph.D.).]
106976 PLAUSIBLE REASONING DURING NEUROLOGICAL PROBLEM -SOLVING.
J. A. Reggia et al.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1610. 1986.]
106977 THE HOUGH TRANSFORM ON THE GEOMETRIC ARITHMETIC PARALLEL PROCESSOR.
T. M. Silberberg.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1612. 1986. Also issued as CAR-TR-180,
Center for Automation Research, University of Maryland.]
106978 MULTIRESOLUTION OBJECT DETECTION AND DELINEATION.
A. D. Gross.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1613. 1986. Also issued as CAR-TR-181,
Center for Automation Research, University of Maryland.]
106979 ON RELIABILITY MECHANISMS IN DISTRIBUTED DATABASE SYSTEMS.
S. H. Son.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1614. 1986. Thesis (Ph.D.).]
106980 A FORMALIZATION OF PARSIMONIOUS COVERING AND PROBABILISTIC REASONING
IN ABDUCTIVE DIAGNOSTIC INFERENCE.
Y. Peng.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1615. 1986. Thesis (Ph.D.).]
106981 HALFTONING AS OPTIMAL QUANTIZATION.
M. Werman and S. Peleg.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1616. 1986. Also issued as CAR-TR-182,
Center for Automation Research, University of Maryland.]
106982 EXPERIMENTS IN STEREO MATCHING USING MULTIRESOLUTION LOCAL SUPPORT.
F.-J. L. Liu, R. Eastman, and L. S. Davis.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1617. 1986. Also issued as CAR-TR-183,
Center for Automation Research, University of Maryland.]
106983 SHAPE FROM TEXTURE: GENERAL PRINCIPLE.
K.-I. Kanatani and C. Tsai-Chia.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1618. 1986. Also issued as CAR-TR-184,
Center for Automation Research, University of Maryland.]
106984 VIRTUAL WAITING TIME OF AN ERLANGIAN SINGLE SERVER QUEUEING SYSTEM.
C. Kim and A. K. Agrawala.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1620. 1985. Also issued as
UMIACS-TR-86-6, Institute for Advanced Computer Studies, University
of Maryland.]
106985 THE FORK-JOIN QUEUE WITH ERLANGIAN SERVERS.
C. Kim and A. K. Agrawala.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1621. 1986. Also issued as
UMIACS-TR-86-7, Institute for Advanced Computer Studies, University
of Maryland.]
106986 INTEGRATING MARKER-PASSING AND PROBLEM-SOLVING: A SPREADING
ACTIVATION APPROACH TO IMPROVED CHOICE IN PLANNING.
J. A. Hendler.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1624. 1986. Thesis (Ph.D.). "Submitted
in partial fulfillment of the requirements for the degree of Doctor
of Philosophy in the Department of Computer Science at Brown
University." "Originally published as Brown University technical
report TR-86-01."]
095184 REPORT OF THE SUMMER WORKSHOP ON PARALLEL ALGORITHMS AND
ARCHITECTURES, 15 JULY TO 2 AUGUST, 1985, WASHINGTON, D.C.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1625. 1986. Also issued as
UMIACS-TR-86-1, Institute for Advanced Computer Studies, University
of Maryland.]
106987 A NEW APPROACH FOR COMPILING BOOLEAN FUNCTIONS.
J. Ja'Ja' and S.-M. Wu.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1626. 1986. Also issued as
UMIACS-TR-86-2, Institute for Advanced Computer Studies, University
of Maryland.]
106988 RELATING TWO KNOWLEDGE BASES: THE ROLE OF IDENTITY AND PART-WHOLE.
R. Rada, L. Darden, and J. Eng.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1627. 1986. Also issued as
UMIACS-TR-86-3, Institute for Advanced Computer Studies, University
of Maryland.]
106989 HYPOTHESIS FORMATION VIA INTERRELATIONS.
L. Darden.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1628. 1986. Also issued as
UMIACS-TR-86-4, Institute for Advanced Computer Studies, University
of Maryland.]
106990 DESIGN OF A PROLOG VIRTUAL MACHINE.
Y. Chu and K. Itano.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1629. 1986.]
106991 PARALLEL APPROXIMATE ALGORITHMS FOR THE 0-1 KNAPSACK PROBLEM.
P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1630. 1986. Extended abstract.]
106992 TEXTURE DISCRIMINATION BY PROJECTIVE INVARIANTS.
S. Chang et al.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1631. 1986. Also issued as CAR-TR-188,
Center for Automation Research, University of Maryland.]
106993 DIRECTION-WEIGHTED LINE FITTING TO EDGE DATA.
A. Rosenfeld and A. C. Sher.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1632. 1986. Also issued as CAR-TR-189,
Center for Automation Research, University of Maryland.]
106994 CLOSED-FORM SOLUTIONS TO IMAGE-FLOW EQUATIONS FOR 3-D STRUCTURE AND
MOTION.
A. M. Waxman, B. Kamgar-Parsi, and M. Subbarao.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1633. 1986. Also issued as CAR-TR-190,
Center for Automation Research, University of Maryland.]
106995 STRUCTURED LIGHT PATTERNS FOR ROBOT MOBILITY.
J. Le Moigne and A. M. Waxman.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1634. 1986. Also issued as CAR-TR-191,
Center for Automation Research, University of Maryland.]
106996 DISPLAY STRATEGIES FOR PROGRAM BROWSING: CONCEPTS AND AN EXPERIMENT.
B. Shneiderman et al.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1635. 1986. Also issued as CAR-TR-192,
Center for Automation Research, University of Maryland.]
106997 ISSUES IN THE DESIGN OF MARKER-PASSING SYSTEMS.
J. A. Hendler.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1636. n.d.]
106998 RECOVERING THE ORIENTATION OF TEXTURED SURFACES.
S. M. Dunn.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1637. 1986. Also issued as CAR-TR-193,
Center for Automation Research, University of Maryland.]
106999 A VERIFIED SLIDING WINDOW PROTOCOL WITH VARIABLE FLOW CONTROL.
A. U. Shankar.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1638. 1986. Also issued as
UMIACS-TR-86-5, Institute for Advanced Computer Studies, University
of Maryland.]
107000 PRACTICAL COMPUTATION OF PAN AND TILT ANGLES IN STEREO.
B. Kamgar-Parsi.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1640. 1986. Also issued as CAR-TR-195,
Center for Automation Research, University of Maryland.]
107001 LINEAR OPEN ADDRESSING AND PETERSON'S THEOREM REHASHED.
G. D. Knott.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1642. 1986. Also issued as CAR-TR-196,
Center for Automation Research, University of Maryland.]
107002 STORING THE SUBDIVISION OF A POLYHEDRAL SURFACE.
D. M. Mount.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1643. 1986. Also issued as CAR-TR-197,
Center for Automation Research, University of Maryland.]
107003 THE INFORMATION STRUCTURE OF DISTRIBUTED MUTUAL EXCLUSION ALGORITHMS.
B. A. Sanders.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1644. 1986.]
107004 ON THE STRUCTURE OF PARALLEL ADAPTIVE ALGORITHMS AND AND/OR TREES
SEARCH WITH A COORDINATE SYSTEM.
T. Tsao and L. N. Kanal.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1645. 1986.]
107005 EXECUTION TRACES OF A PROLOG VIRTUAL MACHINE.
Y. Chu and K. Itano.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1646. 1986.]
107006 CONSTRUCTION OF SLIDING WINDOW PROTOCOLS.
A. U. Shankar and S. S. Lam.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1647. 1986. Also issued as
UMIACS-TR-86-8, Institute for Advanced Computer Studies, University
of Maryland.]
107007 DOMINO: A MESSAGE PASSING ENVIRONMENT FOR PARALLEL COMPUTATION.
D. P. O'Leary, G. W. Stewart, and R. van de Geijn.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1648. 1986.]
107008 A GENERAL APPROACH TO CONNECTED COMPONENT LABELING OF IMAGES.
H. Samet and M. Tamminen.
[University of Maryland. Department of Computer Science. Computer
science technical report CS-TR-1649. 1986. Also issued as CAR-TR-198,
Center for Automation Research, University of Maryland.]
107019 INTENTIONAL DEVELOPMENT OF PROFESSIONAL LANGUAGE THROUGH
COMPUTERIZATION. A CASE STUDY AND SOME THEORETICAL CONSIDERATIONS.
J. Kaasboll.
[University of Oslo. Institute for Informatics. Research report 105.
1986.]
107020 A DATA REDUCTION STRATEGY FOR SPLINES.
T. Lyche and K. Morken.
[University of Oslo. Institute for Informatics. Research report 107.
1987.]
107021 OBJECT ORIENTED SPECIFICATION.
O.-J. Dahl.
[University of Oslo. Institute for Informatics. Research report 108.
1987.]
107022 KNOT REMOVAL FOR PARAMETRIC B-SPLINE CURVES AND SURFACES.
T. Lyche and K. Morken.
[University of Oslo. Institute for Informatics. Research report 109.
1987.]
107023 SECONDARY STORAGE IN A CONCURRENT LOGIC PROGRAMMING ENVIRONMENT.
A. J. Kusalik.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-5. 1987.]
107024 NEW ALGORITHMIC SYNTHESIS TECHNIQUES FOR MULTI-VALUED LOGIC FUNCTIONS.
M. H. Abd-El-Barr.
[University of Saskatchewan. Department of Computational Science.
Report no. 87-6. 1987.]
107025 GLOBAL ERROR ESTIMATION USING DEFECT CORRECTION TECHNIQUES FOR
EXPLICIT RUNGE-KUTTA METHODS.
P. J. Peterson.
[University of Toronto. Department of Computer Science. Report no.
192/86. 1986. Thesis (M.S.).]
107026 DETECTING STIFFNESS WITH EXPLICIT RUNGE-KUTTA FORMULAS.
B. C. Robertson.
[University of Toronto. Department of Computer Science. Report no.
193/87. 1987. Thesis (M.S.).]
107027 PERMUTATION GROUP ALGORITHMS.
M. C. Henderson.
[University of Toronto. Department of Computer Science. Report no.
200/87. 1987.]
107028 CRYPTOGRAPHY USING WEAK SOURCES OF RANDOMNESS.
J. L. McInnes.
[University of Toronto. Department of Computer Science. 1987. Thesis
(M.S.).]
107009 AUTOMATIC GENERATION OF VLSI ARCHITECTURES: SYNTHESIS BY ALGORITHM
TRANSFORMATION.
M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-247.
1985.]
107010 MATRIX TRANSPOSITION ON BOOLEAN N-CUBE CONFIGURED ENSEMBLE
ARCHITECTURES.
C.-T. Ho and S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-494.
1986.]
107011 VERY-HIGH-LEVEL PARALLEL PROGRAMMING BY AGGREGATE SET OPERATIONS.
M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-499.
1986. "Extended abstract."]
107012 SPANNING BALANCED TREES IN BOOLEAN CUBES.
C.-T. Ho and S. L. Johnsson.
[Yale University. Department of Computer Science. YALEU/DCS/RR-508.
1987.]
107013 AUTOMATED PROBLEM MAPPING: THE CRYSTAL RUNTIME SYSTEM.
J. H. Saltz and M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/RR-510.
1987.]
107014 CONSTRAINED RANDOMIZATION FOR PARALLEL COMMUNICATION.
A. G. Ranade.
[Yale University. Department of Computer Science. YALEU/DCS/RR-511.
1987.]
107015 EQUIVALENCE OF MESSAGE SCHEDULING ALGORITHMS FOR PARALLEL
COMMUNICATION.
A. G. Ranade.
[Yale University. Department of Computer Science. YALEU/DCS/RR-512.
1987.]
107017 MATRIX MULTIPLICATION ON BOOLEAN CUBES USING GENERIC COMMUNICATION
PRIMITIVES.
S. L. Johnsson and C.-T. Ho.
[Yale University. Department of Computer Science. YALEU/DCS/RR-530.
1987.]
107018 PARALLELISM, PERSISTENCE AND META-CLEANLINESS IN THE SYMMETRIC LISP
INTERPRETER.
D. Gelernter, S. Jagannathan, and T. London.
[Yale University. Department of Computer Science. YALEU/DCS/RR-531.
1987.]
VOL. 9, NO. 9 09/18/87
107029 TWO-LEVEL SEMANTICS AND CODE GENERATION.
F. Nielson and H. R. Nielson.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 87-3. 1987.]
107030 COMPOSITIONAL PROOFS BY PARTIAL SPECIFICATION OF PROCESSES.
K. G. Larsen and B. Thomsen.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 87-20. 1987.]
107031 A USE OF SYNCHRONIC DISTANCES.
W. M. Lu.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
6. 1986.]
107032 THE TRANSACTION MANAGEMENT IN DISTRIBUTED DATABASE SYSTEM C-POREL.
L. Zhou.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
7. 1986.]
107033 ESLID: AN EXPERT SYSTEM FOR INTERPRETING LOG DATA.
F. Feng.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
8. 1987.]
107034 THE INPUT/OUTPUT COMPLEXITY OF SORTING AND RELATED PROBLEMS.
A. Aggarwal and J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-87-10. 1987.]
107035 DIMENSIONS OF OBJECT-BASED LANGUAGE DESIGN.
P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-87-14. 1987.]
107036 DELEGATION IS INHERITANCE.
L. A. Stein.
[Brown University. Computer Science Department. Technical report
CS-87-15. 1987.]
107037 A TAXONOMY OF MAP LEARNING PROBLEMS.
T. Dean.
[Brown University. Computer Science Department. Technical report
CS-87-16. 1987.]
107038 WHY LIKE ISN'T LIKE IS-A (OR AS YOU LIKE IT).
P. Wegner and S. B. Zdonik.
[Brown University. Computer Science Department. Technical report
CS-87-17. 1987.]
107039 INTERMEDIA: A CASE STUDY OF THE DIFFERENCES BETWEEN RELATIONAL AND
OBJECT-ORIENTED DATABASE SYSTEMS.
K. E. Smith and S. B. Zdonik.
[Brown University. Computer Science Department. Technical report
CS-87-18. 1987.]
107040 ISSUES IN THE DESIGN OF OBJECT-ORIENTED DATABASE PROGRAMMING
LANGUAGES.
T. Bloom and S. B. Zdonik.
[Brown University. Computer Science Department. Technical report
CS-87-19. 1987.]
107041 AVERAGE-CASE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES.
J. S. Vitter and P. Flajolet.
[Brown University. Computer Science Department. Technical report
CS-87-20. 1987.]
107042 AN ALGEBRAIC MODEL OF SUBTYPE AND INHERITANCE.
K. B. Bruce and P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-87-21. 1987.]
107043 WORKSHOP ON OBJECT-ORIENTED PROGRAMMING.
P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-87-22. 1987. Notes of the 1987 "Workshop on Object-Oriented
Programming" (ECOOP 1987), held at IRCAM (Pompidou Center), Paris,
June 18, 1987." Edited by Peter Wegner.]
107044 LOW-LEVEL VISION ON WARP AND THE APPLY PROGRAMMING MODEL.
L. G. C. Hamey, J. A. Webb, and I.-C. Wu.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-17. 1987.]
107045 THE WARP COMPUTER: ARCHITECTURE, IMPLEMENTATION, AND PERFORMANCE.
M. Annaratone et al.
[Carnegie-Mellon University. Robotics Institute. Technical report
CMU-RI-TR-87-18. 1987.]
107046 DISTRIBUTED TRANSACTION PROCESSING AND THE CAMELOT SYSTEM.
A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-100. 1987.]
107047 BLOSSOMING: A CONNECT-THE-DOTS APPROACH TO SPLINES.
L. Ramshaw.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 19. 1987.]
107048 OSSI -- A PORTABLE OPERATING SYSTEM INTERFACE AND UTILITY LIBRARY FOR
MODULA-2.
E. Biagioni et al.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 79. 1987. Second, revised edition: April
1987.]
107049 A PERSPECTIVE ON MACHINE VISION RESEARCH AT GENERAL MOTORS.
W. Wittanen.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5841. 1987.]
107050 AN INTERFACE RECOVERY SYSTEM FOR SERIAL-TO-PARALLEL CONVERSION OF
FORTRAN 77 PROGRAMS.
D. J. McMillan and A. M. Baum.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5889. 1987.]
107051 REAL-TIME MULTISPECTRAL VISUAL PROCESSOR.
I. Misaki.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5894. 1987.]
107052 LOCATION ESTIMATION AND ERROR ANALYSIS FOR AN AUTONOMOUS MOBILE ROBOT.
C.-M. Wang.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5897. 1987.]
107053 REUSE OF FORMATTED REQUIREMENTS SPECIFICATIONS.
A. Finkelstein.
[Imperial College of Science and Technology. Department of Computing.
Research report DoC 87/11. 1987.]
107054 AN OPERATIONAL FORMAL DEFINITION OF PROLOG.
P. Deransart and G. Ferrand.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 598. 1986.]
107055 NATURAL SEMANTICS.
G. Kahn.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 601. 1987.]
107056 TWO PAPERS ON DYNAMIC HUFFMAN CODES.
J. S. Vitter.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 623. 1987.]
107057 AN EFFICIENT ALGORITHM FOR SEQUENTIAL RANDOM SAMPLING.
J. S. Vitter.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 624. 1987.]
107058 UN ALGORITHME D'ELECTION ENTIEREMENT DISTRIBUE ET DECENTRALISE DANS
UN SYSTEME DISTRIBUE QUELCONQUE.
C. Lavault.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 625. 1987.]
107059 LA DETECTION DE PROPRIETES STABLES DANS LES APPLICATIONS DISTRIBUEES.
J.-M. Helary et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 628. 1987. Also issued as Publication
interne 342, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
107060 REGION SEGMENTATION ACCORDING TO MOTION-BASED CRITERIA.
J. Santillana Rivero and P. Bouthemy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 629. 1987.]
107061 PROOF SYSTEMS FOR INFINITE BEHAVIOURS.
P. Darondeau and S. Yoccoz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 632. 1987. Also issued as Publication
interne 348, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
107062 THE INFLUENCE OF VECTOR AND PARALLEL PROCESSORS AND NUMERICAL
ANALYSIS.
I. S. Duff.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 634. 1987.]
107063 DERIVING TRACE CHECKERS FOR DISTRIBUTED SYSTEMS.
C. Jard and O. Drissi-Kaitouni.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 635. 1987. Also issued as Publication
interne 347, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
107064 COMMUNICATION IS AN ABSTRACTION.
G. Boudol.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 636. 1987.]
107065 ALGORITHMIQUE COMBINATOIRE SUR ORDINATEURS PARALLELES.
I. Lavallee.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 637. 1987.]
107066 EVALUATION TOOLS FOR REAL-TIME MESSAGE SCHEDULING ALGORITHMS:
ANALYTIC SOLVER VERSUS EVENT-DRIVEN SIMULATOR.
P. Jacquet and S. Sedillot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 638. 1987.]
107067 MULTI-DIMENSIONAL STOCHASTIC ORDERING AND ASSOCIATED RANDOM VARIABLES.
F. Baccelli and A. Makowski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 639. 1987. Revised version.]
107068 LA SPECIFICITE EN LOGIQUE DES DEFAUTS.
Y. Moinard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 642. 1987. Also issued as Publication
interne 343, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
107069 AUTOMATED PROBLEM SCHEDULING AND REDUCTION OF SYNCHRONIZATION DELAY
EFFECTS.
J. H. Saltz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-22. 1987.]
107070 IMPLEMENTATION OF MULTIGRID METHODS FOR SOLVING NAVIER-STOKES
EQUATIONS ON A MULTIPROCESSOR SYSTEM.
V. K. Naik and S. Ta'asan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-37. 1987.]
107071 VECTORIZED MIXED RADIX DISCRETE FOURIER TRANSFORM ALGORITHMS.
R. C. Agarwal and J. W. Cooley.
[International Business Machines Corporation (IBM). Research
Division. RC 12167. 1986.]
107072 ON ANALYZING LOCK CONTENTION IN DATABASES.
A. Thomasian and I. K. Ryu.
[International Business Machines Corporation (IBM). Research
Division. RC 12666. 1987.]
107073 BRAILLED MONITOR READER.
T. J. Nolan Jr..
[International Business Machines Corporation (IBM). Research
Division. RC 12676. 1987.]
107074 SIMPLE: PART I. AN EXERCISE IN FUTURE SCIENTIFIC PROGRAMMING.
K. Ekanadham and Arvind.
[International Business Machines Corporation (IBM). Research
Division. RC 12686. 1987.]
107075 OPTIMAL CIRCUITS AND TRANSITIVE AUTOMORPHISM GROUPS.
S. Rudich and L. Berman.
[International Business Machines Corporation (IBM). Research
Division. RC 12688. 1987.]
107076 ON HYBRID DISTRIBUTED - CENTRALIZED DATABASE SYSTEMS.
B. Ciciani et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12698. 1987.]
107077 A SHAPE REPRESENTATION BASED ON GEOMETRIC TOPOLOGY: BUMPS, GAUSSIAN
CURVATURE, AND TOPOLOGICAL ZODIAC.
A. P. Blicher.
[International Business Machines Corporation (IBM). Research
Division. RC 12716. 1987.]
107078 A SPECIFICATION AND DESIGN LANGUAGE.
A. E. K. Sobel and G. Fisher.
[International Business Machines Corporation (IBM). Research
Division. RC 12718. 1987.]
107079 TASKMAPPER.
J. M. Carroll, R. E. Herder, and D. Sawtelle 3d.
[International Business Machines Corporation (IBM). Research
Division. RC 12721. 1987.]
107080 QUEUEING-BLOCKING SYSTEM WITH TWO ARRIVAL STREAMS AND GUARD CHANNELS.
R. Guerin.
[International Business Machines Corporation (IBM). Research
Division. RC 12725. 1987.]
107081 IMPROVING MEMORY SUBSYSTEM AVAILABILITY USING BIST.
R. P. Kunda and B. D. Rathi.
[International Business Machines Corporation (IBM). Research
Division. RC 12732. 1987.]
107082 DISCRETE EVENT SIMULATIONS AND PARALLEL PROCESSING: STATISTICAL
PROPERTIES.
P. Heidelberger.
[International Business Machines Corporation (IBM). Research
Division. RC 12733. 1987.]
107083 SMOOTHING AND INTERPOLATION IN A CONVEX SUBSET OF A HILBERT SPACE.
C. A. Micchelli and F. I. Utreras.
[International Business Machines Corporation (IBM). Research
Division. RC 12734. 1987.]
107084 COMPACTLY SUPPORTED FUNDAMENTAL FUNCTIONS FOR SPLINE INTERPOLATION.
W. Dahmen, T. N. T. Goodman, and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. RC 12737. 1987.]
107085 CHAOS AND HALLEY'S METHOD.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12747. 1987.]
107086 THE SEMANTICS OF LAZY FUNCTIONAL LANGUAGES.
M. B. Josephs.
[International Business Machines Corporation (IBM). Research
Division. RC 12754. 1987.]
107087 COLLISION RESOLUTION ALGORITHMS IN MULTI-STATION PACKET-RADIO
NETWORKS.
A. Bar-David and M. Sidi.
[International Business Machines Corporation (IBM). Research
Division. RC 12762. 1987.]
107088 PERSONAL COMPUTER DISPLAYS.
S. Gupta and D. H. McCabe.
[International Business Machines Corporation (IBM). Research
Division. RC 12763. 1987.]
107089 PARALLEL ALGORITHMS FOR INSTANCES OF LINEAR MATROID PARITY WITH A
SMALL NUMBER OF SOLUTIONS.
P. Tiwari.
[International Business Machines Corporation (IBM). Research
Division. RC 12766. 1987.]
107090 MULTILINGUAL EDITING ENVIRONMENTS.
J. J. Shilling.
[International Business Machines Corporation (IBM). Research
Division. RC 12771. 1987.]
107091 INCREMENTAL LL(1) PARSING IN LANGUAGE-BASED EDITORS.
J. J. Shilling.
[International Business Machines Corporation (IBM). Research
Division. RC 12772. 1987.]
107092 MICROECONOMIC MODELS FOR RESOURCE SHARING IN A MULTICOMPUTER.
D. F. Ferguson and Y. Yemini.
[International Business Machines Corporation (IBM). Research
Division. RC 12792. 1987.]
107093 INFINITE STRUCTURES IN SCRATCHPAD II.
W. H. Burge and S. M. Watt.
[International Business Machines Corporation (IBM). Research
Division. RC 12794. 1987.]
107094 ON THE STRUCTURE OF ADDRESS INDEPENDENT NETWORKS.
T. K. Philips.
[International Business Machines Corporation (IBM). Research
Division. RC 12798. 1987.]
107095 ANALYSIS OF TRADE-OFFS IN DISTRIBUTED LOCKING FOR TRANSACTION
PROCESSING SYSTEMS.
B. R. Iyer, C. M. Krishna, and J. S. Lew.
[International Business Machines Corporation (IBM). Research
Division. RC 12802. 1987.]
107096 MULTITERMINAL GLOBAL ROUTING: A DETERMINISTIC APPROXIMATION SCHEME.
P. Raghavan and C. D. Thompson.
[International Business Machines Corporation (IBM). Research
Division. RC 12806. 1987.]
107097 A TRANSLATOR FROM FP TO THE LAMBDA CALCULUS.
A. Cazes.
[International Business Machines Corporation (IBM). Research
Division. RC 12844. 1987.]
107098 AN ANALYSIS OF AN ARRAY-COMPUTER ALGORITHM FOR QUERY PROCESSING.
H. S. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12850. 1987.]
107099 FUTURE SCIENTIFIC PROGRAMMING ON PARALLEL MACHINES.
Arvind and K. Ekanadham.
[International Business Machines Corporation (IBM). Research
Division. RC 12856. 1987.]
107100 SITE ASSIGNMENT FOR RELATIONS AND JOIN OPERATIONS IN THE DISTRIBUTED
TRANSACTION PROCESSING ENVIRONMENT.
D. W. Cornell and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 12865. 1987.]
107101 A GRAPHICAL WORKSTATION-BASED HOST DEBUGGER.
D. P. Pazel.
[International Business Machines Corporation (IBM). Research
Division. RC 12871. 1987.]
107102 THE COMPLEXITY OF LOGIC PROGRAMMING WITH SETS.
K. J. Perry et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12887. 1987.]
107103 HIGH-PERFORMANCE EXPERT SYSTEM -- DBMS INTERFACE FOR NETWORK
MANAGEMENT AND CONTROL.
K.-Y. Whang and S. Brady.
[International Business Machines Corporation (IBM). Research
Division. RC 12890. 1987.]
107104 VERIFYING THE CORRECTNESS OF COMPLIANT MOTION STRATEGIES.
S. J. Buckley.
[International Business Machines Corporation (IBM). Research
Division. RC 12891. 1987.]
107105 PLANNING COMPLIANT MOTION STRATEGIES.
S. J. Buckley.
[International Business Machines Corporation (IBM). Research
Division. RC 12892. 1987.]
107106 TEACHING COMPLIANT MOTION STRATEGIES.
S. J. Buckey.
[International Business Machines Corporation (IBM). Research
Division. RC 12893. 1987.]
107107 AN EVALUATION OF SOME THREE-COLOR TILING PATTERNS.
V. Cordonnier.
[International Business Machines Corporation (IBM). Research
Division. RC 12897. 1987.]
107108 MULTISYSTEM COUPLING BY A COMBINATION OF DATA SHARING AND DATA
PARTITIONING.
J. L. Wolf et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12901. 1987.]
107109 RECURSIVE COMPUTATION OF BUFFER OCCUPANCY PROBABILITIES IN PRIORITY
QUEUEING SYSTEMS.
I. Cidon and M. Sidi.
[International Business Machines Corporation (IBM). Research
Division. RC 12912. 1987.]
107110 DEPLOMAT: A DESIGN EXPERT FOR PLA OPTIMIZATION, MAINTENANCE AND TEST.
P. Bose.
[International Business Machines Corporation (IBM). Research
Division. RC 12928. 1987.]
107111 WIDE SENSE NON-BLOCKING NETWORKS.
P. Feldman, J. Friedman, and N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. RJ 5642. 1987.]
107112 STOCHASTIC PETRI NET REPRESENTATION OF DISCRETE EVENT SIMULATIONS.
P. J. Haas and G. S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. RJ 5646. 1987.]
107113 STOCHASTIC COMPLEXITY.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. RJ 5651. 1987.]
107114 APPROXIMATION ALGORITHMS FOR HITTING OBJECTS BY STRAIGHT LINES.
R. Hassin and N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. RJ 5659. 1987.]
107115 GENERALIZED TRANSITION MANAGEMENT.
G. Chan.
[International Business Machines Corporation (IBM). Research
Division. RJ 5700. 1987. Thesis (M.S.). "Submitted to the Department
of Electrical Engineering and Computer Science in partial fulfillment
of the requirements for the degrees of Master of Science and Bachelor
of Science at the Massachusetts Institute of Technology, May, 1987."]
107116 CHICKEN AND EGGS: THE INTERRELATIONSHIP OF SYSTEMS AND THEORY.
P. G. Selinger.
[International Business Machines Corporation (IBM). Research
Division. RJ 5701. 1987. Extended abstract.]
107117 A RECOVERY ALGORITHM FOR A HIGH-PERFORMANCE MEMORY-RESIDENT DATABASE
SYSTEM.
T. J. Lehman and M. J. Carey.
[International Business Machines Corporation (IBM). Research
Division. RJ 5707. 1987.]
107118 CONCURRENCY CONTROL IN MEMORY-RESIDENT DATABASE SYSTEMS.
T. J. Lehman and M. J. Carey.
[International Business Machines Corporation (IBM). Research
Division. RJ 5708. 1987.]
107119 THE HOUGH TRANSFORMATION HAS O(N) COMPLEXITY ON SIMD MXN MESH ARRAY
ARCHITECTURES.
R. E. Cypher, J. L. C. Sanz, and L. Snyder.
[International Business Machines Corporation (IBM). Research
Division. RJ 5709. 1987.]
107120 COMPUTING IMAGE TEXTURE FEATURES IN PARALLEL COMPUTERS.
J. L. C. Sanz.
[International Business Machines Corporation (IBM). Research
Division. RJ 5710. 1987.]
107121 MECHANISMS FOR FAILURE HANDLING IN DISTRIBUTED PROGRAMMING LANGUAGES.
R. Schlichting, F. Cristian, and T. D. M. Purdin.
[International Business Machines Corporation (IBM). Research
Division. RJ 5713. 1987.]
107122 IMPROVING NETWORK SUBSYSTEM PERFORMANCE IN A DISTRIBUTED ENVIRONMENT.
A BERKELEY UNIX CASE STUDY.
L.-F. Cabrera.
[International Business Machines Corporation (IBM). Research
Division. RJ 5719. 1987.]
107123 ON THE MEAN-SQUARE OF THE RIEMANN ZETA-FUNCTION ON THE CRITICAL LINE.
J. L. Harner and A. Ivic.
[International Business Machines Corporation (IBM). Research
Division. RJ 5726. 1987.]
107124 OSI INTERNETWORKING IN A HETEROGENEOUS LAN AND WAN ENVIRONMENT.
D. Gantenbein, W. Stoll, and M. Zieher.
[International Business Machines Corporation (IBM). Research
Division. RZ 1585. 1987.]
107125 EFFICIENT IMPLEMENTATION OF THE OSI TRANSPORT-PROTOCOL CHECKSUM
ALGORITHM USING 8/16-BIT ARITHMETIC.
A. A. R. Cockburn.
[International Business Machines Corporation (IBM). Research
Division. RZ 1601. 1987.]
107126 OPERATING SYSTEMS SECURITY VERIFICATION USING PROLOG.
D. Sidhu and R. Gulati.
[Iowa State University. Department of Computer Science. TR 87-2.
1987.]
107127 THEORETICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS ON NETWORKS WITH
SMALL INTEGER CAPACITIES.
D. Fernandez-Baca and C. U. Martel.
[Iowa State University. Department of Computer Science. TR 87-4.
1987.]
107128 GLOBAL AND LOCAL VIEWS OF STATE FAIRNESS.
R. R. Howell, L. E. Rosier, and H.-C. Yen.
[Iowa State University. Department of Computer Science. TR 87-5.
1987.]
107129 ON OPTIMAL PARALLELIZATION OF SORTING NETWORKS.
E. Gannett, S. C. Kothari, and H.-C. Yen.
[Iowa State University. Department of Computer Science. TR 87-8.
1987.]
107130 FAILSAFE DISTRIBUTED SOURCE ROUTING PROTOCOLS.
T. W. Lin and D. Sidhu.
[Iowa State University. Department of Computer Science. TR 87-14.
1987.]
107131 PX: A COMPUTATIONAL LOGIC.
S. Hayashi and H. Nakano.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-573. 1987.]
107132 BICHARACTERISTICAL CONVEXITY AND THE SEMI-GLOBAL EXISTENCE OF
HOLOMORPHIC SOLUTIONS OF LINEAR DIFFERENTIAL EQUATIONS WITH
HOLOMORPHIC COEFFICIENTS.
T. Kawai and Y. Takei.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-581. 1987.]
107133 PROCESS MANAGEMENT IN A DISTRIBUTED OPERATING SYSTEM.
S. J. Mullender.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8713. 1987.]
107134 ALGEBRAIC SPECIFICATIONS FOR PARAMETRIZED DATA TYPES: THE CASE OF
MINIMAL COMPUTABLE ALGEBRAS AND PARAMETERS WITH EQUALITY.
P. H. Rodenburg.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8714. 1987.]
107135 ON EFFECTIVELY LABELING PLANAR PROJECTIONS OF POLYHEDRA.
L. M. Kirousis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8715. 1987.]
107136 MERGE AND TERMINATION IN PROCESS ALGEBRA.
J. C. M. Baeten and R. J. Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8716. 1987.]
107137 THE CONCEPT OF INTELLIGENT INTEGRATED INTERACTIVE CAD SYSTEMS.
T. Tomiyama and P. J. W. Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8717. 1987.]
107138 A MODEL FOR GRAPHICAL INTERACTION.
P. J. W. ten Hagen and R. van Liere.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8718. 1987.]
107139 PARALLEL GRAPHICAL OUTPUT FROM DIALOGUE CELLS.
P. J. W. ten Hagen and H. J. Schouten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8719. 1987.]
107140 STABILITY RESULTS FOR THETA-METHODS APPLIED TO A CLASS OF STIFF
DIFFERENTIAL-ALGEBRAIC EQUATIONS.
W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8708. 1987.]
107141 IMPLEMENTATION OF ELEMENTARY FUNCTIONS IN ADA.
M. Bergman.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8709. 1987.]
107142 DESIGN AND IMPLEMENTATION OF ELEMENTARY FUNCTIONS IN ADA.
J. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8710. 1987.]
107143 SOME STABILITY RESULTS FOR THE HOPSCOTCH DIFFERENCE METHOD WHEN
APPLIED TO CONVECTION-DIFFUSION EQUATIONS.
J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8711. 1987.]
107144 NUMVEC FORTRAN LIBRARY MANUAL. CHAPTER: SIMULTANEOUS LINEAR
EQUATIONS. UPDATE #1.
W. Hoffmann.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8712. 1987.]
107145 A NORMAL FORM FOR NOT-NECESSARILY NORMALIZED RELATIONS.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRA4/87. 1987.]
107146 A THREE LEVEL SCHEMA ARCHITECTURE ER-BASED DATA BASE MANAGEMENT
SYSTEM.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRB4/87. 1987.]
107147 KNOWLEDGE REPRESENTATION USING AN AUGMENTED PLANNING NETWORK:
APPLICATION TO AN EXPERT SYSTEM FOR PLANNING HPLC SEPARATIONS.
A. L. Ananda, S. M. Foo, and H. Gunasingham.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRC4/87. 1987.]
107148 ENHANCING COMPUTER-BASED SUPPORT FOR MANAGERIAL DECISION MAKING.
C. Homsilpakul.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRD4/87. 1987.]
107149 A PACKET SWITCHING D-CHANNEL ACCESS PROTOCOL FOR ISDN SYSTEMS.
H. R. Hwa and J. Wong.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRF4/87. 1987.]
107150 AN EXPERT SYSTEM ON SITE PLANNING FOR COMPUTER EQUIPMENT.
W. W. Tsang et al.
[National University of Singapore. Department of Information Systems
and Computer Science. DISCS publication TRG4/87. 1987.]
107151 ON ONE-SIDED JACOBI METHODS FOR PARALLEL COMPUTATION.
P. J. Eberlein.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-17. 1986.]
107152 MESH COMPUTER ALGORITHMS FOR COMPUTATIONAL GEOMETRY.
R. Miller and Q. F. Stout.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-18. 1986.]
107153 SEMANTIC NETWORKS AS ABSTRACT DATA TYPES.
E. J. M. Morgado.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-19. 1986. Thesis (Ph.D.).]
107154 SEMANTICS OF RECURSIVE PROCEDURES WITH PARAMETERS AND ALIASING.
Y. H. Jang.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-21. 1986. Thesis (Ph.D.).]
107155 MODIFIED KLEENE RECURSION THEOREM CONTROL STRUCTURES.
D. S. Martin.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-22. 1986. Thesis (Ph.D.).]
107156 ON USING THE JACOBI METHOD ON THE HYPERCUBE.
P. J. Eberlein.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-23. 1986.]
107157 SYNTACTIC SEMANTICS: FOUNDATIONS OF COMPUTATIONAL NATURAL-LANGUAGE
UNDERSTANDING.
W. J. Rapaport.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 86-24. 1986.]
107158 RULE BASED INTEGRATION OF VISION AND TACTION.
P. H. Mowforth, E. Grant, and S. Rutherford.
[Turing Institute. TIRM-87-023. 1987.]
107159 INPUT DEVICES FOR TASKS USING INTERACTIVE VIDEO.
C. Thomas and S. Milan.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 87/87. 1987.]
107160 INTERAKTION IN SYSTEMEN ZUR BILDFOLGENAUSWERTUNG BASIEREND AUF EINEM
OBJEKTORIENTIERTEN ANSATZ.
V. Haarslev.
[Universitaet Hamburg. Fachbereich Informatik. FBI-HH-B-125/86. 1986.]
107161 SZENENHAFTE MODELLE FUER ZEITABHAENGIGE EREIGNISSE.
M. Mohnhaupt and B. Neumann.
[Universitaet Hamburg. Fachbereich Informatik. FBI-HH-B-127/87. 1987.]
107162 FAIRNESS BEI NEBENLAUFIGEN SYSTEMEN: EINE UNTERSUCHUNG AM MODELL DER
PETRINETZE.
H. Carstensen.
[Universitaet Hamburg. Fachbereich Informatik. FBI-HH-B-126/87. 1987.]
107163 FRAME SEMANTIC CONTROL OF THE COORDINATE STRUCTURE CONSTRAINT.
G. Lakoff.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 37.
1986.]
107164 A PROPOSAL FOR THE SYSTEMATIC DESIGN OF ARRAYS FOR MATRIX
COMPUTATIONS.
J. H. Moreno.
[University of California, Los Angeles. Computer Science Department.
CSD-870019. 1987. Thesis (M.S.).]
107165 INDX, A SEMI-AUTOMATIC INDEXING PROGRAM.
K. K. Takata.
[University of California, Los Angeles. Computer Science Department.
CSD-870020. 1987. Thesis (M.S.).]
107166 DISTRIBUTION ANALYSIS OF PRODUCT FORM QUEUEING NETWORKS.
E. de Souza e Silva.
[University of California, Los Angeles. Computer Science Department.
CSD-870023. 1987.]
107167 A NOTE ON THE COMPUTATIONAL COST OF THE LINEARIZER ALGORITHM FOR
QUEUEING NETWORKS.
E. de Souza e Silva and R. R. Muntz.
[University of California, Los Angeles. Computer Science Department.
CSD-870025. 1987.]
107168 RULE BASED CLASSIFICATION BY ELIMINATION.
D. Robertson and R. Muetzelfeldt.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 189. 1986.]
107169 MONTAGUE GRAMMAR AND FIRST-ORDER LOGIC.
H. E. Jowsey.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 190. 1986.]
107170 KEEPING CALLS CONSISTENT DESPITE DATABASE UPDATES.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 192. 1984.]
107171 USING RANDOM PERMUTATION FOR ENCRYPTION.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 191. 1984.]
107172 A TRANSPORT SYNTAX FOR PROLOG.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 193. 1984.]
107173 DRAFT PROPOSED STANDARD FOR PROLOG EVALUABLE PREDICATES.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 194. 1984. "This is a draft, published for comments."
Revision 2: September 1984.]
107174 PROLOG AND MIXED LANGUAGE PROGRAMMING.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 195. 1984.]
107175 ON STANDARDIZING PROLOG.
R. A. O'Keefe.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 196. 1984.]
107176 TOWARDS AN INTEGRATED INTELLIGENT ROBOTIC ASSEMBLY SYSTEM.
T. Smithers, C. A. Malcolm, and P. Ambler.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 197. 1987.]
107177 PARSING WITH COMBINATORY GRAMMAR.
J. D. Phillips.
[University of Edinburgh. Department of Artificial Intelligence.
Working paper 198. 1987.]
107178 GEOMETRIC RELATIONSHIPS BETWEEN TOLERANCED FEATURES.
A. Fleming.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 292. 1986.]
107179 A COMPUTATIONAL FRAMEWORK FOR LEXICAL DESCRIPTION.
G. D. Ritchie et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 293. 1986.]
107180 SOME ARCHITECTURAL IMPLICATIONS OF THE USE OF SENSORS.
C. A. Malcolm and A. P. Fothergill.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 294. 1986. "This is an updated version of DAI research
paper no. 291."]
107181 KNOWLEDGE-BASED SURFACE CLASSIFICATION USING SPECULAR SONAR ECHOES.
J. C. T. Hallam, J. B. H. Kwa, and J. A. M. Howe.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 295. 1986.]
107182 A SIMPLE, EFFICIENT PARSER FOR PHRASE-STRUCTURE GRAMMARS.
J. D. Phillips.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 296. 1986.]
107183 A CATEGORISATION OF META-LEVEL ARCHITECTURES.
F. van Harmelen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 297. 1986.]
107184 SMS: A SUGGESTIVE MODELLING SYSTEM FOR OBJECT RECOGNITION.
R. Fisher.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 298. 1986.]
107185 SEMANTICS FOR REIFIED TEMPORAL LOGIC.
H. Reichgelt.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 299. 1986.]
107186 AI BRIDGES AND DREAMS.
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 300. 1986.]
107187 METHODS AND MODELS IN INFERENCE RESEARCH.
M. R. Harris.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 301. 1986.]
107188 PROGRAMMING TOOLS FOR PROLOG ENVIRONMENTS.
P. Brna et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 302. 1986.]
107189 BUILDING EXPERT SYSTEMS USING LOGIC AND META-LEVEL INTERPRETATION.
H. Reichgelt and F. van Harmelen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 303. 1987.]
107190 EXPLANATION-BASED LEARNING OF PROOF PLANS.
R. Desimone.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 304. 1986.]
107191 WHAT KIND OF FIELD IS ARTIFICIAL INTELLIGENCE?
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 305. 1986.]
107192 A BEHAVIOURAL APPROACH TO ROBOT TASK PLANNING AND OFF-LINE
PROGRAMMING.
T. Smithers and C. A. Malcolm.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 306. 1987.]
107193 AUTOMATIC PROGRAM DEBUGGING FOR A PROLOG INTELLIGENT TUTORING SYSTEM.
C. Looi and P. Ross.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 307. 1987.]
107194 DEBUGGING PROLOG PROGRAMS IN AN INTELLIGENT TUTORING SYSTEM.
C. Looi and P. Ross.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 308. 1987.]
107195 PLAN RECOGNITION AND CHART PARSING.
P. Ross and J. Lewis.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 309. 1987.]
107196 SYNTHESIS OF SIMULATION MODELS FROM HIGH LEVEL SPECIFICATIONS.
D. Robertson et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 313. 1987.]
107197 COMPUTER-AIDED CONSTRUCTION OF ECOLOGICAL SIMULATION PROGRAMS.
R. Muetzelfeldt et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 314. 1987.]
107198 USING MATHEMATICAL KNOWLEDGE IN FORMAL SOFTWARE DEVELOPMENT.
L. A. Wallen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 310. 1986. Revised: December 1986.]
107199 GEOMETRIC REASONING FOR COMPUTER VISION.
M. J. L. Orr and R. B. Fisher.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 311. 1986.]
107200 PROVING PROPERTIES OF LOGIC PROGRAMS: SUMMARY OF PROGRESS.
A. Bundy and L. A. Wallen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 312. 1986.]
107201 AUTOMATED DEDUCTION IN S5 MODAL LOGIC: THEORY AND IMPLEMENTATION.
L. A. Wallen and G. V. Wilson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 315. 1987. November 1986 (Revised: January 1987).]
107202 A COMPUTATIONAL REPRESENTATION FOR GENERALIZED PHRASE-STRUCTURE
GRAMMARS.
J. D. Phillips.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 316. 1987.]
107203 COMPUTATIONAL THEORIES FOR RESEARCH IN VISION AND COGNITION.
J. Hallam.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 317. 1987.]
107204 KNOWLEDGE-BASED DEVELOPMENT IN ENCOMPASS.
R. B. Terwilliger.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1334. 1987.]
107205 IMPLEMENTATION OF PRECONDITIONED S-STEP CONJUGATE GRADIENT METHODS ON
A MULTIPROCESSOR SYSTEM WITH MEMORY HIERARCHY.
A. T. Chronopoulos and C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1347. 1987.]
107206 TABLE LOOK-UP ADDITION AND MULTIPLICATION IN A PSP ENVIRONMENT.
C. O'Toole.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1349. 1987. Thesis (M.S.).]
107207 AN OBJECT-ORIENTED CODE OPTIMIZER AND GENERATOR.
J. D. Wiegand.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1351. 1987. Thesis (M.S.).]
107208 FLOOR PLANNING AND GLOBAL ROUTING IN AN AUTOMATED CHIP DESIGN SYSTEM.
Y.-C. Hsu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1353. 1987. Thesis (Ph.D.).]
107209 THE QUALITATIVE STATICS OF RIGID BODIES.
P. Nielsen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1354. 1987.]
107210 A COMPUTATIONAL MODEL FOR NEURAL FEATURE EXTRACTION.
B. W. Mel.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1357. 1987.]
107211 INTEGRATED SWITCHING NETWORKS: PERFORMANCE STUDY.
C. K. Kim.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1359. 1987. Thesis (Ph.D.).]
107212 QUALITATIVE PLACE VOCABULARIES FOR MECHANISMS IN CONFIGURATION SPACE.
B. Faltings.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1360. 1987.]
107213 THE STRUCTURE-MAPPING ENGINE: ALGORITHM AND EXAMPLES.
B. Falkenhainer, K. D. Forbus, and D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1361. 1987.]
107214 THE MESH SUPERCEDED.
L. V. Kale.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1362. 1987.]
107215 ACCELERATION TECHNIQUES FOR DECOUPLING ALGORITHMS IN SEMICONDUCTOR
SIMULATION.
T. Kerkhoven and Y. Saad.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1363. 1987.]
107216 COVERING CONVEX SETS WITH NON-OVERLAPPING POLYGONS.
H. Edelsbrunner, A. D. Robison, and X. Shen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1364. 1987.]
107217 ANALOGICAL INFERENCE AND ANALOGICAL ACCESS.
D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1365. 1987.]
107218 CAMERA CALIBRATION.
I. Rigoutsos and C. M. Brown.
[University of Rochester. Department of Computer Science. TR 186.
1986.]
107219 COMPUTING INTRINSIC IMAGES.
J. Y. Aloimonos.
[University of Rochester. Department of Computer Science. TR 198.
1986. Thesis (Ph.D.).]
107220 PERFORMANCE IN PRACTICAL PROBLEM SOLVING.
L. Hartman and J. Tenenberg.
[University of Rochester. Department of Computer Science. TR 203.
1987.]
107221 PRESERVING CONSISTENCY ACROSS ABSTRACTION MAPPINGS.
J. Tenenberg.
[University of Rochester. Department of Computer Science. TR 204.
1987.]
107222 MAINTAINING LOGICAL CONSISTENCY IN ABSTRIPS: A FORMAL APPROACH.
J. Tenenberg.
[University of Rochester. Department of Computer Science. TR 205.
1987.]
107223 TEST INSTANCE CONSTRUCTION FOR NP-HARD PROBLEMS.
L. A. Sanchis.
[University of Rochester. Department of Computer Science. TR 206.
1987.]
107224 NAIVE PHYSICS AND THE CONTROL OF INFERENCE.
L. Hartman and J. Tenenberg.
[University of Rochester. Department of Computer Science. TR 207.
1987.]
107225 DESIGN OF THE CONSUL PROGRAMMING LANGUAGE.
D. Baldwin and C. A. Q. Gonzalez.
[University of Rochester. Department of Computer Science. TR 208.
1987.]
107226 STABILITY AND LOOPING IN CONNECTIONIST MODELS WITH ASYMMETRIC WEIGHTS.
S. Porat.
[University of Rochester. Department of Computer Science. TR 210.
1987.]
107227 AN INTERFACE BETWEEN OBJECT-ORIENTED SYSTEMS.
L. A. Crowl.
[University of Rochester. Department of Computer Science. TR 211.
1987.]
107228 ON RELAXATION ALGORITHMS BASED ON MARKOV RANDOM FIELDS.
P. B. Chou and R. Raman.
[University of Rochester. Department of Computer Science. TR 212.
1987.]
107229 COMPUTING WITH STRUCTURED CONNECTIONIST NETWORKS.
J. A. Feldman et al.
[University of Rochester. Department of Computer Science. TR 213.
1987.]
107230 KNOWLEDGE RETRIEVAL AS SPECIALIZED INFERENCE.
A. M. Frisch.
[University of Rochester. Department of Computer Science. TR 214.
1987. Thesis (Ph.D.). "With slight modification, this report
reproduces a dissertation submitted in partial fulfillment of the
requirements for the degree Doctor of Phiosophy in Computer Science
at the University of Rochester."]
107231 A FORMAL THEORY OF PLAN RECOGNITION.
H. A. Kautz.
[University of Rochester. Department of Computer Science. TR 215.
1987. Thesis (Ph.D.).]
107232 ORDER AND STRUCTURE IN STEREO CORRESPONDENCE.
P. R. Cooper.
[University of Rochester. Department of Computer Science. TR 216.
1987.]
107233 A COMPUTATIONAL STUDY OF RIGID MOTION PERCEPTION.
A. Bandopadhay.
[University of Rochester. Department of Computer Science. TR 221.
1986. Thesis (Ph.D.).]
107234 DESCRIBING CONSTRAINTS ON A DIGITAL CIRCUIT'S BEHAVIOR.
D. Baldwin.
[University of Rochester. Department of Computer Science. TR 222.
1987.]
107235 LESS EXPENSIVE CCD REALIZATION OF MULTIVALUED MULTI-THRESHOLD
FUNCTIONS.
M. H. Abd-El-Barr.
[University of Saskatchewan. Department of Computational Science.
Research report 87-7. 1987.]
107236 THE ISI EXPERIMENTAL MULTIMEDIA MAIL SYSTEM.
J. B. Poster et al.
[University of Southern California. Information Sciences Institute.
ISI/RR-86-173. 1986.]
107237 ROUTING AND ADDRESSING PROBLEMS IN LARGE METROPOLITAN-SCALE
INTERNETWORKS.
G. G. Finn.
[University of Southern California. Information Sciences Institute.
ISI/RR-87-180. 1987.]
107238 LEARNING BY UNDERSTANDING ANALOGIES.
R. Greiner.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-188. 1986.]
107239 FAST, HIGH QUALITY VLSI PLACEMENT ON AN MIMD MULTIPROCESSOR.
J. S. Rose.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-189. 1986. Thesis (Ph.D.).]
107240 REDUCED DISTANCE ROUTING IN SINGLE-STAGE SHUFFLE-EXCHANGE
INTERCONNECTION NETWORKS.
X.-N. Tan and K. C. Sevcik.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-190. 1986.]
107241 ON THE COEXISTENCE OF DIFFERENT CSMA PROTOCOLS ON THE SAME NETWORK.
G. V. Guardalben.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-191. 1986. Thesis (Ph.D.).]
107242 SYSTOLIC CALCULATION OF PARAMETERS FOR OPTIMAL ROUTING IN A TYPE OF
SHUFFLE-EXCHANGE NETWORK.
X.-N. Tan, K. C. Sevcik, and J.-W. Hong.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-192. 1986.]
107243 PRINCIPLES OF INFERENCE PROCESSES.
R. Greiner.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-193. 1986.]
107244 IMPLEMENTING A TAXIS COMPILER.
B. A. Nixon et al.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-194. 1987.]
107245 THE BB-SR SYSTEM.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR94. 1987.]
107246 A STANDARD FOR A GRAPH REPRESENTATION FOR FUNCTIONAL PROGRAMS.
M. S. Joy and T. Axford.
[University of Warwick. Department of Computer Science. Research
report RR95. 1987.]
107247 SPECIFICATION AND VERIFICATION OF TOTAL CORRECTNESS OF DISTRIBUTED
PROGRAMS.
M. Joseph and P. Pandya.
[University of Warwick. Department of Computer Science. Research
report RR96. 1987.]
107248 SERPENS - A PRODUCTION RULE INTERPRETER.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR97. 1987.]
107249 THE BLACKBOARD ARCHITECTURE: A DEFINITION AND ITS IMPLICATIONS.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR98. 1987.]
107250 THE BLACKBOARD ARCHITECTURE: EXAMPLE SYSTEMS.
I. D. Craig.
[University of Warwick. Department of Computer Science. Research
report RR101. 1987.]
107251 ROOMMATE STABILITY LEADS TO MARRIAGE: THE STRUCTURE OF THE STABLE
ROOMMATE PROBLEM.
D. Gusfield.
[Yale University. Department of Computer Science. YALEU/DCS/TR-435.
1985.]
107252 THE STRUCTURE OF THE STABLE ROOMMATE PROBLEM: EFFICIENT
REPRESENTATION AND ENUMERATION OF ALL STABLE ASSIGNMENTS.
D. Gusfield.
[Yale University. Department of Computer Science. YALEU/DCS/TR-482.
1986.]
107253 COMMUNICATION-EFFICIENT DISTRIBUTED DATA STRUCTURES ON HYPERCUBE
MACHINES.
Z. Mu and M. C. Chen.
[Yale University. Department of Computer Science. YALEU/DCS/TR-516.
1986.]
107254 A PRECIS OF RESEARCH ON KNOWLEDGE-BASED MANAGEMENT SYSTEMS.
G. Wiederhold and J. Milton.
[1987. "Investigators: Professor Gio C. M. Wiederhold, Professor Jack
Milton. Research participants: Robert Blum, David Beech, Prof.
Stefano Ceri, David Hartzband, Kurt Konolige, Mike Walker, Marianne
Winslette. Everything else: Caroline Barsalou." No issuing agency
indicated (investigators' addresses: Professor Gio Wiederhold,
Department of Computer Science, Stanford University, Stanford, CA
94305. Professor Jack Milton, Department of Mathematics, University
of California at Davis, Davis, CA 95616).]
VOL. 9, NO. 10 10/01/87
107255 A TUTORIAL FOR THE SAM COMMAND LANGUAGE.
R. Pike.
[AT&T Bell Laboratories. Computing science technical report 129.
1986.]
107256 SSAF - SMOOTH SPLINE APPROXIMATIONS TO FUNCTIONS.
N. L. Schryer.
[AT&T Bell Laboratories. Computing science technical report 131.
1986.]
107257 A SYSTEM FOR ALGORITHM ANIMATION: TUTORIAL AND USER MANUAL.
J. L. Bentley and B. W. Kernighan.
[AT&T Bell Laboratories. Computing science technical report 132.
1987.]
107258 AMPL: A MATHEMATICAL PROGRAMMING LANGUAGE.
R. Fourer, D. M. Gay, and B. W. Kernighan.
[AT&T Bell Laboratories. Computing science technical report 133.
1987.]
107259 MANUAL FOR THE PROTOCOL ANALYZER 'TRACE'.
G. J. Holzmann.
[AT&T Bell Laboratories. Computing science technical report 134.
1987.]
107260 TTGR - A PACKAGE FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS IN TWO
SPACE VARIABLES.
L. Kaufman and N. L. Schryer.
[AT&T Bell Laboratories. Computing science technical report 135.
1985.]
107261 OPTIMISTIC CONCURRENCY CONTROL FOR ABSTRACT DATA TYPES.
M. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-120. 1986.]
107262 SPEAKER ADAPTATION THROUGH VECTOR QUANTIZATION.
K. Shikano, K.-F. Lee, and R. Reddy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-160. 1986.]
107263 COMMUNICATION SUPPORT IN OPERATING SYSTEMS FOR DISTRIBUTED
TRANSACTIONS.
A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-165. 1986.]
107264 THE CAMELOT PROJECT.
A. Z. Spector et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-166. 1986.]
107265 VT: AN EXPERT ELEVATOR DESIGNER THAT USES KNOWLEDGE-BASED
BACKTRACKING.
S. Marcus, J. Stout, and J. McDermott.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-169. 1986.]
107266 SALT: A KNOWLEDGE ACQUISITION TOOL FOR PROPOSE-AND-REVISE SYSTEMS.
S. Marcus and J. McDermott.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-170. 1986.]
107267 SOAR: AN ARCHITECTURE FOR GENERAL INTELLIGENCE.
J. E. Laird, A. Newell, and P. S. Rosenbloom.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-171. 1986.]
107268 A DISTRIBUTED CONNECTIONIST PRODUCTION SYSTEM.
D. S. Touretzky and G. E. Hinton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-172. 1986.]
107269 A PATTERN CLASSIFICATION APPROACH TO EVALUATION FUNCTION LEARNING.
K.-F. Lee.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-173. 1986.]
107270 DURRA: A TASK-LEVEL DESCRIPTION LANGUAGE. PRELIMINARY REFERENCE
MANUAL.
M. R. Barbacci and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-176. 1986. V[ersion] 0.1 - November 15, 1986.]
107271 SPECIFYING FUNCTIONAL AND TIMING BEHAVIOR FOR REAL-TIME APPLICATIONS.
M. R. Barbacci and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-177. 1986.]
107272 NATURAL LANGUAGE DIALOGUE IN AN INTEGRATED COMPUTATIONAL MODEL.
R. E. Frederking.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-178. 1986. Thesis (Ph.D.).]
107273 ADDRESSING MODES FOR FAST AND OPTIMAL CODE GENERATION.
C. Y. Hitchcock III.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-179. 1986. Thesis (Ph.D.).]
107274 WORKSHOP ON PERFORMANCE EFFICIENT PARALLEL PROGRAMMING [SEVEN
SPRINGS, CHAMPION, PENNSYLVANIA, SEPTEMBER 8-10, 1986].
Z. Segall and L. Snyder.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-180. 1986. Edited by Zary Segall and Larry Snyder.]
107275 A LARCH SPECIFICATION OF THE LIBRARY PROBLEM.
J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-168. 1986.]
107276 POSITION PAPERS: WORKSHOP ON PERFORMANCE EFFICIENT PARALLEL
PROGRAMMING, SEVEN SPRINGS, [CHAMPION], PENNSYLVANIA, SEPTEMBER 8-10,
1986.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-181. 1986.]
107277 SYNCHRONIZATION PRIMITIVES FOR A MULTIPROCESSOR: A FORMAL
SPECIFICATION.
A. D. Birrell et al.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 20. 1987.]
107278 DISTRIBUTED CONTROL OF A ROBOT-BASED ASSEMBLY CELL.
C. N. Stevenson.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5956. 1987.]
107279 DATAPLEX: A HETEROGENEOUS DISTRIBUTED DATABASE MANAGEMENT SYSTEM.
C. W. Chung.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-5973. 1987.]
107280 ON THE UNIQUENESS OF LOCAL MINIMA FOR GENERAL ABSTRACT NON-LINEAR
LEAST SQUARE PROBLEMS.
G. Chavent.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 645. 1987.]
107281 PARALLEL MANIPULATORS. PART I: THEORY. DESIGN, KINEMATICS, DYNAMICS
AND CONTROL.
J.-P. Merlet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 646. 1987.]
107282 SYNCHRONOUS PROGRAMMING OF REACTIVE SYSTEMS: AN INTRODUCTION TO
ESTEREL.
G. Berry, P. Couronne, and G. Gonthier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 647. 1987.]
107283 ANALYTIC MODELS FOR TREE COMMUNICATION PROTOCOLS.
P. Flajolet and P. Jacquet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 648. 1987.]
107284 FROM REGULAR EXPRESSIONS TO DETERMINISTIC AUTOMATA.
G. Berry and R. Sethi.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 649. 1987.]
107285 PISCES 2 USER'S MANUAL.
T. W. Pratt.
[Institute for Computer Applications in Science and Engineering.
Interim report 2. 1987.]
107286 A BIBLIOGRAPHY ON PARALLEL AND VECTOR NUMERICAL ALGORITHMS.
J. M. Ortega and R. G. Voigt.
[Institute for Computer Applications in Science and Engineering.
Interim report 3. 1987.]
107287 THE PISCES 2 PARALLEL PROGRAMMING ENVIRONMENT.
T. W. Pratt.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-38. 1987.]
107288 AN EFFICIENT PARALLEL ALGORITHM FOR SIMULATION OF THREE-DIMENSIONAL
COMPRESSIBLE TRANSITION ON A 20 PROCESSOR FLEX/32 MULTICOMPUTER.
G. Erlebacher, S. H. Bokhari, and M. Y. Hussaini.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-41. 1987.]
107289 IMPLEMENTATION OF AN ADI METHOD ON PARALLEL COMPUTERS.
R. A. Fatoohi and C. E. Grosch.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-43. 1987.]
107290 OPTIMAL DYNAMIC REMAPPING OF PARALLEL COMPUTATIONS.
D. M. Nicol and P. F. Reynolds.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-49. 1987.]
107291 ON PARALLEL PROGRAMMING METHODOLOGY IN GHC - EXPERIENCE IN
PROGRAMMING OF A PROOF PROCEDURE OF TEMPORAL LOGIC.
K. Takahashi and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TM-0171.
1986.]
107292 A PARALLEL PARSING ALGORITHM AND ITS COMPLEXITY.
Y. Matsumoto.
[Institute for New Generation Computer Technology (ICOT). TM-0215.
1986. Extended abstract (8th August 1986).]
107293 METIS: A TERM REWRITING SYSTEM GENERATOR - AN INFERENCE ENGINE FOR
EQUATIONS AND INEQUATIONS.
A. Ohsuga and K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TM-0226.
1986.]
107294 REFUTATIONAL THEOREM PROVING FOR EQUATIONAL SYSTEMS BASED ON TERM
REWRITING.
A. Ohsuga and K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TM-0231.
1986.]
107295 A FORM OF CONJECTURAL REASONING ON EQUIVALENCE -- ASCRIPTION:
PRELIMINARY REPORT.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TM-0235.
1986.]
107296 NOTES ON TRANSFORMATION TECHNIQUES FOR GENERATE AND TEST LOGIC
PROGRAMS.
H. Seki and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TM-0240.
1986.]
107297 SHOOTX: A MULTIPLE KNOWLEDGE BASED DIAGNOSIS EXPERT SYSTEM FOR NEAX61
ESS.
Y. Koseki et al.
[Institute for New Generation Computer Technology (ICOT). TM-0244.
1986.]
107298 ASCRIPTION: AN APPROACH TO FORMALIZATION OF NON-MONOTONIC REASONING
IN THE WIDER SENSE.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TM-0248.
1987.]
107299 AN EVALUATION OF PARALLEL LAYOUT ALGORITHM.
Y. Aoyagi, K. Yoshinaga, and N. Shiraki.
[Institute for New Generation Computer Technology (ICOT). TM-0275.
1987.]
107300 LOAD BALANCING IN VERY LARGE SCALE MULTI-PROCESSOR SYSTEMS.
T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TM-0276.
1987.]
107301 A DEDUCTIVE DATABASE SYSTEM WRITTEN IN GUARDED HORN CLAUSES.
N. Miyazaki and Y. Mitomo.
[Institute for New Generation Computer Technology (ICOT). TR-214.
1986.]
107302 UNDECIDABILITY OF DETERMINACY, TWO DECIDABLE CASES OF DETERMINACY AND
THEIR APPLICATIONS TO SOURCE-TO-SOURCE TRANSFORMATION OF PROLOG
PROGRAMS.
H. Sawamura.
[Institute for New Generation Computer Technology (ICOT). TR-216.
1986.]
107303 INDUCTIVE INFERENCE OF CONTEXT-FREE LANGUAGES - CONTEXT-FREE
EXPRESSION METHOD.
T. Yokomori.
[Institute for New Generation Computer Technology (ICOT). TR-217.
1986.]
107304 A PROCEDURE RESOLVING ANAPHORIC AMBIGUITY BY FINDING THE MOST
INFORMATIVE INTERPRETATION.
T. Ukita, K. Sumita, and S. Amano.
[Institute for New Generation Computer Technology (ICOT). TR-220.
1986.]
107305 AN OBJECT-ORIENTED PROGRAMMING LANGUAGE BASED ON A PARALLEL LOGIC
PROGRAMMING LANGUAGE KL1.
M. Ohki, A. Takeuchi, and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-222.
1986.]
107306 PARTIAL EVALUATION OF KNOWLEDGE BASE AS SPECIFICATION FOR QUERIES.
C. Sakama and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-223.
1986.]
107307 AN APPROACH TO PROOF CHECKER.
K. Hirose, K. Yokota, and K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TR-224.
1987.]
107308 PROTON -EXPERT SYSTEM TOOL ON THE PSI MACHINE.
Y. Nagai, H. Kubono, and Y. Iwashita.
[Institute for New Generation Computer Technology (ICOT). TR-226.
1987.]
107309 FACT/MODEL REPRESENTATION ENVIRONMENT IN AN EXPERT SYSTEM TOOL ON PSI.
H. Kubono et al.
[Institute for New Generation Computer Technology (ICOT). TR-227.
1986.]
107310 FIFTH GENERATION COMPUTER PROJECT: CURRENT RESEARCH ACTIVITY AND
FUTURE PLANS.
K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-228.
1987.]
107311 A DESCRIPTION LANGUAGE WITH AND/OR PARALLELISM FOR CONCURRENT SYSTEMS
AND ITS STREAM-BASED REALIZATION.
A. Takeuchi, K. Takahashi, and H. Shimizu.
[Institute for New Generation Computer Technology (ICOT). TR-229.
1987.]
107312 A DISTRIBUTED IMPLEMENTATION OF FLAT GHC ON THE MULTI-PSI.
N. Ichiyoshi, T. Miyazaki, and K. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-230.
1987.]
107313 COGNITIVE MODEL FOR QUANTITATIVE INTERPRETATION OF LINE DRAWINGS.
N. Oka.
[Institute for New Generation Computer Technology (ICOT). TR-231.
1987.]
107314 AN EVALUATION OF THE FGHC VIA PRACTICAL APPLICATION PROGRAMS.
M. Kishimoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-232.
1987.]
107315 PARALLEL INFERENCE MACHINE AND KNOWLEDGE BASE MACHINE.
H. Itoh and S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TR-234.
1987.]
107316 THE PARALLEL SOFTWARE RESEARCH AND DEVELOPMENT TOOL: MULTI-PSI SYSTEM.
K. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-237.
1987.]
107317 ON SEMANTICS OF LOGIC PROGRAMS WITH UNCERTAINTIES.
Y. Sakakibara.
[Institute for New Generation Computer Technology (ICOT). TR-238.
1987.]
107318 ANADIC TUPLES IN PROLOG.
K. Mukai.
[Institute for New Generation Computer Technology (ICOT). TR-239.
1987.]
107319 PERFORMANCE EVALUATION OF A UNIFICATION ENGINE FOR A KNOWLEDGE BASE
MACHINE.
Y. Morita et al.
[Institute for New Generation Computer Technology (ICOT). TR-240.
1987.]
107320 PROVING PARTIAL CORRECTNESS OF GUARDED HORN CLAUSES PROGRAMS.
M. Murakami.
[Institute for New Generation Computer Technology (ICOT). TR-242.
1987.]
107321 CONSTRAINT ANALYSIS ON JAPANESE MODIFICATION.
R. Sugimura and H. Miyoshi.
[Institute for New Generation Computer Technology (ICOT). TR-243.
1987.]
107322 WRITING PROGRAM AS QJ PROOF AND COMPILING INTO PROLOG PROGRAM.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-244.
1987.]
107323 PROOF PARAMETERIZATION METHOD IN CONSTRUCTIVE LOGIC.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-245.
1987.]
107324 PARALLEL CACHE AND HARDWARE LOCK MECHANISM FOR PIM CLUSTER.
A. Goto et al.
[Institute for New Generation Computer Technology (ICOT). TR-247.
1987.]
107325 MULTIPLE REFERENCE MANAGEMENT IN FLAT GHC.
T. Chikayama and Y. Kimura.
[Institute for New Generation Computer Technology (ICOT). TR-248.
1987.]
107326 MAKING EXHAUSTED SEARCH PROGRAMS DETERMINISTIC, PART II.
K. Ueda.
[Institute for New Generation Computer Technology (ICOT). TR-249.
1987.]
107327 KL1 EXECUTION MODEL FOR PIM CLUSTER WITH SHARED MEMORY.
M. Sato et al.
[Institute for New Generation Computer Technology (ICOT). TR-250.
1987.]
107328 A PARSING SYSTEM BASED ON LOGIC PROGRAMMING.
Y. Matsumoto and R. Sugimura.
[Institute for New Generation Computer Technology (ICOT). TR-252.
1987.]
107329 (M)ICCG FOR 2D PROBLEMS ON VECTORCOMPUTERS.
H. A. van der Vorst.
[Kyoto University. Data Processing Center. A-17. 1986.]
107330 ICCG AND RELATED METHODS FOR 3D PROBLEMS ON VECTORCOMPUTERS.
H. A. van der Vorst.
[Kyoto University. Data Processing Center. A-18. 1987.]
099091 SCHEDULING JOB SHOPS WITH DELAYS.
-368 S. X. C. Lou, G. Van Ryzin, and S. B. Gershwin.
[1987.]
099091 THE COMPETITIVE DECLINE OF THE U.S. SEMICONDUCTOR INDUSTRY.
-366 C. H. Ferguson.
[1987.]
099091 DYNAMIC SCHEDULING AND ROUTING FOR FLEXIBLE MANUFACTURING SYSTEMS
-370 THAT HAVE UNRELIABLE MACHINES.
O. Z. Maimon and S. B. Gershwin.
[1987.]
099091 EFFICIENT PARALLEL ALGORITHMS FOR (DELTA + 1)-COLORING AND MAXIMAL
-373 INDEPENDENT SET PROBLEMS.
A. V. Goldberg and S. A. Plotkin.
[1987.]
099091 EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS.
-378 A. V. Goldberg.
[1987. Thesis (Ph.D.). "Submitted to the Department of Electrical
Engineering and Computer Science in partial fulfillment of the
requirements of the degree of Doctor of Philosophy at Massachusetts
Institute of Technology, January 1987."]
107336 ON PROVING REGISTER ATOMICITY.
B. Awerbuch et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8707. 1987.]
107337 ORGANIZATION OF DESIGN KNOWLEDGE IN AN INTELLIGENT CAD ENVIRONMENT.
T. Tomiyama and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8720. 1987.]
107338 ABSTRACTION AND EMPTY PROCESS IN PROCESS ALGEBRA.
J. C. M. Beaten and R. J. van Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8721. 1987.]
107339 ATOMIC MULTIREADER REGISTER.
L. M. Kirousis, E. Kranakis, and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8722. 1987.]
107340 AN AMOEBA REPLICATED SERVICE ORGANISATION.
I. Shizgal.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8723. 1987.]
107341 A FULLY ABSTRACT SEMANTICS FOR DATA FLOW NETS.
J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8724. 1987.]
107342 ACP SUBSCRIPT TAU: A UNIVERSAL AXIOM SYSTEM FOR PROCESS SPECIFICATION.
J. A. Bergstra and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8725. 1987.]
107343 STEPS INTO A GEOMETER'S WORKBENCH.
V. Akman.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8726. 1987.]
107344 GEOMETRY AND GRAPHICS APPLIED TO ROBOTICS.
V. Akman.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8727. 1987.]
107345 REPRESENTING KNOWLEDGE IN TWO DISTINCT DESCRIPTIONS: EXTENSIONAL VS.
INTENSIONAL.
T. Tomiyama and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8728. 1987.]
107346 VERIFICATION OF AN ALGORITHM FOR LOG-TIME SORTING BY SQUARE
COMPARISON.
J. C. Mulder and W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8729. 1987.]
107347 A LANGRANGIAN MOVING GRID SCHEME FOR ONE-DIMENSIONAL EVOLUTIONARY
PARTIAL DIFFERENTIAL EQUATIONS.
J. G. Blom, J. M. Sanz-Serna, and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8713. 1987.]
107348 STABILIZATION OF EXPLICIT DIFFERENCE SCHEMES BY SMOOTHING TECHNIQUES.
P. J. van der Houwen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8714. 1987.]
107349 DISCOVERING ALGORITHMS FROM WEAK METHODS.
A. E. Prieditis.
[Rutgers. Laboratory for Computer Science Research. Technical report
ML-TR-18. 1987.]
107350 A PROPOSAL FOR A FEASIBILITY STUDY ON THE DESIGN OF SOFTWARE
INTERFACES IN LARGE SYSTEMS.
B. A. Wichmann and P. T. Wilkinson.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 89/87. 1987.]
054341 MANAGING CHANGE IN A COMPUTER-AIDED DESIGN DATABASE.
R. H. Katz and E. Chang.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/341. 1987.]
054342 A PROTOCOL FOR SECURE COMMUNICATION IN LARGE DISTRIBUTED SYSTEMS.
D. P. Anderson et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/342. 1987. Also issued as PROGRES report 87.1, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054343 PROCESS MIGRATION IN THE SPRITE OPERATING SYSTEM.
F. Douglis.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/343. 1987.]
054344 CURARE: RESTRUCTURING LISP PROGRAMS FOR CONCURRENT EXECUTION.
J. R. Larus.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/344. 1987.]
054345 CACHING IN THE SPRITE NETWORK FILE SYSTEM.
M. Nelson, B. Welch, and J. Ousterhout.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/345. 1987.]
054346 SUBTRANSPORT LEVEL: THE RIGHT PLACE FOR END-TO-END SECURITY
MECHANISMS.
D. P. Anderson, D. Ferrari, and P. V. Rangan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/346. 1987. Also issued as PROGRES report 87.2, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054347 AUTOMATING INDEX PREPARATION.
P. Chen and M. A. Harrison.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/347. 1987.]
054348 AN ADAPTIVE SUBDIVISION METHOD WITH CRACK PREVENTION FOR RENDERING
BETA-SPLINE OBJECTS.
B. A. Barsky, T. D. DeRose, and M. D. Dippe.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/348. 1987.]
054349 INTEGRATING NONINTERACTIVE DOCUMENT PROCESSORS INTO AN INTERACTIVE
ENVIRONMENT.
P. Chen and M. A. Harrison.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/349. 1987.]
054350 THE EMPIRICAL EVALUATION OF A SECURITY-ORIENTED DATAGRAM PROTOCOL.
D. P. Anderson et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/350. 1987. Also issued as PROGRES report 87.3, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054351 SOME PROBLEMS AND PROPOSALS FOR KNOWLEDGE REPRESENTATION.
R. Wilensky.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/351. 1987.]
054352 A HIGH PERFORMANCE ARCHITECTURE FOR PROLOG.
T. Dobry.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/352. 1987. Thesis (Ph.D.).]
054353 AN EMPIRICAL INVESTIGATION OF LOAD INDICES FOR LOAD BALANCING
APPLICATIONS.
D. Ferrari and S. Zhou.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/353. 1987. Also issued as PROGRES report 87.4, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054354 NONLINEAR PARAMETER ESTIMATION OF ACOUSTIC MODELS.
E. H. Wold.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/354. 1987. Thesis (Ph.D.).]
054355 ESTIMATING PERFORMANCE OF SINGLE BUS, SHARED MEMORY MULTIPROCESSORS.
G. Gibson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/355. 1987. Thesis (M.S.).]
054356 DATA STRUCTURES AND DESTRUCTIVE ASSIGNMENT IN PROLOG.
P. C. McGeer and A. M. Despain.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/356. 1987.]
054357 DESIGN OF CPU CACHE MEMORIES.
A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/357. 1987.]
054358 EFFICIENT (STACK) ALGORITHMS FOR ANALYSIS OF WRITE-BACK AND SECTOR
MEMORIES.
J. G. Thompson and A. J. Smith.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/358. 1987.]
054359 THE SPRITE NETWORK OPERATING SYSTEM.
J. Ousterhout et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/359. 1987.]
054360 UGRAY: AN EFFICIENT RAY-TRACING RENDERER FOR UNIGRAFIX.
D. M. Marsh.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/360. 1987.]
054361 THE DESIGN OF A LOAD BALANCING MECHANISM FOR DISTRIBUTED COMPUTER
SYSTEMS.
H. I. Rubin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/361. 1987. Also issued as PROGRES report 87.5, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
107370 EXPERIMENTAL GOAL REGRESSION: A METHOD FOR LEARNING PROBLEM SOLVING
HEURISTICS.
B. W. Porter and D. Kibler.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-20. 1986.]
107371 GT: A CONJECTURE GENERATOR FOR GRAPH THEORY.
W.-K. C. Wong.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-21. 1986. Thesis (M.S.).]
107372 AN INTELLIGENT BACKTRACKING ALGORITHM FOR PARALLEL EXECUTION OF LOGIC
PROGRAMMING.
T.-J. Lin, V. Kumar, and C. Leung.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-22. 1986.]
107373 A PARALLEL EXECUTION SCHEME FOR EXPLOITING AND-PARALLELISM OF LOGIC
PROGRAMS.
Y.-J. Lin and V. Kumar.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-23. 1986.]
107374 QUALITATIVE SIMULATION AS CAUSAL EXPLANATION.
B. J. Kuipers.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-24. 1986.]
107375 FAULT DIAGNOSIS USING QUALITATIVE SIMULATION.
E. R. Bareiss and A. Farquhar.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-25. 1986.]
107376 SYMMETRIC RULES FOR TRANSLATION OF ENGLISH AND CHINESE.
W. Jim and R. F. Simmons.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-26. 1986.]
107377 AUTOMATIC PROGRAM DEBUGGING FOR INTELLIGENT TUTORING SYSTEMS.
W. R. Murray.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-27. 1986. Thesis (Ph.D.).]
107378 THE ROLE OF INVERSION, CLEFTING AND PP-FRONTING IN RELATING DISCOURSE
ELEMENTS: SOME IMPLICATIONS FOR COGNITIVE AND COMPUTATIONAL MODELS OF
NATURAL LANGUAGE PROCESSING.
M. V. LaPolla.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-28. 1986.]
107379 A THEORY OF ARGUMENT COHERENCE.
W.-K. C. Won.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-29. 1986.]
107380 METAPHORICAL SHIFT AND THE INDUCTION OF SIMILARITIES.
P. M. Alcouffe.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-30. 1986. Thesis (Ph.D.).]
107381 A RULE LANGUAGE FOR THE GLISP PROGRAMMING SYSTEM.
C. A. Rath.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-31. 1986.]
107382 TALUS: AUTOMATIC PROGRAM DEBUGGING FOR INTELLIGENT TUTORING SYSTEMS.
W. R. Murray.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-32. 1986.]
107383 NEW ALGORITHMS FOR DEPENDENCY-DIRECTED BACKTRACKING.
C. J. Petrie Jr.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-33. 1986. Thesis (M.S.).]
107384 AN EXECUTION MODEL FOR EXPLOITING AND-PARALLELISM IN LOGIC PROGRAMS.
Y.-J. Lin and V. Kumar.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-34. 1986.]
107385 PROTOS: AN EXPERIMENT IN KNOWLEDGE ACQUISITION FOR HEURISTIC
CLASSIFICATION TASKS.
B. W. Porter and E. R. Bareiss.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-35. 1986.]
107386 A FRAMEWORK FOR INTELLIGENT BACKTRACKING IN LOGIC PROGRAMS.
V. Kumar and Y.-J. Lin.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-36. 1986.]
107387 A REVIEW OF THE FIRST INTERNATIONAL MEETING ON ADVANCES IN LEARNING.
B. W. Porter.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-37. 1986. The "First International Meeting on Advances in
Learning" was held at Les Arcs, France, on the week of July 28,
1986.]
107388 INTUITIONISTIC MODELLING AND SIMULATION OF MECHANICAL DEVICES.
C. Y. Chee.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-38. 1986. Thesis (M.S.).]
107389 AN INTELLIGENT REMOTE FILE SERVER.
K. Korner.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-39. 1986. Thesis (Ph.D.).]
107390 QUESTION ANSWERING WITH RHETORICAL RELATIONS.
W. Jin and R. F. Simmons.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-40. 1986.]
107391 AN INTELLIGENT BACKTRACKING SCHEME FOR PROLOG.
V. Kumar and Y.-J. Lin.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-41. 1986.]
107392 EXTRACTING DATA BASE KNOWLEDGE FROM MEDICAL TEXT.
H.-C. Rim and R. F. Simmons.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR86-42. 1986.]
107393 A SURVEY OF SPECIALIZED PARALLEL ARCHITECTURES DESIGNED TO SUPPORT
KNOWLEDGE REPRESENTATION.
D. P. Miranker.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-43. 1987.]
107394 DEVELOPMENTS TOWARDS CONSTRAINING QUALITATIVE SIMULATION.
W. W. Lee, C. Chiu, and B. J. Kuipers.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-44. 1987.]
107395 PARALLEL HEURISTIC SEARCH ON A SHARED MEMORY MULTIPROCESSOR.
V. N. Rao, V. Kumar, and K. Remesh.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-45. 1987.]
107396 A PARALLEL IMPLEMENTATION OF ITERATIVE-DEEPENING-A*.
V. N. Rao, V. Kumar, and K. Ramesh.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-46. 1987.]
107397 INTERPRETING NARRATIVES WITH EVALUATIVE STATEMENTS.
A. Bhattacharjee.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-47. 1987. Thesis (M.S.).]
107398 A PROGRAM FOR TRANSLATING ENGLISH SENTENCES INTO LISP PROGRAMS.
A. Flatau.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-48. 1987.]
107399 A PROTOTYPE NATURAL LANGUAGE UNDERSTANDING LEGAL CONSULTANT.
L. K. Branting.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-49. 1987.]
107400 A SURVEY OF PSYCHOLOGICAL MODELS OF CONCEPT REPRESENTATION.
E. R. Bareiss and B. W. Porter.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-50. 1987.]
107401 THE UTIPS IMAGE PROCESSING SYSTEM.
V. S. S. Hwang.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-51. 1987.]
107402 TMYCIN EXPERT SYSTEM TOOL.
G. S. Novak Jr.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-52. 1987.]
107403 PROTOS: AN EXEMPLAR-BASED LEARNING APPRENTICE.
E. R. Bareiss, B. W. Porter, and C. C. Wier.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-53. 1987.]
107404 CODA: AN EXTENDED DEBUGGER FOR PROLOG.
D. Plummer.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-54. 1987.]
107405 EXPERT SYSTEMS FOR MONITORING AND CONTROL.
D. L. Dvorak.
[University of Texas, Austin. Artificial Intelligence Laboratory. AI
TR87-55. 1987.]
107406 MODELLING THE EFFECT OF SCATTERING: A NEW LIGHTING MODEL FOR COMPUTER
IMAGERY.
R. V. Klassen.
[University of Waterloo. Department of Computer Science. Research
report CS-87-14. 1987.]
107407 ASYMPTOTICALLY OPTIMAL ALGORITHMS FOR ILL-POSED PROBLEMS.
G. M. Trojan.
[University of Waterloo. Department of Computer Science. Research
report CS-87-15. 1987.]
107408 OPTIMAL RECOVERY IN THE ASYMPTOTIC SETTING.
G. M. Trojan.
[University of Waterloo. Department of Computer Science. Research
report CS-87-16. 1987.]
107409 A TIGHT UPPER BOUND FOR THE PATH LENGTH OF AVL TREES.
R. Klein and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-87-17. 1987.]
107410 DISCOVERING INEQUALITY CONDITIONS IN THE ANALYTICAL SOLUTION OF
OPTIMIZATION PROBLEMS.
P. A. Strooper, B. W. Char, and A. R. Macnaughton.
[University of Waterloo. Department of Computer Science. Research
report CS-87-18. 1987.]
107411 A PROJECTION METHOD FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM.
A. R. Conn and G. Cornuejols.
[University of Waterloo. Department of Computer Science. Research
report CS-87-19. n.d.]
107412 A LIVELOCK-FREE PROTOCOL FOR SLOTTED RINGS.
J. Pachl.
[University of Waterloo. Department of Computer Science. Research
report CS-87-20. 1987.]
107413 CONVERTING AND-CONTROL TO OR-CONTROL BY PROGRAM TRANSFORMATION.
M. H. Van Emden and P. Szeredi.
[University of Waterloo. Department of Computer Science. Research
report CS-87-21. 1987.]
107414 USER MODELING BIBLIOGRAPHY.
P. Van Arragon.
[University of Waterloo. Department of Computer Science. Research
report CS-87-22. 1987.]
107415 AVERAGE COMPLEXITY OF A DISTRIBUTED ORIENTATION ALGORITHM.
V. Syrotiuk and J. Pachl.
[University of Waterloo. Department of Computer Science. Research
report CS-87-23. 1987.]
107416 A UNIFIED THEORY OF ASYNCHRONOUS NETWORKS.
J. A. Brzozowski and C.-J. Seger.
[University of Waterloo. Department of Computer Science. Research
report CS-87-24. 1987.]
107417 A NETWORK PENALTY METHOD.
A. B. Gamble, A. R. Conn, and W. R. Pulleyblank.
[University of Waterloo. Department of Computer Science. Research
report CS-87-25. 1987.]
107418 THE CGD PROJECT: AN EDUCATIONAL DIAGNOSTIC SYSTEM BASED ON THEORIST.
M. Jones.
[University of Waterloo. Department of Computer Science. Research
report CS-87-26. 1987.]
107419 MAPLE WORKBOOK OF CALCULUS PROBLEMS.
B. Char and B. Marshman.
[University of Waterloo. Department of Computer Science. Research
report CS-87-27. 1987. Preliminary version.]
107420 SPECIFYING A SEMANTICALLY ADEQUATE STRUCTURE FOR INFORMATION SYSTEMS
AND DATABASES.
C. N. G. Dampney.
[University of Waterloo. Department of Computer Science. Research
report CS-87-28. 1987.]
107421 SYMBOLIC COMPUTATION WITH ALGEBRAIC NUMBERS AND FUNCTIONS.
T. J. Smedley.
[University of Waterloo. Department of Computer Science. Research
report CS-87-29. 1987. Thesis (Master of Mathematics in Computer
Science).]
107422 EXPERIMENTS IN THE THEORIST PARADIGM: A COLLECTION OF STUDENT PAPERS
ON THE THEORIST PROJECT.
D. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-87-30. 1987. Edited by David Poole.]
107423 TRACKING MULTIPLE INDEPENDENT TARGETS: EVIDENCE FOR BOTH SERIAL AND
PARALLEL STAGES.
Z. W. Pylyshyn and R. W. Storm.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 22. 1986.]
107424 USING RELATIVE VELOCITY AS A NATURAL CONSTRAINT FOR THE MOTION
CORRESPONDENCE PROBLEM.
M. Dawson.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 27. 1986. "This research is
part of a dissertation submitted to the University of Western
Ontario."]
107425 CONTEXTUALIZATION AND DIFFERENTIATION IN CROSS-CULTURAL COGNITION.
J. P. Denny.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 28. 1986.]
107426 LOGICAL FORMULATION OF GOVERNMENT-BINDING PRINCIPLES FOR AUTOMATIC
THEOREM PROVERS.
E. P. Stabler.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 30. 1987.]
107427 SEMANTIC/PRAGMATIC INFERENCES AND COMPUTER-ASSISTED INSTRUCTION.
A. Bailin.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 31. 1987.]
107430 LOGIC PROGRAMMING - FROM A LOGIC POINT OF VIEW.
S.-A. Taernlund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 34. 1986.]
107431 COMPILATION FOR TRICIA AND ITS ABSTRACT MACHINE.
M. Carlsson.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 35. 1986.]
107432 GARBAGE CUT.
J. Barklund and H. Millroth.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 38. 1986.]
107444 CASE-BASED REASONING: A COMPUTER MODEL OF SUBJECTIVE ASSESSMENT.
W. M. Bain.
[Yale University. Department of Computer Science. YALEU/CSD/RR-470.
1986. Thesis (Ph.D.).]
107445 A CRITIQUE OF PURE REASON.
D. V. McDermott.
[Yale University. Department of Computer Science. YALEU/CSD/RR-480.
1986.]
107446 CASE-BASED PLANNING: AN INTEGRATED THEORY OF PLANNING, LEARNING AND
MEMORY.
K. J. Hammond.
[Yale University. Department of Computer Science. YALEU/CSD/RR-488.
1986. Thesis (Ph.D.).]
107447 INTEGRATED PROCESSING IN PLANNING AND UNDERSTANDING.
L. Birnbaum.
[Yale University. Department of Computer Science. YALEU/CSD/RR-489.
1986. Thesis (Ph.D.).]
107448 REASONING ABOUT CHANGE: TIME AND CAUSATION FROM THE STANDPOINT OF
ARTIFICIAL INTELLIGENCE.
Y. Shoham.
[Yale University. Department of Computer Science. YALEU/CSD/RR-507.
1986. Thesis (Ph.D.).]
107449 TEN PROBLEMS IN ARTIFICIAL INTELLIGENCE.
R. C. Schank and C. C. Owens.
[Yale University. Department of Computer Science. YALEU/CSD/RR-514.
1987.]
107450 CREATIVITY IN EDUCATION: A STANDARD FOR COMPUTER-BASED TEACHING.
R. C. Schank and R. Farrell.
[Yale University. Department of Computer Science. YALEU/CSD/RR-518.
1987.]
107451 GENERATING NATURAL LANGUAGE UNDER PRAGMATIC CONSTRAINTS.
E. H. Hovy.
[Yale University. Department of Computer Science. YALEU/CSD/RR-521.
1987. Thesis (Ph.D.).]
107452 DARPA-SPONSORED PLANNING RESEARCH: REPORT AND PROSPECTUS.
D. V. McDermott.
[Yale University. Department of Computer Science. YALEU/CSD/RR-522.
1987.]
107453 TYPES OF EXPLANATIONS.
A. Kass and D. Leake.
[Yale University. Department of Computer Science. YALEU/CSD/RR-523.
1987.]
107457 HOW ABSTRACTION CAN REDUCE AMBIGUITY IN EXPLANATION PROBLEMS.
S. Letovsky.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 32. n.d.]
107458 GOAL AND PLAN KNOWLEDGE REPRESENTATIONS: FROM STORIES TO TEXT EDITORS
AND PROGRAMS.
J. B. Black, D. S. Kay, and E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 33. 1986.]
107459 WHAT TO DO NEXT: MEETING THE CHALLENGE OF PROGRAMMING IN THE LARGE.
E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 34. 1986.]
107460 AN ANALYSIS OF TUTORIAL REASONING ABOUT PROGRAMMING BUGS.
D. C. Littman, J. Pinto, and E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 35. n.d.]
107461 EVALUATING ITSS: THE COGNITIVE SCIENCE PERSPECTIVE.
D. C. Littman and E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 41. n.d.]
107462 MENTAL SIMULATION OF PROGRAMS: SOME DATA AND SOME THEORY.
D. C. Littman and E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 42. n.d.]
107463 IT'S 2020: DO YOU KNOW WHAT YOUR CHILDREN ARE LEARNING IN PROGRAMMING
CLASS?
E. Soloway.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 46. 1987. Extended abstract. Draft:
February 3, 1987.]
107464 ASSESSING THE MAINTAINABILITY OF XCON-IN-RIME: COPING WITH THE
PROBLEMS OF A VERY LARGE RULE-BASE.
E. Soloway, J. Bachant, and K. Jensen.
[Yale University. Department of Computer Science. Cognition and
Programming Project. Report no. 47. 1987.]
VOL. 9, NO. 11 10/20/87
107465 REGRESSION BY LOCAL FITTING: METHODS, PROPERTIES, AND COMPUTATIONAL
ALGORITHMS.
W. S. Cleveland, S. J. Devlin, and E. Grosse.
[AT&T Bell Laboratories. Numerical analysis manuscript 87-03. 1987.]
107466 COMPUTATIONAL TESTING OF LINGUISTIC MODELS IN SYNTAX AND SEMANTICS.
J. Friedman.
[Boston University. Department of Computer Science. Technical report
86-007. 1986.]
107467 FINITELY TYPED FUNCTIONAL PROGRAMS: SYNTAX, SEMANTICS, AND
IMPLEMENTATION (PART I).
A. J. Kfoury and P. Urzyczyn.
[Boston University. Department of Computer Science. Technical report
86-008. 1986.]
107468 CONCURRENT PROGRAM SCHEMES.
A. J. Kfoury and P. Urzyczyn.
[Boston University. Department of Computer Science. Technical report
86-009. 1986.]
107469 PREFERENCE-ORIENTED GRAPHICS INTERFACE.
M. Holynski, R. Garneau, and E. Lewis.
[Boston University. Department of Computer Science. Technical report
86-010. 1986.]
107470 AUTOMATIC RULE DERIVATION FOR SEMANTIC QUERY OPTIMIZATION.
M. Siegel.
[Boston University. Department of Computer Science. Technical report
86-013. 1986.]
107471 A SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.
P. Gacs and J. H. Reif.
[Boston University. Department of Computer Science. Technical report
87-001. 1987.]
107472 SELF-CORRECTING TWO-DIMENSIONAL ARRAYS.
P. Gacs.
[Boston University. Department of Computer Science. Technical report
87-002. 1987.]
107473 THE TRANSLATION OF FUNCTIONAL PROGRAMS INTO TAIL-RECURSIVE FORM (PART
I).
A. J. Kfoury.
[Boston University. Department of Computer Science. Technical report
87-003. 1987.]
107474 RECURSION-THEORETIC PROPERTIES OF MINIMAL HONEST POLYNOMIAL DEGREES.
W. I. Gasarch and S. Homer.
[Boston University. Department of Computer Science. Technical report
87-005. 1987.]
107475 ABSOLUTE RESULTS CONCERNING ONE-WAY FUNCTIONS AND THEIR APPLICATIONS.
S. Homer and J. Wang.
[Boston University. Department of Computer Science. Technical report
87-006. 1987.]
107476 AN INTRODUCTION TO FORMS AND LOGIC.
B. Doyle, M. Friedman, and B. York.
[Boston University. Department of Computer Science. Technical report
87-008. 1987.]
107477 A WHITE PAPER ON CONCURRENT PROGRAMMING.
T. W. Doeppner Jr., J. M. Bloom, and D. D. Johnson.
[Brown University. Computer Science Department. Technical report
CS-87-07 1987.]
107478 A HIGH PERFORMANCE IMPLEMENTATION OF PROLOG.
M. O. Newton.
[California Institute of Technology. Computer Science Department.
Report no. 5234:TR:86. 1986.]
107479 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 16 NOVEMBER 1986 - 31 MARCH 1987.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5240:TR:87. 1987. Principal investigator: Charles L.
Seitz. Faculty investigators: Alain J. Martin, Robert J. McEliece,
Martin Rem, Charles L. Seitz.]
107480 VLSI MESH ROUTING SYSTEMS.
C. M. Flaig.
[California Institute of Technology. Computer Science Department.
Report no. 5241:TR:87. 1987.]
107481 FINE GRAIN CONCURRENT COMPUTATIONS.
W. C. Athas.
[California Institute of Technology. Computer Science Department.
Report no. 5242:TR:87. 1987. Thesis (Ph.D).]
107482 RESOURCE-BOUNDED CATEGORY AND MEASURE IN EXPONENTIAL COMPLEXITY
CLASSES.
J. H. Lutz.
[California Institute of Technology. Computer Science Department.
Report no. 5243:TR:87. 1987. Thesis (Ph.D). "Thesis...in partial
fulfillment of the requirements for the degree of Doctor of
Philosophy, Department of Mathematics, California Institute of
Technology...May 18, 1987."]
107483 MULTICOMPUTERS.
W. C. Athas and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5244:TR:87. 1987.]
107484 A FRAMEWORK FOR ADAPTIVE ROUTING.
J. Y. Ngai and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5246:TR:87. 1987.]
107485 VLSI CONCURRENT COMPUTATIONAL FOR MUSIC SYNTHESIS.
J. Wawrzynek.
[California Institute of Technology. Computer Science Department.
Report no. 5247:TR:87. 1987. Thesis (Ph.D).]
107486 PERFORMANCE ISSUES FOR DOMAIN-ORIENTED TIME-DRIVEN DISTRIBUTED
SIMULATIONS.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-50. 1987.]
107487 PRELIMINARY SPECIFICATION FOR A MULTIPROCESSOR DEBUGGER.
J. M. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12442. 1987.]
107488 EXCEPTION HANDLING.
F. Cristian.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5724. 1987.]
107489 ON SOME MEAN VALUE RESULTS FOR THE RIEMANN ZETA-FUNCTION.
J. L. Hafner and A. Ivic'.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5737. 1987.]
107490 PIPELINE SCHEDULING: A SURVEY.
E. Lawler et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5738. 1987.]
107491 ON THE COMPLEXITY OF SOME GEOMETRIC PROBLEMS IN UNBOUNDED DIMENSION.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5744. 1987.]
107492 ON FINDING A MINIMUM DOMINATING SET IN A TOURNAMENT.
N. Megiddo and U. Vishikin.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5745. 1987.]
107493 MULTIDIMENSIONAL SIGNAL REPRESENTATION BY ZERO CROSSINGS: AN
ALGEBRAIC STUDY.
J. L. Sanz.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5747. 1987.]
107494 PARALLEL SELECTION.
N. Pippenger.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5762. 1987.]
107495 THE COMPLEXITY OF REASONING ABOUT KNOWLEDGE AND TIME, I: LOWER BOUNDS.
M. Y. Vardi and J. Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5764. 1987.]
107496 EFFICIENT MESSAGE PASSING USING SUCCINCT ROUTING TABLES.
D. Peleg and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5768. 1987.]
107497 CATEGORY NUMERICAL RELATIONAL OPERATIONS FOR STATISTICAL DATABASE
MANAGEMENT.
S. P. Ghosh.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5780. 1987.]
107498 ARE THE VERTEX COVER AND THE DOMINATING SET PROBLEMS EQUALLY HARD?
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5783. 1987.]
107499 RECURSIVE CONSTRUCTION FOR 3-REGULAR EXPANDERS.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5794. 1987.]
107500 CONCURRENCY CONTROL ISSUES IN NESTED TRANSACTIONS.
T. Haerder and K. Rothermel.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5803. 1987.]
107501 STRING PATTERN-MATCHING IN PROLOG.
A. L. Furtado and M. A. Casanova.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR045. 1987.]
041848 REVISED [3] REPORT ON THE ALGORITHMIC LANGUAGE SCHEME.
J. Rees and W. Clinger.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 848a. 1986. 3rd revised report: "The first
description of Scheme was written in 1975. A revised report appeared
in 1978...The 'Revised revised report on Scheme' was published...in
the summer of 1985. Another round of revision in the spring of
1986...resulted in the present report." Contributors: H. Abelson,
N.I. Adams IV, D.H. Bartley, G. Brooks, R.K. Dybvig, D.P. Friedman,
R. Halstead, C. Hanson, C. T. Haynes, E. Kohlbecker, D. Oxley, K.M.
Pitman, G.J. Rozas, G.J. Sussman, M. Wand. Editors: Jonathan Rees and
William Clinger.]
041862 THE SYNTHESIS OF STABLE GRASPS IN THE PLANE.
V. D. Nguyen.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 862. 1985.]
041879 CLASSIFYING OBJECTS FROM VISUAL INFORMATION.
A. Bobick and W. Richards.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 879. 1986.]
041885 SHAPE FROM SHADING, OCCLUSION, AND TEXTURE.
A. L. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 885. 1987.]
041888 MASSIVELY PARALLEL IMPLEMENTATIONS OF THEORIES FOR APPARENT MOTION.
N. M. Grzywacz and A. L. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 888. 1987. Also issued as C.B.I.P. memo 16,
Center for Biological Information Processing, Whitaker College.]
041896 A SIMPLE MOTION PLANNING ALGORITHM FOR GENERAL ROBOT MANIPULATORS.
T. Lozano-Perez.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 896. 1986.]
041902 ARIADNE: PATTERN DIRECTED INFERENCE AND HIERARCHICAL ABSTRACTION IN
PROTEIN STRUCTURE RECOGNITION.
R. H. Lathrop, T. A. Webster, and T. F. Smith.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 902. 1987.]
041903 FUNCTIONAL ABSTRACTION FROM STRUCTURE IN VLSI SIMULATION MODELS.
R. H. Lathrop, R. J. Hall, and R. S. Kirk.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 903. 1987.]
041907 TOWARD A REQUIREMENTS APPRENTICE: ON THE BOUNDARY BETWEEN INFORMAL
SPECIFICATIONS.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 907. 1986.]
041909 LEARNING A COLOR ALGORITHM FROM EXAMPLES.
A. Hurlbert and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 909. 1987. Also issued as C.B.I.P. memo 25,
Center for Biological Information Processing, Whitaker College.]
041910 ON DYNAMICAL MODELS OF ROBOT FORCE CONTROL.
S. D. Eppinger and W. P. Seering.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 910. 1986.]
041911 BOOLEAN CLASSES.
D. McAllester and R. Zabih.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 911. 1986.]
041919 THE ANALYSIS OF VISUAL MOTION: FROM COMPUTATIONAL THEORY TO NEURONAL
MECHANISMS.
E. C. Hildreth and C. Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 919. 1986. Also issued as C.B.I.P. memo 21,
Center for Biological Information Processing, Whitaker College.]
041924 ILL-POSED PROBLEMS IN EARLY VISION.
M. Bertero, T. Poggio, and V. Torre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 924. 1987.]
041928 PARALLEL ALGORITHMS FOR COMPUTER VISION ON THE CONNECTION MACHINE.
J. L. Little.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 928. 1986.]
041930 SIMPLIFYING DECISION TREES.
J. R. Quinlan.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 930. 1986.]
041931 AN APPROACH TO OBJECT ORIENTED RECOGNITION: ALIGNING PICTORIAL
DESCRIPTIONS.
S. Ullman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 931. 1986.]
041937 RECOGNIZING RIGID OBJECTS BY ALIGNING THEM WITH AN IMAGE.
D. P. Huttenlocher and S. Ullman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 937. 1987.]
041939 A DIRECT METHOD FOR LOCATING THE FOCUS OF EXPANSION.
S. Negahdaripour and B. K. P. Horn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 939. 1987.]
041940 AMBIGUITIES OF A MOTION FIELD.
S. Negahdaripour.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 940. 1987.]
041941 DIMENSIONALITY-REDUCTION USING CONNECTIONIST NETWORKS.
E. Saund.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 941. 1987.]
041950 EXTRACTING QUALITATIVE DYNAMICS FROM NUMERICAL EXPERIMENTS.
K. M. Yip.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 950. 1987.]
041955 THE DYMANICIST'S WORKBENCH: I. AUTOMATIC PREPERATION OF NUMERICAL
EXPERIMENTS.
H. Abelson and G. J. Sussman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 955. 1987.]
041957 SIMPLIFIED VORONOI DIAGRAMS.
J. Canny and B. Donald.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 957. 1987.]
041962 USING PROGRAM TRANSFORMATIONS TO IMPROVE PROGRAM TRANSLATION.
T. R. Kennedy III.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 962. 1987.]
041966 A FULLY ABSTRACT SEMANTICS FOR EVENT-BASED SIMULATION.
R. J. Hall.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 966. 1987.]
041967 A MULTIPLE REPRESENTATION APPROACH TO UNDERSTANDING THE TIME BEHAVIOR
OF DIGITAL CIRCUITS.
R. J. Hall, R. H. Lathrop, and R. S. Kirk.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 967. 1987.]
040900 CONTACT SENSORS FOR DEXTROUS ROBOT HANDS.
D. M. Siegel.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-900. 1986. Thesis (M.S.).]
040901 ARLO: ANOTHER REPRESENTATION LANGUAGE OFFER.
K. W. Haase Jr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-901. 1986.]
040904 AUTOMATED PROGRAM SYSTEM.
L. M. Wills.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-904. 1987. Thesis (M.S.).]
040905 THE SYNTHESIS OF STABLE FORCE-CLOSURE GRASPS.
V.-D. Nguyen.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-905. 1986. Thesis (M.S.).]
040908 THE COUPLED DEPTH/SLOPE APPROACH TO SURFACE RECONSTRUCTION.
J. G. Harris.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-908. 1986. Thesis (M.S.).]
040912 TRAJECTORY AND FORCE CONTROL OF A DIRECT DRIVE ARM.
C. H. An.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-912. 1986. Thesis (Ph.D.).]
040918 AFL-1: A PROGRAMMING LANGAUGE FOR MASSIVELY CONCURRENT COMPUTERS.
G. Blelloch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-918. 1986. Thesis (M.S.).]
040925 A COMPUTATIONAL MODEL FOR OBSERVATION IN QUANTUM MECHANICS.
G. J. Rozas.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-925. 1987. Thesis (M.S.). "Revised version of a
dissertation submitted to the Department of Electrical Engineering
and Computer Science in December, 1986, in partial fulfillment of the
requirements for the degree of Master of Science."]
040932 AUTOMATED ASSEMBLY USING FEATURE LOCALIZATION.
S. J. Gordon.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-932. 1986. Thesis (Ph.D.).]
040936 PLANNING AND TEACHING COMPLIANT MOTION STRATEGIES.
S. J. Buckley.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-936. 1987. Thesis (Ph.D).]
040942 ROLES OF KNOWLEDGE IN MOTOR LEARNING.
C. G. Atkeson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-942. 1987. Thesis (Ph.D.).]
040963 HIERARCHICAL OBJECT RECOGNITION USING LIBRARIES OF PARAMETERIZED
MODEL SUB-PARTS.
G. J. Ettinger.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-963. 1987. Thesis (M.S.).]
040972 PRINCIPLE-BASED PARSING.
R. C. Berwick.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-972. 1987.]
040974 TIME-FREQUENCY REPRESENTATIONS FOR SPEECH SIGNALS.
M. D. Riley.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-974. 1987. Thesis (Ph.D.).]
107502 ON ROUTING AND CONGESTION CONTROL IN COMPUTER COMMUNICATIONS NETWORKS.
D. W. Glazer and C. Tropper.
[McGill University. School of Computer Science. Technical report
SOCS-86.18. 1986.]
107503 ON THE VALIDATION OF THE SHARP-WHEELER BUBBLE MERGER MODEL FROM
EXPERIMENTAL AND COMPUTATIONAL DATA.
J. Glimm and X. L. Li.
[New York University. Courant Mathematics and Computing Laboratory.
DOE/ER/03077-283. 1987.]
107504 SAGAS.
H. Garcia-Molina and K. Salem.
[Princeton University. Department of Computer Science. CS-TR-070-87.
1987.]
107505 AN IMPROVED UPPER BOUND FOR SORTING ON NON-PARTITIONABLE SUPERIMPOSED
PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-071-87.
1987.]
107506 OPTIMAL SELECTION ON NON-PARTITIONABLE SUPERIMPOSED PARALLEL BUSES.
B. W. Arden and T. Nakatani.
[Princeton University. Department of Computer Science. CS-TR-072-87.
1987.]
107507 DISTRIBUTED COMPUTING RESEARCH AT PRINCETON - 1986.
R. Abbott et al.
[Princeton University. Department of Computer Science. CS-TR-073-87.
1987.]
107508 IOSTONE: A SYNTHETIC FILE SYSTEM PERFORMANCE BENCHMARK.
A. Park and R. J. Lipton.
[Princeton University. Department of Computer Science. CS-TR-074-87.
1987.]
107509 PERFORMANCE THROUGH MEMORY.
H. Garcia-Molina, A. Park, and L. R. Rogers.
[Princeton University. Department of Computer Science. CS-TR-075-87.
1987.]
107510 RECOVERY IN A TRIPLE MODULAR REDUNDANT DATABASE SYSTEM.
F. Pittelli and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-076-87.
1987.]
107511 AN ALGORITHM FOR SEGMENT-DRAGGING AND ITS IMPLEMENTATION.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-077-87.
1987.]
107512 SOME PROBLEMS ON DOUBLY PERIODIC INFINITE GRAPHS.
K. Iwano.
[Princeton University. Department of Computer Science. CS-TR-078-87.
1987.]
107513 RE-OPENING CLOSURES.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-079-87.
1987.]
107514 CONCISE SPECIFICATIONS OF LOCALLY OPTIMAL CODE GENERATORS.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-080-87.
1987.]
107515 SOLVING MINIMUM-COST FLOW PROBLEMS BY SUCCESSIVE APPROXIMATION.
A. V. Goldberg and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-081-87.
1987.]
107516 THE COMPLEXITY OF CUTTING COMPLEXES.
B. Chazelle, H. Edelsbrunner, and L. J. Guibas.
[Princeton University. Department of Computer Science. CS-TR-082-87.
1987.]
107517 PERFORMANCE OF VLSI ENGINES FOR LATTICE COMPUTATIONS.
S. D. Kugelmass, R. Squier, and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-083-87.
1987.]
107518 COMPUTATIONAL GEOMETRY -- THEN AND NOW.
D. P. Dobkin.
[Princeton University. Department of Computer Science. CS-TR-084-87.
1987.]
107519 THE APPLICATION OF WORKSTATION CACHING TO INFORMATION SYSTEMS.
P. Simpson and R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-085-87.
1987.]
107520 MONOTONE BIPARTITE GRAPH PROPERTIES ARE EVASIVE.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-086-87.
1987.]
107521 ALTRUISTIC LOCKING: A STRATEGY FOR COPING WITH LONG LIVED
TRANSACTIONS.
K. Salem, H. Garcia-Molina, and R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-087-87.
1987.]
107522 THE PROCESSOR IDENTITY PROBLEM.
R. J. Lipton.
[Princeton University. Department of Computer Science. CS-TR-088-87.
1987.]
107523 PRIMITIVES FOR THE MANIPULATION OF THREE-DIMENSIONAL SUBDIVISIONS.
D. P. Dobkin and M. J. Laszlo.
[Princeton University. Department of Computer Science. CS-TR-089-87.
1987.]
107524 SOME THOUGHTS ON PROBABILISTIC DATABASES.
H. Garcia-Molina and D. Porter.
[Princeton University. Department of Computer Science. CS-TR-090-87.
1987.]
107525 UPDATE PROPAGATION IN BAKUNIN DATA NETWORKS.
B. Kogan and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-091-87.
1987.]
107526 A PROCESS MIGRATION IMPLEMENTATION FOR A UNIX SYSTEM.
R. Alonso and K. Kyrimis.
[Princeton University. Department of Computer Science. CS-TR-092-87.
1987.]
107527 SIMULATING DIGITAL CIRCUITS WITH ONE BIT PER WIRE.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-093-87.
1987.]
095205 COMPUTATIONAL GEOMETRY IN A CURVED WORLD.
D. L. Souvaine.
[Princeton University. Department of Computer Science. CS-TR-094-87.
1986. Thesis (Ph.D.).]
107528 SOME TECHNIQUES FOR GEOMETRIC SEARCHING WITH IMPLICIT SET
REPRESENTATIONS.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-095-87.
1987.]
107529 COMPUTING ON A FREE TREE VIA COMPLEXITY-PRESERVING MAPPINGS.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-096-87.
1987. "A preliminary version of this work has appeared in the
'Proceedings of the 25th Annual IEEE Symposium on the Foundations of
Computer Science,' October 1984, West Palm Beach, Fl, pp.358-368."]
107530 A STANDARD ML COMPILER.
A. W. Appel and D. B. MacQueen.
[Princeton University. Department of Computer Science. CS-TR-097-87.
1987.]
107531 LOWER BOUNDS FOR SHELLSORT.
M. A. Weiss.
[Princeton University. Department of Computer Science. CS-TR-098-87.
1987. Thesis (Ph.D.).]
107532 CONCURRENCY CONTROLS FOR GLOBAL PROCEDURES IN FEDERATED DATABASE
SYSTEMS.
R. Alonso, H. Garcia-Molina, and K. Salem.
[Princeton University. Department of Computer Science. CS-TR-099-87.
1987.]
107533 SOME THOUGHTS ON DATA SHARING AMONG AUTONOMOUS COOPERATING DATABASE
SYSTEMS.
R. Alonso and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-100-87.
1987.]
107534 QUASI-COPIES: EFFICIENT DATA SHARING FOR INFORMATION RETRIEVAL
SYSTEMS.
H. Garcia-Molina and R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-101-87.
1987. "An expanded version of this paper appears as Princeton
University Computer Science Department technical report
CS-TR-065-86."]
107535 A PROTOTYPE FOR RESEARCH ON HETEROGENEOUS DATABASE SYSTEMS.
R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-102-87.
1987.]
107536 AMORTIZED ANALYSIS OF ALGORITHMS FOR SET UNION WITH BACKTRACKING.
J. Westbrook and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-103-87.
1987.]
107537 ALGORITHMS FOR TWO BOTTLENECK OPTIMIZATION PROBLEMS.
H. N. Gabow and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-104-87.
1987.]
107538 MULTIPLE TAU-EXTRAPOLATION FOR MULTIGRID METHODS.
U. Ruede.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8701. 1987.]
107539 COMPILING EXPLORATORY AND GOAL-DIRECTED DEDUCTION INTO SLOPPY
DELTA-ITERATION.
H. Schmidt et al.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8703. 1987.]
107540 NEUE ANSAETZE ZUM PROBLEM DER KOLLISIONSVERMEIDUNG.
H. Wendel.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8704. 1987.]
107541 INFINITARY PARTIAL PETRI NET LANGUAGES AND THEIR RELATIONSHIP TO
OTHER PETRI NET SEMANTICS.
A. Kiehn.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8705. 1987.]
107542 THEORETICAL CSP AND FORMAL LANGUAGES.
D. Taubner.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8706. 1987.]
107543 TOWARDS AN ALGEBRAIC SPECIFICATION OF CODE GENERATION.
R. Berghammer, H. Ehler, and H. Zierer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8707. 1987.]
107544 DYNAMIC FLAVORS.
S. Bocionek.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8708. 1987.]
107545 COMBINATION OF UNIFICATION ALGORITHMS IN EQUATIONAL THEORIES.
A. Herold.
[Universitaet Kaiserslautern. Fachbereich Informatik. D 386. 1987.
Thesis (Doktor der Naturwissenschften).]
107546 TRANFORMATION OF REFUTATION GRAPHS INTO NATURAL DEDUCTION PROOFS.
C. Lingenfelder.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-86-10. 1986.]
107547 ORDER-SORTED HORN LOGIC: SEMANTICS AND DEDUCTION.
G. Smolka.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-86-17. 1986.]
107548 THE UNDECIDABILITY OF THE D SUBSCRIPT A-UNIFICATION PROBLEM.
J. Siekmann and P. Szabo.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-86-19. 1986.]
107549 ON EQUATIONAL THEORIES, UNIFICATION AND DECIDABILITY.
H.-J. Buerckert, A. Herold, and M. Schmidt-Schauss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-86-20. 1986.]
107550 EQUALITY REASONING BASED ON GRAPHS.
K. H. Blausius.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-87-01. 1987. "This report is a modification of [the author's]
dissertation. The parts one and two are identical with the
corresponding parts of the dissertation. Part three, however, has
been modified."]
107551 UNIFICATION IN PERMUTATIVE EQUATIONAL THEORIES IS UNDECIDABLE.
M. Schmidt-Schauss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-87-03. 1987.]
107552 BOOLEAN SIMPLIFICATION OF FIRST ORDER FORMULAE.
R. Socher.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-report
SR-87-04. 1987.]
107553 A BIRD'S-EYE VIEW OF LISPLOG: THE LISP/PROLOG INTEGRATION WITH
INITIAL-CUT TOOLS.
H. Boley.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI-working
paper SWP-86-08. 1986. Edited by Harold Boley.]
107554 A COMPOSITION MODEL OF MOS CIRCUITS.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 105.
1987.]
107555 ABSTRACTION MECHANISMS FOR HARDWARE VERIFICATION.
T. F. Melham.
[University of Cambridge. Computer Laboratory. Technical report 106.
1987.]
107556 DI-DOMAINS AS A MODEL OF POLYMORPHISM.
T. Coquand, C. Gunter, and G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 107.
1987.]
107557 WORKSTATION DESIGN FOR DISTRIBUTED COMPUTING.
A. J. Wilkes.
[University of Cambridge. Computer Laboratory. Technical report 108.
1987. Thesis (Ph.D.).]
107558 HARDWARE VERIFICATION OF VLSI REGULAR STRUCTURES.
J. Joyce.
[University of Cambridge. Computer Laboratory. Technical report 109.
1987.]
107559 RELATING TWO MODELS OF HARDWARE.
G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 110.
1987.]
107560 REALISM ABOUT USER MODELLING.
K. S. Jones.
[University of Cambridge. Computer Laboratory. Technical report 111.
1987.]
107561 REDUCING THRASHING BY ADAPTIVE BACKTRACKING.
D. A. Wolfram.
[University of Cambridge. Computer Laboratory. Technical report 112.
1987.]
107562 THE REPRESENTATION OF LOGICS IN HIGHER-ORDER LOGIC.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 113.
1987.]
107563 AN ARCHITECTURE FOR INTEGRATED SERVICES ON THE LOCAL AREA NETWORK.
S. Ades.
[University of Cambridge. Computer Laboratory. Technical report 114.
1987. Thesis (Ph.D.).]
107564 FORMAL VALIDATION OF AN INTEGRATED CIRCUIT DESIGN STYLE.
I. S. Dhingra.
[University of Cambridge. Computer Laboratory. Technical report 115.
1987.]
107565 DOMAIN THEORETIC MODELS OF POLYMORPHISM.
T. Coquand, C. Gunter, and G. Winskel.
[University of Cambridge. Computer Laboratory. Technical report 116.
1987.]
095200 STANDARD ML.
R. Harper, D. MacQueen, and R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-2. 1986. "Part I
describes the final form of the Core Language and supersedes the
report 'The Standard ML Core Language,' CSR-168-84." Also issued as
CSR-209-86, Department of Computer Science, University of Edinburgh.]
095201 INTRODUCTION TO STANDARD ML.
R. Harper.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-86-14. 1986. Exercises
by Kevin Mitchell. Also issued as CSR-220-86, Department of Computer
Science, University of Edinburgh.]
107566 TPLAN: A TEMPORAL INTERVAL-BASED PLANNER WITH NOVEL EXTENSIONS.
J. C. Hogge.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1367. 1987.]
107567 THE COMPILATION OF PLANNING OPERATORS FROM QUALITATIVE PROCESS THEORY
MODELS.
J. C. Hogge.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1368. 1987. Thesis (M.S.).]
107568 PARALLEL METHODS FOR ORDINARY DIFFERENTIAL EQUATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1369. 1987.]
107569 CONCEPTUAL PURPOSE: IMPLICATIONS FOR REPRESENTATION AND LEARNING IN
MACHINES AND HUMANS.
C. J. Matheus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1370. 1987. Thesis (M.S.).]
107570 POLYNOMIAL-TIME SOLVABILITY OF CLUSTERING AND CONCEPTUAL CLUSTERING
PROBLEMS: THE AGGLOMERATIVE-HIERARCHICAL ALGORITHM.
L. Pitt and R. E. Reinke.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1371. 1987.]
107571 SEMI-SUPERVISED LEARNING.
R. A. Board and L. Pitt.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1372. 1987.]
107572 AN INFORMATION-BASED MODEL FOR CONCURRENCY CONTROL.
M. J. Jipping and R. Ford.
[University of Iowa. Department of Computer Science. Technical report
87-03. 1987.]
107573 DESIGN OF PARTIALLY REPLICATED DISTRIBUTED SYSTEMS: AN INTEGRATED
METHODOLOGY.
R. Mukkamala.
[University of Iowa. Department of Computer Science. Technical report
87-04. 1987. Thesis (Ph.D).]
107574 ON EQUIVALENT EXECUTION SEMANTICS OF CONCURRENT SYSTEMS.
R. Janicki and M. Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 234. 1987.]
107575 EARLY STOPPING ALGORITHMS FOR DISTRIBUTED AGREEMENT UNDER FAIL-STOP,
OMISSION, AND TIMING FAULT TYPES.
P. D. Ezhilchelvan.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 235. 1987.]
107576 A VIEW MECHANISM FOR AN INTEGRATED PROJECT SUPPORT ENVIRONMENT.
A. W. Brown.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 236. 1987.]
107577 SYNCHRONIZED EVENTS IN REPLICATED SYSTEMS.
M. Koutny and L. Mancini.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 237. 1987.]
107578 FAILURE DETECTION IN REPLICATED SYSTEMS.
L. Mancini and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 238. 1987.]
107579 A MODEL FOR DYNAMICALLY STRUCTURED COMMUNICATING SYSTEMS.
R. P. Hopkins and M. Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 239. 1987.]
107580 PSYCHE: A GENERAL-PURPOSE OPERATING SYSTEM FOR SHARED-MEMORY
MULTIPROCESSORS.
M. L. Scott and T. J. LeBlanc.
[University of Rochester. Department of Computer Science. TR 223.
1987.]
107581 [REQUIREMENTS FOR WORKSTATIONS TO ENHANCE INFORMATION EXCHANGE
BETWEEN HUMANS]
M. Maekawa et al.
[University of Tokyo. Department of Information Science. Technical
report 86-20. 1986. IN JAPANESE. English abstract.]
107582 RAY COHERENCE THEOREM AND CONSTANT TIME RAY TRACING ALGORITHM.
M. Ohta and M. Maekawa.
[University of Tokyo. Department of Information Science. Technical
report 86-21. 1986.]
107583 ANISOTROPIC MAGNETIC SHIELDING.
E. Goto and T. Soma.
[University of Tokyo. Department of Information Science. Technical
report 86-22. 1986.]
107584 GARBAGE COLLECTION FOR MULTIMEDIA PROCESSING.
M. Maekawa, M. Ohta, and K. Shimizu.
[University of Tokyo. Department of Information Science. Technical
report 87-01. 1987.]
107585 [CLOCKS, MUTUAL EXCLUSIONS, CONCURRENCY CONTROL AND DEADLOCK IN
DISTRIBUTED SYSTEMS]
M. Maekawa, K. Shimizu, and J. Hamano.
[University of Tokyo. Department of Information Science. Technical
report 87-02. 1987. IN JAPANESE. English abstract.]
107586 BOUNDED RAY TRACING FOR PERFECT EFFICIENT ANTI-ALIASING.
M. Ohta and M. Maekawa.
[University of Tokyo. Department of Information Science. Technical
report 87-03. 1987.]
107587 THE IMPLEMENTATION AND EXPERIENCE OF MULTIMEDIA WORKSTATION - PIE.
M. Ohta et al.
[University of Tokyo. Department of Information Science. Technical
report 87-04. 1987.]
107588 [A DISTRIBUTED HIERARCHICAL DEADLOCK DETECTION ALGORITHM]
M. Maekawa.
[University of Tokyo. Department of Information Science. Technical
report 87-05. 1987. IN JAPANESE. English abstract.]
107589 AN EVALUATION OF PERFORMANCE DIFFERENCE BETWEEN DSK AND QWERTY
KEYBOARDS.
T. Okadome, Y. Ono, and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-08. 1987.]
107590 [A STUDY OF INFORMATION PROCESSING DURING JAPANESES TOUCH TYPING,
THROUGH COGNITIVE METHODS]
T. Okadome, Y. Ono, and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-09. 1987. IN JAPANESE. English abstract.]
107591 [HORIZONTAL WRITING IN JAPANESE: ITS HISTORY, PRESENT STATE AND
EVALUATION]
H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-10. 1987. IN JAPANESE. English abstract.]
107592 [COGNITIVE ASPECTS OF JAPANESE TYPING TASK WITH A CODED INPUT METHOD]
T. Okadome, Y. Ono, and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-11. 1987. IN JAPANESE. English abstract.]
107593 VIRGO: A COMPUTER-AIDED APPAREL PATTERN-MAKING SYSTEM.
T. Noma, K. Terai, and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 87-12. 1987.]
107594 [RECONSTRUCTION AND CROSS-SECTION OF HIERARCHICALLY REPRESENTED 3D
GRAY-SCALE DIGITAL IMAGES]
X. Mao et al.
[University of Tokyo. Department of Information Science. Technical
report 87-13. 1987. IN JAPANESE. English abstract.]
107595 COMPUTER GRAPHICS FOR INTELLIGENT CITY PLANNING AND MANAGEMENT.
T. Kunii, Y. Shirota, and I. Fujishiro.
[University of Tokyo. Department of Information Science. Technical
report 87-14. 1987.]
107596 EXTENDING EXTERNAL VIEWS ON A LINK-ORIENTED DATA MODEL.
I. Fujishiro et al.
[University of Tokyo. Department of Information Science. Technical
report 87-15. 1987.]
107597 NONDETERMINISTIC CIRCUITS.
M. J. Wolf.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 698. 1987.]
107598 ON THE ADEQUACY OF PROGRAM DEPENDENCE GRAPHS FOR REPRESENTING
PROGRAMS.
S. Horwitz, J. Prins, and T. Reps.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 699. 1987.]
107599 LOAD BALANCING, LOAD SHARING AND PERFORMANCE IN DISTRIBUTED SYSTEMS.
P. Krueger and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 700. 1987.]
107600 SERIAL AND PARALLEL SOLUTION OF LARGE SCALE LINEAR PROGRAMS BY
AUGMENTED LAGRANGIAN SUCCESSIVE OVERRELAXATION.
R. De Leone and O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 701. 1987.]
107601 THE K-GRID FOURIER ANALYSIS OF MULTIGRID-TYPE ITERATIVE METHODS.
N. H. Decker.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 703. 1987.]
107602 INSTRUCTION ISSUE LOGIC FOR HIGH-PERFORMANCE, INTERRUPTIBLE, MULTIPLE
FUNCTIONAL UNIT, PIPELINED COMPUTERS.
G. S. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 704. 1987.]
107603 A PARALLEL ASYNCHRONOUS SUCCESSIVE OVERRELAXATION ALGORITHM FOR
SOLVING THE LINEAR COMPLEMENTARITY PROBLEM.
K. M. Thompson.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 705. 1987.]
107604 A TWO-STAGE SUCCESSIVE OVERRELAXATION ALGORITHM FOR SOLVING THE
LINEAR COMPLEMENTARITY PROBLEM.
K. M. Thompson.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 706. 1987.]
107605 A PARALLEL PIVOTAL ALGORITHM FOR SOLVING THE LINEAR COMPLEMENTARITY
PROBLEM.
K. M. Thompson.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 707. 1987.]
107606 THE IMPACT OF HARDWARE AND SOFTWARE ALTERNATIVES ON THE PERFORMANCE
OF THE GAMMA DATABASE MACHINE.
R. H. Gerber and D. J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 708. 1987.]
107607 NP-COMPLETENESS OF LINEARLY-CONNECTED MULTIPROCESSOR SCHEDULING.
G. Verghese and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 709. 1987.]
107608 A MINIMAL FUNCTION GRAPH SEMANTICS FOR LOGIC PROGRAMS.
W. Winsborough.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 711. 1987.]
107609 A SINGLE USER EVALUATION OF THE GAMMA DATABASE MACHINE.
D. J. DeWitt et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 712. 1987.]
107610 A STRUCTURED AND AUTOMATIC APPROACH TO THE PERFORMANCE MEASUREMENT OF
PARALLEL AND DISTRIBUTED PROGRAMS.
C.-Q. Yang.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 713. 1987. Thesis (Ph.D.).]
VOL. 9, NO. 12 10/06/87
107611 LEARNING FUNCTIONS FROM EXAMPLES.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-19.
1987.]
107612 A HIGH LIGHT LARGE SCALE CIRCUIT AND DEVICE COMPUTATION.
F. Odeh et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12731. 1987.]
107613 ALGORITHMS FOR COMPRESSING STRING-ENCODED DATA.
W.-J. Hsu and K.-T. Huang.
[International Business Machines Corporation (IBM). Research
Division. RC 12778. 1987.]
107614 WHAT'S IN A NAME? -OR- THE VALUE OF RENAMING FOR PARALLELISM
DETECTION AND STORAGE ALLOCATION.
R. Cytron and J. Ferrante.
[International Business Machines Corporation (IBM). Research
Division. RC 12785. 1987.]
107615 AN ELECTRONIC PODIUM FOR THE CLASSROOM.
J. L. Levine et al.
[International Business Machines Corporation (IBM). Research
Division. RC 12858. 1987.]
107616 OVERRELAXATION.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12863. 1987.]
107617 AN IMPROVEMENT OF THE QUINE-MCCLUSKEY LOGIC REDUCTION TECHNIQUE.
J. Peysakh.
[International Business Machines Corporation (IBM). Research
Division. RC 12898. 1987.]
107618 TOWARDS A FRAMEWORK FOR COMPARING SYSTEMS WITH VISUAL INTERFACES.
T. Selker, C. Wolf, and L. Koved.
[International Business Machines Corporation (IBM). Research
Division. RC 12902. 1987.]
107619 OPTIMAL ANNEALING SCHEDULES.
P. N. Strenski.
[International Business Machines Corporation (IBM). Research
Division. RC 12923. 1987.]
107620 GENERALIZED INVERSION OF TRANSLATION SPECIFICATIONS.
R. Farrow and D. M. Yellin.
[International Business Machines Corporation (IBM). Research
Division. RC 12925. 1987.]
107621 EFFICIENT AND CORRECT EXECUTION OF PARALLEL PROGRAMS THAT SHARE
MEMORY.
D. Shasha and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. RC 12936. 1987.]
107622 GARBAGE COLLECTION FOR PROLOG BASED ON WAM.
K. Appleby, S. Haridi, and D. Sahlin.
[International Business Machines Corporation (IBM). Research
Division. RC 12941. 1987.]
107623 THE DELFP INTERPRETER USER'S MANUAL.
T. Huynh and B. Hailpern.
[International Business Machines Corporation (IBM). Research
Division. RC 12952. 1987.]
107624 HOW TO DESIGN USABLE SYSTEMS.
J. D. Gould.
[International Business Machines Corporation (IBM). Research
Division. RC 12956. 1987.]
107625 A VISUAL PROGRAMMING APPROACH TO MANUFACTURING MODELING.
R. F. Gordon and E. A. MacNair.
[International Business Machines Corporation (IBM). Research
Division. RC 12962. 1987.]
107626 LYSP - A LISP DIALECT FOR PROGRAMMING SMALL APPLICATIONS.
P. R. Kosinski.
[International Business Machines Corporation (IBM). Research
Division. RC 12963. 1987.]
107627 VISUALIZING CONCURRENT PROCESSES.
J. M. Stone.
[International Business Machines Corporation (IBM). Research
Division. RC 12973. 1987.]
107628 MINIMAL AND COMPLETE WORD UNIFICATION.
J. Jaffar.
[International Business Machines Corporation (IBM). Research
Division. RC 12976. 1987.]
107629 MATHEMATICS AND BEAUTY X: SELF-DECORATING SURFACES.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12977. 1987.]
107630 AN INNER LOOP CRITERION FOR ANNEALING.
L. P. P. P. Ginneken and R. H. J. M. Otten.
[International Business Machines Corporation (IBM). Research
Division. RC 12980. 1987.]
107631 A GATE MATRIX BASED CELL ASSEMBLER.
M. Bartholomeus.
[International Business Machines Corporation (IBM). Research
Division. RC 12981. 1987.]
107632 AN INTRODUCTION TO THE THEORY OF SPECIFICATION AND REFINEMENT.
M. B. Josephs.
[International Business Machines Corporation (IBM). Research
Division. RC 12993. 1987.]
107633 A PERSPECTIVE ON PARALLEL PROCESSING.
T. K. Agerwala and S. L. Harvey.
[International Business Machines Corporation (IBM). Research
Division. RC 12996. 1987.]
107634 GRAND COMPUTER CONFERENCING - WHAT HAVE WE LEARNED.
J. D. Willford, B. A. Santero, and R. A. Flavin.
[International Business Machines Corporation (IBM). Research
Division. RC 13001. 1987.]
107635 APPROXIMATING TASK RESPONSE TIMES IN FORK/JOIN QUEUES.
R. Nelson and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 13012. 1987.]
107636 CONNECTIVITY PROPERTIES OF A PACKET RADIO NETWORK MODEL.
T. K. Philips, S. S. Panwar, and A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. RC 13013. 1987.]
107637 DATABASE THEORY AND CYLINDRIC LATTICES.
S. S. Cosmadakis.
[International Business Machines Corporation (IBM). Research
Division. RC 13016. 1987.]
107638 TOWARD CONNECTION AUTONOMY OF FINE GRAIN SIMD PARALLEL ARCHITECTURE.
M. Maresca and H. Li.
[International Business Machines Corporation (IBM). Research
Division. RC 13025. 1987.]
107639 CONNECTION AUTONOMY IN SIMD COMPUTERS: A VLSI IMPLEMENTATION.
M. Maresca and H. Li.
[International Business Machines Corporation (IBM). Research
Division. RC 13028. 1987.]
107640 HIERARCHICAL MEMORY WITH BLOCK TRANSFER.
A. Aggarwal, A. K. Chandra, and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. RC 13035. 1987.]
107641 HEAVY TRAFFIC RESPONSE TIMES FOR A PRIORITY QUEUE WITH LINEAR
PRIORITIES.
R. D. Nelson.
[International Business Machines Corporation (IBM). Research
Division. RC 13049. 1987.]
107642 DISTRIBUTED NAME ASSIGNMENT IN COMPUTER NETWORKS.
A. Segall and I. S. Gopal.
[International Business Machines Corporation (IBM). Research
Division. RC 13050. 1987.]
107643 PROSPECTS FOR KNOWLEDGE-BASED CUSTOMIZATION OF NATURAL LANGUAGE QUERY
SYSTEMS.
F. J. Damerau.
[International Business Machines Corporation (IBM). Research
Division. RC 13051. 1987.]
107644 AN ALGORITHM FOR A CLASS CONSTRAINED RESOURCE ALLOCATION PROBLEM.
A. N. Tantawi, D. Towsley, and J. Wolf.
[International Business Machines Corporation (IBM). Research
Division. RC 13053. 1987.]
107645 SOME NONTELESCOPING PARALLEL ALGORITHMS BASED ON SERIAL
MULTIGRID/AGGREGATION/DISAGGREGATION TECHNIQUES.
C. C. Douglas and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. RC 13060. 1987.]
107646 THE PARALLEL ASSIGNMENT PROBLEM REDEFINED.
C. May.
[International Business Machines Corporation (IBM). Research
Division. RC 13067. 1987.]
107647 MEASURE SPECIFIC DYNAMIC IMPORTANCE SAMPLING FOR AVAILABILITY
SIMULATIONS.
A. Goyal, P. Heidelberger, and P. Shahabuddin.
[International Business Machines Corporation (IBM). Research
Division. RC 13077. 1987.]
107648 A METHOD FOR STRUCTURAL SYNTHESIS.
R. Camposano.
[International Business Machines Corporation (IBM). Research
Division. RC 13081. 1987.]
107649 MODELING TOKEN RING NETWORKS - A SURVEY.
W. Bux.
[International Business Machines Corporation (IBM). Research
Division. RZ 1615. 1987.]
107650 TIMERS IN OSI PROTOCOLS - SPECIFICATION VERSUS IMPLEMENTATION.
E. Mumprecht, D. Gantenbein, and R. Hauser.
[International Business Machines Corporation (IBM). Research
Division. RZ 1620. 1987.]
107651 AN EFFICIENT DYNAMIC RELOCATION SCHEME IN LOOSELY COUPLED DISTRIBUTED
FILE SYSTEMS.
D. Lee.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-23. 1987.]
107652 VISIBILITY PROBLEMS FOR ORTHOGONAL OBJECTS IN TWO- OR THREE-DIMENSION.
J.-I. Doh and K.-Y. Chwa.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-24. 1987.]
107653 OVERVIEW OF A PARALLEL OBJECT ORIENTED LANGUAGE CLIX.
J. H. Hur and K. Chon.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-25. 1987.]
107654 AN EXECUTABLE SYSTEM MODEL BASED ON STREAM PROCESSING FOR STRUCTURED
ANALYSIS.
M. H. Kim and Y. R. Kwon.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-26. 1987.]
107655 CHAIN VISIBILITY AND LINEAR-TIME TRIANGULATION OF SOME POLYGON
CLASSES.
S.-H. Lee and K.-Y. Chwa.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-27. 1987.]
107656 A MODE DRIVEN DATAFLOW MODEL FOR AND/OR PARALLELISM OF LOGIC PROGRAMS.
T.-C. Chung.
[Korea Advanced Institute of Science and Technology (KAIST). Computer
Science Department. CS-TR-87-28. 1987.]
107657 OPTIMAL SLOPE SELECTION.
R. Cole et al.
[Rutgers. Department of Computer Science. DCS-TR-216. 1987. Revision
2: June 1987.]
107658 FIXED POINT COMPUTATION AND TRANSFORMATIONAL PROGRAMMING.
J. Cai.
[Rutgers. Department of Computer Science. DCS-TR-217. 1987. Thesis
(Ph.D.).]
107659 SEARCHING FOR OPERATIONAL CONCEPT DESCRIPTIONS IN BAR, METALEX, AND
EGB.
J. Mostow.
[Rutgers. Department of Computer Science. ML-TR-15. 1987. Also
available as Rutgers AI/Design Project working paper #57.]
107660 FAILSAFE -- A FLOOR PLANNER THAT USES EBG TO LEARN FROM ITS FAILURES.
J. Mostow and N. Bhatnagar.
[Rutgers. Department of Computer Science. ML-TR-17. 1987.]
107661 DISCOVERING ALGORITHMS FROM WEAK METHODS.
A. E. Prieditis.
[Rutgers. Department of Computer Science. ML-TR-18. 1987.]
107662 A TECHNIQUE FOR GENERALIZING NUMBER IN EXPLANATION-BASED LEARNING.
W. W. Cohen.
[Rutgers. Department of Computer Science. ML-TR-19. 1987.]
107663 HOW HARD CAN IT BE TO DRAW A PIE CHART?
D. L. Souvaine and C. J. Van Wyk.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-90. 1987.]
107664 PREDICTING SUBPROGRAM INTERACTIONS.
J. L. Bresina, S. C. Marsella, and C. F. Schmidt.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-92. 1987.]
107665 INCREMENTAL DATA FLOW ANALYSIS VIA ATTRIBUTES.
B. G. Ryder and M. D. Carroll.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-93. 1987.]
107666 A COMPUTATIONAL COMPARISON OF THE DINIC AND NETWORK SIMPLEX METHODS
FOR MAXIMAL FLOW.
D. Goldfarb and M. D. Grigoriadis.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-94. 1987.]
107667 A FAST PARAMETRIC MAXIMUM FLOW ALGORITHM.
G. Gallo, M. D. Grigoriadis, and R. E. Tarjan.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-95. 1987.]
107668 INCREMENTAL ITERATIVE DATA FLOW ANALYSIS ALGORITHMS.
M. Burke and B. G. Ryder.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-96. 1987.]
038323 A COMPARISON BETWEEN THE WAM AND DEC-10 PROLOG ARCHITECTURES.
E. Tick.
[Stanford University. Computer Systems Laboratory. CSL-TN-87-323. May
1987.]
038324 A PROLOG EMULATOR.
E. Tick.
[Stanford University. Computer Systems Laboratory. CSL-TN-87-324. May
1987.]
038325 EFFICIENT CIRCUIT SEGMENTATION FOR PSEUDO-EXHAUSTIVE TEST.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-325. April 1987. "This technical report contains reprints of the
poster session of the same name presented at the Design for
Testability Workshop in Vail, CO, April 22, 1987." Also issued as
Report no. 87-1, Center for Reliable Computing, Stanford University.]
038326 WEIGHTED COVERAGE IN FAULT-TOLERANT SYSTEMS.
H. H. Amer and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-326. May 1987. Also issued as Report no. 87-8, Center for Reliable
Computing, Stanford University.]
038327 DESIGNING CMOS COMBINATION CIRCUITS FOR SWITCH-LEVEL TESTABILITY.
D. L. Liu and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-327. June 1987. Also issued as Report no. 87-9, Center for
Reliable Computing, Stanford University.]
038328 CMOS SCAN-PATH IC FOR STUCK-OPEN FAULT TESTABILITY.
D. L. Liu and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-328. June 1987. Also issued as Report no. 87-10, Center for
Reliable Computing, Stanford University.]
038329 INADEQUACY OF CONVENTIONAL DYNAMIC RECOVERY MECHANISMS IN THE
PRESENCE OF TEMPORARY FAILURES.
H. H. Amer, M. L. Cortes, and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-329. June 1987. Also issued as Report no. 87-11, Center for
Reliable Computing, Stanford University.]
038330 PREPRINTS.
[Stanford University. Center for Reliable Computing. Technical note
87-12. June 1987. "This technical report contains preprints of the
1987 International Test Conference...held in Washington D.C.,
September 1-3, 1987." Also issued as Report no. 87-330, Computer
Systems Laboratory, Stanford University.]
038330 PROBABILITY MODELS FOR PSEUDORANDOM TEST SEQUENCES.
E. J. McCluskey et al.
[Stanford University. Center for Reliable Computing. Technical note
87-12. n.d. One of three ITC'87 preprints issued together as Center
for Reliable Computing report 87-12. Also issued as Report no.
87-330, Computer Systems Laboratory, Stanford University.]
038330 CIRCUIT SEGMENTATION FOR PSEUDO-EXHAUSTIVE TESTING VIA SIMULATED
ANNEALING.
I. Shperling and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Technical note
87-12. n.d. One of three ITC'87 preprints issued together as Center
for Reliable Computing report 87-12. Also issued as Report no.
87-330, Computer Systems Laboratory, Stanford University.]
038330 BUILT-IN SELF-TEST FOR SEQUENTIAL MACHINES.
L.-T. Wang and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Technical note
87-12. n.d. One of three ITC'87 preprints issued together as Center
for Reliable Computing report 87-12. Also issued as Report no.
87-330, Computer Systems Laboratory, Stanford University.]
038331 EXHAUSTIVE AND PSEUDO-EXHAUSTIVE TESTING.
E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-331. July 1987. "This technical report contains a tutorial to be
presented at the International Test Conference, Washington, D.C.,
Sept. 1-3, 1987." Also issued as Report no. 87-13, Center for
Reliable Computing, Stanford University.]
038332 CIRCUITS FOR BUILT-IN SELF-TEST.
L.-T. Wang.
[Stanford University. Computer Systems Laboratory. Technical note
87-332. July 1987. Thesis (Ph.D.). Thesis performed for the
Department of Electrical Engineering. Also issued as Report no.
87-14, Center for Reliable Computing, Stanford University.]
038333 TESTABLE STRUCTURES FOR CMOS VLSI CIRCUITS.
D. L. Liu.
[Stanford University. Computer Systems Laboratory. Technical note
87-333. July 1987. Thesis (Ph.D.). Thesis performed for the
Department of Electrical Engineering. Also issued as Report no.
87-15, Center for Reliable Computing, Stanford University.]
038334 COMPUTING SYSTEMS: MODELING AND RELIABILITY ISSUES.
H. H. Amer.
[Stanford University. Computer Systems Laboratory. Technical note
87-334. July 1987. Also issued as Report no. 87-16, Center for
Reliable Computing, Stanford University.]
038335 DESIGN OF THE DETECTOR II: A CMOS GATE ARRAY FOR THE STUDY OF
CONCURRENT ERROR DETECTION TECHNIQUES.
H. A. Goosen, M. L. Cortes, and E. J. McCluskey.
[Stanford University. Computer Systems Laboratory. Technical note
87-335. July 1987. Also issued as Report no. 87-17, Center for
Reliable Computing, Stanford University.]
038336 PREPRINTS.
[Stanford University. Center for Reliable Computing. Technical note
87-18. August 1987. "This technical report contains preprints of the
1987 IEEE International Conference on Computer-Aided Design, Santa
Clara, CA, November 9-12, 1987." Also issued as Report no. 87-336,
Computer Systems Laboratory, Stanford University.]
038336 EFFECT OF BYZANTINE HARDWARE FAULTS ON CONCURRENT ERROR CHECKING.
T. Nanya and H. A. Goosen.
[Stanford University. Center for Reliable Computing. Technical note
87-18. n.d. One of two ICCAD'87 preprints issued together as Center
for Reliable Computing report 87-18. Also issued as Report no.
87-336, Computer Systems Laboratory, Stanford University.]
038336 EFFICIENT CIRCUIT SEGMENTATION FOR PSEUDO-EXHAUSTIVE TEST.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Technical note
87-18. n.d. One of two ICCAD'87 preprints issued together as Center
for Reliable Computing report 87-18. Also issued as Report no.
87-336, Computer Systems Laboratory, Stanford University.]
035310 DYNAMIC RESOURCE ALLOCATION IN A HIERARCHICAL MULTIPROCESSOR SYSTEM:
A PRELIMINARY STUDY.
T.-F. Ngai.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-310.
October 1986.]
035312 CONCURRENT RUNTIME CHECKING OF ANNOTATED ADA PROGRAMS.
D. S. Rosenblum, S. Sankar, and D. C. Luckham.
[Stanford University. Computer Systems Laboratory. CSL-TR-86-312.
November 1986. Also issued as Report no. 33, Program Analysis and
Verification Group, Computer Systems Laboratory, Stanford
University.]
035318 CAPACITY ANALYSIS OF MULITHOP PACKET RADIO NETWORKS UNDER A GENERAL
CLASS OF CHANNEL ACCESS PROTOCOLS AND CAPTURE MODELS.
J. M. R. L. Brazio.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-318.
March 1987. Thesis (Ph.D.).]
035324 LISP ON A REDUCED-INSTRUCTION-SET PROCESSOR: CHARACTERIZATION AND
OPTIMIZATION.
P. Steenkiste.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-324.
March 1987. Thesis (Ph.D.).]
035325 SPECTRAL LOWER-BOUND TECHNIQUES FOR LOGIC CIRCUITS.
Y. Brandman.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-325.
March 1987.]
035326 SRT DIVISION DIAGRAMS AND THEIR USAGE IN DESIGNING CUSTOM INTEGRATED
CIRCUITS FOR DIVISION.
T. E. Williams and M. Horowitz.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-326.
November 1986.]
035327 OBJECT COMMUNICATION IN ALLEGRO.
M. A. Linton.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-327.
April 1987.]
035328 PARTITIONING AND SCHEDULING PARALLEL PROGRAMS FOR EXECUTION ON
MULTIPROCESSORS.
V. Sarkar.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-328.
April 1987. Thesis (Ph.D.).]
035329 STUDIES IN PROLOG ARCHITECTURES.
E. Tick.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-329.
June 1987. Thesis (Ph.D.).]
035330 PERFORMANCE-ORIENTED SYNTHESIS OF LARGE SCALE DOMINO CMOS CIRCUITS.
G. De Micheli.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-330. May
1987.]
035331 THROUGHPUT ANALYSIS OF IEEE 802.4 TOKEN BUS STANDARD UNDER HEAVY LOAD.
J. Pang and F. Tobagi.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-331.
March 1987.]
035332 ANALYSIS OF CACHE PERFORMANCE OF OPERATING SYSTEMS AND
MULTIPROGRAMMING.
A. Agarwal.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-332. May
1987. Thesis (Ph.D.).]
035333 MANAGING AND MEASURING TWO PARALLEL PROGRAMS ON A MULTIPROCESSOR.
J. C. Yan.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-333.
June 1987.]
035334 TASK SEQUENCING LANGUAGE FOR SPECIFYING DISTRIBUTED ADA SYSTEMS:
TSL-1.
D. C. Luckham et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-334.
July 1987. Also issued as Report no. 34, Program Analysis and
Verification Group, Computer Systems Laboratory, Stanford
University.]
025154 A PROGRAMMING AND PROBLEM-SOLVING SEMINAR.
T. G. Rokicki and D. E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-87-1154. April 1987. "This report contains edited transcripts
of the discussions held in Stanford's course, CS304, Problem Seminar,
during Winter Quarter 1987."]
025155 EXPERIMENTS IN AUTOMATIC THEOREM PROVING.
G. Bellin and J. Ketonen.
[Stanford University. Department of Computer Science.
STAN-CS-87-1155. December 1986.]
025156 THE DYNAMIC TREE EXPRESSION PROBLEM.
E. W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-87-1156. May 1987.]
025157 NETWORK IMPLEMENTATIONS OF THE DETP ALGORITHMS.
E. W. Mayr and C. G. Plaxton.
[Stanford University. Department of Computer Science.
STAN-CS-87-1157. May 1987.]
025158 A LANGUAGE/ACTION PERSPECTIVE ON THE DESIGN OF COOPERATIVE WORK.
T. A. Winograd.
[Stanford University. Department of Computer Science.
STAN-CS-87-1158. May 1987. Also issued as CSLI-87-98, Center for the
Study of Language and Information, Stanford University.]
025159 MUIR: A TOOL FOR LANGUAGE DESIGN.
T. A. Winograd.
[Stanford University. Department of Computer Science.
STAN-CS-87-1159. May 1987. Also issued as CSLI-87-81, Center for the
Study of Language and Information, Stanford University.]
025160 STRATEGIC COMPUTING RESEARCH AND THE UNIVERSITIES.
T. A. Winograd.
[Stanford University. Department of Computer Science.
STAN-CS-87-1160. March 1987.]
025161 THINKING MACHINES: CAN THERE BE? ARE WE?
T. A. Winograd.
[Stanford University. Department of Computer Science.
STAN-CS-87-1161. June 1987. Also issued as CSLI-87-100, Center for
the Study of Language and Information, Stanford University.]
025162 WEIGHTED MATCHING ALGORITHMS.
T. Spencer.
[Stanford University. Department of Computer Science.
STAN-CS-87-1162. June 1987. Thesis (Ph.D.).]
025163 EFFICIENT ALGORITHMS FOR THE SHORTEST PATH AND VISIBILITY PROBLEMS.
J. E. Hershberger.
[Stanford University. Department of Computer Science.
STAN-CS-87-1163. June 1987. Thesis (Ph.D.).]
025164 SHARING MEMORY IN DISTRIBUTED SYSTEMS -- METHODS AND APPLICATIONS.
A. R. Karlin.
[Stanford University. Department of Computer Science.
STAN-CS-87-1164. January 1987. Thesis (Ph.D.).]
025165 SOLUTION OF NONLINEAR LEAST-SQUARES PROBLEMS.
C. Fraley.
[Stanford University. Department of Computer Science.
STAN-CS-87-1165. June 1987. Thesis (Ph.D.).]
025166 PARALLEL EXECUTION OF OPS5 IN QLISP.
H. G. Okuna and A. Gupta.
[Stanford University. Department of Computer Science.
STAN-CS-87-1166. June 1987. Also issued as KSL-87-43, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025167 SCHWARZ SPLITTING AND TEMPLATE OPERATORS.
W. P. Tan.
[Stanford University. Department of Computer Science.
STAN-CS-87-1167. June 1987. Thesis (Ph.D.). Also issued as CLASSIC
Project report CLaSSiC-87-03, Center for Large Scale Scientific
Computation, Stanford University.]
048086 A METHODOLOGY FOR GENERATING COMPUTER-BASED EXPLANATIONS OF
DECISION-THEORETIC ADVICE.
C. P. Langlotz, E. H. Shortliffe, and L. M. Fagan.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-57. July 1987.]
048086 FORMULATION OF COGNITIVE DIAGNOSIS AS HEURISTIC CLASSIFICATION.
D. C. Wilkins.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-71. December 1986.]
048087 PROBABILISTIC INFERENCE USING BELIEF NETWORKS IS NP-HARD.
G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-27. August 1987. May 1987. Revised: August
1987.]
048087 A MULTIATTRIBUTE UTILITY APPROACH TO INFERENCE UNDERSTANDABILITY AND
EXPLANATION.
E. J. Horvitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-28. March 1987.]
048087 REASONING ABOUT BELIEFS AND ACTIONS UNDER COMPUTATIONAL RESOURCE
CONSTRAINTS.
E. J. Horvitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-29. March 1987.]
048087 A DYNAMIC, CUT-THROUGH COMMUNICATIONS PROTOCOL WITH MULTICAST.
G. T. Byrd, R. Nakano, and B. A. Delagi.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-44. August 1987.]
048087 A PERSPECTIVE ON CONFIDENCE AND ITS USE IN FOCUSING ATTENTION DURING
KNOWLEDGE ACQUISITION.
D. E. Heckerman and H. Jimison.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-45. July 1987.]
048087 THE ROLE OF CALCULI IN UNCERTAIN REASONING.
M. P. Wellman and D. E. Heckerman.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-46. July 1987.]
048087 COMPUTER-BASED MEDICAL DIAGNOSIS USING BELIEF NETWORKS AND BOUNDED
PROBABILITIES.
G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-48. July 1987.]
048087 RETRIEVING INFORMATION INTO HYPERTEXT SYSTEMS.
M. E. Frisse and G. Wiederhold.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-49. August 1987.]
048087 SEARCHING FOR INFORMATION IN A HYPERTEXT MEDICAL HANDBOOK: THE
WASHINGTON UNIVERSITY DYNAMIC MEDICAL HANDBOOK PROJECT.
M. E. Frisse.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-50. August 1987.]
048087 ADVICE GENERATION IN AN AXIOMATIC-BASED EXPERT SYSTEM.
C. P. Langlotz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-52. August 10, 1987.]
048087 ON THE EXPRESSIVENESS OF RULE-BASED SYSTEMS FOR REASONING WITH
UNCERTAINTY.
D. E. Heckerman and E. J. Horvitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-53. August 1987.]
048087 HOW DENDRAL WAS CONCEIVED AND BORN.
J. Lederberg.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-54. August 1987.]
048087 FIRMWARE APPROACH TO FAST LISP INTERPRETER.
H. G. Okuno, N. Osato, and I. Takeuchi.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-57. September 1987.]
107669 KIT-CORE-PROLOG DESCRIPTION. VERSION 1.0.
O. Bittkau, C. Haider, and J.-U. Kietz.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Interner Arbeitsbericht 17. 1987.]
107670 EIN EDITOR MIT INTEGRIERTEM PRAEPROZESSOR FUER DAS BERLINER
GPSG-SYSTEM.
C. Kindermann and J. Quantz.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Interner Arbeitsbericht 18. 1987.]
107671 COMPUTATIONAL COMPLEXITY OF TERMINOLOGICAL REASONING IN BACK.
B. Nebel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 43. 1987.]
107672 MODELING THE USER'S WANTS.
K. Morik.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 44. 1987.]
107673 EIN DOMINANZ-CHART-PARSER FUER GENERALISIERTE
PHRASENSTRUKTURGRAMMATIKEN.
W. Weisweber.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 45. 1987.]
107674 ISSUES OF INTEGRATION AND BALANCING IN HYBRID KNOWLEDGE
REPRESENTATION SYSTEMS.
B. Nebel and K. von Luck.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 46. 1987.]
107675 DISCOURSE MODELS, DIALOG MEMORIES, AND USER MODELS.
K. Morik.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 47. 1987.]
107676 GENDER AND COGNITIVE STYLE DIFFERENCES AT THE HUMAN-COMPUTER
INTERFACE.
C. J. H. Fowler and D. M. Murray.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 90/87. 1987.]
107677 SYSTEM ADAPTIVITY AND THE MODELLING OF STEREOTYPES.
D. Benyon, P. Innocent, and D. M. Murray.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 91/87. 1987.]
107735 FAULT-TOLERANT COMPUTATION IN COMMUNICATING SEQUENTIAL PROCESSES.
P. Jalote and S. Tripathi.
[University of Maryland. Department of Computer Science. TR-1653.
1986. Also issued as UMIACS-TR-86-10, Institute for Advanced Computer
Studies, University of Maryland.]
107736 INTERPRETATION OF IMAGE MOTION FIELDS: RIGID CURVED SURFACES IN
MOTION.
M. Subbarao.
[University of Maryland. Department of Computer Science. CS-TR-1654.
1986. Also issued as CAR-TR-199, Center for Automation Research,
University of Maryland.]
107737 CONSTRAINTS ON LENGTH AND ANGLE.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1655.
1986. Also issued as CAR-TR-200, Center for Automation Research,
University of Maryland.]
107738 HANDLING UNCERTAIN INFORMATION: A REVIEW OF NUMERIC AND NON-NUMERIC
METHODS.
R. K. Bhatnagar and L. N. Kanal.
[University of Maryland. Department of Computer Science. TR-1656.
1986.]
107739 DISCOURSE PROCESSING: A PARSIMONIOUS COVERING MODEL FOR ABDUCTIVE
INFERENCE.
V. R. Dasigi.
[University of Maryland. Department of Computer Science. TR-1657.
1986.]
107740 MOLES: A CLASS OF FOOT-OPERATED CURSOR-POSITIONING DEVICES.
G. Pearson and M. Weiser.
[University of Maryland. Department of Computer Science. CS-TR-1658.
1986. Also issued as UMIACS-TR-86-11, Institute for Advanced Computer
Studies, University of Maryland.]
107741 THE MARYLAND CRAB: A MODULE FOR BUILDING PARALLEL COMPUTERS.
D. P. O'Leary et al.
[University of Maryland. Department of Computer Science. CS-TR-1660.
1986. Also issued as UMIACS-TR-86-9, Institute for Advanced Computer
Studies, University of Maryland.]
107742 THE EFFECT OF TREE STRUCTURE ON SEARCH IN A HIERARCHICAL MENU
SELECTION SYSTEM.
K. L. Norman and J. Chin.
[University of Maryland. Department of Computer Science. CS-TR-1661.
1986. Also issued as CAR-TR-201, Center for Automation Research,
University of Maryland.]
107743 A PARALLEL IMPLEMENTATION OF THE QR ALGORITHM.
G. W. Stewart.
[University of Maryland. Department of Computer Science. TR-1662.
1986.]
107744 CAMERA ROTATION INVARIANCE OF IMAGE CHARACTERISTICS.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1663.
1986. Also issued as CAR-TR-202, Center for Automation Research,
University of Maryland.]
107745 SOME PYRAMID TECHNIQUES FOR IMAGE SELECTION.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1664.
1986. Also issued as CAR-TR-203, Center for Automation Research,
University of Maryland.]
107746 OPTIMAL IMAGE PYRAMID GENERATING KERNELS.
P. Meer, S. Baugher, and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1665.
1986. Also issued as CAR-TR-204, Center for Automation Research,
University of Maryland.]
107747 AN ANALYSIS OF CUBE-CONNECTED CYCLES AND CIRCULAR SHUFFLE NETWORKS
FOR PARALLEL COMPUTATION.
B. N. Jain and S. K. Tripathi.
[University of Maryland. Department of Computer Science. CS-TR-1666.
1986. Also issued as UMIACS-TR-86-12, Institute for Advanced Computer
Studies, University of Maryland.]
107748 COMPUTING THE EULER NUMBER OF A 3D IMAGE.
C.-N. Lee and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1667.
1986. Also issued as CAR-TR-205, Center for Automation Research,
University of Maryland.]
107749 AN ANALYSIS OF STABILIZATION TIMES IN COMPETITION-BASED SPREADING
ACTIVATION MODELS.
A. Freeman.
[University of Maryland. Department of Computer Science. TR-1668.
1986.]
107750 A HIERARCHICAL GRAPH MODEL OF CONCURRENT REAL-TIME SOFTWARE SYSTEMS.
P. D. Stotts Jr.
[University of Maryland. Department of Computer Science. TR-1669.
1986. Thesis (Ph.D.). "Originally published as Ph.D. Dissertation,
Department of Computer Science, University of Virginia...August
1985."]
107751 A NOTE ON AVERAGE DISTANCES IN DIGITAL SETS.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1670.
1986. Also issued as CAR-TR-206, Center for Automation Research,
University of Maryland.]
107752 SIMPLE CONNECTIVITY IS NOT LOCALLY COMPUTABLE FOR CONNECTED 3D IMAGES.
C.-N. Lee and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1671.
1986. Also issued as CAR-TR-207, Center for Automation Research,
University of Maryland.]
107753 APPLICATION OF ALTERNATIVE QUADTREE REPRESENTATIONS.
C. A. Shaffer.
[University of Maryland. Department of Computer Science. CS-TR-1672.
1986. Also issued as CAR-TR-208, Center for Automation Research,
University of Maryland.]
107754 VLSI DESIGN AND LOGIC IN MEMORY.
Y. Chu, K. Itano, and Z.-S. Wang.
[University of Maryland. Department of Computer Science. TR-1673.
1986.]
107755 PRELIMINARY DESIGN OF ADMS[PLUS OR MINUS]: A WORKSTATION-MAINFRAME
INTEGRATED ARCHITECTURE FOR DATABASE MANAGEMENT SYSTEMS.
N. Roussopoulos and H. Kang.
[University of Maryland. Department of Computer Science. CS-TR-1674.
1986. Also issued as UMIACS-TR-86-13, Institute for Advanced Computer
Studies, University of Maryland.]
107756 THE XTAL SYSTEM OF CRYSTALLOGRAPHIC PROGRAMS: SYSTEM MANUAL, FIRST
EDITION.
S. R. Hall et al.
[University of Maryland. Department of Computer Science. TR-1675.
1986.]
107757 PARALLEL IMPLEMENTATION OF THE BLOCK CONJUGATE GRADIENT ALGORITHM.
D. P. O'Leary.
[University of Maryland. Department of Computer Science. CS-TR-1676.
1986. Also issued as UMIACS-TR-86-14, Institute for Advanced Computer
Studies, University of Maryland.]
107758 SOME ALGORITHMS FOR APPROXIMATING CONVOLUTIONS.
D. P. O'Leary.
[University of Maryland. Department of Computer Science. CS-TR-1677.
1986. Also issued as UMIACS-TR-86-15, Institute for Advanced Computer
Studies, University of Maryland.]
107759 PETRI NET REACHABILITY TREES FOR CONCURRENT EXECUTION RULES.
P. D. Stotts and T. W. Pratt.
[University of Maryland. Department of Computer Science. TR-1679.
1986.]
107760 THE RELATIONSHIP BETWEEN PARSIMONIOUS COVERING THEORY AND
COMPETITION-BASED SPREADING ACTIVATION.
R. Lewand and J. A. Reggia.
[University of Maryland. Department of Computer Science. TR-1680.
1986.]
107761 USING 2-WAY SEMIJOINS IN DISTRIBUTED QUERY PROCESSING.
H. Kang and N. Roussopoulos.
[University of Maryland. Department of Computer Science. TR-1681.
1986.]
107762 ANALYTIC COMPLETENESS IN SL SUBSCRIPT 0.
J. Drapkin and D. Perlis.
[University of Maryland. Department of Computer Science. TR-1682.
1986.]
107763 A HIGH-LEVEL-LANGUAGE PROGRAMMING ENVIRONMENT.
Y. Chu.
[University of Maryland. Department of Computer Science. TR-1683.
1986.]
107764 A NOTE ON THE SHRINKING AND EXPANDING OPERATIONS IN PYRAMIDS.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1684.
1986. Also issued as CAR-TR-209, Center for Automation Research,
University of Maryland.]
107765 INVERSE PERSPECTIVE OF A ROAD FROM A SINGLE IMAGE.
D. DeMenthon.
[University of Maryland. Department of Computer Science. CS-TR-1685.
1986. Also issued as CAR-TR-210, Center for Automation Research,
University of Maryland.]
107766 PROBABILITY AND PLURALITY FOR AGGREGATIONS OF LEARNING MACHINES.
L. Pitt and C. H. Smith.
[University of Maryland. Department of Computer Science. CS-TR-1686.
1986. Also issued as UMIACS-TR-86-16, Institute for Advanced Computer
Studies, University of Maryland.]
107767 PORTING 4.3BSD NETWORKING TO THE SUN 2.0 KERNEL.
S. D. Miller.
[University of Maryland. Department of Computer Science. TR-1687.
1986.]
107768 THE ZMOB DISTRIBUTED DEBUGGER.
G. Pearson, H. Kadrichu, and M. Weiser.
[University of Maryland. Department of Computer Science. CS-TR-1688.
1986. Also issued as UMIACS-TR-86-17, Institute for Advanced Computer
Studies, University of Maryland.]
107769 TRACING FINITE MOTIONS WITHOUT CORRESPONDENCE.
K. Kanatani and T.-C. Chou.
[University of Maryland. Department of Computer Science. CS-TR-1689.
1986. Also issued as CAR-TR-211, Center for Automation Research,
University of Maryland.]
107770 PARALLEL COMPUTATION OF GEOMETRIC PROPERTIES FROM THE MEDICAL AXIS
TRANSFORM.
A. Y. Wu and S. K. Bhaskar.
[University of Maryland. Department of Computer Science. CS-TR-1691.
1986. Also issued as CAR-TR-213, Center for Automation Research,
University of Maryland.]
107771 GROUP THEORETICAL METHODS IN IMAGE UNDERSTANDING.
K. Kanatani.
[University of Maryland. Department of Computer Science. CS-TR-1692.
1986. "This work is based on a series of lectures the author gave at
the Center for Automated Research, University of Maryland while he
was staying there in 1985-1986." Also issued as CAR-TR-214, Center
for Automation Research, University of Maryland.]
107772 CONTRIBUTIONS TO A GENERAL THEORY OF MARKOV MESHES: I. DEFINITION,
EXISTENCE THEOREMS, CARDINALITY LEMMA, PARTITION LEMMA.
M. Rosenblatt-Roth.
[University of Maryland. Department of Computer Science. CS-TR-1693.
1986.]
107773 CONTRIBUTIONS TO A GENERAL THEORY OF MARKOV MESHES: II. HOMOGENEITY
IN MARKOV MESHES AND MARKOV FIELDS.
M. Rosenblatt-Roth.
[University of Maryland. Department of Computer Science. CS-TR-1694.
1986. Also issued as CAR-TR-216, Center for Automation Research,
University of Maryland.]
107774 CONTRIBUTIONS TO A GENERAL THEORY OF MARKOV MESHES: III. THE TEMPORAL
REPRESENTATION OF SPATIAL MARKOV MESHES.
M. Rosenblatt-Roth.
[University of Maryland. Department of Computer Science. CS-TR-1695.
1986. Also issued as CAR-TR-217, Center for Automation Research,
University of Maryland.]
107775 PERFORMANCE ANALYSIS OF UNCONDITIONALLY SYNCHRONIZING DISTRIBUTED
COMPUTER PROGRAMS USING THE GEOMETRIC CONCURRENCY MODEL.
M. Abrams.
[University of Maryland. Department of Computer Science. TR-1696.
1986. Thesis (Ph.D.).]
107776 VIRTUAL WAITING TIME ANALYSIS OF AN ERLANGIAN SINGLE SERVER QUEUEING
SYSTEM AND ITS APPLICATIONS.
C. Kim and A. K. Agrawala.
[University of Maryland. Department of Computer Science. TR-1697.
1986. Thesis (Ph.D.).]
107777 ON MONOCULAR STEREOPSIS: A NOTE.
J. Y. Aloimonos and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1698.
1987. Also issued as CAR-TR-218, Center for Automation Research,
University of Maryland.]
107778 POLYNOMIAL TERSE SETS.
A. Amir and W. I. Gasarch.
[University of Maryland. Department of Computer Science. CS-TR-1782.
1987. Also issued as UMIACS-TR-87-1, Institute for Advanced Computer
Studies, University of Maryland.]
107779 APPLICATIONS OF BINARY SEARCH TO RECURSIVE GRAPH THEORY.
R. J. Beigel and W. I. Gasarch.
[University of Maryland. Department of Computer Science. TR-1804.
n.d.]
107780 SUPPORTIVE AND PARALLEL-SUPPORTIVE SETS.
R. J. Beigel and W. I. Gasarch.
[University of Maryland. Department of Computer Science. TR-1805.
1987.]
107781 TERSE, SUPERTERSE, AND VERBOSE SETS.
R. J. Beigel et al.
[University of Maryland. Department of Computer Science. TR-1806.
1987.]
107782 BOUNDED QUERY CLASSES AND THE DIFFERENCE HIERARCHY.
R. J. Beigel, W. I. Gasarch, and L. Hay.
[University of Maryland. Department of Computer Science. TR-1847.
1987.]
107783 A HIERARCHY OF FUNCTIONS WITH APPLICATIONS TO RECURSIVE GRAPH THEORY.
W. I. Gasarch.
[University of Maryland. Department of Computer Science. TR-1651.
1986.]
107784 THE COMPLEXITY OF OPTIMIZATION FUNCTIONS.
W. I. Gasarch.
[University of Maryland. Department of Computer Science. TR-1652.
1986.]
107785 A COMPARATIVE ANALYSIS OF COMPETITION-BASED SPREADING ACTIVATION
MODELS.
S. Millheim.
[University of Maryland. Department of Computer Science. TR-1659.
1986.]
107678 QUORUM-MAJORITY VOTING: AN ALTERNATIVE METHOD FOR REAL-TIME COMPUTING
SYSTEMS.
K. G. Shin and J. W. Dolter.
[University of Michigan. Computing Research Laboratory. CRL-TR-14-86.
1986.]
107679 PERFORMABILITY EVALUATION OF DISTRIBUTED SYSTEMS USING STOCHASTIC
ACTIVITY NETWORKS.
W. H. Sanders and J. F. Meyer.
[University of Michigan. Computing Research Laboratory. CRL-TR-16-86.
1986.]
107680 REPRESENTATION SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE
STUDY USING N-QUEENS.
B. A. Nadel.
[University of Michigan. Computing Research Laboratory. CRL-TR-2-87.
1987.]
107681 INFLUENCE OF WORKLOAD ON ERROR RECOVERY IN RANDOM ACCESS MEMORIES.
J. F. Meyer and L. Wei.
[University of Michigan. Computing Research Laboratory. CRL-TR-8-87.
1987. "This work is an updated version of CRL-TR-17-86, 'Evaluation
of Transient Error Recovery in a Self-Exercising, Self Checking
Memory.'"]
107682 CHARACTERISTIC PROGRAM BEHAVIOR WITH PHASE MODELS.
J. M. Murphy.
[University of Saskatchewan. Department of Computational Science.
Research report 87-8. 1987. Thesis (M.S.).]
107683 A NEW TECHNIQUE FOR SHAPE ANALYSIS USING ORTHOGONAL POLYNOMIALS.
J. Xu and Y.-H. Yang.
[University of Saskatchewan. Department of Computational Science.
Research report 87-9. 1987.]
107684 PROTOCOL CONVERSION.
S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-05. 1987.]
107685 UNARY MINIMUM COST PATH PROBLEMS, ALTERNATING LOGSPACE, AND RUZZO,
SIMON, AND TOMPA'S DL SUPERSCRIPT NL.
R. R. Howell, L. E. Rosier, and H.-C. Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-13. 1987.]
107686 INDEXING TECHNIQUES FOR OBJECT-ORIENTED DATABASES.
W. Kim, K.-C. Kim, and A. G. Dale.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-14. 1987.]
107687 DEVELOPMENT OF AN ANALOG NEURAL NETWORK MODEL OF COMPUTATION.
J. R. Anderson.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-15. 1987. Thesis (M.S.).]
107688 VIRTUAL MEMORY ON A RECONFIGURABLE NETWORK ARCHITECTURE.
E. A. Allison.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-16. 1987.]
107689 PADS: A GRAPHICAL INTERFACE FOR SOFTWARE SYSTEMS MODELING.
D. M. Whiting.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-17. 1987. Thesis (M.S.).]
107690 DESIGN OF A HYPERKYKLOS-BASED MULTIPROCESSOR ARCHITECTURE FOR
HIGH-PERFORMANCE JOIN OPERATIONS.
B. L. Menezes et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-18. 1987.]
107691 PROBLEMS CONCERNING FAIRNESS AND TEMPORAL LOGIC FOR CONFLICT-FREE
PETRI NETS.
R. R. Howell and L. E. Rosier.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-19. 1987.]
107692 ATOMIC SEMANTICS OF NONATOMIC PROGRAMS.
J. H. Anderson and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-20. 1987.]
107693 ON THE IMPLEMENTATION OF DATA INTENSIVE LOGIC PROGRAMS.
R. Ramakrishnan.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-21. 1987. Thesis (Ph.D.).]
107694 GENERATING SOFT SHADOWS EFFICIENTLY.
G. Fossum and D. Fussell.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-22. 1987.]
107695 A MOLECULAR DATABASE SYSTEMS TECHNOLOGY.
D. S. Batory.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-23. 1987.]
107696 MODELING, ANALYSIS, AND OPTIMAL ROUTING OF FLOW-CONTROLLED
COMMUNICATION NETWORKS.
S. S. Lam and C.-T. Hsieh.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-24. 1987.]
107697 AN INTERCONNECTION NETWORK SUPPORTING RELATIONAL JOIN OPERATIONS.
B. L. Menzenes et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-25. 1987.]
107698 DISTRIBUTED COMPUTING ON MICROCOMPUTER NETWORKS.
R. Bagrodia, K. M. Chandy, and J. Misra.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-26. 1987.]
107699 BUILT-IN TESTING OF INTEGRATED CIRCUIT WAFERS.
S. Rangarajan, D. Fussell, and M. Malek.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-27. 1987.]
107700 PAM - A NONITERATIVE APPROXIMATE SOLUTION METHOD FOR CLOSED
MULTICHAIN QUEUEING NETWORKS.
C.-T. Hsieh and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-28. 1987.]
107701 ON DENOTATIONAL VERSUS PREDICATIVE SEMANTICS.
M. Broy and C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-29. 1987.]
107702 A GENERALIZED DELAUNAY TRIANGULATION AND THE SOLUTION OF CLOSEST NODE
PROBLEMS IN THE PRESENCE OF BARRIERS.
A. K. Cline and R. J. Renka.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-30. 1987.]
107703 PERFORMANCE ANALYSIS OF TWO CONCURRENCY CONTROL SCHEMES FOR DESIGN
ENVIRONMENTS.
S. Yeh et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-31. 1987.]
107704 A STUDY AND ANALYSIS OF PERFORMANCE OF DISTRIBUTED SIMULATION.
M. S. Lakshmi.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-32. 1987.]
107705 A SIMULATOR FOR MESSAGE-BASED DISTRIBUTED SYSTEMS.
W. F. Quinlivan III.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-33. 1987.]
107706 UPDATING MATERIALIZED DATABASE VIEWS.
J. A. Blakely.
[University of Waterloo. Department of Computer Science. Research
report CS-87-32. 1987.]
107707 COMPUTING QUERIES FROM DERIVED RELATIONS: THEORETICAL FOUNDATION.
P.-A. Larson and H. Z. Yang.
[University of Waterloo. Department of Computer Science. Research
report CS-87-35. 1987.]
107708 USING DISPATCHERS TO CONTROL PROCESS STRUCTURES.
D. R. Raymond.
[University of Waterloo. Department of Computer Science. Research
report CS-87-37. 1987.]
107709 A FORMATTER-INDEPENDENT STRUCTURED DOCUMENT PREPARATION SYSTEM.
G. de V. Smit.
[University of Waterloo. Department of Computer Science. Research
report CS-87-40. 1987. Thesis (Ph.D.).]
107710 FAST PARALLEL SORTING ON A MESH-CONNECTED PROCESSOR ARRAY.
K. Sado and Y. Igarashi.
[University of Waterloo. Department of Computer Science. Research
report CS-87-42. 1987.]
107711 MATHEMATICAL MODELS OF REASONING: COMPETENCE MODELS OF REASONING
ABOUT PROPOSITIONS IN ENGLISH AND THEIR RELATIONSHIP TO THE CONCEPT
OF PROBABILITY.
R. Aleliunas.
[University of Waterloo. Department of Computer Science. Research
report CS-87-31. 1987.]
107712 THE DESIGN AND IMPLEMENTATION OF AN EVIDENCE ORACLE FOR THE
UNDERSTANDING OF ARGUMENTS.
M. A. Young.
[University of Waterloo. Department of Computer Science. Research
report CS-87-33. 1987. Thesis (Master of Mathematics in Computer
Science).]
107713 INTEGRATING CONNECTIVE CLUE PROCESSING INTO THE ARGUMENT ANALYSIS
ALGORITHM IMPLEMENTATION.
T. J. Smedley.
[University of Waterloo. Department of Computer Science. Research
report CS-87-34. 1987.]
107714 URISC: THE ULTIMATE REDUCED INSTRUCTION SET COMPUTER.
F. Mavadatt and B. Parhami.
[University of Waterloo. Department of Computer Science. Research
report CS-87-36. 1987.]
107715 USING USER MODELS FOR EXPLANATION: INTRODUCING THUMS.
L. Dent, A. Sanmugasunderham, and B. Spencer.
[University of Waterloo. Department of Computer Science. Research
report CS-87-38. 1987. "Submitted as a final project, CS 685, Winter
1987."]
107716 DETERMINISTIC SYNTAX ERROR RECOVERY.
G. V. Cormack.
[University of Waterloo. Department of Computer Science. Research
report CS-87-39. 1987.]
107717 CONVERGENCE OF QUASI-NEWTON MATRICES GENERATED BY THE SYMMETRIC RANK
ONE UPDATE.
A. R. Conn, N. I. M. Gould, and Ph. L. Toint.
[University of Waterloo. Department of Computer Science. Research
report CS-87-41. 1987.]
107718 THE GRID SPATIAL STABILITY AND AN ADAPTIVE SCHEME FOR THE
DIFFUSION-CONVECTION EQUATIONS.
C. Y. Loh.
[University of Waterloo. Department of Computer Science. Research
report CS-87-43. 1987.]
107719 CONSTRAINED NONLINEAR LEAST SQUARES: AN EXACT PENALTY APPROACH WITH
PROJECTED STRUCTURED QUASI-NEWTON UPDATES.
N. Mahdavi-Amiri.
[University of Waterloo. Department of Computer Science. Research
report CS-87-44. 1987.]
107720 EPIDEMIOGRAPHY - II: GAMES WITH A DOZING YET WINNING PLAYER.
A. S. Fraenkel, M. Leobel, and J. Nesetril.
[Weizmann Institute of Science. Department of Computer Science.
CS87-01. 1987.]
107721 BIDIRECTIONAL HUFFMAN CODING.
A. S. Fraenkel and S. T. Klein.
[Weizmann Institute of Science. Department of Computer Science.
CS87-02. 1987.]
107722 AN OR-PARALLEL EXECUTION ALGORITHM FOR PROLOG AND ITS FCP
IMPLEMENTATION.
E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-03. 1987.]
107723 A PARALLEL IMPLEMENTATION OF FLAT CONCURRENT PROLOG.
S. Taylor, S. Safra, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-04. 1987.]
107724 A TYPE SYSTEM FOR LOGIC PROGRAMS.
E. Yardeni and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-05. 1987.]
107725 CHANNELS: A GENERALIZATION OF STREAMS.
E. D. Tribble et al.
[Weizmann Institute of Science. Department of Computer Science.
CS87-06. 1987.]
107726 OR-PARALLEL AND-INTERLEAVING EXECUTION OF CONCURRENT PROLOG.
R. Picca, J. Bellone, and J. Levi.
[Weizmann Institute of Science. Department of Computer Science.
CS87-07. 1987.]
107727 TRANSLATION OF SAFE GHC AND SAFE CONCURRENT PROLOG TO FCP.
J. Levy and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-08. 1987.]
107728 AN ARCHITECTURE OF A DISTRIBUTED WINDOW SYSTEM AND ITS FCP
IMPLEMENTATION.
D. Katzenellenbogen, S. Cohen, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-09. 1987.]
107729 LOGICAL SECRETS.
M. S. Miller et al.
[Weizmann Institute of Science. Department of Computer Science.
CS87-10. 1987.]
107730 ON THE ECONOMY OF SYNCHRONIZED STATECHECKS.
D. Drusinsky.
[Weizmann Institute of Science. Department of Computer Science.
CS87-11. 1987.]
107731 COMPILING CONCURRENT LOGIC PROGRAMS INTO DECISION GRAPHS.
S. Taylor and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS87-12. 1987.]
107732 FLAT PARLOG: A BASIS FOR COMPARISON.
I. Foster and S. Taylor.
[Weizmann Institute of Science. Department of Computer Science.
CS87-13. 1987.]
107733 A DOMINATING PROPERTY FOR HAMILTONICITY.
A. S. Fraenkel.
[Weizmann Institute of Science. Department of Computer Science.
CS87-14. 1987.]
107734 POLYNOMIAL ITERATION FOR NONSYMMETRIC INDEFINITE LINEAR SYSTEMS.
H. C. Elman and R. L. Streit.
[Yale University. Department of Computer Science. Research report
YALEU/DCS/RR-380. 1987.]
VOL. 9, NO. 13 12/04/87
107814 EVOLVING THE UNIX SYSTEM INTERFACE TO SUPPORT MULTITHREAD PROGRAMS.
P. R. McJones and G. F. Swart.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 21. 1987.]
107815 BUILDING USER INTERFACES BY DIRECT MANIPULATION.
L. Cardelli.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 22. 1986.]
107816 POLY - A FIRST STEP TO COMPUTER GRAPHICS AND COMPUTATIONAL GEOMETRY.
A. Meier.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 81. 1987.]
107817 FROM MODULA TO OBERON AND THE PROGRAMMING LANGUAGE OBERON.
N. Wirth.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 82. 1987. This report consists of two papers
by Niklaus Wirth, "From Modula to Oberon" and "The Programming
Language Oberon."]
107818 GRID GENERATION FOR THE SOLUTION OF PARTIAL DIFFEENTIAL EQUATIONS.
P. R. Eiseman and G. Erlebacher.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-57. 1987.]
107819 ON IMPLICIT RUNGE-KUTTA METHODS FOR PARALLEL COMPUTATIONS.
S. L. Keeling.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-58. 1987.]
107820 PERFORMANCE OF FORTRAN FLOATING-POINT OPERATIONS ON THE FLEX/32
MULTICOMPUTER.
T. W. Crockett.
[Institute for Computer Applications in Science and Engineering
(ICASE). Interim report 4. 1987.]
041897 PROBABILISTIC SOLUTIONS OF ILL-POSED PROBLEMS IN COMPUTATIONAL VISION.
J. Marroquin, S. Mitter, and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 897. 1987.]
041914 COMPUTATIONS IN THE VERTEBRATE RETINA: GAIN ENHANCEMENT,
DIFFERENTIATION AND MOTION DISCRIMINATION.
C. Koch, T. Poggio, and V. Torre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 914. 1986. Also issued as C.B.I.P. paper 019,
Center for Biological Information Processing, Whitaker College.]
041915 VISUAL ATTENTION IN BRAINS AND COMPUTERS.
A. Hurlbert and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 915. 1986. Also issued as C.B.I.P. paper 017,
Center for Biological Information Processing, Whitaker College.]
041916 REGULARIZATION THEORY AND SHAPE CONSTRAINTS.
A. Verri and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 916. 1986.]
041917 MOTION FIELD AND OPTICAL FLOW: QUALITATIVE PROPERTIES.
A. Verri and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 917. 1986. Also issued as C.B.I.P. paper 022,
Center for Biological Information Processing, Whitaker College.]
041933 THE PROGRAMMER'S APPRENTICE: A PROGRAM SYNTHESIS SCENARIO.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 933. 1986.]
041949 PROGRAM TRANSLATION VIA ABSTRACTION AND REIMPLEMENTATION.
R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 949. 1986.]
041954 FORMALIZING REUSABLE SOFTWARE COMPONENTS IN THE PROGRAMMER'S
APPRENTICE.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 954. 1987.]
107821 CELLULAR AUTOMATA SUPERCOMPUTERS FOR FLUID DYNAMICS MODELING.
N. Margolas, T. Toffoli, and G. Vichniac.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-296. 1985.]
107822 A RANDOMIZED DATA STRUCTURE FOR ORDERED SETS.
J. L. Bentley et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-297. 1986.]
107823 TIGHT BOUNDS FOR MINIMAX GRID MATCHING, WITH APPLICATIONS TO THE
AVERAGE CASE ANALYSIS OF ALGORITHMS.
F. T. Leighton and P. Shor.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-298. 1986.]
107824 THE APPLICATION OF DIGITAL BROADCAST COMMUNICATION TO LARGE SCALE
INFORMATION SYSTEMS.
D. K. Gifford, J. M. Lucussen, and S. T. Berlin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-299. 1986.]
107825 KNOWLEDGE AND COMMON KNOWLEDGE IN A BYZANTINE ENVIRONMENT: CRASH
FAILURES.
C. Dwork and Y. Moses.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-300. 1986.]
107826 INTERVAL AND RECENCY-RANK SOURCE CODING: TWO ON-LINE ADAPTIVE
VARIABLE-LENGTH SCHEMES.
P. Elias.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-301. 1986.]
107827 A SURVEY OF ALGORITHMS FOR INTEGRATING WAFER-SCALE SYSTOLIC ARRAYS.
F. T. Leighton and C. E. Leiserson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-302. 1986.]
107828 THE POWER OF THE QUEUE.
M. Li, L. Longpre, and P. M. B. Vitanyi.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-303. 1986.]
107829 DISTRIBUTED CONTROL IN COMPUTER NETWORKS AND CROSS-SECTIONS OF
COLORED MULTIDIMENSIONAL BODIES.
E. Krankis and P. M. B. Vitanyi.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-304. 1986.]
107830 REPRESENTING CHANGE.
E. P. Sacks.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-305. 1986.]
107831 NONSEQUENTIAL COMPUTATION AND LAWS OF NATURE.
P. M. B. Vitanyi.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-306. 1986.]
107832 RANDOMIZED ROUTING ON FAT-TREES.
R. I. Greenberg and C. E. Leiserson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-307. 1986.]
107833 FLOYD-HOARE LOGIC DEFINES SEMANTICS.
A. R. Meyer.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-308. 1986.]
107834 RETIMING SYNCHRONOUS CIRCUITRY.
C. E. Leiserson and J. B. Saxe.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-309. 1986.]
107835 AN ARTIFICIAL INTELLIGENCE APPROACH TO CLINICAL DECISION MAKING.
P. Szolovits et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-310. 1986.]
107836 GAME TREE SEARCHING BY MIN/MAX APPROXIMATION.
R. L. Rivest.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-311. 1986.]
107837 HIERARCHICAL INEQUALITY REASONING.
E. P. Sacks.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-312. 1987.]
107838 ATOMIC SHARED REGISTER ACCESS BY ASYNCHRONOUS HARDWARE.
P. M. B. Vitanyi and B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-314. 1986. "Detailed abstract."]
107839 TWO REMARKS CONCERNING THE GOLDWASSER-MICALI-RIVEST SIGNATURE SCHEME.
O. Goldreich.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-315. 1986.]
107965 DATA SHARING IN GROUP WORK.
I. Greif and S. Sarin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-316. 1986.]
107840 CELLULAR AUTOMATA '86 CONFERENCE.
C. H. Bennett, T. Toffoli, and S. Wolfram.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-317. 1986. "This report contains material
distributed at the Cellular Automata Conference, held at MIT on June
16-18, 1986."]
107841 COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS.
C. E. Leiserson and B. M. Maggs.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-318. 1986.]
107842 MURMUR CLINIC: A CARDIAC AUSCULTATION EXPERT SYSTEM.
T.-Y. Leong.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-319. 1987.]
107843 EFFICIENT PARALLEL ALGORITHMS FOR (DELTA + 1)-COLORING AND MAXIMAL
INDEPENDENT SET PROBLEMS.
A. V. Goldberg and S. A. Plotkin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-320. 1987.]
107844 A HYPERCONCENTRATOR SWITCH FOR ROUTING BIT-SERIAL MESSAGES.
T. H. Cormen and C. E. Leiserson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-321. 1987.]
107845 EFFICIENT MULTICHIP PARTIAL CONCENTRATOR SWITCHES.
T. H. Cormen.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-322. 1987.]
107846 A SPACE-EFFICIENT ALGORITHM FOR FINDING THE CONNECTED COMPONENTS OF
RECTANGLES IN THE PLANE.
C. E. Leiserson and C. A. Phillips.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-323. 1987. July 1985. Last revised: February
1987.]
107847 NESTED TRANSACTIONS AND READ/WRITE LOCKING.
A. Fekete et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-324. 1987. "A preliminary version of this work
appeared in the 'Proceedings of the 6th [1987] Symposium on
Principles of Database Systems.'"]
107848 APPROXIMATING THE SIZE OF A DYNAMICALLY GROWING ASYNCHRONOUS
DISTRIBUTED NETWORK.
B. Awerbuch and S. A. Plotkin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-328. 1987.]
107849 THEORY OF COMPUTATION GROUP. RESEARCH SUMMARY: JUNE, 1986 - JUNE,
1987.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-337. 1987.]
020361 BOUNDED WIDTH BRANCHING PROGRAMS.
D. A. Barrington.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-361. 1986. Thesis (Ph.D.).]
020362 SIMULATING APPLICATIVE ARCHITECTURES ON THE CONNECTION MACHINE.
B. C. Kuszmaul.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-362. 1986. Thesis (M.S.).]
020363 EXPLOITING PARALLELISM IN VLSI CAD.
J. D. Marantz.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-363. 1986. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on June 3,
1986 in partial fulfillment of the requirements for the Degrees of
Bachelor of Science and Master of Science."]
020364 CORRECTNESS CONDITIONS FOR HIGHLY AVAILABLE REPLICATED DATABASES.
N. Lynch, B. Blaustein, and M. Siegel.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-364. 1986.]
020365 ID WORLD: AN ENVIRONMENT FOR THE DEVELOPMENT OF DATAFLOW PROGRAMS
WRITTEN IN ID.
D. R. Morias.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-365. 1986. Thesis (B.S.).]
020366 THE CLOCK DISTRIBUTION SYSTEM OF THE MULTIPROCESSOR EMULATION
FACILITY.
S. G. Younis.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-366. 1986. Thesis (B.S.).]
020367 INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS.
N. Lynch and M. Merritt.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-367. 1986.]
020368 THE X WINDOW SYSTEM.
R. W. Scheifler and J. Gettys.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-368. 1986.]
020369 PROGRAMMING SIMULTANEOUS ACTIONS USING COMMON KNOWLEDGE.
Y. Moses and M. R. Tuttle.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-369. 1987.]
020370 A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE.
K. R. Traub.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-370. 1986. Thesis (M.S.).]
020371 A PIPELINED CODE MAPPING SCHEME FOR STATIC DATA FLOW COMPUTERS.
G. G. Rong.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-371. 1986. Thesis (Ph.D.).]
020372 COMPACTION WITH AUTOMATIC JOG INTRODUCTION.
F. M. Maley.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-372. 1986. Thesis (M.S.).]
020374 EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS.
A. V. Goldberg.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-374. 1987. Thesis (Ph.D.).]
020376 REPLICATION AND RECONFIGURATION IN A DISTRIBUTED MAIL REPOSITORY.
M. S. Day.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-376. 1987. Thesis (M.S.).]
020377 LONG ATOMIC COMPUTATIONS.
P. Ng.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-377. 1986. Thesis (Ph.D.).]
020378 MACE: A MULTIPROCESSOR APPROACH TO CIRCUIT EXTRACTION.
S. M. Levitin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-378. 1986. Thesis (M.S.).]
020379 THE NOTION OF SECURITY FOR PROBABILISTIC PUBLIC-KEY CRYPTOSYSTEMS.
R. H. Sloan.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-379. 1986. Thesis (M.S.).]
020380 LOGIC SIMULATION ON A MULTIPROCESSOR.
E. Bradley.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-380. 1986. Thesis (M.S.).]
020381 CRYPTOLOGY AND VLSI (A TWO-PART DISSERTATION): I. DETECTING AND
EXPLOITING ALGEBRAIC WEAKNESSES IN CRYPTOSYSTEMS. II. ALGORITHMS FOR
PLACING MODULES ON A CUSTOM VLSI CHIP.
A. T. Sherman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-381. 1986. Thesis (Ph.D.).]
020382 CONGESTION CONTROL IN ROUTING NETWORKS.
A. A. Chien.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-382. 1986. Thesis (M.S.).]
020383 THE ORGANIZATION OF RESEARCH IN THE INFORMATION SCIENCES: CASE
STUDIES IN JAPAN AND IN THE US.
M. M. Strauss.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-383. 1986. Thesis (M.S.). "Submitted to the
Department of Political Science at the Massachusetts Institute of
Technology, September 1986."]
020384 REMOTE PIPES AND PROCEDURES FOR EFFICIENT DISTRIBUTED COMMUNICATION.
D. K. Gifford.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-384. 1986.]
020386 A SIMULATION ENVIRONMENT FOR SCHEMA.
M. A. St. Pierre.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-386. 1986. Thesis (M.S.).]
107850 A NEGLECTED ASPECT OF DIGITAL SIGNATURES.
W. W. Tsang and J. W. John.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA5/87. 1987.]
107851 LEVEL-EMBEDDING AND LOOP-EMBEDDING OF BINARY TREES INTO HYPERCUBES.
T. Bier and K. F. Loe.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB5/87. 1987.]
107852 A DEVELOPMENT ENVIRONMENT FOR AUTOMATICALLY INTEGRATING
ENTITY-RELATIONSHIP DIAGRAM PROCESSING, STRUCTURED SYSTEM DESIGN
AND/OR POPULAR COMMERCIAL RELATIONAL DBMS'S.
J. L. Clark et al.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC5/87. 1987.]
107894 ACTION, PROCESSES, AND CAUSALITY.
M. P. Georgeff.
[SRI International. Artificial Intelligence Center. Technical note
404. 1987.]
107895 EVIDENTIAL REASONING FOR GEOGRAPHIC EVALUATION FOR HELICOPTER ROUTE
PLANNING.
T. D. Garvey.
[SRI International. Artificial Intelligence Center. Technical note
405. 1986.]
107896 RECOGNITION BY PARTS.
A. P. Pentland.
[SRI International. Artificial Intelligence Center. Technical note
406. 1987. December 16, 1986. Revised: August 25, 1987.]
107897 ON THE RELATION BETWEEN DEFAULT AND AUTOEPISTEMIC LOGIC.
K. G. Konolige.
[SRI International. Artificial Intelligence Center. Technical note
407. 1987.]
107898 THE LOGICAL FOUNDATIONS OF EVIDENTIAL REASONING.
E. H. Ruspini.
[SRI International. Artificial Intelligence Center. Technical note
408. 1987. December 20, 1986. Revised: April 27, 1987.]
107899 A COMPUTATIONAL MODEL OF REFERRING.
D. E. Appelt and A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
409. 1987.]
107900 USING CAUSAL RULES IN PLANNING.
D. E. Wilkins.
[SRI International. Artificial Intelligence Center. Technical note
410R. 1987.]
107901 PROCEDURAL KNOWLEDGE.
M. P. Georgeff.
[SRI International. Artificial Intelligence Center. Technical note
411. 1987.]
107902 THE SYNTHESIS OF DIGITAL MACHINES WITH PROVABLE EPISTEMIC PROPERTIES.
S. J. Rosenchien and L. P. Kaelbling.
[SRI International. Artificial Intelligence Center. Technical note
412. 1987.]
107903 THE SRI MOBILE ROBOT TESTBED: A PRELIMINARY REPORT.
S. Reifel.
[SRI International. Artificial Intelligence Center. Technical note
413. 1987.]
107904 STEREO MATCHING BY HIERARCHICAL, MICROCANONICAL ANNEALING.
S. T. Barnard.
[SRI International. Artificial Intelligence Center. Technical note
414. 1987.]
107905 PERSISTANCE, INTENTION, AND COMMITMENT.
P. R. Cohen Sr. and H. J. Levesque.
[SRI International. Artificial Intelligence Center. Technical note
415. 1987.]
107906 AUTOMATING ARGUMENT CONSTRUCTION.
J. D. Lowrance.
[SRI International. Artificial Intelligence Center. Technical note
416. 1986.]
107907 MANY AGENTS ARE BETTER THAN ONE.
M. P. Georgeff.
[SRI International. Artificial Intelligence Center. Technical note
417. 1987.]
107908 IMPLICATURE AND DEFINITE REFERENCE.
J. R. Hobbs.
[SRI International. Artificial Intelligence Center. Technical note
419. 1987.]
107909 GRAMMARS AND LOGICS OF PARTIAL INFORMATION.
F. C. N. Pereira.
[SRI International. Artificial Intelligence Center. Technical note
420. 1987.]
107910 LEARNING AND RECOGNITION IN NATURAL ENVIRONMENTS.
A. P. Pentland.
[SRI International. Artificial Intelligence Center. Technical note
421. 1987.]
107911 SEPARATING LINGUISTIC ANALYSES FROM LINGUISTIC THEORIES.
S. M. Shieber.
[SRI International. Artificial Intelligence Center. Technical note
422. 1987.]
107912 TOWARD AN ARCHITECTURE FOR RESOURCE-BOUNDED AGENTS.
M. E. Pollack, D. J. Israel Sr., and M. E. Bratman.
[SRI International. Artificial Intelligence Center. Technical note
425. 1987.]
052078 TOPIC, PRONOUN, AND AGREEMENT IN CHICHEWA.
J. Bresnan and S. Mchombo.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-78. March 1987.]
052079 HEAD-DRIVEN PHRASE STRUCTURE GRAMMAR: AN INFORMAL SYNOPSIS.
I. Sag and C. Pollard.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-79. July 1987.]
052080 THE SITUATED PROCESSING OF SITUATED LANGUAGE.
S. Stucky.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-80. March 1987.]
052082 FINAL ALGEBRAS, COSEMICOMPUTABLE ALGEBRAS, AND DEGREES OF
UNSOLVABILITY.
L. S. Moss, J. Meseguer, and J. A. Goguen.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-82. March 1987.]
052086 ORDER-SORTED UNIFICATION.
J. Meseguer, J. A. Goguen, and G. Smolka.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-86. March 1987.]
052092 ORDER-SORTED ALGEBRA SOLVES THE CONSTRUCTOR-SELECTOR, MULTIPLE
REPRESENTATION AND COERCION PROBLEMS.
J. A. Goguen and J. Meseguer.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-92. March 1987.]
052093 UNIFYING FUNCTIONAL, OBJECT-ORIENTED AND RELATIONAL PROGRAMMING WITH
LOGICAL SEMANTICS.
J. A. Goguen and J. Meseguer.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-93. March 1987.]
052094 L3 REFERENCE MANUAL.
W. Poser.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-94. March 1987.]
052098 A LANGUAGE/ACTION PERSPECTIVE ON THE DESIGN OF COOPERATIVE WORK.
T. Winograd.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-98. May 1987.]
052099 IMPLICATURE AND DEFINITE REFERENCE.
J. R. Hobbs.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-99. May 1987.]
052100 THINKING MACHINES: CAN THERE BE? ARE WE?
T. Winograd.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-100. July 1987.]
052101 SITUATION SEMANTICS AND SEMANTIC INTERPRETATION IN CONSTRAINT-BASED
GRAMMARS.
P.-K. Halvorsen.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-101. August 1987.]
052102 CATEGORY STRUCTURES.
G. Gazdar et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-102. July 1987.]
052103 COGNITVE THEORIES OF EMOTION.
R. A. Nash.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-103. August 1987.]
052104 TOWARD AN ARCHITECTURE FOR RESOURCE-BOUNDED AGENTS.
M. E. Pollack, D. J. Israel, and M. E. Bratman.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-104. August 1987.]
052105 ON THE RELATION BETWEEN DEFAULT AND AUTOEPISTEMIC LOGIC.
K. G. Konolige.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-105. September 1987.]
052106 THREE RESPONSES TO SITUATION THEORY.
T. Winograd.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-106. September 1987.]
052108 TOOLS FOR MORPHOLOGICAL ANALYSIS.
M. Dalrymple et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-108. September 1987. "This report consists of
two self-contained but related parts... [1]'A Compiler for Two-level
Phonological Rules,' by Karttunen, Koskenniemi, and Kaplan... [2] 'A
Morphological Analyzer using Two-level Rules,' by Shaio, Dalrymple,
Karttunen, and Wescoat."]
052108 A COMPILER FOR TWO-LEVEL PHONOLOGICAL RULES.
L. Karttunen, K. Koskenniemi, and R. M. Kaplan.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-108. n.d. One of two papers on morphological
analysis published together as Center for the Study of Language and
Information report no. CSLI-87-108.]
052108 A MORPHOLOGICAL ANALYZER USING TWO-LEVEL RULES.
S. Shaio et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-108. n.d. One of two papers on morphological
analysis published together as Center for the Study of Language and
Information report no. CSLI-87-108.]
107913 ON THE BIT COMPLEXITY OF DISTRIBUTED COMPUTATIONS IN A RING WITH A
LEADER.
Y. Mansour and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 422. 1986. "This is a revised version of
[TECHNION Department of Computer Science] report #383, November
1985."]
107914 TIGHT LOWER AND UPPER BOUNDS FOR SOME DISTRIBUTED ALGORITHMS FOR A
COMPLETE NETWORK OF PROCESSORS.
E. Korach, S. Moran, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 423. 1986. "This is a revised version of
[TECHNION Department of Computer Science] report #272, 'Tight Lower
and Upper Bounds for a Class of Distributed Algorithms for a Complete
Network of Processors,' May 1983." "A preliminary version [of this
report] was presented in the 3rd PODC (ACM Symposium on Principles of
Distributed Computing), Vancouver, Canada, August 1984."]
107915 A NEW CHARACTERIZATION OF DISTRIBUTED DEADLOCK IN DATABASES.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 424. 1986.]
107916 THE PERFORMANCE OF LOCKING PROTOCOLS IN DISTRIBUTED DATABASES.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 425. 1986. Revised version: December 1986.]
107917 THE PRIVATE WORKSPACE MODEL OF CONCURRENCY CONTROL: THEORY AND
PRACTICE.
I. Gold.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 426. 1986. Thesis (D.Sc.).]
107918 EVALUATING LINEAR-RECURSIVE LOGIC QUERIES AGAINST CYCLIC RELATIONS.
E. Gery and Y. Raz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 427. 1986.]
107919 OPTIMAL DISTRIBUTED T-RESILIENT ELECTION IN COMPLETE NETWORKS.
S. Kutten, Y. Wolfstahl, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 430. 1986.]
107920 STEPWISE CONSTRUCTION OF AN EFFICIENT DISTRIBUTED TRAVERSING
ALGORITHM FOR GENERAL STRONGLY CONNECTED DIRECTED GRAPHS (OR:
TRAVERSING ONE WAY STREETS WITH NO MAPS).
S. Kutten.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 431. 1986. "Extended abstract."]
107921 OPTIMAL FAULT-TOLERANT DISTRIBUTED SPANNING TREE WEAK CONSTRUCTION IN
GENERAL NETWORKS.
S. Kutten.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 432. 1986.]
107922 TRANSACTION COMMITMENT AT A MINIMAL COMMUNICATION COST.
A. Segall and O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 441. 1986. Preliminary version: December
1986.]
107923 IMPOSSIBILITY RESULTS FOR DECISION PROTOCOLS.
G. Taubenfeld.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 445. 1987. "Extended abstract."]
107924 FROM RINGS TO COMPLETE GRAPHS - O(N LOGN) TO O(N) DISTRIBUTED LEADER
ELECTION.
H. Attiya, N. Santori, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 446. 1987.]
107925 GAP THEOREMS FOR DISTRIBUTED COMPUTATION.
S. Moran and M. K. Warmuth.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 449. 1987.]
107926 A FEEDBACK-LESS DISTRIBUTED BROADCAST ALGORITHM FOR MULTIHOP RADIO
NETWORKS WITH TIME-VARYING STRUCTURE.
M. Hofri.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 451. 1987.]
107927 SENSE OF DIRECTION IN COMPLETE DISTRIBUTED NETWORKS.
Z. Harpaz and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 453. 1987.]
107928 FAIRNESS AND THE AXIOMS OF CONTROL PREDICATES.
N. Francez and S. Katz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 455. 1987.]
107929 INTERLEAVING SET TEMPORAL LOGIC.
S. Katz and D. Pelad.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 456. 1987.]
107930 WEAK SECOND ORDER CHARACTERIZATIONS OF VARIOUS PROGRAM VERIFICATION
SYSTEMS.
J. A. Makowsky and I. Sain.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 457. 1987.]
107931 FADES - AN EXPERT SYSTEM FOR FAULT ANALYSIS AND DIAGNOSIS.
C. Wood and P. Clark.
[Turing Institute. TIRM-87-024. 1987.]
107932 KIC: A KNOWLEDGE INTEGRITY CHECKER.
D. Pearce.
[Turing Institute. TIRM-87-025. 1987.]
107933 REPRESENTATION AND COMPUTER VISION: A FRAMEWORK FOR TACKLING MEDIUM
AND HIGH LEVEL VISION.
J. Shapiro and P. Mowforth.
[Turing Institute. TIOP-87-007. 1987.]
107934 A MULTIPROCESSOR FAULT SIMULATION ARCHITECTURE.
J. J. Baxter.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-62. 1987. Thesis (M.S.).]
107935 RECONFIGURABLE TREE ARCHITECTURES USING SUBTREE ORIENTED FAULT
TOLERANCE.
M. B. Lowrie.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-65. 1987.]
107936 PERFORMANCE ANLYSIS OF NUMERICAL PROBLEMS ON A LOOSELY COUPLED SYSTEM.
J. T. Rahmeh.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-66. 1987.]
107937 ALGORITHM-BASED FAULT DETECTION TECHNIQUES FOR SPECIFIC APPLICATIONS.
N. R. L. Annapareddy.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-67. 1987. Thesis (M.S.).]
107938 DESIGN AND TEST OF BIT-SERIAL MULTIPLIER ARRAYS.
J. T. Scanlon.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-68. 1987. Thesis (M.S.).]
107939 PLACEMENT BY SIMULATED EVOLUTION.
R. M. Kling.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-69. 1987. Thesis (M.S.).]
107940 THE DESIGN AND EVALUATION OF A NOVEL CLASS OF RECONFIGURABLE PARALLEL
ARCHITECTURES.
V. Balasubramanian.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-70. 1987. Thesis (M.S.).]
107941 MEASUREMENT-BASED RELIABILITY/PERFORMABILITY MODELS.
M.-C. Heueh.
[University of Illinois, Urbana-Champaign. Coordinated Science
Laboratory. Computer Systems Group. CSG-71. 1987. Thesis (Ph.D.).]
107942 A PROGRAM TO DETERMINE WHETHER TWO LINE SEGMENTS INTERSECT.
G. D. Knott and E. D. Jou.
[University of Maryland. Center for Automation Research. CAR-TR-306.
1987. Also issued as CS-TR-1884, Department of Computer Science,
University of Maryland.]
107943 CACHE COHERENCE IN MIMD SYSTEMS: A PETRI NET MODEL FOR A MINIMAL
STATE SOLUTION.
J.-L. Baer and C. Girault.
[University of Washington. Department of Computer Science. Technical
report 87-04-01. 1987.]
107944 THE DESIGN AND IMPLEMENTATION OF DISTRIBUTED SMALLTALK.
J. K. Bennett.
[University of Washington. Department of Computer Science. Technical
report 87-04-02. 1987.]
107945 COMPUTATIONAL MODELS OF GAMES.
A. Condon.
[University of Washington. Department of Computer Science. Technical
report 87-04-04. 1987. Thesis (Ph.D.).]
107946 PESSIMAL GUESSES MAY BE OPTIMAL: A COUNTERINTUITIVE SEARCH RESULT.
K. R. Sloan Jr. and J. Painter.
[University of Washington. Department of Computer Science. Technical
report 87-05-01. 1987.]
107947 SPACE BOUNDED PROBABILISTIC GAMES.
A. Condon.
[University of Washington. Department of Computer Science. Technical
report 87-05-04. 1987.]
107948 IMPROVING QUICKSORT PERFORMANCE WITH A CODEWORD DATA STRUCTURE.
J.-L. Baer and Y.-B. Lin.
[University of Washington. Department of Computer Science. Technical
report 87-06-01. 1987.]
107949 CONSTRAINT HIERARCHIES.
A. Borning et al.
[University of Washington. Department of Computer Science. Technical
report 87-06-05. 1987.]
107950 PARALLEL PROGRAMMING PARADIGMS.
P. A. Nelson.
[University of Washington. Department of Computer Science. Technical
report 87-07-02. 1987. Thesis (Ph.D.).]
107951 HETEROGENEOUS REMOTE PROCEDURE CALL FOR FRANZ LISP.
K. Gosney.
[University of Washington. Department of Computer Science. Technical
report 87-07-03. 1987.]
107952 CODE GENERATION BY TABLE LOOKUP.
R. R. Henry.
[University of Washington. Department of Computer Science. Technical
report 87-07-07. 1987.]
107953 NAMING IN LARGE, HETEROGENEOUS SYSTEMS.
M. F. Schwartz.
[University of Washington. Department of Computer Science. Technical
report 87-08-01. 1987. Thesis (Ph.D.).]
107954 AN EVALUATION OF LOAD SHARING IN LOCALLY DISTRIBUTED SYSTEMS.
S. A. Banawan.
[University of Washington. Department of Computer Science. Technical
report 87-08-02. 1987. Thesis (Ph.D.).]
107955 A TOOL FOR ANALYZING COMPILER ERROR MESSAGES.
R. R. Henry.
[University of Washington. Department of Computer Science. Technical
report 87-08-03. 1987.]
107956 THE CODEGEN USER'S MANUAL.
R. R. Henry.
[University of Washington. Department of Computer Science. Technical
report 87-08-04. 1987.]
107957 REASONING ABOUT TIME IN HIGHER-LEVEL LANGUAGE SOFTWARE.
A. Shaw.
[University of Washington. Department of Computer Science. Technical
report 87-08-05. 1987.]
107958 THE TRIANGLE: A MULTIPROCESSOR ARCHITECTURE FOR FAST CURVES AND
SURFACE GENERATION.
T. D. DeRose and T. J. Holman.
[University of Washington. Department of Computer Science. Technical
report 87-08-07. 1987.]
107959 PARALLEL AND SERIAL SOLUTION OF LARGE-SCALE LINEAR COMPLEMENTARITY
PROBLEMS.
K. M. Thompson.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 714. 1987. Thesis (Ph.D.).]
107960 THE COMPLEXITY OF CONTROLLED THREE DIMENSIONAL ROUNDING.
K. Pruhs.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 715. 1987.]
107961 GREEDY ALGORITHMS FOR VLSI MODULE PLACEMENT AND ROUTING.
M. K. Mohan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 716. 1987. Thesis (Ph.D.).]
107962 RECOGNITION CONES: A NEURONAL ARCHITECTURE FOR PERCEPTION AND
LEARNING.
V. Honavar and L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 717. 1987.]
107963 DECOMPOSITION OF STRUCTURED LARGE-SCALE OPTIMIZATION PROBLEMS AND
PARALLEL OPTIMIZATION.
D. Medhi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 718. 1987. Thesis (Ph.D.).]
107964 SIGNED DATA DEPENDENCIES IN LOGIC PROGRAMS.
K. Kunen.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer science technical report 719. 1987.]
*** A BACKSET OF 1986 CMU REPORTS ***
107786 DISTRIBUTED LOGGING FOR TRANSACTION PROCESSING.
D. S. Daniels, A. Z. Spector, and D. S. Thompson.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-106. 1986.]
107787 ABSTRACTION AND THE METHODICAL DEVELOPMENT OF FAULT-TOLERANT SOFTWARE.
I. Durham.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-112. 1986. Thesis (Ph.D.).]
107788 FINDING A MAXIMUM-GENUS GRAPH IMBEDDING.
M. L. Furst, J. L. Gross, and L. A. McGeoch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-113. 1986.]
107789 MEASURE THEORY AND FAIR ARBITERS.
D. L. Black.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-116. 1986.]
107790 SOME GRAPH THEORETIC ISSUES IN VLSI DESIGN.
B. Mishra.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-117. 1986. Thesis (Ph.D.).]
107791 FLAMINGO: OBJECT-ORIENTED WINDOW MANAGEMENT FOR DISTRIBUTED,
HETEROGENEOUS SYSTEMS.
E. T. Smith and D. B. Anderson.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-118. 1986.]
107792 ADVANCED DESIGN TOOLS FOR PROGRAMMABLE LOGIC DEVICES.
A. Nowatzyk.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-121. 1986.]
107793 PARALLELISM IN PRODUCTION SYSTEMS.
A. Gupta.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-122. 1986. Thesis (Ph.D.).]
107794 CONTINUITY AND EFFECTIVENESS IN TOPOI.
G. Rosolini.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-123. 1986. Thesis (Ph.D.).]
107795 A SURVEY OF LANGUAGE SUPPORT PROGRAMMING IN THE LARGE.
T. D. Newton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-124. 1986.]
107796 AN IMPLEMENTATION OF ADA GENERICS.
T. D. Newton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-125. 1986.]
107797 EXPERIMENTS ON LEARNING BY BACK PROPAGATION.
D. C. Plaut, S. J. Nowlan, and G. E. Hinton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-126. 1986.]
107798 FAULT-FREE PERFORMANCE VALIDATION OF FAULT-TOLERANT MULTIPROCESSORS.
A. M. Grizzaffi.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-127. 1986. Thesis (M.S.).]
107799 THE ALOE ACTION ROUTINE LANGUAGE MANUAL.
V. Ambriola and B. J. Staudt.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-129. 1986.]
107800 CONSENSUS: A STATISTICAL LEARNING PROCEDURE IN A CONNECTIONIST
NETWORK.
G. J. Goetsch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-131. 1986.]
107801 A WEIGHTED VOTING ALGORITHM FOR REPLICATED DIRECTORIES.
J. J. Bloch, D. S. Daniels, and A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-132. 1986. Revision of Carnegie-Mellon University
Department of Computer Science report no. CMU-CS-84-114.]
107802 COOPERATIVE ALGORITHMS FOR SOLVING RANDOM-DOT STEREOGRAMS.
R. Szeliski.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-133. 1986.]
107803 BEST-EFFORT DECISION MAKING FOR REAL-TIME SCHEDULING.
C. D. Locke.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-134. 1986. Thesis (Ph.D.).]
107804 VERIFICATION OF SYSTOLIC ARRAYS: A FP FUNCTIONAL APPROACH.
Y.-Q. Sun.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-135. 1986.]
107805 MAPPING IMAGE PROCESSING OPERATIONS ONTO A LINEAR SYSTOLIC MACHINE.
H. T. Kung and J. A. Webb.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-137. 1986.]
107806 A CALCULUS FOR INHERITANCE IN MONOTONIC SEMANTIC NETS.
R. H. Thomason, J. F. Horty, and D. S. Touretzky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-138. 1986.]
107807 ALL THE RIGHT MOVES: A VLSI ARCHITECTURE FOR CHESS.
C. Ebeling.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-142. 1986. Thesis (Ph.D.).]
107808 YIELD SIMULATION FOR INTEGRATED CIRCUITS.
D. M. H. Walker.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-143. 1986. Thesis (Ph.D.).]
107809 A FORMAL SEMANTICS FOR IDL.
P. Giannini.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-150. 1986.]
107810 THE WORLD'S FASTEST SCRABBLE PROGRAM.
A. W. Appel and G. J. Jacobson.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-153. 1986.]
107811 PAST: PROGRAM-SPECIFIC AND ARCHITECTURE-SPECIFIC SIMULATION TOOL.
B. S. Siegell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-159. 1986. M.S. Project report.]
107812 PROSODY AND SPEECH RECOGNITION.
A. Waibel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-162. 1986. Thesis (Ph.D.).]
107813 THE ROLE OF ARTIFICIAL INTELLIGENCE IN THE INTEGRATION OF REMOTELY
SENSED DATA WITH GEOGRAPHICAL INFORMATION SYSTEMS.
D. M. McKeown Jr.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-86-174. 1986.]
VOL. 10, NO. 1 01/08/88
107966 VERIFICATION OF CCS-PROCESSES.
M. Hillerstroem.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 87-27. 1987.]
107967 PICTURES OF KARMAKAR'S LINEAR PROGRAMMING ALGORITHM.
D. M. Gay.
[AT&T Bell Laboratories. Computing science technical report 136.
1987.]
107968 ANNOTATING SPELLING LIST WORDS WITH AFFIXATION CLASSES.
R. J. Elliott.
[AT&T Bell Laboratories. Computing science technical report 137.
1987.]
107969 THE CRISP MICROPROCESSOR: COLLECTED PAPERS.
D. R. Ditzel and H. R. McLellan.
[AT&T Bell Laboratories. Computing science technical report 138.
1987.]
107970 A RESEARCH UNIX READER: ANNOTATED EXCERPTS FROM THE PROGRAMMER'S
MANUAL, 1971-1986.
M. D. McIlroy.
[AT&T Bell Laboratories. Computing science technical report 139.
1987.]
107971 PROJECTIONS: MAPMAKER'S ANSWERS TO THE RIDDLE OF DEPICTING A ROUND
EARTH ON FLAT PAPER.
M. D. McIlroy.
[AT&T Bell Laboratories. Computing science technical report 140.
1987.]
107972 POLYNOMIAL DECOMPOSITION ALGORITHMS FOR MULTIVARIATE POLYNOMIALS.
M. Dickerson.
[Cornell University. Department of Computer Science. Technical report
87-826. 1987.]
107973 HISTORIC NOTE: THE PAST THIRTY YEARS IN INFORMATION RETRIEVAL.
G. Salton.
[Cornell University. Department of Computer Science. Technical report
87-827. 1987.]
107974 PARALLEL TEXT SEARCH METHODS.
G. Salton and C. Buckley.
[Cornell University. Department of Computer Science. Technical report
87-828. 1987.]
107975 ADAPTIVE LOCKING.
C. Elkan.
[Cornell University. Department of Computer Science. Technical report
87-829. 1987.]
107976 ON THE OPERATIONALITY/GENERALITY TRADE-OFF IN EXPLANATION-BASED
LEARNING.
A. M. Segre.
[Cornell University. Department of Computer Science. Technical report
87-830. 1987.]
107977 EFFICIENT CONCATENABLE ORDERED LISTS.
W. Pugh.
[Cornell University. Department of Computer Science. Technical report
87-831. 1987.]
107978 A NON-TYPE-THEORETIC DEFINITION OF MARTIN-LOEF'S TYPES.
S. Allen.
[Cornell University. Department of Computer Science. Technical report
87-832. 1987.]
107979 TRACE-BASED NETWORK PROOF SYSTEMS: EXPRESSIVENESS AND COMPLETENESS.
J. Widom.
[Cornell University. Department of Computer Science. Technical report
87-833. 1987. Thesis (Ph.D.).]
107980 THE COMPLEXITY OF OPTIMIZATION PROBLEMS.
M. W. Krentel.
[Cornell University. Department of Computer Science. Technical report
87-834. 1987. Thesis (Ph.D.).]
107981 ALEX - AN ALEXICAL PROGRAMMING LANGUAGE.
D. Kozen et al.
[Cornell University. Department of Computer Science. Technical report
87-835. 1987.]
107982 INCREMENTAL GRAPH EVALUATION.
R. Hoover.
[Cornell University. Department of Computer Science. Technical report
87-836. 1987. Thesis (Ph.D.).]
107983 TYPE-THEORETIC MODELS OF CONCURRENCY.
W. R. Cleaveland II.
[Cornell University. Department of Computer Science. Technical report
87-837. 1987. Thesis (Ph.D.).]
107984 ATTRIBUTE GRAMMARS IN CONSTRAINT-BASED GRAPHICS SYSTEMS.
L. A. Barford and B. T. Vander Zanden.
[Cornell University. Department of Computer Science. Technical report
87-838. 1987.]
107985 COUNTING IN STRUCTURAL COMPLEXITY THEORY.
L. A. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
87-840. 1987. Thesis (Ph.D.).]
107986 THE SORTING OF POINTS ALONG AN ALGEBRAIC CURVE.
J. K. Johnstone.
[Cornell University. Department of Computer Science. Technical report
87-841. 1987. Thesis (Ph.D.).]
107987 IS ONE NP QUESTION AS POWERFUL AS TWO?
J. Kadin.
[Cornell University. Department of Computer Science. Technical report
87-842. 1987.]
107988 THE POLYNOMIAL TIME HIERARCHY COLLAPSES IF THE BOOLEAN HIERARCHY
COLLAPSES.
J. Kadin.
[Cornell University. Department of Computer Science. Technical report
87-843. 1987.]
107989 COLORMAP: A COLOR IMAGE QUANTIZER.
A. Rosen.
[Cornell University. Department of Computer Science. Technical report
87-845. 1987.]
107990 AN ENVIRONMENT FOR FORMAL SYSTEMS.
T. G. Griffin.
[Cornell University. Department of Computer Science. Technical report
87-846. 1987.]
107991 VECTORIZED SIMULATIONS AND RAY TRACING.
S. Youssef.
[Florida State University. Supercomputer Computations Research
Institute. FSU-SCRI-87-63. 1987.]
107992 REUSE OF FORMATTED REQUIREMENTS SPECIFICATIONS.
A. Finkelstein.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/11. 1987.]
107993 MIXED COMPUTATION OF PROLOG PROGRAMS - AN EXTENDED PAPER.
D. A. Fuller and S. Abramsky.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/12. 1987.]
107994 THE SOURCE OF AUTHORITY FOR COMMERCIAL ACCESS CONTROL.
J. D. Moffett and M. S. Sloman.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/13. 1987.]
107995 TRANSPARENT MODULE REPLICATION IN A DISTRIBUTED SYSTEM.
O. G. Loques and J. Kramer.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/14. 1987.]
107996 A DIALOGIC FRAMEWORK FOR SOFTWARE DEVELOPMENT.
A. Finkelstein et al.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/15. 1987.]
107997 A REVIEW OF COMPUTER VISION WITH COMMENTS ON ITS APPLICATION TO
ENDOSCOPY.
G. N. Khan and D. F. Gillies.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/16. 1987.]
107998 ANIMATION OF REQUIREMENTS SPECIFICATIONS.
J. Kramer.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/17. 1987.]
107999 TARA: TOOL ASSISTED REQUIREMENTS ANALYSIS. FINAL REPORT: SEPTEMBER
1987.
J. Kramer et al.
[Imperial College of Science and Technology. Department of Computing.
Research report 87/18. 1987.]
095211 A SOFTWARE TOOL FOR BUILDING SUPERCOMPUTER APPLICATIONS.
D. Gannon et al.
[Indiana University. Computer Science Department. Technical report
224. 1987.]
095212 STRATEGIES FOR CACHE AND LOCAL MEMORY MANAGEMENT BY GLOBAL PROGRAM
TRANSFORMATION.
D. Gannon, W. Jalby, and K. Gallivan.
[Indiana University. Computer Science Department. Technical report
228. 1987.]
095213 APPLYING AI TECHNIQUES TO PROGRAM OPTIMIZATION FOR PARALLEL COMPUTERS.
K.-Y. Wang and D. Gannon.
[Indiana University. Computer Science Department. Technical report
227. 1987.]
108000 ANALYSIS AND SYNTHESIS OF ABSTRACT DATA TYPES THROUGH GENERALIZATION
FROM EXAMPLES.
C. Wild.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-59. 1987.]
108001 THE JOURNAL OF CHAOS AND GRAPHICS, VOL. 2.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RA 192. 1987. Clifford A. Pickover, editor.]
108002 AN INTERVAL-BASED APPROACH TO EXHAUSTIVE AND INCREMENTAL
INTERPROCEDURAL DATA FLOW ANALYSIS.
M. Burke.
[International Business Machines Corporation (IBM). Research
Division. RC 12702. 1987.]
108003 CHARGED CURVES.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. RC 12864. 1987.]
108004 AN ENVIRONMENT FOR UNDERSTANDING PROGRAMS.
L. Cleveland.
[International Business Machines Corporation (IBM). Research
Division. RC 12889. 1987.]
108005 PERFORMANCE OF DELAYED BRANCHES.
P. Y.-T. Hsu.
[International Business Machines Corporation (IBM). Research
Division. RC 13078. 1987.]
108006 THE ACTIVE DEALLOCATION OF OBJECTS IN OBJECT-ORIENTED SYSTEMS.
M. C. Atkins and L. R. Nackman.
[International Business Machines Corporation (IBM). Research
Division. RC 13091. 1987.]
108007 PROGRESSIVE ACCESS PLAN SELECTION FOR RELATIONAL DATABASE SYSTEMS.
Y.-H. Lee and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 13093. 1987.]
108008 PARALLEL GRAPH ALGORITHMS THAT ARE EFFICIENT ON AVERAGE.
D. Coppersmith, P. Raghavan, and M. Tompa.
[International Business Machines Corporation (IBM). Research
Division. RC 13098. 1987.]
108009 A PARALLEL ADDRESS TRANSLATION MECHANISM FOR MICROPROCESSORS.
B. Abali.
[International Business Machines Corporation (IBM). Research
Division. RC 13101. 1987.]
108010 REDUCED INSTRUCTION SET COMPUTING.
M. W. Blasgen.
[International Business Machines Corporation (IBM). Research
Division. RC 13103. 1987.]
108011 A TAXONOMIC APPROACH TO UNDERSTANDING DIRECT MANIPULATION.
C. G. Wolf and J. R. Rhyne.
[International Business Machines Corporation (IBM). Research
Division. RC 13104. 1987.]
108012 INTERCONS: INTERFACE CONSTRUCTION SET.
D. N. Smith.
[International Business Machines Corporation (IBM). Research
Division. RC 13108. 1987.]
108013 ALGORITHM FOR AC TEST COMPUTATION.
J. P. Roth.
[International Business Machines Corporation (IBM). Research
Division. RC 13109. 1987.]
108014 AN OVERVIEW OF THE PTRAN ANALYSIS SYSTEM FOR MULTIPROCESSING.
F. Allen et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13115. 1987.]
108015 INTEGRATING RULES AND INHERITANCE NETWORKS IN A KNOWLEDGE-BASED
FINANCIAL MARKETING CONSULTATION SYSTEM.
T. Daly, J. Kastner, and E. Mays.
[International Business Machines Corporation (IBM). Research
Division. RC 13144. 1987.]
108016 EVOLVING KNOWLEDGE AND LOGICAL OMNISCIENCE.
A. S. Rao and N. Y. Foo.
[International Business Machines Corporation (IBM). Research
Division. RC 13155. 1987.]
108017 EVOLVING KNOWLEDGE AND AUTOEPISTEMIC REASONING.
A. S. Rao and N. Y. Foo.
[International Business Machines Corporation (IBM). Research
Division. RC 13156. 1987.]
108018 EPEX - ENVIRONMENT FOR PARALLEL EXECUTION.
D. A. George.
[International Business Machines Corporation (IBM). Research
Division. RC 13158. 1987.]
108019 L SUBSCRIPT 2-ESTIMATES FOR CHEBYSHEV COLLOCATION.
L. G. Reyna.
[International Business Machines Corporation (IBM). Research
Division. RC 13160. 1987.]
108020 ANALYSIS OF PROTOCOLS FOR HYBRID DISTRIBUTED-CENTRALIZED DATABASE
SYSTEMS.
B. Ciciani et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13162. 1987.]
108021 GUIDING DESIGN WITH USER INTERFACE TOOLS.
M. B. Rosson.
[International Business Machines Corporation (IBM). Research
Division. RC 13166. 1987.]
108022 OPTIMAL INSCRIBED POLYGONS IN CONVEX CUBES.
J. S. Lew and D. A. Quarles Jr.
[International Business Machines Corporation (IBM). Research
Division. RC 13167. 1987.]
108023 REFINEMENT AND SUBDIVISION FOR SPACES OF INTEGER TRANSLATES OF A
COMPACTLY SUPPORTED FUNCTION.
C. A. Micchelli and H. Prautzsch.
[International Business Machines Corporation (IBM). Research
Division. RC 13175. 1987.]
108024 COMPUTING SURFACES INVARIANT UNDER SUBDIVISION.
C. A. Micchelli and H. Prautzsch.
[International Business Machines Corporation (IBM). Research
Division. RC 13176. 1987.]
108025 TWO APPLICATIONS OF COMPLEMENTATION VIA INDUCTIVE COUNTING.
A. Borodin et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13179. 1987.]
108026 WORKLOAD ALLOCATION FOR DISTRIBUTED SYSTEMS.
N. S. Bowen, C. N. Nikolaou, and A. Ghafoor.
[International Business Machines Corporation (IBM). Research
Division. RC 13180. 1987.]
108027 A STATE-BASED APPROACH TO COMMUNICATING PROCESSES.
M. B. Josephs.
[International Business Machines Corporation (IBM). Research
Division. RC 13183. 1987.]
108028 A COMPARATIVE EVALUATION OF GESTURAL AND CONVENTIONAL INTERFACES.
C. W. Wolf.
[International Business Machines Corporation (IBM). Research
Division. RC 13187. 1987.]
108029 AUTOMATIC DETERMINATION OF PRIVATE AND SHARED VARIABLES FOR NESTED
PROCESSES.
M. Burke, R. Cytron, and J. Ferrante.
[International Business Machines Corporation (IBM). Research
Division. RC 13194. 1987. Preliminary version.]
108030 SEMANTICS FOR CONCURRENCY WITHOUT POWERDOMAINS.
F. J. Oles.
[International Business Machines Corporation (IBM). Research
Division. RC 13195. 1987.]
108031 A NEW TECHNIQUE FOR AUTONOMOUS AND EFFICIENT 3D ROBOTICS HAND/EYE
CALIBRATION.
R. Y. Tsai and R. K. Lenz.
[International Business Machines Corporation (IBM). Research
Division. RC 13212. 1987.]
108032 HYPERCUBE AND SHUFFLE-EXCHANGE ALGORITHMS FOR IMAGE COMPONENT
LABELING.
R. Cypher and L. Snyder.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5809. 1987.]
108033 AN EREW PRAM ALGORITHM FOR IMAGE COMPONENT LABELING.
R. Cypher and L. Snyder.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5810. 1987.]
108034 INTENT-BASED PAGE MODELLING USING BLOCKS IN THE QUILL DOCUMENT EDITOR.
A. W. Luniewski.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5811. 1987.]
108035 THE POWER SPECTRUM OF RUN-LENGTH-LIMITED CODES.
A. Gallopoulos and C. Heegard.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5813. 1987.]
108036 STOCHASTIC PETRI NETS WITH TIMED AND IMMEDIATE TRANSITIONS.
P. J. Haas and G. S. Shedler.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5842. 1987.]
108037 THE UNIVERSAL RELATION DATA MODEL.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5849. 1987.]
108038 ISSUES IN THE DESIGN OF HIGHLY AVAILABLE COMPUTING SYSTEMS.
F. Cristian.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5856. 1987.]
108039 A LITTLE KNOWLEDGE GOES A LONG WAY: SIMPLE KNOWLEDGE-BASED
DERIVATIONS AND CORRECTNESS PROOFS FOR A FAMILY OF PROTOCOLS.
J. Y. Halpern and L. D. Zuck.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5857. 1987.]
108040 A TRADEOFF BETWEEN SPACE AND EFFICIENCY FOR ROUTING TABLES.
D. Peleg and E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5859. 1987.]
108041 A TEMPORAL FIXPOINT CALCULUS.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5867. 1987.]
108042 STEPWISE SPECIFICATION OF A SLIDING WINDOW PROTOCOL BY MEANS OF
PROCESS ALGEBRA.
G. Karjoth.
[International Business Machines Corporation (IBM). Research
Division. RZ 1625. 1987.]
108043 ANALYSIS OF A DISCRETE-TIME G SUPERSCRIPT [X] /D/1-S QUEUEING SYSTEM
WITH APPLICATION IN PACKET SWITCHING SYSTEMS.
P. Tran-Gia and H. Ahmadi.
[International Business Machines Corporation (IBM). Research
Division. RZ 1632. 1987.]
040968 FINDING TEXTURE BOUNDARIES IN IMAGES.
H. Voorhees.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. AI-TR-968. 1987. Thesis (M.S.).]
108044 AN INTEGRATED DATA DESCRIPTION LANGUAGE FOR CODING DESIGN KNOWLEDGE.
B. Veth.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8731. 1987.]
108045 DESIGNING EQUIVALENT SEMANTIC MODELS FOR PROCESS CREATION.
P. America and J. W. de Bakker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8732. 1987.]
108046 A CONVERGENCE THEOREM IN PROCESS ALGEBRA.
J. A. Bergstra and J. W. Klop.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8733. 1987.]
108047 VERIFICATION OF A SYSTOLIC ALGORITHM FOR STRING COMPARISON.
L. Kossen and W. P. Weijiland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8734. 1987.]
108048 TWO NORMAL FORM THEOREMS FOR CSP PROGRAMS.
K. R. Apt, L. Bouge, and Ph Clermont.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8735. 1987.]
108049 CONSISTENCY OF RULE-BASED EXPERT SYSTEMS.
M. Bezem.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8736. 1987.]
108050 TYPE-CHECKING MINI-ML: AN ALGEBRAIC SPECIFICATION WITH USER-DEFINED
SYNTAX.
P. R. H. Hendriks.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8737. 1987.]
108051 LOGICAL INPUT DEVICES AND INTERACTION.
R. van Liere and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8738. 1987.]
108052 STRONGLY SEQUENTIAL TERM REWRITING SYSTEMS.
J. W. Klop and A. Middeldorp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8730. 1987.]
108053 OPTIMIZATION OF THE REAL LEVEL 2 BLAS ON THE CYBER 205.
W. M. Lioen, M. Louter-Nool, and H. J. J. te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8715. 1987.]
108054 AN EXPERIMENTAL-COMPUTATIONAL INVESTIGATION OF TRANSONIC SHOCK
WAVE-TURBULENT BOUNDARY LAYER INTERACTION IN A CURVED TEST SECTION.
C. Nebbeling and B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8716. 1987.]
108055 CONVERGENCE OF RUNGE-KUTTA METHODS ON CLASSES OF STIFF INITIAL VALUE
PROBLEMS.
W. H. Hundsdorfer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8717. 1987.]
108056 SPECIFICATIONS AND ABSTRACTIONS IN AN EXTENSIBLE SOFTWARE ENVIRONMENT
GENERATION SYSTEM.
S. Jarzabek.
[McMaster University. Department of Computer Science and Systems.
Technical report 86-06. 1986.]
108057 STRATEGIES: A TOOL TO CHARACTERIZE DIFFERENT EXECUTION SEMANTICS OF
NON-SEQUENTIAL SYSTEMS. VERSION 1.
R. Janicki and M. Koutny.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-02. 1987.]
108058 REFERENCE MANUAL OF MCMASTER POPLOG.
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-03. 1987.]
108059 USER'S GUIDE TO POP-11 OF MCMASTER POPLOG.
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-04. 1987.]
108060 COMPACT IMPLEMENTATION OF PROLOG AS A PART OF THE ENVIRONMENT OF
MCMASTER POPLOG.
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-05. 1987.]
108061 ISOMORPHISMS OF INFINITE STEINER TRIPLE SYSTEMS.
F. Franek.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-06. 1987.]
108062 ASPECTS OF COMPUTATIONAL CIRCUIT ANALYSIS.
W. M. Coughran Jr., E. Grosse, and D. J. Rose.
[Microelectronics Center of North Carolina. TR86-08. 1986.]
108063 PARALLEL PROCESSING OF CERTAIN VISION PRIMITIVES WITH TWO-DIMENSIONAL
SHUFFLE EXCHANGE NETWORK.
G.-G. Mei and W. Liu.
[Microelectronics Center of North Carolina. TR86-09. 1986.]
108064 A HEURISTIC GLOBAL ROUTER FOR POLYCELL LAYOUT.
V. K. De.
[Microelectronic Center of North Carolina. TR86-12. 1986.]
108065 MULTIPLE BUS INTERCONNECTION SCHEMES.
G. Kedem.
[Microelectronics Center of North Carolina. TR86-13. 1986.]
108066 STANDARD CELL PLACEMENT BY QUADRASECTION.
P. R. Suaris and G. Kedem.
[Microelectronics Center of North Carolina. TR86-14. 1986.]
108067 VLSI SIMULATION IN A CONCURRENT ENVIRONMENT.
R. Salama, W. Liu, and W. T. Krakow.
[Microelectronics Center of North Carolina. TR87-07. 1987.]
108068 THE COOKIE CUTTER ALGORITHM FOR HANDLING MIXED HIERARCHY.
N. G. Sullivan and J. B. Rosenberg.
[Microelectronics Center of North Carolina. TR87-10. 1987.]
108069 CONES: A CONCURRENT ENVIRONMENT SIMULATION.
R. Salama, W. Liu, and W. T. Krakow.
[Microelectronics Center of North Carolina. TR87-11. 1987.]
108070 APPROXIMATE POLYNOMIAL PRECONDITIONING APPLIED TO BIHARMONIC
EQUATIONS ON VECTOR SUPERCOMPUTERS.
Y. S. Wong and H. Jiang.
[National Aeronautics and Space Administration. NASA TM-100217. 1987.
Also issued as ICOMP-87-5, Institute for Computational Mechanics in
Propulsion, Lewis Research Center, National Aeronautics and Space
Administration.]
108071 TIME DELAYS IN DATA FLOW DESIGNS.
K. C. L. Seah and J. C. McCallum.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA6/87. 1987.]
108072 PROCEEDINGS OF THE SEMINAR ON CONCURRENT TRENDS IN MIS RESEARCH,
SATURDAY, 1 AUGUST 1987.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA8/87. 1987.]
108073 FASTER OPTIMAL PARALLEL PREFIX SUMS AND LIST RANKING.
R. Cole and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 117. 1987. Also
issued as Technical report 277, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
108074 ON FINDING LOWEST COMMON ANCESTORS: SIMPLIFICATION AND
PARALLELIZATION.
B. Schieber and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 118. 1987.]
108075 APPROXIMATE PARALLEL SCHEDULING. PART II: APPLICATIONS TO OPTIMAL
PARALLEL GRAPH ALGORITHMS IN LOGARITHMIC TIME.
R. Cole and U. Vishkin.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 119. 1987. Also
issued as Technical report 291, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
108076 ON SOME PARALLEL SIEVE OF PRIME NUMBERS GENERATION.
V. Fleyshgakker.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 120. 1987.]
108077 LONG RANGE CORRELATIONS IN LINEAR CONGRUENTIAL GENERATORS.
O. E. Percus and J. K. Percus.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 121. 1987.]
108078 ON THE EDITING DISTANCE BETWEEN TREES AND RELATED PROBLEMS.
K. Zhang and D. Shasha.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 122. 1987. Also
issued as Technical report 310, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
108079 DYNAMIC PROCESSOR ALLOCATION FOR PARALLEL ALGORITHMS IN IMAGE
PROCESSING.
R. A. Hummel and K. Zhang.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 123. 1987. Also
issued as Technical report 268, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
108080 AN ANALYTICAL MODEL FOR THE PERFORMANCE OF CONCURRENT B TREE
ALGORITHMS.
D. Shasha, V. Lanin, and J. Schmidt.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 124. 1987. Also
issued as Technical report 311, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
108081 DESIGNING VLSI NETWORK NODES TO REDUCE MEMORY TRAFFIC IN A SHARED
MEMORY PARALLEL COMPUTER.
S. Dickey et al.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 125. 1986.]
044061 THE SPECIFICATION OF NETWORK SERVICES.
J. Bowen, R. Gimson, and S. Topp-Jorgensen.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-61. 1987.]
044062 THE FORMAL DOCUMENTATION OF A BLOCKAGE STORAGE SERVICE.
R. Gimson.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-62. 1987.]
035336 BIBLIOGRAPHY OF THE COMPUTER SYSTEMS LABORATORY, 1968-1987.
N. Schulman.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-336.
October 1987.]
035337 DESIGN OF TESTBED AND EMULATION TOOLS.
M. J. Flynn and S. F. Lundstrom.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-337.
October 1987.]
035339 MIPS-X: THE EXTERNAL INTERFACE.
A. Salz, A. Agarwal, and P. Chow.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-339.
November 1987.]
108082 ARRAY TACTILE SENSING: INTEGRATION, CALIBRATION, AND APPLICATION.
E. Grant et al.
[Turing Institute. TIOP-87-008. 1987.]
108083 FINITE ELEMENT MESH GENERATION AND ISOPARAMETRIC ELEMENTS.
S. A. Hannaby.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 97/87. 1987.]
108084 CONTRIBUTIONS TO A NUMERICAL LIBRARY IN ADA.
G. T. Symm.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 98/87. 1987.]
108085 A CLASSIFIED BIBLIOGRAPHY ON PUBLICATIONS RELEVANT TO DATA SECURITY
IN LANS.
P. K. T. Vaswani.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 99/87. 1987.]
108086 ADVANCES IN RELIABLE NUMERICAL COMPUTATION: A SUMMARY.
M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 102/87. 1987. "This article contains a
summary of a research meeting held in honour of the late J. H.
Wilkinson...at the National Physical Laboratory, from 8-10 July
1987."]
108087 A CONJUGATE PROJECTED GRADIENT METHOD FOR QUADRATIC PROGRAMS WITH
SIMPLE CONSTRAINT SETS.
J.-P. Dusseault and J. A. Ferland.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 552. 1987.]
108088 INTERVAL-TYPE ALGORITHMS FOR GENERALIZED FRACTIONAL PROGRAMMING.
J.-C. Bernard and J. A. Ferland.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 589. 1986.]
108089 METHODS AND TOOLS FOR THE DESIGN AND VALIDATION OF PROTOCOL
SPECIFICATIONS AND IMPLEMENTATIONS.
G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 596. 1987.]
108090 BIBLIOGRAPHIE D'INFORMATIQUE MUSICALE 1976-1986.
E. Lauzon.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 600. 1986.]
108091 HYPERPATHS AND SHORTEST HYPERPATHS.
S. Nguyen and S. Pallottino.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 601. 1987.]
108092 SWITCH-LEVEL SIMULATION WITH LINEAR AND MAGNITUDE NETWORK MODELS.
E. Cerny and N. C. Rumin.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 602. 1987.]
108093 NONLINEAR SPATIAL PRICE EQUILIBRIUM.
J. A. Ferland, L. Zubieta, and H. Spiess.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 603. 1986.]
108094 PROCESS-ORIENTED SIMULATION IN PROLOG.
J. G. Vaucher and G. Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 604. 1987.]
108095 INTRODUCTION TO MODERN CRYPTOLOGY.
G. Brassard.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 606. 1987. Revised version: February
1987. "This version is preliminary. It was prepared for an IEEE
CompCon tutorial given on Friday, February 27th, 1987."]
108096 VECTOR CORRELATION IN MULTIVARIATE TIME SERIES.
R. Cleroux and R. Roy.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 607. 1987.]
108097 ETUDE COMPARATIVE DE DIFFERENTES MESURES DE LIAISON ENTRE VECTEURS
ALEATOIRES ET TESTS D'INDEPENDANCE.
A. Lazraq and R. Cleroux.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 610. 1987.]
108098 ON THE BEHAVIOR OF THE SAMPLE AUTOCOVARIANCES AND AUTOCORRELATIONS OF
A SEASONAL ARIMA MODEL.
A. Latour and R. Roy.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 611. 1987.]
108099 PARTIAL LINEARIZATION FOR GENERALIZED FRACTIONAL PROGRAMMING.
Y. Benadada and J. A. Ferland.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 612. 1987.]
108100 MULTIVARIATE ASSOCIATION AND INFERENCE PROBLEMS IN DATA ANALYSIS.
R. Cleroux.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 614. 1987.]
108101 ALTO: A COMPUTER SYSTEM FOR THE DESIGN AND EXPERIMENTATION OF ROUTING
ALGORITHMS.
J.-Y. Potvin, G. Lapalme, and J.-M. Rousseau.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 616. 1987.]
108102 UNE EXPERIMENTATION AVEC UN SYSTEME DE REPRESENTATION IMAGEE DE
RELATIONS MATHEMATIQUES SIMPLES.
G. Lemoyne, A. Senteni, and G. Lapalme.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 618. 1987.]
108103 UNE APPLICATION DE LA METHODOLOGIE ACTEUR A LA DEFINITION D'UNE
INTERFACE CONVIVIALE.
G. Lapalme and A. Senteni.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 619. 1987.]
108104 A RECORD PACKAGE FOR PROLOG.
J. G. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 620. 1987.]
108105 REPRESENTATION OF A CONVEX FUNCTION FROM ITS LEVEL SETS AND GOOD
ASYMPTOTICAL BEHAVIOUR OF CONVEX FUNCTIONS.
A. Auslender and J. P. Crouzeix.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 621. 1987.]
108106 SPECIFICATIONS OF A SIMPLIFIED TRANSPORT USING DIFFERENT FORMAL
DESCRIPTION TECHNIQUES.
G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 623. 1987.]
108107 PRINCIPLES OF PROTOCOL CONVERSION AND COMMUNICATION GATEWAYS.
G. v. Bochmann.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 624. 1987.]
108108 MODELES DE SERIES CHRONOLOGIQUES AVEC SEUILS.
G. Melard and R. Roy.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 625. 1987.]
108109 BROWSING TECHNIQUES IN IMAGE DATABASES.
J. Gecsei.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 627. 1987.]
108110 TRACE ANALYSIS FOR CONFORMANCE AND ARBITRATION TESTING.
G. v. Bochmann, R. Dssouli, and J. R. Zhao.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 629. 1987.]
108111 STATISTICALLY FOUNDED DEGREES OF BELIEF.
F. Bacchus.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-02. 1987.]
108112 SYMBOLIC GENERATION OF ROBOT DYNAMICS EQUATIONS.
R. W. Toogood.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-04. 1987.]
108113 CURVED MONDRIANS: A GENERALIZED APPROACH TO SHAPE FROM SHADING.
W. F. Bischof and M. Ferraro.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-06. 1987.]
108114 TYPE-SHIFTING RULES AND THE SEMANTICS OF INTERROGATIVES.
J. Groenendijk and M. Stokhof.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-01. 1987.]
108115 FRAME REPRESENTATION AND DISCOURSE REPRESENTATIONS.
R. Bartsch.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-02. 1987.]
108116 UNIQUE NORMAL FORMS FOR LAMBDA CALCULUS WITH SURJECTIVE PAIRING.
J. W. Klop and R. de Vrijer.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-03. 1987.]
108117 POLYADIC QUANTIFIERS.
J. van Bentham.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-04. 1987.]
108118 TRADITIONAL LOGICIANS AND DE MORGAN'S EXAMPLE.
V. S. Valencia.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-05. 1987.]
108119 THE IMPACT OF HIERARCHICAL MEMORY SYSTEMS ON LINEAR ALGEBRA ALGORITHM
DESIGN.
K. Gallivan et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 625. 1987.]
108120 USING MEMORY IN THE CEDAR SYSTEM.
R. E. McGrath and P. Emrath.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 655. 1987.]
108121 NONPREEMPTIVE RUN-TIME SCHEDULING ISSUES ON A MULTITASKED,
MULTIPROGRAMMED MULTIPROCESSOR WITH DEPENDENCIES, BIDIMENSIONAL
TASKS, FOLDING AND DYNAMIC GRAPHS.
A. R. Miller.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 656. 1987. Thesis (Ph.D.).]
108122 PARALLEL COMPUTATION OF A DOMAIN DECOMPOSITION METHOD.
R. C. Y. Chin et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 657. 1987.]
108123 A PARALLEL BLOCK CYCLIC REDUCTION ALGORITHM FOR THE FAST SOLUTION OF
ELLIPTIC EQUATIONS.
E. Gallopoulos and Y. Saad.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 659. 1987.]
108124 A POLYNOMIAL BASED ITERATIVE METHOD FOR LINEAR PARABOLIC EQUATIONS.
M. J. Schaefer.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 661. 1987. Thesis (Ph.D.).]
108125 PSOLVE: A CONCURRENT ALGORITHM FOR SOLVING SPARSE SYSTEMS OF LINEAR
EQUATIONS.
T. A. Davis and E. S. Davidson.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 662. 1987.]
108126 THE INFLUENCE OF MEMORY HIERARCHY ON ALGORITHM ORGANIZATION:
PROGRAMMING FFTS ON A VECTOR MULTIPROCESSOR.
D. Gannon and W. Jalby.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 663. 1987.]
108127 AUTOMATIC RESTRUCTURING OF FORTRAN PROGRAMS FOR PARALLEL EXECUTION.
C. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 665. 1987.]
108128 ON FINDING THE VERTEX CONNECTIVITY OF GRAPHS.
M. Girkar and M. Sohoni.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 669. 1987.]
108129 THE EFFECTIVENESS OF CACHES AND DATA PREFETCH BUFFERS IN LARGE-SCALE
SHARED MEMORY MULTIPROCESSORS.
R. L. Lee.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 670. 1987. Thesis (Ph.D.).]
108130 SUPERCOMPUTER PROGRAMMING ENVIRONMENTS.
D. A. Padua, V. A. Guarna Jr., and D. H. Lawrie.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 673. 1987.]
108131 A MEASUREMENT-BASED STUDY OF CONCURRENCY IN A MULTIPROCESSOR.
P. J. McGuire.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 674. 1987. Thesis (M.S.).]
108132 PARALLEL RAY TRACING IN A VECTOR-MULTIPROCESSING ENVIRONMENT.
D. E. Defend.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 677. 1987. Thesis (M.S.).]
108133 A PERFORMANCE ANALYSIS OF ARCHITECTURAL SCALABILITY.
A. Y.-W. Kwok.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 679. 1987. Thesis (Ph.D.).]
108134 ACCELERATION TECHNIQUES FOR DECOUPLING ALGORITHMS IN SEMICONDUCTOR
SIMULATION.
T. Kerkhoven and Y. Saad.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 686. 1987.]
108135 FAST POISSON SOLVER ON IRREGULAR REGIONS BY BOUNDARY INTEGRAL-BASED
DOMAIN DECOMPOSITION METHODS.
D. Lee and E. Gallopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 687. 1987.]
108136 A PARALLEL QUASI-NEWTON METHOD FOR PARTIALLY SEPARABLE LARGE SCALE
MINIMIZATION.
M.-Q. Chen and S.-P. Han.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 689. 1987.]
108137 CONTEXT SWITCHING WITH MULTIPLE REGISTER WINDOWS: A RISC PERFORMANCE
STUDY.
M. B. Konsek, D. A. Reed, and W. Watcharawittayakul.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1377. 1987.]
108138 MINIMUM DIAMETER PARTITIONING OF A PLANAR POINT SET IN QUADRATIC TIME.
H. Edelsbrunner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1378. 1987.]
108139 PROBING CONVEX POLYGONS WITH HALF-PLANES.
S. S. Skiena.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1380. 1987.]
108140 MECHANISMS OF ANALOGICAL LEARNING.
D. Gentner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1381. 1987.]
108141 A DYNAMIC JOB SCHEDULING SYSTEM FOR A UNIX BASED DISTRIBUTED SYSTEM.
R. Chen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1382. 1987.]
108142 CONDENSED CHEMICAL KINETIC EQUATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1383. 1987.]
108143 FOIBLE: A FRAMEWORK FOR OBJECT-ORIENTED INTERACTIVE BOX AND LINE
ENVIRONMENTS.
S. D. Ericson.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1384. 1987. Thesis (M.S.).]
108144 DAES: ODES WITH CONSTRAINTS AND INVARIANTS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1385. 1987.]
108145 INCREMENTAL COMPACTION OF FLAT SYMBOLIC LAYOUTS.
L. G. Jones.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1386. 1987.]
108182 GENERALIZED I/O WITH TIMING CONSTRAINTS.
I. Lee and S. B. Davidson.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-01. 1987.]
108183 IMPLICIT ACQUISITION OF USER MODELS IN COOPERATIVE ADVISORY SYSTEMS.
R. Kass.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-05. 1987.
"A dissertation proposal." Also issued as LINC LAB 49, Laboratory for
Language, Information and Computation, Moore School of Electrical
Engineering, University of Pennsylvania.]
108184 INFORMATION MAPS FOR ACTIVE SENSOR CONTROL.
G. Hager.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-07. 1987.
Also issued as GRASP LAB 91, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108185 AN AGENT SPECIFICATION LANGUAGE.
G. Hager.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-08. 1987.
Also issued as GRASP LAB 92, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108186 ESTIMATION PROCEDURES FOR ROBUST SENSOR CONTROL.
G. Hager and M. Mintz.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-09. 1987.
Also issued as GRASP LAB 93, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108187 RULES FOR THE IMPLICIT ACQUISITION OF KNOWLEDGE ABOUT THE USER.
R. Kass and T. Finin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-10. 1987.
Also issued as LINC LAB 50, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108188 A DISTRIBUTED SYSTEM FOR ROBOT MANIPULATOR CONTROL: NSF GRANT
ECS84-11879.
R. P. Paul et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-11. 1987.
Also issued as GRASP LAB 94, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108189 TYPES AND PERSISTENCE IN DATABASE PROGRAMMING LANGUAGES.
M. P. Atkinson and O. P. Buneman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-12. 1987.
Revised: September 1987.]
108190 INCORPORATING POSTSCRIPT AND MACINTOSH FIGURES IN TEX.
T. Darrell.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-13. 1987.
Also issued as GRASP LAB 95, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108191 COMBINATORY GRAMMARS AND PARASITIC GAPS.
M. Steedman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-15. 1987.
Also issued as LINC LAB 51, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108192 THE INTEGRATION OF SENSING WITH ACTUATION TO FORM A ROBUST
INTELLIGENT CONTROL SYSTEM: NSF GRANT DMC 85-12838.
R. P. Paul et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-17. 1987.
Also issued as GRASP LAB 97, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108193 RANGE IMAGE INTERPRETATION OF MAIL PIECES WITH SUPERQUADRICS.
F. Solina and R. Bajcsy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-18. 1987.
Also issued as GRASP LAB 98, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108194 THREE DIMENSIONAL-OBJECT REPRESENTATION REVISITED.
R. Bajcsy and F. Solina.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-19. 1987.
Also issued as GRASP LAB 99, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108195 PARALLEL ALGORITHMS FOR SHORTEST PATH PROBLEMS IN POLYGONS.
H. A. ElGindy and M. T. Goodrich.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-20. 1987.
"Extended abstract."]
108196 COMMENTS ON: THE COMPUTATION OF THE CONVEX HULL OF A SIMPLE POLYGON
IN LINEAR TIME.
H. A. ElGindy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-21. 1987.]
108197 SPADES: AN EXPERT SYSTEM FOR SCREENING OF PENSION APPLICATIONS AND
DETERMINATION SUPPORT.
M. Harwood et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-23. 1987.
Also issued as LINC LAB 53, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108198 HEREDITARY HARROP FORMULAS AND UNIFORM PROOF SYSTEMS.
D. A. Miller, G. Nadathur, and A. Scedrov.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-24. 1987.
Also issued as LINC LAB 54, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108199 WHAT'S SO SPECIAL ABOUT KRUSKAL'S THEOREM AND THE ORDINAL GAMMA
SUBSCRIPT 0?
J. H. Gallier.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-27. 1987.]
108200 THEOREM PROVING USING RIGID E-UNIFICATION: EQUATIONAL MATINGS.
J. H. Gallier, S. Raatz, and W. Snyder.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-28. 1987.
Also issued as LINC LAB 56, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108201 EXPLORATORY VISUAL SENSING FOR DETERMINING SPATIAL LAYOUT WITH AN
AGILE STEREO CAMERA SYSTEM.
E. P. Krotkov.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-29. 1987.
Thesis (Ph.D.). Also issued as GRASP LAB 101, General Robotics and
Active Sensory Processing Laboratory, Moore School of Electrical
Engineering, University of Pennsylvania.]
108202 A COMPACT REPRESENTATION OF PROOFS.
D. A. Miller.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-30. 1987.
Also issued as LINC LAB 57, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108203 A COMPUTATIONAL TREATMENT OF LOCATIVE RELATIONS IN NATURAL LANGUAGE.
E. M. Hays.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-31. 1987.
Also issued as LINC LAB 58, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108204 TEMPORAL ONTOLOGY IN NATURAL LANGUAGE.
M. Moens and M. Steedman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-32. 1987.
Also issued as LINC LAB 59, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108205 A LAZY WAY TO CHART-PARSE WITH CATEGORIAL GRAMMARS.
R. Pareschi and M. Steedman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-33. 1987.
Also issued as LINC LAB 60, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108206 THE INTERPRETATION OF TENSE IN DISCOURSE.
B. L. Webber.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-34. 1987.
Also issued as LINC LAB 61, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108207 A PARALLEL SOLUTION TO ROBOT INVERSE KINEMATICS.
H. Zhang and R. P. Paul.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-36. 1987.
Also issued as GRASP LAB 102, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108208 THE UTILIZATION OF PROCESSORS INTERCONNECTED WITH A RECONFIGURABLE
NETWORK.
D. L. Smitley.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-37. 1987.
Thesis (Ph.D.). Also issued as GRASP LAB 104, General Robotics and
Active Sensory Processing Laboratory, Moore School of Electrical
Engineering, University of Pennsylvania.]
108209 MINIMAL CONSEQUENCE IN SENTENTIAL LOGIC.
M.-A. Papalaskari and S. Weinstein.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-43. 1987.
Also issued as LINC LAB 66, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108210 THE "MONEY CHANGING PROBLEM" IS NP-COMPLETE.
N. Abe.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-45. 1987.
Also issued as LINC LAB 67, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108211 THE MECHANICS AND PLANNING OF ENVELOPING GRASPS.
J. C. Trinkle.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-46. 1987.
Thesis (Ph.D.). Also issued as GRASP LAB 108, General Robotics and
Active Sensory Processing Laboratory, Moore School of Electrical
Engineering, University of Pennsylvania.]
108212 AN AID TO DATABASE DESIGN: AN INDUCTIVE INFERENCE APPROACH.
S. V. Lanka.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-47. 1987.
Thesis (Ph.D.). Also issued as LINC LAB 68, Laboratory for Language,
Information and Computation, Moore School of Electrical Engineering,
University of Pennsylvania.]
108213 A HIGHER-ORDER LOGIC AS THE BASIS FOR LOGIC PROGRAMMING.
G. Nadathur.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-48. 1987.
Thesis (Ph.D.). Also issued as LINC LAB 69, Laboratory for Language,
Information and Computation, Moore School of Electrical Engineering,
University of Pennsylvania.]
108214 LEARNING ALGORITHMS FOR CONNECTIONIST NETWORKS: APPLIED GRADIENT
METHODS OF NONLINEAR OPTIMIZATION.
R. L. Watrous.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-51. 1987.
Also issued as LINC LAB 72, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108215 LINE-BASED STEREO MATCHING.
K. Henriksen.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-52. 1987.
Also issued as GRASP LAB 109, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108216 REDUNDANCY: AN APPROACH TO THE EFFICIENT IMPLEMENTATION OF SEMANTIC
INTEGRITY ASSERTIONS.
M. N. Kamel and S. B. Davidson.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-53. 1987.]
108217 MOTIVATING TIME AS A FIRST CLASS ENTITY.
I. Lee, S. B. Davidson, and V. Wolfe.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-54. 1987.
Revised: October 1987.]
108218 A MODULAR FEEDBACK SYSTEM FOR IMAGE SEGMENTATION.
H. L. Anderson, R. Bajcsy, and M. Mintz.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-56. 1987.
Also issued as GRASP LAB 110, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108219 EXPLAINING AND REFINING DECISION-THEORETIC CHOICES.
D. A. Klein.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-57. 1987.
"Doctoral thesis proposal." Also issued as LINC LAB 74, Laboratory
for Language, Information and Computation, Moore School of Electrical
Engineering, University of Pennsylvania.]
108220 REPRESENTING GENERIC OBJECTS FOR EXPLORATION AND RECOGNITION.
S. A. Stansfield.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-61. 1987.
Also issued as GRASP LAB 112, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
108221 BBC: A BLACKBOARD GENERATING SYSTEM.
J. Levy and T. Finin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-62. 1987.
Also issued as LINC LAB 77, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108222 ABDUCTIVE REASONING IN MULTIPLE FAULT DIAGNOSIS.
G. Morris and T. Finin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-63. 1987.
Also issued as LINC LAB 78, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
108223 CONNECTIONISM AND COGNITIVE ARCHITECTURE: A CRITICAL ANALYSIS.
J. A. Fodor and Z. W. Pylyshyn.
[University of Western Ontario. Centre for Cognitive Science.
Cognitive science memorandum (COGMEM) 29. 1987.]
108224 FUNDAMENTAL SOLUTIONS FOR MULTIVARIATE DIFFERENCE EQUATIONS AND
APPLICATIONS TO CARDINAL INTERPOLATION.
C. de Boor, K. Hoellig, and S. Riemenschneider.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 720. 1987.]
108225 REMARKS ON THE SOLUTION OF TOEPLITZ SYSTEMS OF EQUATIONS.
S. V. Parter.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 721. 1987.]
108226 REGISTER ALLOCATION AND CODE SCHEDULING FOR LOAD/STORE ARCHITECTURES.
W.-C. Hsu.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 722. 1987. Thesis (Ph.D.).]
108227 BERMUDA - AN ARCHITECTURAL PERSPECTIVE ON INTERFACING PROLOG TO A
DATABASE MACHINE.
Y. E. Ioannidis et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 723. 1987.]
108228 RULE-BASED QUERY OPTIMIZATION IN EXTENSIBLE DATABASE SYSTEMS.
G. Graefe.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 724. 1987. Thesis (Ph.D.).]
108229 FINDING WITNESSES USING FEWER RANDOM BITS.
V. Shoup.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 725. 1987.]
108230 NONCONSTRUCTIVE TOOLS FOR PROVING POLYNOMIAL-TIME DECIDABILITY.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-86-163.
1987. Revised: August 1987.]
108231 RESOURCE ALLOCATION UNDER LIMITED SHARING.
M. A. Langston and M. P. Morford.
[Washington State University. Computer Science Department. CS-87-164.
1987.]
108232 ON-LINE VARIABLE SIZED BIN PACKING.
N. G. Kinnersley and M. A. Langston.
[Washington State University. Computer Science Department. CS-87-165.
1987.]
108233 STABLE SET AND MULTISET OPERATIONS IN OPTIMAL TIME AND SPACE.
B.-C. Huang and M. A. Langston.
[Washington State University. Computer Science Department. CS-87-166.
1987.]
108234 BISIMULATION OF AUTOMATA.
D. B. Benson and O. Ben-Shachar.
[Washington State University. Computer Science Department. CS-87-167.
1987.]
108235 THE SHUFFLE BIALGEBRA.
D. B. Benson.
[Washington State University. Computer Science Department. CS-87-168.
1987.]
108236 BIALGEBRAS: SOME FOUNDATIONS FOR DISTRIBUTED AND CONCURRENT
COMPUTATION.
D. B. Benson.
[Washington State University. Computer Science Department. CS-87-169.
1987.]
108237 FAST STABLE MERGING AND SORTING IN CONSTANT EXTRA SPACE.
B.-C. Huang and M. A. Langston.
[Washington State University. Computer Science Department. CS-87-170.
1987.]
108238 POLYNOMIAL-TIME SELF-REDUCIBILITY: THEORETICAL MOTIVATIONS AND
PRACTICAL RESULTS.
D. J. Brown, M. R. Fellows, and M. A. Langston.
[Washington State University. Computer Science Department. CS-87-171.
1987.]
108239 LOGICS OF PROGRAMS.
D. Kozen and J. Tiuryn.
[Washington State University. Computer Science Department. CS-87-172.
1987.]
108240 FIXED POINTS IN FREE PROCESS ALGEBRAS, PART I.
D. B. Benson and J. Tiuryn.
[Washington State University. Computer Science Department. CS-86-152.
1987. Revised: September 1987.]
108241 FIXED POINTS IN FREE PROCESS ALGEBRAS, PART II.
J. Tiuryn and D. B. Benson.
[Washington State University. Computer Science Department. CS-87-173.
1987.]
108242 FAST SELF-REDUCTION ALGORITHMS FOR COMBINATORIAL PROBLEMS OF VLSI
DESIGN.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. 1987.
"Extended abstract."]
108243 LAYOUT PERMUTATION PROBLEMS AND WELL-PARTIALLY-ORDERED SETS.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. 1987.
"Extended abstract."]
VOL. 10, NO. 2 01/29/88
108244 MIMO: A GENERAL FRAMEWORK OF PROGRAM RELIABILITY.
L. Ruquan.
[Academia Sinica. Institute of Mathematics. Research memorandum. C.
9. 1987.]
108245 PERSISTENCE AND PROBABILISTIC INFERENCE.
T. Dean and K. Kanazawa.
[Brown University. Computer Science Department. Technical report
CS-87-23. 1987.]
108246 DETECTING EQUALITY OF VARIABLES IN PROGRAMS.
B. Alpern, M. N. Wegman, and F. K. Zadeck.
[Brown University. Computer Science Department. Technical report
CS-87-24. 1987.]
108247 GLOBAL VALUE NUMBERS AND REDUNDANT COMPUTATIONS.
B. K. Rosen, M. N. Wegman, and F. K. Zadeck.
[Brown University. Computer Science Department. Technical report
CS-87-25. 1987.]
108248 C++ ON A PARALLEL MACHINE.
T. W. Doeppner Jr. and A. J. Gebele.
[Brown University. Computer Science Department. Technical report
CS-87-26. 1987.]
108249 ON THE RELATIONSHIP OF CONGRUENCE CLOSURE AND UNIFICATION.
P. C. Kanellakis and P. Z. Revesz.
[Brown University. Computer Science Department. Technical report
CS-87-27. 1987.]
108250 LOGIC FROM PROGRAMMING LANGUAGE SEMANTICS.
Y. Choo.
[California Institute of Technology. Computer Science Department.
Report no. 5249:TR:87. 1987. Thesis (Ph.D.).]
108251 IMAGES, NUMERICAL ANALYSIS OF SINGULARITIES AND SHOCK FILTERS.
L. I. Rudin.
[California Institute of Technology. Computer Science Department.
Report no. 5250:TR:87. 1987. Thesis (Ph.D.).]
108252 CONDITIONAL KNOWLEDGE AS A BASIS FOR DISTRIBUTED SIMULATION.
K. M. Chandy and J. Misra.
[California Institute of Technology. Computer Science Department.
Report no. 5251:TR:87. 1987. "Preliminary draft."]
108253 A SYNTHESIS METHOD FOR SELF-TIMED VLSI CIRCUITS.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Report no. 5256:TR:87. 1987.]
108254 THE C PROGRAMMER'S ABBREVIATED GUIDE TO MULTICOMPUTER PROGRAMMING
(THE SHORT-C-GUIDE).
C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Report no. 5252:TR:87. 1987. "Corresponds to the Cosmic Environment
version 7.1."]
108255 CN YUR CMPUTR RAED THS?
L. G. Means.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6079. 1987.]
108256 A ROBUST ESTIMATOR FOR WALL FOLLOWING.
C.-M. Wang.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6087. 1987.]
108257 LAZY PATTERN MATCHING IN THE ML LANGUAGE.
A. Laville.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 664. 1987.]
108258 RE-ROUTING AND RESEQUENCING IN MULTISTAGE INTERCONNECTION NETWORKS.
A. Jean-Marie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 666. 1987.]
108259 THE RUDIMENTS OF OBJECT DISTRIBUTION IN A DISTRIBUTED SYSTEM.
C. Jard and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 668. 1987. Also issued as report no.
358, Institut de Recherche en Informatique et Systemes Aleatoires
(IRISA).]
108260 DE LA DEDUCTION NATURELLE A LA MACHINE CATEGORIQUE.
Y. Lafont.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 670. 1987.]
108261 DECIDABILITY OF THE CONFLUENCE OF GROUND TERM REWRITING SYSTEMS.
P. Lescanne et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 675. 1987.]
108262 HOW TO CHARACTERIZE THE LANGUAGE OF GROUND NORMAL FORMS.
J.-L. Remy and H. Comon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 676. 1987.]
108263 TERMINATION OF REWRITING SYSTEMS BY POLYNOMIAL INTERPRETATIONS AND
ITS IMPLEMENTATION.
A. BenCherifa and P. Lescanne.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 677. 1987.]
108264 ON WORD PROBLEMS IN EQUATIONAL THEORIES.
M. Rusinowitch and J. Hsiang.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 678. 1987.]
108265 ON TERMINATION OF THE DIRECT SUM OF TERM REWRITING SYSTEMS.
M. Rusinowitch.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 679. 1987.]
108266 SCHEMATIZATION OF INFINITE SETS OF REWRITE RULES: APPLICATIONS TO THE
DIVERGENCE OF COMPLETION PROCESSES.
H. Kirchner.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 680. 1987.]
108267 IMPROVING BASIC NARROWING TECHNIQUES AND COMMUTATION PROPERTIES.
P. Rety.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 681. 1987.]
108268 PROVING INDUCTIVE EQUALITIES: ALGORITHMS AND IMPLEMENTATION.
A. Lazrek, P. Lescanne, and J.-J. Thiel.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 682. 1987.]
108269 A DENOTATIONAL THEORY OF SYNCHRONOUS COMMUNICATING SYSTEMS.
A. Benveniste and P. Le Guernic.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 685. 1987.]
108270 SOLVING DISEQUATIONS.
C. Kirchner and P. Lescanne.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 686. 1987.]
108271 THE FORK-JOIN QUEUE AND RELATED SYSTEMS WITH SYNCHRONIZATION
CONSTRAINTS: STOCHASTIC ORDERING, APPROXIMATIONS AND COMPUTABLE
BOUNDS.
F. Baccelli, A. M. Makowski, and A. Shwartz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 687. 1987.]
108272 ACYCLIC FORK-JOIN QUEUEING NETWORKS.
F. Baccelli, W. A. Massey, and D. Towsley.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 688. 1987.]
108273 KNOWLEDGE-BASED METHODOLOGY IN PATTERN RECOGNITION AND UNDERSTANDING.
J.-P. Haton.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 691. 1987.]
108274 AN ACTIVE STABLE STORAGE AND ITS INTEGRATION IN A MULTIPROCESSOR
ARCHITECTURE.
M. Banatre, G. Muller, and J.-P. Banatre.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 693. 1987. Also issued as publication
interne 362, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108275 DISTRIBUTED SYSTEM STRUCTURING USING MULTI-FUNCTIONS.
J.-P. Banatre, M. Banatre, and F. Ployette.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 694. 1987. Also issued as publication
interne 363, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108276 MSQL: A MULTIDATABASE LANGUAGE.
W. Litwin et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 695. 1987.]
108277 A MAXIMUM-LIKELIHOOD FRAMEWORK FOR DETERMINING MOVING EDGES IN IMAGE
SEQUENCES.
P. Bouthemy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 696. 1987. Also issued as publication
interne 365, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108278 AN ESTIMATION-BASED APPROACH TO THE RECONSTRUCTION OF OPTICAL FLOW.
A. Rougee, B. C. Levy, and A. S. Willsky.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 697. 1987. Also issued as publication
interne 366, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108279 COMPUTER REPRESENTATION AND ANIMATION OF MATHEMATICAL PROOFS WITH
DYNABOARD.
M. Kaltenbach.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 700. 1987.]
108280 DEPTH-FIRST TRAVERSAL AND VIRTUAL RING CONSTRUCTION IN DISTRIBUTED
SYSTEMS.
J.-M. Helary and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 704. 1987. Also issued as publication
interne 369, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108281 ON THE EXTERNAL BOUNDARY OF A UNION OF RAYS.
J.-D. Boissonnat and F. P. Preparata.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 705. 1987.]
108282 PRINCIPLES FOR PROBLEM AGGREGATION AND ASSIGNMENT IN MEDIUM SCALE
MULTIPROCESSORS.
D. M. Nicol and J. H. Saltz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-39. 1987.]
108283 MAPPING A BATTLEFIELD SIMULATION ONTO MESSAGE-PASSING PARALLEL
ARCHITECTURES.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-51. 1987.]
108284 SCHEDULES FOR MAPPING IRREGULAR PARALLEL COMPUTATION.
D. M. Nicol and J. H. Saltz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-52. 1987.]
108285 COMPARING BARRIER ALGORITHMS.
N. S. Arenstorf and H. F. Jordan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-65. 1987.]
108286 MULTIPATH HIERARCHIES IN INTERCONNECTION NETWORKS.
P. A. Franaszek and C. J. Georgiou.
[International Business Machines Corporation (IBM). Research
Division. RC 12583. 1987.]
108287 UNDERSTANDING INTELLIGENT HELP: A PROTOCOL ANALYSIS OF ADVISORY
INTERACTIONS.
A. Aaronson and J. M. Caroll.
[International Business Machines Corporation (IBM). Research
Division. RC 13059. 1987.]
108288 INCREMENTAL ITERATIVE DATA FLOW ANALYSIS ALGORITHMS.
M. Burke and B. G. Ryder.
[International Business Machines Corporation (IBM). Research
Division. RC 13170. 1987.]
108289 INCREMENTAL EVALUATION OF ATTRIBUTED GRAPHS.
B. Alpern et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13205. 1987.]
108290 ON SIMULATING FAULTS IN PARALLEL.
V. S. Iyengar and D. T. Tang.
[International Business Machines Corporation (IBM). Research
Division. RC 13206. 1987.]
108291 RANDOM SELF-REDUCIBILITY AND ZERO KNOWLEDGE INTERACTIVE PROOFS OF
POSSESSION OF INFORMATION.
M. Tompa and H. Woll.
[International Business Machines Corporation (IBM). Research
Division. RC 13207. 1987.]
108292 CALIBRATING A CARTESIAN ROBOT WITH EYE-ON-HAND CONFIGURATION
INDEPENDENT OF EYE-TO-HAND RELATIONSHIP.
R. Lenz and R. Y. Tsai.
[International Business Machines Corporation (IBM). Research
Division. RC 13211. 1987.]
108293 A COMPILATION TECHNIQUE FOR SOFTWARE PIPELINING OF LOOPS WITH
CONDITIONAL JUMPS.
K. Ebcioglu.
[International Business Machines Corporation (IBM). Research
Division. RC 13214. 1987.]
108294 NOISY SORT, A MEMORY INTENSIVE SORTING ALGORITHM.
S. Horiguchi and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. RC 13218. 1987.]
108295 DESIGN PRINCIPLES OF OPERATING SYSTEMS FOR LARGE SCALE MULTICOMPUTERS.
A. Barak and Y. Kornatzky.
[International Business Machines Corporation (IBM). Research
Division. RC 13220. 1987.]
108296 EXPECTED RESPONSE TIME FOR FCFS FEEDBACK QUEUE WITH MULTIPLE CLASSES.
R. D. Nelson.
[International Business Machines Corporation (IBM). Research
Division. RC 13221. 1987.]
108297 A WIRE-LENGTH MINIMIZATION ALGORITHM FOR LAYOUT WITH JOGS.
J. Lee, M. Kolinek, and C.-K. Wong.
[International Business Machines Corporation (IBM). Research
Division. RC 13225. 1987.]
108298 SPEED, ACCURACY, FLEXIBILITY TRADE-OFFS IN ON-LINE CHARACTER
RECOGNITION.
C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. RC 13228. 1987.]
108299 CALCULATING JOINT QUEUE LENGTH DISTRIBUTIONS IN PRODUCT FORM QUEUEING
NETWORKS.
E. de Souza e Silva and S. S. Lavenberg.
[International Business Machines Corporation (IBM). Research
Division. RC 13235. 1987.]
108300 A GRAPHICAL ENTITY-RELATIONSHIP DATABASE BROWSER.
L. M. Burns, J. L. Archibald, and A. Malhotra.
[International Business Machines Corporation (IBM). Research
Division. RC 13238. 1987.]
108301 PASSIVE OPTICAL STAR AS A BUILDING BLOCK OF A DISTRIBUTED SYSTEM.
Y. Ofek.
[International Business Machines Corporation (IBM). Research
Division. RC 13247. 1987.]
108302 SPEECH RECOGNITION USING NOISE-ADAPTIVE PROTOTYPES.
A. Nadas, D. Nahamoo, and M. A. Picheny.
[International Business Machines Corporation (IBM). Research
Division. RC 13261. 1987.]
108303 TWO NON-PARAMETRIC CONFIDENCE INTERVALS.
N. B. Waite.
[International Business Machines Corporation (IBM). Research
Division. RC 13268. 1987.]
108304 DEFINING DOCUMENT STYLES FOR WYSIWYG PROCESSING.
D. D. Chamberlin, H. F. Hasselmeier, and D. P. Paris.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5812. 1987.]
108305 APPROXIMATE COUNTING WITH UNIFORM CONSTANT DEPTH CIRCUITS.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5896. 1987.]
108306 ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM
APPROXIMATELY.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5898. 1987.]
108307 FAST PARALLEL COMPUTATION OF PERFECT AND STRONGLY PERFECT ELIMINATION
SCHEMES.
E. Dahlhaus and M. Karpinski.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5901. 1987.]
108308 PERFECT MATCHING FOR REGULAR GRAPHS IS AC SUPERSCRIPT 0-HARD FOR THE
GENERAL MATCHING PROBLEM.
E. Dahlaus and M. Karpinski.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5902. 1987.]
108309 ASYMPTOTIC BEHAVIOR OF THE CHROMATIC INDEX FOR HYPERGRAPHS.
N. Pippenger and J. Spencer.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5916. 1987.]
108310 DESIGN OF A MEASUREMENT INSTRUMENT FOR DISTRIBUTED SYSTEMS.
M. Abrams.
[International Business Machines Corporation (IBM). Research
Division. RZ 1639. 1987.]
108311 SEMANTICS FOR PROLOG VIA TERM REWRITE SYSTEMS.
J. C. M. Baeten and W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8739. 1987.]
108312 SEMANTICS FOR LOGIC PROGRAMS WITHOUT OCCUR CHECKS.
W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8740. 1987.]
108313 INTRODUCTION TO LOGIC PROGRAMMING.
K. R. Apt.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8741. 1987.]
108314 INTELLIGENT SYSTEMS INTERCONNECTION: WHAT SHOULD COME AFTER OPEN
SYSTEMS INTERCONNECTION?
P. Bernus and Z. Letray.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8742. 1987.]
108315 LOCALITY, COMMUNICATION, AND INTERCONNECT LENGTH IN MULTICOMPUTERS.
P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8743. 1987. Revised and expanded: August 1987.
Revision of the January 1987 version (CWI report CS-R8708).]
108316 DESIGN AS A FORMAL, KNOWLEDGE ENGINEERED ACTIVITY.
V. Akman, P. J. W. ten Hagen, and T. Tomiyama.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8744. 1987.]
108317 KNOWLEDGE ENGINEERING IN DESIGN.
V. Akman et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8745. 1987.]
108318 RESOURCE MANAGEMENT IN DICE.
R. van Liere and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8746. 1987.]
108319 CORRECTNESS PROOFS FOR SYSTOLIC ALGORITHMS: A PALINDROME RECOGNIZER.
W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8747. 1987.]
108320 READIES AND FAILURES IN THE ALGEBRA OF COMMUNICATING PROCESSES.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8748. 1987. "This paper is an extensive revision of
CWI report CS-R8523." Revised: October 1987.]
108321 PRINCIPLES OF LAZY AND INCREMENTAL PROGRAM GENERATION.
J. Heering, P. Klint, and J. Rekers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8749. 1987.]
108322 DISTRIBUTED MATCH-MAKING.
S. J. Mullender and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8750. 1987.]
108323 A VERY SIMPLE CONSTRUCTION FOR ATOMIC MULTIWRITER REGISTER.
M. Li and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8751. 1987. "Extended abstract."]
108324 TAPE VERSUS QUEUE AND STACKS: THE LOWER BOUNDS.
M. Li and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8752. 1987. Revised: November 1987. "Originally
submitted in early 1984 as two separate papers."]
108325 C-GKS, A C IMPLEMENTATION OF GKS, THE GRAPHICAL KERNEL SYSTEM.
M. M. de Ruiter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8753. 1987.]
108326 PROPOSAL FOR STANDARD MATHEMATICAL PACKAGES IN ADA.
J. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8718. 1987.]
108327 NUMVEK FORTRAN LIBRARY MANUAL. CHAPTER: SIMULTANEOUS LINEAR
EQUATIONS. ROUTINE: SVDTJP AND LSQMNS.
P. P. M. de Rijk.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8719. 1987.]
108328 VECTORIZATION OF THE ODD-EVEN HOPSCOTCH SCHEME AND THE ALTERNATING
DIRECTION IMPLICIT SCHEME FOR THE TWO-DIMENSIONAL BURGER'S EQUATIONS.
E. D. de Goede and J. H. M. ten Thije Boonkkamp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8720. 1987.]
108329 RESIDUAL SMOOTHING FOR ACCELERATING THE ADI ITERATION METHOD FOR
ELLIPTIC DIFFERENCE EQUATIONS.
J. H. M. ten Thije Boonkkamp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8721. 1987.]
108330 A SIMULATION GAME ADMINISTRATION SYSTEM.
G. K. Yeo and B. W. Chew.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA7/87. 1987.]
108331 OPTIMAL PROPERTIES OF SEMIJOIN SEQUENCES FOR DISTRIBUTED QUERY
PROCESSING.
B. Srinivasan.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB7/87. 1987.]
108332 CONCURRENCY IN INDEXED SEQUENTIAL FILES.
B. Srinivasan and K. J. McDonnell.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB8/87. 1987.]
108333 SEMANTICS OF EXTENDED UNIFICATION FOR LOGIC PROGRAMS WITH EQUALITY.
C. K. Hung.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC8/87. 1987.]
108334 AUTO-DFD: AN INTELLIGENT DATA FLOW PROCESSOR.
T. S. Chua, K. P. Tan, and P. T. Lee.
[National University of Singapore. Department of Information Systems
and Computer Science. TRD8/87. 1987.]
052107 SUBJECTS AND COMPLEMENTS IN HPSG.
R. D. Borsley.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-107. September 1987.]
052112 BARE PLURALS, NAKED RELATIVES, AND THEIR KIN.
D. Zaefferer.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-112. November 1987.]
052114 BACKWARD ANAPHORA AND DISCOURSE STRUCTURE: SOME CONSIDERATIONS.
P. Sells.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-114. November 1987.]
052115 TOWARD A LINKING THEORY OF RELATION CHANGING RULES IN LFG.
L. Levin.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-115. November 1987.]
048086 LAMINA: CARE APPLICATIONS INTERFACE.
-67 B. A. Delagi, N. P. Saraiya, and G. T. Byrd.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-86-67. November 1987.]
048087 DEFINING OPERATIONALITY FOR EXPLANATION-BASED LEARNING.
-60 R. M. Keller.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-60. October 1987.]
048087 EVOLUTION OF A KNOWLEDGE-BASED SYSTEM FOR DETERMINING STRUCTURAL
-62 COMPONENTS OF PROTEINS.
J. A. Brugge and B. G. Buchanan.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-62. October 1987.]
048087 AUTOMATIC TEST CASE GENERATION BY MODELING PATIENT STATES AND
-63 PHYSICIAN ACTIONS.
L. E. Perreault.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-63. October 1987.]
048087 PROBLEM-SOLVING DESIGN: REASONING ABOUT COMPUTATIONAL VALUE,
-64 TRADEOFFS, AND RESOURCES.
E. J. Horvitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-64. November 1987.]
048087 INSTRUMENTED ARCHITECTURAL SIMULATION.
-65 B. A. Delagi et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-65. November 1987.]
048087 DYNAMIC CONTROL PLANNING IN ADAPTIVE SYSTEMS.
-67 B. Hayes-Roth.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-67. November 1987.]
108335 EDGE DETECTION AS AN ILL-POSED TASK.
P. Mowforth and L. Gillespie.
[Turing Institute. TIRM-87-026. 1987.]
108336 COLLISION AVOIDANCE IN MULTIROBOT PLANNING.
Z. Zografski.
[Turing Institute. TIRM-87-027. 1987.]
108337 FITTING A GENERALIZED PARABOLA TO DATA.
A. B. Forbes.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 96/87. 1987.]
108338 STRATEGIES FOR KNOT PLACEMENT IN LEAST SQUARES DATA FITTING BY
SPLINES.
M. G. Cox, P. M. Harris, and H. M. Jones.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 101/87. 1987.]
108339 THE NPL DATA APPROXIMATION SUBROUTINE LIBRARY: CURRENT AND PLANNED
FACILITIES.
M. G. Cox.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 104/87. 1987.]
108340 THE SYMMETRIC TRAVELING SALESMAN POLYTOPE I: VALID INEQUALITIES
DERIVED FROM THE GRAPHICAL RELAXATION.
D. Naddef.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Atelier de
Recherches sur les Techniques Mathematiques et Informatiques des
Systemes (ARTEMIS). RR 660-M. 1987.]
108341 MODELLING A PARALLEL ARCHITECTURE FOR IMAGE PROCESSING.
P. Houeix and M. Becker.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
Circuits et Systemes (LCS). RR 646-I. 1987.]
108342 FP2: THE LANGUAGE AND ITS FORMAL DEFINITION.
J.-M. Hufflen et al.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR 537. 1985. Also issued as RR LIFIA 26.]
108343 A BIBLIOGRAPHY ON MATRIX MULTIPLICATION COMPLEXITY AND RELATED
PROBLEMS (1969-1985).
P. Chatelin.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR 582. 1986. Also issued as RR LIFIA 45.]
108344 CAICOU: UN SYSTEME DE DEVELOPPEMENT INTERACTIF POUR L'ANALYSE
D'IMAGES EN COULEUR.
J. L. Gordillo.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR-641-I. 1987. March 1986. Revised: January 1987. Also issued as
report no. 39 LIFIA.]
108345 ON A CLASSIFICATION OF PROBLEMS ON SETS OF BILINEAR FORMS BY FORMAL
POLYNOMIALS.
P. Chatelin.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR-642-I. 1987. Also issued as report no. 53 LIFIA.]
108346 ABOUT DISEQUATIONS SIMPLIFICATIONS.
H. Comon.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR 645-I. 1987. Also issued as report no. 55 LIFIA.]
108347 ON THE GEOMETRIC INTERPRETATION OF IMAGE CONTOURS.
R. Horaud and M. Brady.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
d'Informatique Fondamentale et d'Intelligence Artificielle (LIFIA).
RR 647-I. 1987. Also issued as report no. 57 LIFIA.]
108348 ON TUTTE POLYNOMIALS AND LINK POLYNOMIALS.
F. Jaeger.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Laboratoire
Structures Discretes et Didactique (LSD). RR 659-M. 1987.]
108349 A UNIFIED BUILT-IN SELF-TEST SCHEME: UBIST.
M. Nicolaidis.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Techniques de
l'Informatique, des Mathematiques, de la Microelectronique et de la
Microscopie Quantitative (TIM3). RR 649-I. 1987.]
108350 SELF-CHECKING LOGIC ARRAYS.
M. Nicolaidis and B. Courtois.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Techniques de
l'Informatique, des Mathematiques, de la Microelectronique et de la
Microscopie Quantitative (TIM3). RR 656-I. 1987.]
108351 SHORTS IN SELF-CHECKING CIRCUITS.
M. Nicolaidis.
[Universite Scientifique et Medicale de Grenoble. Institut IMAG
(Informatique et Mathematiques Appliquees de Grenoble). Techniques de
l'Informatique, des Mathematiques, de la Microelectronique et de la
Microscopie Quantitative (TIM3). RR 657-I. 1987.]
108352 PROGRAM DEVELOPMENT ON GRAPHICAL WORKSTATIONS.
K. Normark.
[University of Aarhus. Department of Computer Science. DAIMI PB-187.
1984.]
108353 ON PROVING LIMITING COMPLETENESS.
P. D. Mosses and G. D. Plotkin.
[University of Aarhus. Department of Computer Science. DAIMI PB-188.
1985.]
108354 SYMMETRIC DISTRIBUTED TERMINATION.
O. Eriksen and S. Skyum.
[University of Aarhus. Department of Computer Science. DAIMI PB-189.
1985.]
108355 GALLERIES AND INSTITUTIONS.
B. H. Mayoh.
[University of Aarhus. Department of Computer Science. DAIMI PB-191.
1985.]
108356 GENERALIZATIONS OF LIVENESS AND FAIRNESS PROPERTIES.
P. Chrzastowski-Wachtel.
[University of Aarhus. Department of Computer Science. DAIMI PB-194.
1985.]
108357 STEP CHANGE STRATEGIES FOR MULTISTEP METHODS.
O. Osterby.
[University of Aarhus. Department of Computer Science. DAIMI PB-196.
1985.]
108358 LEARNABILITY.
G. Frandsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-199.
1985.]
108359 PROBLEM-HEAP: A PARADIGM FOR MULTIPROCESSOR ALGORITHMS.
P. Moller-Nielsen and J. Staunstrup.
[University of Aarhus. Department of Computer Science. DAIMI PB-200.
1985.]
108360 A DENOTATIONAL SEMANTICS FOR LOGIC PROGRAMMING.
G. Frandsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-201.
1985.]
108361 A HIERARCHICAL, CO-OPERATIVE EXCEPTION HANDLING MECHANISM.
J. L. Knudsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-204.
1986.]
108362 NOTIONS OF REALIZABLE NON-SEQUENTIAL PROCESSES.
C. Fernandez, M. Nielsen, and P. S. Thiagarajan.
[University of Aarhus. Department of Computer Science. DAIMI PB-205.
1986.]
108363 THE POTENTIAL USE OF ACTION SEMANTICS IN STANDARDS.
P. D. Mosses and D. A. Watt.
[University of Aarhus. Department of Computer Science. DAIMI PB-206.
1986.]
108364 FREE BLACKBOARDS AND ANARCHIC COMMUNITIES OF EXPERTS.
B. H. Mayoh.
[University of Aarhus. Department of Computer Science. DAIMI PB-207.
1986.]
108365 A CALCULUS OF COMMUNICATING SYSTEMS WITH LABEL PASSING.
U. Engberg and M. Nielsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-208.
1986. Thesis (M.S.). "This report is essentially Uffe Engberg's
thesis for the M.Sc. degree from the Department of Computer Science,
Aarhus University - except that all proofs of theorems have been left
out."]
108366 MULTIPLE INHERITANCE, A STRUCTURING MECHANISM FOR DATA, PROCESSES AND
PROCEDURES.
K. S. Thomsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-209.
1986.]
108367 INHERITANCE USED TO FACTORIZE DISTRIBUTED TERMINATION DETECTION
ALGORITHMS.
K. S. Thomsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-210.
1986.]
108368 TIME REPRESENTATION AND USE IN EXPERT SYSTEMS.
N. Klarlund.
[University of Aarhus. Department of Computer Science. DAIMI PB-211.
1986.]
108369 STATIC EXCEPTION HANDLING IN BETA.
J. L. Knudsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-214.
1986.]
108370 THE USE OF ACTION SEMANTICS.
P. D. Mosses and D. A. Watt.
[University of Aarhus. Department of Computer Science. DAIMI PB-217.
1986.]
108371 AN OBJECT-ORIENTED DATA MODEL FOR MANAGING COMPUTER-AIDED DESIGN AND
COMPUTER-AIDED MANUFACTURING DATA BASES.
S. J. Cammarata.
[University of California, Los Angeles. Computer Science Department.
CSD-870026. 1987. Thesis (Ph.D.).]
108372 SYNTHESIS OF CUSTOM INTEGRATED CIRCUITS FROM A HIGH-LEVEL BEHAVIORAL
DESCRIPTION.
S. H. Kelem.
[University of California, Los Angeles. Computer Science Department.
CSD-870028. 1987. Thesis (Ph.D.).]
108373 LOG(F): A NEW SCHEME FOR INTEGRATING REWRITE RULES, LOGIC PROGRAMMING
AND LAZY EVALUATION.
S. Narain.
[University of California, Los Angeles. Computer Science Department.
CSD-870027. 1987.]
108374 DEDIX 87 - A SUPERVISORY SYSTEM FOR DESIGN DIVERSITY EXPERIMENTS AT
UCLA.
A. Avizienis et al.
[University of California, Los Angeles. Computer Science Department.
CSD-870029. 1987. "A preliminary version of this report was presented
at the workshop, 'Design Diversity in Action,' that was organized by
IFIP Working Group 10.4, 'Reliable Computing and Fault Tolerance,'
and was held on June 27-28, 1986 in Baden, Austria."]
108375 AN OBJECT ORIENTED METHODOLOGY FOR THE SPECIFICATION OF MARKOV MODELS.
S. Berson, E. de Souza e Silva, and R. Muntz.
[University of California, Los Angeles. Computer Science Department.
CSD-870030. 1987. Also issued as R-82, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108376 THE RECOVERY OF CAUSAL POLY TREES FROM STATISTICAL DATA.
G. Rebane and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870031. 1987.]
108377 CAUSAL NETWORKS: SEMANTICS AND EXPRESSIVENESS.
T. Verma.
[University of California, Los Angeles. Computer Science Department.
CSD-870032. 1987. Also issued as R-65-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
108378 ON THE PROBABILISTIC SEMANTICS OF CONNECTIONIST NETWORKS.
H. Geffner and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870033. 1987. Also issued as R-84, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108379 THE INDUCTIVE LOGIC OF INFORMATION SYSTEMS.
N. C. Dalkey.
[University of California, Los Angeles. Computer Science Department.
CSD-870034. 1987. Also issued as R-85, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108380 STRUCTURING CAUSAL TREE MODELS WITH CONTINUOUS VARIABLES.
L. Xu and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870035. 1987. Also issued as R-83-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
108381 DO WE NEED HIGHER-ORDER PROBABILITIES AND, IF SO, WHAT DO THEY MEAN?
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870036. 1987. Also issued as R-88, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108382 NETWORK-BASED HEURISTICS FOR CONSTRAINT SATISFACTION PROBLEMS.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870037. 1987. Also issued as R-90, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108383 A MODELING METHODOLOGY FOR THE ANALYSIS OF CONCURRENT SYSTEMS AND
COMPUTATIONS.
A. Kapelnikov, R. R. Muntz, and M. D. Ercegovac.
[University of California, Los Angeles. Computer Science Department.
CSD-870038. 1987.]
108384 DISTRIBUTED COMPUTER SIMULATION OF A DATA COMMUNICATION NETWORK.
S. Cheung.
[University of California, Los Angeles. Computer Science Department.
CSD-870039. 1987. Thesis (Ph.D.).]
108385 REMOVING ALGORITHM IRREGULARITIES IN THE DESIGN OF ARRAYS FOR MATRIX
COMPUTATIONS.
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-870040. 1987.]
108386 PARALLEL ALGORITHMS AND ARCHITECTURES FOR BINARY IMAGE COMPONENT
LABELING.
Q. T. Pham.
[University of California, Los Angeles. Computer Science Department.
CSD-870041. 1987. Thesis (M.S.).]
108387 DISTRIBUTED SIMULATION AND THE TIME WARP OPERATING SYSTEM.
D. Jefferson et al.
[University of California, Los Angeles. Computer Science Department.
CSD-870042. 1987.]
108388 ON-LINE SCHEMES FOR COMPUTING ROTATION ANGLES FOR SVDS.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-870043. 1987.]
108389 FAST TRIANGULARIZATION BY GIVENS ROTATION USING ON-LINE CORDIC.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-870045. 1987.]
108390 REDUNDANT AND ON-LINE CORDIC: APPLICATION TO MATRIX TRIANGULARIZATION
AND SVD.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-870046. 1987.]
108391 FAST MULTIPLICATION WITHOUT CARRY PROPAGATION ADDITION.
M. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-870047. 1987.]
108392 THE NON-AXIOMATIZABILITY OF DEPENDENCIES IN DIRECTED ACYCLIC GRAPHS.
D. Geiger.
[University of California, Los Angeles. Computer Science Department.
CSD-870048. 1987. Also issued as R-83, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108393 THE OPTIMALITY OF A*.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870049. 1987.]
108394 MODELS VS. INDUCTIVE INFERENCE FOR DEALING WITH PROBABILISTIC
KNOWLEDGE.
N. C. Dalkey.
[University of California, Los Angeles. Computer Science Department.
CSD-870050. 1987. Also issued as R-89, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108395 AN ENQUIRY INTO COMPUTER UNDERSTANDING.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870051. 1987. Also issued as R-91, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108396 PROBABILISTIC SEMANTICS FOR INHERITANCE HIERARCHIES WITH EXCEPTIONS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870052. 1987. Also issued as R-93-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
108397 DECIDING CONSISTENCY IN INHERITANCE NETWORKS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870053. 1987. Also issued as R-96, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108398 A FULL CHARACTERIZATION OF PSEUDOGRAPHOIDS IN TERMS OF FAMILIES OF
UNDIRECTED GRAPHS.
A. Paz.
[University of California, Los Angeles. Computer Science Department.
CSD-870055. 1987. Also issued as R-95, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108399 TREE CLUSTERING SCHEMES FOR CONSTRAINT PROCESSING.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870054. 1987. Also issued as R-92, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108400 A COMPLEX AXIOMATIZATION OF SOME DEPENDENCIES IN PROBABILISTIC MODELS.
D. Geiger.
[University of California, Los Angeles. Computer Science Department.
CSD-870056. 1987. Also issued as R-97, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108401 A LOGIC OF INFORMATION SYSTEMS.
N. C. Dalkey.
[University of California, Los Angeles. Computer Science Department.
CSD-870057. 1987.]
108402 SOUND DEFEASIBLE INFERENCE.
H. Geffner and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870058. 1987. Also issued as R-94, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108403 GENTZENIZING SCHROEDER-HEISTER'S NATURAL EXTENSION OF NATURAL
DEDUCTION.
A. Avron.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-20. 1987. Also
issued as CSR-225-87, Department of Computer Science, University of
Edinburgh.]
108404 SOME THOUGHTS ON ALGEBRAIC SPECIFICATION.
D. Sannella and A. Tarlecki.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-21. 1987. Also
issued as CSR-226-87, Department of Computer Science, University of
Edinburgh.]
108405 INTRODUCTION TO A CALCULUS OF COMMUNICATING SYSTEMS.
D. Walker.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-22. 1987.
"Expository report." Also issued as CSR-227-87, Department of
Computer Science, University of Edinburgh.]
108406 A FRAMEWORK FOR DEFINING LOGICS.
R. Harper, F. A. Honsell, and G. Plotkin.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-23. 1987. "This is a
slightly edited version of a paper delivered at the Second Symposium
on Logic in Computer Science, Ithaca, NY, 1987." Also issued as
CSR-228-87, Department of Computer Science, University of Edinburgh.]
108407 COMPARING LINEAR AND BRANCHING TIME TEMPORAL LOGICS.
C. Stirling.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-24. 1987. Also
issued as CSR-229-87, Department of Computer Science, University of
Edinburgh.]
108408 INDUCTIVELY DEFINED FUNCTIONS IN FUNCTIONAL PROGRAMMING LANGUAGES.
R. Burstall.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-25. 1987. Also
issued as CSR-230-87, Department of Computer Science, University of
Edinburgh.]
108409 SUBMODULE CONSTRUCTION AS EQUATION SOLVING IN CCS.
J. Parrow.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-26. 1987. Also
issued as CSR-231-87, Department of Computer Science, University of
Edinburgh.]
108410 THE SEMANTICS AND PROOF THEORY OF LINEAR LOGIC.
A. Avron.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-27. 1987. Also
issued as CSR-232-87, Department of Computer Science, University of
Edinburgh.]
108411 A TYPE DISCIPLINE FOR PROGRAM MODULES.
R. Harper, R. Milner, and M. Tofte.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-28. 1987. "This is a
slightly edited reprint of a paper presented at TAPSOFT '87, Pisa,
March 1987, in 'Lecture Notes in Computer Science' 250 (1987),
pp.308-319." Also issued as CSR-233-87, Department of Computer
Science, University of Edinburgh.]
108412 CONFIGURABLE LOGIC: AN APPROACH TO THE RAPID IMPLEMENTATION OF ASIC'S.
T. Kean and G. Feng.
[University of Edinburgh. Department of Computer Science. CSR-234-87.
1987.]
108413 BISIMULATION EQUIVALENCE AND DIVERGENCE IN CCS.
D. Walker.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-29. 1987. Also
issued as CSR-235-87, Department of Computer Science, University of
Edinburgh.]
108414 SIMPLE CONSEQUENCE RELATIONS.
A. Avron.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-30. 1987. Also
issued as CSR-236-87, Department of Computer Science, University of
Edinburgh.]
108415 USING TYPED LAMBDA CALCULUS TO IMPLEMENT FORMAL SYSTEMS ON A MACHINE.
A. Avron, F. A. Honsell, and I. A. Mason.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-31. 1987. Also
issued as CSR-237-87, Department of Computer Science, University of
Edinburgh.]
108416 HOARE'S LOGIC IN THE LF.
I. A. Mason.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-32. 1987. Also
issued as CSR-238-87, Department of Computer Science, University of
Edinburgh.]
108417 A DATA STRUCTURE FOR SYSTEMS OF ORTHOGONAL, NON-OVERLAPPING
RECTANGLES.
M. Jerrum.
[University of Edinburgh. Department of Computer Science. CSR-239-87.
1987.]
108418 CHANGES IN THE STANDARD ML CORE LANGUAGE.
R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-33. 1987. Also
issued as CSR-240-87, Department of Computer Science, University of
Edinburgh.]
108419 APPROXIMATE COUNTING, UNIFORM GENERATION AND RAPIDLY MIXING MARKOV
CHAINS.
A. Sinclair and M. Jerrum.
[University of Edinburgh. Department of Computer Science. CSR-241-87.
1987. Revised: October 1987.]
108420 AN ENVIRONMENT FOR FORMAL SYSTEMS.
T. G. Griffin.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-34. 1987. Also
issued as CSR-242-87, Department of Computer Science, University of
Edinburgh.]
108421 SYNCHRONIZATION FLOW ALGEBRA.
J. Parrow.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-35. 1987. Also
issued as CSR-243-87, Department of Computer Science, University of
Edinburgh.]
108422 THE SEMANTICS OF STANDARD ML.
R. Harper, R. Milner, and M. Tofte.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-36. 1987. Version 1:
August 13, 1987. Also issued as CSR-244-87, Department of Computer
Science, University of Edinburgh.]
108423 VARIATIONS ON A THESIS: INTUITIONISM AND COMPUTABILITY.
C. McCarty.
[University of Edinburgh. Department of Computer Science. CSR-245-87.
1987.]
108424 A STUDY ON FAULT PREDICTION AND RELIABILITY ASSESSMENT IN THE SEL
ENVIRONMENT.
V. R. Basili and D. Patnaik.
[University of Maryland. Department of Computer Science. TR-1699.
1986.]
108425 CHROMATIC NUMBER APPROXIMATION USING SIMULATED ANNEALING.
C. A. Morgenstern and H. D. Shapiro.
[University of New Mexico. Department of Computer Science. Technical
report CS86-1. 1986.]
108426 A FAST PROBABILISTIC ALGORITHM FOR FOUR-COLORING LARGE PLANAR GRAPHS.
R. A. Archuleta and H. D. Shapiro.
[University of New Mexico. Department of Computer Science. Technical
report CS86-2. 1986.]
108427 ON SMALLEST MAXIMALLY NON-HAMILTONIAN GRAPHS.
L. H. Clark et al.
[University of New Mexico. Department of Computer Science. Technical
report CS86-3. 1986.]
108428 A COMMON SCHEMA FOR DYNAMIC PROGRAMMING AND BRANCH-AND-BOUND TYPE
ALGORITHMS.
P. Helman.
[University of New Mexico. Department of Computer Science. Technical
report CS86-4. 1986.]
108429 DESIGNING DEDUCTIVE DATABASES.
P. Helman and R. E. Veroff.
[University of New Mexico. Department of Computer Science. Technical
report CS86-5. 1986.]
108430 PERFECT DOMINATION.
M. R. Fellows and M. N. Hoover.
[University of New Mexico. Department of Computer Science. Technical
report CS86-7. 1987.]
108431 RESOLVING NONDETERMINISM IN DISTRIBUTED REDUNDANT SYSTEMS.
L. Mancini and G. Peppalardo.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 233. 1987.]
108432 WINDOW MANAGEMENT SYSTEMS: AN ANNOTATED BIBLIOGRAPHY.
D. L. Kemp, E. A. Scott, and D. A. Taylor.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 240. 1987.]
108433 OBJECTS AND ACTIONS IN RELIABLE DISTRIBUTED SYSTEMS.
S. K. Shrivastava, G. N. Dixon, and G. D. Parrington.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 242. 1987.]
108434 AN ALGORITHM FOR COLOURING PERFECT PLANAR GRAPHS.
I. A. Stewart.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 243. 1987.]
108435 THE STRICT LANGUAGE AND DESIGN METHODOLOGY.
A. M. Koelmans and M. R. McLauchlan.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 244. 1987.]
108439 THE INCREMENTAL-COST APPROACH FOR SYNTHESIS OF CCD 4-VALUED UNARY
FUNCTIONS.
M. H. Abd-El-Barr, T. D. Hoang, and Z. G. Vranesic.
[University of Saskatchewan. Department of Computational Science.
Research report 87-10. 1987.]
108440 HIERARCHICAL INTERCONNECTION NETWORKS FOR MULTICOMPUTER SYSTEMS.
S. P. Dandamudi and D. L. Eager.
[University of Saskatchewan. Department of Computational Science.
Research report 87-11. 1987.]
108441 THE PRACTICAL USE OF ARTIFICIAL INTELLIGENCE IN AUTOMATED TUTORING:
CURRENT STATUS AND IMPEDIMENTS TO PROGRESS.
G. I. McCalla and J. E. Greer.
[University of Saskatchewan. Department of Computational Science.
Research report 87-12. 1987.]
108442 FINDING LANGUAGE ERRORS AND PROGRAM EQUIVALENCE IN AUTOMATED
PROGRAMMING ADVISOR.
X. Huang.
[University of Saskatchewan. Department of Computational Science.
Research report 87-13. 1987. Thesis (M.S.).]
108443 A SURVEY ON BINARY TREE CODINGS.
E. Maukinen.
[University of Tampere. Department of Computer Science. A-1987-8.
1987.]
108444 DESIGN GOALS FOR THE TURING PROGRAMMING LANGUAGE.
R. C. Holt.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-187. 1986.]
108445 CREATING USER INTERFACES BY DEMONSTRATION.
B. A. Myers.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-196. 1987. Thesis (Ph.D.).]
108446 SUPPORTING CONCURRENCY, COMMUNICATION AND SYNCHRONIZATION IN
HUMAN-COMPUTER INTERACTION.
R. D. Hill.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-197. 1987. Thesis (Ph.D.).]
108447 EFFICIENT COMPUTATION OF SOLUTIONS TO HYPERBOLIC CONSERVATION LAWS.
SOME NUMERICAL EXPERIMENTS.
B. Sjogreen.
[University of Uppsala. Department of Computer Science. Report no.
110. 1987.]
108448 AN IMPROVEMENT ON THE ACCURACY OF THE SOLUTION OF
DIFFERENTIAL-ALGEBRAIC SYSTEMS OF INDEX THREE BY BDF-METHODS.
C. Arevalo.
[University of Uppsala. Department of Computer Science. Report no.
111. 1987.]
108449 CONFER: A KNOWLEDGE SYSTEM FOR BIOPROCESS CONTROL.
I. D. Craig and D. H. Wilson.
[University of Warwick. Department of Computer Science. RR103. 1987.]
108450 ON EFFICIENT PARALLEL COMPUTATIONS FOR SOME DYNAMIC PROGRAMMING
PROBLEMS.
W. Rytter.
[University of Warwick. Department of Computer Science. RR104. 1987.]
108451 PARALLEL O(LOG(N)) TIME EDGE COLOURING OF TREES AND HALIN GRAPHS.
A. Gibbons, A. Israeli, and W. Rytter.
[University of Warwick. Department of Computer Science. RR105. 1987.]
108452 CHARLES BABBAGE'S TABLE OF LOGARITHMS (1827).
M. Campbell-Kelly.
[University of Warwick. Department of Computer Science. RR106. 1987.]
108453 FORMATTED STREAMS: EXTENSIBLE FORMATTED I/O FOR C++ USING
OBJECT-ORIENTED PROGRAMMING.
M. Rafter.
[University of Warwick. Department of Computer Science. RR107. 1987.]
108454 LOCAL CONSTRAINT INTEGRATION IN A CONNECTIONIST MODEL OF STEREO
VISION.
C. V. Stewart and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 726. 1987.]
108455 THE EFFECTS OF FAULTS IN CACHE MEMORIES.
G. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 727. 1987.]
108456 DYNAMIC SCHEDULING ALGORITHMS FOR DISTRIBUTED SOFT REAL-TIME SYSTEMS.
H.-Y. Chang.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 728. 1987. Thesis (Ph.D.).]
108457 DISTRIBUTED UPCALLS: A MECHANISM FOR LAYERING ASYNCHRONOUS
ABSTRACTIONS.
D. L. Cohrs, B. P. Miller, and L. A. Call.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 729. 1987.]
108458 CONDOR - A HUNTER OF IDLE WORKSTATIONS.
M. J. Litzkow, M. Livny, and M. W. Mutka.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 730. 1987.]
108459 PARALLEL ALGORITHMS FOR A CLASS OF CONVEX OPTIMIZATION PROBLEMS.
R.-J. Chen.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 731. 1987. Thesis (Ph.D.).]
108460 PARALLEL OPTIMIZATION FOR TRAFFIC ASSIGNMENT.
R.-J. Chen and R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 732. 1987.]
108461 EQUI-DEPTH MULTI-DIMENSIONAL HISTOGRAMS.
M. Muralikrishna and D. J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 733. 1987.]
VOL. 10, NO. 3 03/25/88
108462 RANDOM INSTANCES OF A GRAPH COLORING PROBLEM ARE HARD.
R. Venkatesan and L. Levin.
[Boston University. Department of Computer Science. Technical report
87-007. 1987. "Extended abstract."]
108463 AN INTRODUCTION TO FORMS AND LOGIC.
B. Doyle, M. Friedman, and B. York.
[Boston University. Department of Computer Science. Technical report
87-008. 1987.]
108465 DOUBLE-PERIODIC SEQUENCES AND A CLASS OF TWO-DIMENSIONAL CYCLIC CODES.
J. Goldman and S. Homer.
[Boston University. Department of Computer Science. Technical report
87-010. 1987.]
108466 A SURVEY OF HETEROGENEOUS DATABASE SYSTEMS.
M. D. Siegel.
[Boston University. Department of Computer Science. Technical report
87-011. 1987.]
108467 AUTOMATIC RULE DERIVATION FOR SEMANTIC QUERY OPTIMIZATION.
M. D. Siegel.
[Boston University. Department of Computer Science. Technical report
87-012. 1987.]
108468 LECTURE NOTES ON DESCRIPTIONAL COMPLEXITY AND RANDOMNESS.
P. Gacs.
[Boston University. Department of Computer Science. Technical report
87-013. 1987.]
108469 SYNTHESIZING ALGORITHMS WITH PERFORMANCE CONSTRAINTS.
R. D. McCartney.
[Brown University. Computer Science Department. Technical report
CS-87-28. 1987. Thesis (Ph.D.).]
108470 THE SYSTEM ARCHITECT'S WORKBENCH USER'S GUIDE.
D. E. Thomas.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-13. 1987.]
108471 ULYSSES DESIGN ENVIRONMENT USER'S GUIDE.
M. L. Bushnell.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-16. 1987.]
108472 A PROTOTYPE FRAMEWORK FOR KNOWLEDGE-BASED ANALOG CIRCUIT SYNTHESIS.
R. Harjani, R. A. Rutenbar, and L. R. Carley.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-26. n.d.]
108473 REALISTIC FAULT MODELING FOR VLSI TESTING.
W. Maly.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-27. 1987.]
108474 A SCANLINE DATA STRUCTURE PROCESSOR FOR VLSI CHECKING.
E. C. Carlson and R. A. Rutenbar.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-32. 1987.]
108475 PLACEMENT BY SIMULATED ANNEALING ON A MULTIPROCESSOR.
S. A. Kravitz and R. A. Rutenbar.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRU-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-33. 1987.]
108476 SPECS2: AN INTEGRATED CIRCUIT TIMING SIMULATOR.
C. Visweswariah and R. A. Rohrer.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-36. 1987.]
108477 SPECIAL PURPOSE HARDWARE FOR ALGORITHMIC LEVEL SIMULATION.
D. J. Geiger and D. E. Thomas.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-37. 1987.]
108478 ARTIFICIAL INTELLIGENCE TECHNIQUES: EXPANDING VLSI DESIGN AUTOMATION
TECHNOLOGY.
J. D. Daniel, A. M. Dewey, and S. W. Director.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-38. 1987.]
108479 FLOORPLANNING BY ANNEALING ON A HYPERCUBE MULTIPROCESSOR.
R. Jayaraman and R. A. Rutenbar.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-41. 1987.]
108480 A PIECEWORK LINEAR CIRCUIT SIMULATOR BASED ON TREE/LINK
REPARTITIONING AND ITERATIVE SOLUTION.
X. Huang.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-42. 1987. Thesis (M.S.).]
108481 STATIC VS. DYNAMIC PARTITIONING OF CIRCUITS FOR A MOS TIMING
SIMULATOR ON A MESSAGE-BASED MULTIPROCESSOR.
S. A. Kravitz and B. D. Ackland.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-44. 1987.]
108482 MICON: A SINGLE BOARD COMPUTER SYNTHESIS TOOL.
W. P. Birmingham et al.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Research report CMUCAD-87-48. 1987.]
108483 THE METALLURGIC DATABASE OF ALADIN - AN ALLOY DESIGN SYSTEM.
I. Hulthage et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-19.
1987.]
108484 OBJECT RECOGNITION ON A SYSTOLIC ARRAY.
C. M. Bono and J. A. Webb.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-21.
1987.]
108485 THE AUTOMATED CRAFTSMAN: PRELIMINARY RESEARCH.
D. A. Bourne.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-22.
1987.]
108486 KR: AN EFFICIENT KNOWLEDGE REPRESENTATION SYSTEM.
D. Gluse.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-23.
1987.]
108487 NAVLAB: AN AUTONOMOUS NAVIGATION TESTBED.
K. Dowling et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-24.
1987.]
108488 TWO NEW FRAMEWORKS FOR LEARNING.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-25.
1987.]
108489 KALMAN FILTER-BASED ALGORITHMS FOR ESTIMATING DEPTH FROM IMAGE
SEQUENCES.
L. Matthies, R. Szeliska, and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-1.
1988.]
108490 SYMMETRY IN DISTRIBUTED SYSTEMS.
R. E. Johnson.
[Cornell University. Department of Computer Science. Technical report
87-855. 1987. Thesis (Ph.D.).]
108491 SPARSE CHOLESKY FACTORIZATION ON A MULTIPROCESSOR.
E. Zmijewski.
[Cornell University. Department of Computer Science. Technical report
87-856. 1987. Thesis (Ph.D.).]
108492 MAINTAINING AVAILABILITY IN PARTITIONED REPLICATED DATABASES.
A. El Abbadi and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
87-857. 1987.]
108493 TECHNIQUES FOR SIMPLIFYING THE PROGRAMMING OF DISTRIBUTED SYSTEMS.
R. Koo.
[Cornell University. Department of Computer Science. Technical report
87-858. 1987. Thesis (Ph.D.).]
108494 A NON-TYPE-THEORETIC SEMANTICS FOR TYPE-THEORETIC LANGUAGE.
S. F. Allen.
[Cornell University. Department of Computer Science. Technical report
87-866. 1987. Thesis (Ph.D.).]
108495 EXPRESSIVENESS BOUNDS FOR COMPLETENESS IN TRACE-BASED NETWORK PROOF
SYSTEMS.
J. Widom and P. Panangaden.
[Cornell University. Department of Computer Science. Technical report
87-867. 1987.]
108496 EXPERIMENTS IN AUTOMATIC PHRASE INDEXING FOR DOCUMENT RETRIEVAL: A
COMPARISON OF SYNTACTIC AND NON-SYNTACTIC METHODS.
J. L. Fagan.
[Cornell University. Department of Computer Science. Technical report
87-868. 1987. Thesis (Ph.D.).]
108497 COMPUTING THE SINGULAR VALUE DECOMPOSITION ON A DISTRIBUTED SYSTEM OF
VECTOR PROCESSORS.
C. Bischof.
[Cornell University. Department of Computer Science. Technical report
87-869. 1987. Revision of [Cornell University Department of Computer
Science] TR 86-798.]
108498 INDUCTIVE DEFINITION IN TYPE THEORY.
P. F. Mendler.
[Cornell University. Department of Computer Science. Technical report
87-870. 1987. Thesis (Ph.D.).]
108499 COMPARATIVE BENCHMARKING IN RELATIONAL DATABASE SYSTEMS.
C. Turbyfill.
[Cornell University. Department of Computer Science. Technical report
87-871. 1987. Thesis (Ph.D.).]
108500 WHAT PROGRAMMERS DON'T AND SHOULD KNOW.
D. Gries.
[Cornell University. Department of Computer Science. Technical report
87-872. 1987.]
108501 PERFECT PIPELINING: A NEW LOOP PARALLELIZATION TECHNIQUE.
A. Aiken and A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
87-873. 1987.]
108502 DECOMPOSING PROPERTIES INTO SAFETY AND LIVENESS USING PREDICATE LOGIC.
F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
87-874. 1987.]
108503 ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS.
C. M. Hoffmann, J. E. Hopcroft, and M. S. Karasick.
[Cornell University. Department of Computer Science. Technical report
87-875. 1987.]
108504 FIREFLY: A MULTIPROCESSOR WORKSTATION.
C. P. Thacker, L. C. Stewart, and E. H. Satterthwaite Jr..
[Digital Equipment Corporation (DEC). Systems Research Center.
Technical report 23. 1987.]
108505 A SIMPLE AND EFFICIENT IMPLEMENTATION FOR SMALL DATABASES.
A. D. Birrell, M. B. Jones, and E. P. Wobber.
[Digital Equipment Corporation (DEC). Systems Research Center.
Technical report 24. 1987.]
108507 GLOBALLY STABLE COMPLIANT MOTION CONTROL FOR ROBOTIC ASSEMBLY.
W. E. Hamilton Jr..
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6105. 1988.]
108508 MESSAGE PASSING IN PARALLEL REAL TIME CONTINUOUS SYSTEM SIMULATIONS.
A. M. Baum and D. J. McMillan.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6146. 1988.]
108509 HIGH LEVEL SYNTHESIS DESIGN OF A REAL TIME CONTROL CHIP.
T. E. Fuhrman.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6148. 1988.]
108510 ANALYZING THE PERFORMANCE OF PHYSICAL IMPACT SIMULATION SOFTWARE ON
VECTOR AND PARALLEL PROCESSORS.
M. Ginsberg.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6149. 1988.]
108511 A DYNAMIC STORAGE PROCESS.
C. Kipnis and P. Robert.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 713. 1987.]
108512 COL: A LOGIC-BASED LANGUAGE FOR COMPLEX OBJECTS.
S. Abiteboul and S. Grumbach.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 714. 1987.]
108513 TRANSACTION LANGUAGES FOR DATABASE UPDATE AND SPECIFICATION.
S. Abiteboul and V. Vianu.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 715. 1987.]
108514 ROBUST AND IMPLICITLY "BIMODAL" COLLISION RESOLUTION PROTOCOLS.
P. Jacquet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 717. 1987.]
108515 AVERAGE-CASE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES.
P. Flajolet and J. S. Vitter.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 718. 1987.]
108516 DEVIATIONS FROM NORMALITY IN RANDOM STRINGS.
P. Flajolet, P. Kirschenhofer, and R. Tichy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 719. 1987.]
108517 BIRTHDAY PARADOX, COUPON COLLECTORS, CACHING ALGORITHMS AND
SELF-ORGANIZING SEARCH.
P. Flajolet, D. Gardy, and L. Thimonier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 720. 1987.]
108518 MULTILEVEL TRIE HASHING.
W. Litwin, D. Zegour, and G. Levy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 723. 1987.]
108519 NEW FUNCTIONS FOR DYNAMIC ATTRIBUTES IN THE MULTIDATABASE SYSTEM
MRDSM.
P. Vigier and W. Litwin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 724. 1987.]
108520 THE INPUT/OUTPUT COMPLEXITY OF SORTING AND RELATED PROBLEMS.
A. Aggarwal and J. S. Vitter.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 725. 1987.]
108521 COMPLETELY REGULAR CODES AND COMPLETELY TRANSITIVE CODES.
P. Sole.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 727. 1987.]
108522 RANDOM TREE MODELS IN THE ANALYSIS OF ALGORITHMS.
P. Flajolet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 729.729. 1987.]
108523 ORDERS AND OVERLAPPING CLUSTERS BY PYRAMIDS.
E. Diday.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 730. 1987.]
108524 PARALLEL PIVOTING COMBINED WITH PARALLEL REDUCTION.
G. Alaghband.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-75. 1987.]
108525 INTRODUCTION TO A SYSTEM FOR IMPLEMENTING NEURAL NET CONNECTIONS ON
SIMD ARCHITECTURES.
S. Tomboulian.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-3. 1987.]
108526 ZERO KNOWLEDGE INTERACTIVE PROOFS OF KNOWLEDGE.
M. Tompa.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13282. 1987. "A digest."]
108527 A RELAXATION APPROACH TO THE PROBLEM OF TRANSISTOR PLACEMENT IN CMOS
CELLS.
A. Stauffer and R. Nair.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13288. 1987.]
108528 A PROBABILISTIC MODELING METHOD FOR LANGUAGE PARSING.
T. Fujisaki.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13296. 1987.]
108529 THE RAPID EVALUATION OF VOLUME INTEGRALS WITH GREENS FUNCTION KERNELS
ON GENERAL REGIONS.
A. Mayo.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13304. 1987.]
108530 A DECOMPOSITION METHOD FOR THE FOURTH ORDER ACCURATE SOLUTION OF
LAPLACE'S EQUATION ON IRREGULAR REGIONS.
A. Mayo.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13305. 1987.]
108531 THE EUCLIDEAN ALGORITHM AND THE DEGREE OF THE GAUSS MAP.
T. Sakkalis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13306. 1987.]
108532 A LINGUISTIC TREATMENT OF PROGRAMS AS TYPED OBJECTS.
R. E. Strom, S. A. Yemini, and D. F. Bacon.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13325. 1987.]
108533 IMPROVING DISTRIBUTED PROTOCOLS BY DECOUPLING RECOVERY FROM
CONCURRENCY CONTROL.
S. A. Yemini, R. E. Strom, and D. F. Bacon.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13326. 1987.]
108534 INC: A LANGUAGE FOR INCREMENTAL COMPUTATIONS.
D. Yellin and R. E. Strom.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13327. 1987.]
108535 PERFORMANCE MODELING AND ANALYSIS OF A HIERARCHICALLY INTERCONNECTED
MULTIPROCESSOR.
A. N. Tantawi.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13335. 1987.]
108536 CREATING AND QUERYING LEXICAL DATA BASES.
M. S. Neff, R. J. Byrd, and O. A. Rizk.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13347. 1987.]
108537 THE TOPOGRAPHY OF 2-MANIFOLDS REPRESENTED BY THE QUAD-EDGE DATA
STRUCTURE.
C. A. Neff.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13351. 1987.]
108538 MODELING OF CORRELATED FAILURES AND COMMUNITY ERROR RECOVERY IN
MULTIVERSION SOFTWARE.
V. F. Nicola and A. Goyal.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13352. 1987.]
108539 A FULL-SCREEN FACILITY FOR DEFINING RELATIONAL AND
ENTITY-RELATIONSHIP DATABASE SCHEMAS.
G. H. Sockut and A. Malhotra.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13356. 1987.]
099091 PROCESS MODEL TESTING AND OPTIMIZATION USING MATRIX EXPERIMENTATION.
-405 E. Sachs and G. Prueger.
[1987.]
099091 A HIERARCHICAL FRAMEWORK FOR DISCRETE EVENT SCHEDULING IN
-406 MANUFACTURING SYSTEMS.
S. B. Gershwin.
[1987.]
099091 A HIERARCHICAL FRAMEWORK FOR MANUFACTURING SYSTEMS SCHEDULING: A
-409 TWO-MACHINE EXAMPLE.
S. B. Gershwin.
[1987.]
099091 SYNTHESIS OF SELF-TIMED VLSI CIRCUITS FROM GRAPH-THEORETIC
-410 SPECIFICATIONS.
T.-A. Chu.
[1987. Thesis (Ph.D.). "Submitted to the Department of Electrical
Engineering and Computer Science [Massachusetts Institute of
Technology] on May 11, 1987 in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
099091 PATH: A SIMULATION-BASED TRANSISTOR SIZER.
-412 J. K. Kim.
[1987.]
099091 3-D IC TECHNOLOGY: AN OVERVIEW BASED ON THE JAPANESE R & D MOVEMENT.
-413 B. Eidson.
[1987.]
108540 G.A.M.E.: A PERCEPTION MEASUREMENT TOOL FOR SOFTWARE DEVELOPMENT.
C. S. P. Peng.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA9/87. n.d.]
108541 SELECTING AND RANKING SYSTEM PROJECTS: A BINARY MATRIX APPROACH.
K. V. Rao and G. G. Gable.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB9/87. n.d.]
108542 VECTORIZATION OF CONJUGATE-GRADIENT METHODS FOR LARGE-SCALE
MINIMIZATION.
I. M. Navon, P. K. H. Phua, and M. Ramamurthy.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC9/87. 1987.]
108543 PROCEEDINGS OF THE INTER DEPARTMENT SEMINAR ON SUPERCOMPUTERS AND
THEIR APPLICATIONS, 20 NOVEMBER, 1987.
[National University of Singapore. Department of Information Systems
and Computer Science. TR10/87. 1987.]
108544 PROBABILISTIC PROPOSITIONAL LOGIC.
H. Guggenheimer.
[Polytechnic University (New York). Division of Computer Science.
Report no. 4. 1987.]
108545 MANY HARD EXAMPLES FOR RESOLUTION.
V. Chvatal and E. Szemeredi.
[Rutgers. Department of Computer Science. DCS-TR-218. 1987.]
108546 LEARNING APPROXIMATE PLANS IN GAMES.
P. Tadepalli.
[Rutgers. Department of Computer Science. ML-TR-8. 1986.]
108547 APPROXIMATING INTRACTABLE THEORIES: A PROBLEM SPACE MODEL.
J. Mostow and T. Fawcett.
[Rutgers. Department of Computer Science. ML-TR-16. 1987.]
108548 ADAPT: AN ANALOGICALLY DIRECTED AUTOMATIC PROGRAMMING TOOL.
W. W. Cohen and P. B. Franklin.
[Rutgers. Department of Computer Science. ML-TR-20. 1987.]
108549 A NEW CLASS OF HEURISTIC ALGORITHMS FOR WEIGHTED PERFECT MATCHING.
M. D. Grigoriadis and B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-76. 1987.]
108550 KARMARKAR'S ALGORITHM WITH IMPROVED STEPS.
B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-80. 1987.]
108551 SOLVING LINEAR PROGRAMS IN THE STANDARD FORM BY BISECTION AND A
PROJECTIVE FEASABILITY ALGORITHM.
B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-91. 1987.
April 1987. Revised: November 1987.]
108552 COMPUTATIONAL GEOMETRY IN A CURVED WORLD.
D. P. Dobkin and D. L. Souvaine.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-97. 1987.]
025168 REPRESENTING CONTROL KNOWLEDGE AS ABSTRACT TASK AND METARULES.
W. J. Clancey and C. Bock.
[Stanford University. Department of Computer Science.
STAN-CS-87-1168. April 1985. Also issued as KSL-85-16, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025169 APPLYING A QUALITATIVE MODELING SHELL TO PROCESS DIAGNOSIS: THE
CASTER SYSTEM.
T. F. Thompson and W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1169. March 1986. Also issued as KSL-85-32, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025170 VIEWING KNOWLEDGE BASES AS QUALITATIVE MODELS.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1170. May 1986. Also issued as KSL-86-27, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025171 QUALITATIVE STUDENT MODELS.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1171. May 1986. Reprinted from: "Annual Review of Computer
Science," v.1 (1986), pp.381-450. Also issued as KSL-86-15, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025172 FROM GUIDON TO NEOMYCIN AND HERACLES IN TWENTY SHORT LESSONS.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1172. July 1986. Also issued as KSL-86-11, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025173 REVIEW OF WINOGRAD AND FLORES' "UNDERSTANDING COMPUTERS AND
COGNITION:: A FAVORABLE INTERPRETATION."
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1173. July 1986. Also issued as KSL-86-48, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025174 INTELLIGENT TUTORING SYSTEMS: A TUTORIAL SURVEY.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1174. September 1986. Also issued as KSL-86-58, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025175 USING AND EVALUATING DIFFERENTIAL MODELING IN INTELLIGENT TUTORING
AND APPRENTICE LEARNING SYSTEMS.
D. C. Wilkins, W. J. Clancey, and B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-87-1175. January 1987. October 1986. Revision 1: January
1987. Also issued as KSL-86-62, Knowledge Systems Laboratory,
Department of Computer Science, Stanford University.]
025176 BIRTHDAY PARADOX, COUPON COLLECTORS, CACHING ALGORITHMS AND
SELF-ORGANIZING SEARCH.
P. Flajolet, D. Gardy, and L. Thimonier.
[Stanford University. Department of Computer Science.
STAN-CS-87-1176. August 1987.]
025177 LOG FILES: AN EXTENDED FILE SERVICE EXPLOITING WRITE-ONCE STORAGE.
R. S. Finlayson and D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-87-1177. September 1987.]
025178 A DYNAMIC, CUT-THROUGH COMMUNICATIONS PROTOCOL WITH MULTICAST.
G. T. Byrd, R. Nakano, and B. A. Delagi.
[Stanford University. Department of Computer Science.
STAN-CS-87-1178. September 1987. Also issued as KSL-87-44, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025179 DECENTRALIZED NAMING IN DISTRIBUTED COMPUTER SYSTEMS.
T. P. Mann.
[Stanford University. Department of Computer Science.
STAN-CS-87-1179. September 1987. Thesis (Ph.D.).]
025180 BIBLIOGRAPHY: DEPARTMENT OF COMPUTER SCIENCE TECHNICAL REPORTS,
1963-1988.
T. M. Nazarian.
[Stanford University. Department of Computer Science.
STAN-CS-87-1180. January 1988.]
025181 ON DEBUGGING RULE SETS WHEN REASONING UNDER UNCERTAINTY.
D. C. Wilkins and B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-87-1181. May 1987. April 1986. Revision 2: May 1987. Also
issued as KSL-86-30, Knowledge Systems Laboratory, Department of
Computer Science, Stanford University.]
025182 KNOWLEDGE BASE REFINEMENT BY MONITORING ABSTRACT CONTROL KNOWLEDGE.
D. C. Wilkins, W. J. Clancey, and B. G. Buchanan.
[Stanford University. Department of Computer Science.
STAN-CS-87-1182. August 1987. January 1987. Revision 1: August 1987.
Also issued as KSL-87-01, Knowledge Systems Laboratory, Department of
Computer Science, Stanford University.]
025183 THE KNOWLEDGE ENGINEER AS STUDENT: METACOGNITIVE BASES FOR ASKING
GOOD QUESTIONS.
W. J. Clancey.
[Stanford University. Department of Computer Science.
STAN-CS-87-1183. January 1987. Also issued as KSL-87-12, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025184 FIRMWARE APPROACH TO FAST LISP INTERPRETER.
H. G. Okuno, N. Osato, and I. Takeuchi.
[Stanford University. Department of Computer Science.
STAN-CS-87-1184. September 1987. Also issued as KSL-87-57, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025185 BLAZENET: A PHOTOTONIC IMPLEMENTABLE WIDE-AREA NETWORK.
Z. Haas and D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-87-1185. October 1987. Also issued as CSL-TR-87-346, Computer
Systems Laboratory, Stanford University.]
025186 A HIERARCHY OF TEMPORAL PROPERTIES.
Z. Manna and A. Pnueli.
[Stanford University. Department of Computer Science.
STAN-CS-87-1186. October 1987.]
025187 YAWN! (YET ANOTHER WINDOW ON NAIL!).
K. Morris et al.
[Stanford University. Department of Computer Science.
STAN-CS-87-1187. October 1987.]
025188 EXPERIMENTS WITH A KNOWLEDGE-BASED SYSTEM ON A MULTIPROCESSOR.
R. Nakano and M. Minami.
[Stanford University. Department of Computer Science.
STAN-CS-87-1188. October 1987. Also issued as KSL-87-61, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025189 INSTRUMENTED ARCHITECTURAL SIMULATION.
B. A. Delagi et al.
[Stanford University. Department of Computer Science.
STAN-CS-87-1189. November 1987. Also issued as KSL-87-65, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
108553 ON COMPILING INDEXING AND CUT FOR THE WAM.
M. Carlsson.
[Swedish Institute of Computer Science. Research report R86011. 1986.]
108554 GENERIERUNG MIT GPSG.
S. Busemann.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 49. 1987.]
108555 DESIGN GOALS FOR SLOPPY MODELING SYSTEMS.
S. Wrobel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 50. 1987.]
108556 HIGHER-ORDER CONCEPTS IN A TRACTABLE KNOWLEDGE REPRESENTATION.
S. Wrobel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 51. 1987.]
108557 GPSG AND GERMAN WORD ORDER.
C. Hauenschild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 52. 1987.]
108558 TEXTLINGUISTISCHE PROBLEME DER MASCHINELLAN OBERSETZUNG.
C. Hauenschild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 53. 1987.]
108559 KI-METHODEN DER MASCHINELLAN OBERSETZUNG?
C. Hauenschild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 54. 1987.]
108560 THE SCHEME OF POSIDONIUS - USING TAXONOMIC REASONING IN DESIGN.
C. Peltason.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 55. 1987.]
108561 NON-CUMULATIVE LEARNING IN METAXA.3.
W. Emde.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 56. 1987.]
108562 NEW AI FORMALISMS FOR KNOWLEDGE REPRESENTATIONS: A CASE STUDY.
K. Von Luck and B. Owsnicki-Klewe.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 57. 1987.]
108563 ON TERMINOLOGY CYCLES.
B. Nebel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz un Textverstehen). Report no. 58. 1987.]
108564 HANDLING GEO-SCIENTIFIC DATABASE OBJECTS IN A HIGHER LEVEL
PROGRAMMING LANGUAGE.
F. Lohmann.
[Technische Universitaet Braunschweig. Institut fuer Informatik.
Report no. 87-11. 1987.]
108565 AN EQUALITY PREDICATE FOR PROLOG.
G. A. Narboni.
[Turing Institute. TIRM-87-028. 1987.]
108566 IMPROVING THE MAN-MACHINE INTERFACE TO ROBOTIC SYSTEMS.
D. R. Manning et al.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 100/87. 1987.]
108567 A HETEROGENEOUS INHERITANCE SYSTEM BASED ON PROBABILITIES.
F. Bacchus.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-03. 1987.]
108568 POLYNOMIAL PRECONDITIONING FOR CONJUGATE GRADIENT METHODS.
S. F. Ashby.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1355. 1987. Thesis (Ph.D.).]
108569 FFS: SUPPORT FOR A RELATIONAL-NETWORK DATABASE MANAGEMENT SYSTEM.
R. A. Kaiser Jr..
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1358. 1987. Thesis (M.S.).]
108570 LEAPFROG VARIANTS OF ITERATIVE METHODS FOR LINEAR ALGEBRAIC EQUATIONS.
P. E. Saylor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1373. 1987.]
108571 TREATING A SINGLE, STIFF, SECOND-ORDER ODE DIRECTLY.
M. Suleiman and C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1391. 1987.]
108572 USING HISTORIES TO IMPLEMENT ATOMIC OBJECTS.
P. Ng.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1392. 1987.]
108573 SIMULATION OF SIMPLICITY: A TECHNIQUE TO COPE WITH DEGENERATE CASES
IN GEOMETRIC ALGORITHMS.
H. Edelsbrunner and E. P. Mucke.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1393. 1987.]
108574 LEARNING IN ARTIFICIAL NEURAL SYSTEMS.
C. J. Matheus and W. E. Hohensee.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1394. 1987.]
108575 IMPROVING THE DESIGN OF RULE-LEARNING SYSTEMS.
L. Rendell et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1395. 1987.]
108576 THE UPPER ENVELOPE OF PIECEWISE LINEAR FUNCTIONS: TIGHT BOUNDS ON THE
NUMBER OF FACES.
H. Edelsbrunner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1396. 1987.]
108577 MURPHY: A ROBOT THAT LEARNS BY DOING.
B. W. Mel.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1397. 1988.]
108578 FAST CONCURRENT CONTROLLED CIRCUITS USING MIRRORS.
W. J. Poppelbaum, J. B. Glickman, and L. A. Linstrom.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1398. 1988.]
108579 THE DTROLL SYSTEM: AN ANALYTIC OVERVIEW.
J. D. Tullis.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1399. 1987. Thesis (M.S.).]
108580 CIRCLES THROUGH TWO POINTS THAT ALWAYS ENCLOSE MANY POINTS.
H. Edelsbrunner et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1400. 1988.]
108581 L SUBSCRIPT INFINITY STABILITY OF FININTE ELEMENT APPROXIMATIONS TO
ELLIPTIC GRADIENT EQUATIONS.
T. Kerkhoven and J. W. Jerome.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1401. 1988.]
108582 LOGARITHMICALLY CONNECTED, REPETITIVE COMPUTER NETWORKS AND NUMERICAL
APPLICATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1402. 1988.]
108583 PYRIMAGE: A PYRAMID-BASED WORKSTATION.
D. J. Knights.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1403. 1988. Thesis (M.S.).]
108584 A CASE STUDY COMPARISON OF FOUR DECLARATIVE PROGRAMMING LANGUAGES.
A. C. Fleck.
[University of Iowa. Department of Computer Science. Technical report
87-05. 1987.]
108585 ON THE INTERSECTIONS OF LONGEST CYCLES IN A GRAPH.
I. A. Stewart.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 241. n.d.]
108586 A PARALLEL ALGORITHM TO FOUR-COLOUR A PERFECT PLANAR GRAPH.
I. A. Stewart.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 245. 1987.]
108587 METEOR BURST COMMUNICATION PROTOCOLS - THE HISTORY AND ROLE OF
COMPUTING TECHNOLOGY IN RADIO COMMUNICATION VIA METEOR TRAILS.
Q. G. Campbell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 246. 1987.]
108588 ON THE DUALITY OF FAULT TOLERANT SYSTEM STRUCTURES.
S. K. Shrivastava, L. V. Mancini, and B. Randell.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 248. 1987.]
108589 CONDITIONAL DESCRIPTIONS IN FUNCTIONAL UNIFICATION GRAMMAR.
R. Kasper.
[University of Southern California. Information Sciences Institute.
ISI/RR-87-191. 1987.]
108590 AI AS THE ULTIMATE ENHANCER OF PROTOCOL DESIGN.
D. Cohen and J. Finnegan.
[University of Southern California. Information Sciences Institute.
ISI/RS-87-193. 1987.]
108591 FUSION: A NEW MOSIS SERVICE.
R. Ayres.
[University of Southern California. Information Sciences Institute.
ISI/TM-87-194. 1987.]
108592 THE ISI GRAPHER: A PORTABLE TOOL FOR DISPLAYING GRAPHS PICTORIALLY.
G. Robins.
[University of Southern California. Information Sciences Institute.
ISI/RS-87-196. 1987.]
108593 EXPERIMENTS ON DRAWING 2-LEVEL HIERARCHICAL GRAPHS.
E. Maekinen.
[University of Tampere. Department of Computer Science. A-1988-1.
1988.]
108594 APPROXIMATE SEQUENCE COMPARISON: A STUDY WITH HISTOGRAMS.
L. Raeihae.
[University of Tampere. Department of Computer Science. A-1988-2.
1988.]
108595 VERTEX DECOMPOSITIONS OF PLANAR GRAPHS.
D. Fussell and R. Thurimella.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-34. 1987.]
108596 INTRODUCTION TO LOGIC PROGRAMMING.
K. R. Apt.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-35. 1987.]
108597 DESIGN OF THE CADM BASED SORT/SEARCH/SET ENGINE.
V. Bhat.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-36. 1987.]
108598 A DATA-DEPENDENCY BASED INTELLIGENT BACKTRACKING SCHEME FOR PROLOG.
V. Kumar and Y.-J. Lin.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-37. 1987.]
108599 ON IMPLEMENTING A COST-EFFECTIVE HYPERTEXT SYSTEM.
K.-S. The.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-38. 1987.]
108600 BALANCED PROTOCOLS FOR SEQUENCING DISTRIBUTED COMPUTATIONS.
Y. Aahlad and J. C. Browne.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-39. 1987.]
108601 DISTRIBUTED PROCESSING OF LOGIC PROGRAMS.
O. Wolfson and A. Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-40. 1987.]
108602 MANAGEMENT OF STRATIFIED DATABASES.
K. R. Apt and J.-M. Pugin.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-41. 1987.]
108603 TECHNIQUES AND DATA STRUCTURES FOR PARALLEL RESOURCE MANAGEMENT.
J. Biswas.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-42. 1987. Thesis (Ph.D.).]
108604 PSYCHO: A GRAPHICAL LANGUAGE FOR SUPPORTING SCHEMA EVOLUTION IN
OBJECT-ORIENTED DATABASES.
H.-J. Kim and H. F. Korth.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-43. 1987.]
108605 TDFL: A TASK-LEVEL DATA FLOW LANGUAGE.
P. A. Suhler, J. Biswas, and K. M. Korner.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-44. 1987.]
108606 QUERY LANGUAGES FOR NESTED RELATIONAL DATABASES.
H. F. Korth and M. A. Roth.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-45. 1987.]
108607 A PROTOTYPE VIEW UPDATE TRANSLATION FACILITY.
A. M. Keller and L. Harvey.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-46. 1987.]
108608 FORMAL MODEL OF CORRECTNESS WITHOUT SERIALIZABILITY.
H. F. Korth and G. Speegle.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-47. 1987.]
108609 PHYSICAL DESIGN AND QUERY COMPILATION FOR A SEMANTIC DATA MODEL
(ASSUMING MEMORY RESIDENCE).
G. E. Wedell.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-198. 1987. Thesis (Ph.D.).]
108610 CONTROL OF REASONING IN KNOWLEDGE-BASED SYSTEMS.
B. M. Kramer.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-199. 1987. Thesis (Ph.D.).]
108611 QUERYING NETWORKS WITH STATE-DEPENDENT SERVICE RATES.
T. J. Coatta.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-200. 1987. Thesis (M.S.).]
108612 EMBEDDING TREES IN A HYPERCUBE IS NP-COMPLETE.
A. Wagner and D. G. Corneil.
[University of Toronto. Department of Computer Science. Technical
report 196/87. 1987.]
108613 LOWER BOUNDS IN A PARALLEL MACHINE COMPUTATION.
P. W. Beame.
[University of Toronto. Department of Computer Science. Technical
report 197/87. 1987. Thesis (M.S.).]
108614 USER GUIDE FOR ERNY: AN EXPLICIT RUNGE-KUTTA NYSTROM INTEGRATOR FOR
SECOND ORDER INITIAL VALUE PROBLEMS.
P. W. Sharp and J. M. Fine.
[University of Toronto. Department of Computer Science. Technical
report 198/87. 1987.]
108615 DECIDABLE, LOGIC-BASED KNOWLEDGE REPRESENTATION.
P. F. Patel-Schneider.
[University of Toronto. Department of Computer Science. Technical
report 201/87. 1987. Thesis (Ph.D.). "This report is a slight
modification of a Ph.D. thesis of the same name submitted to the
School of Graduate Studies, University of Toronto in partial
fulfilment of the requirements for the degree of Doctor of
Philosophy." "It is also available from Schlumberger Palo Alto
Research as Technical Report 56."]
108616 MONTE-CARLO APPROXIMATION ALGORITHMS FOR ENUMERATION PROBLEMS.
R. M. Karp, M. G. Luby, and N. Madras.
[University of Toronto. Department of Computer Science. Technical
report 203/87. 1987.]
108617 EMBEDDING TREES IN THE HYPERCUBE.
A. S. Wagner.
[University of Toronto. Department of Computer Science. Technical
report 204/87. 1987. Thesis (Ph.D.).]
108618 ANALYSIS OF ERROR CONTROL STRATEGIES FOR CONTINUOUS RUNGE-KUTTA
METHODS.
W. H. Enright.
[University of Toronto. Department of Computer Science. Technical
report 205/87. 1987.]
108619 A TRANSPARENT COPROCESSOR FOR INTERPROCESSOR COMMUNICATION IN AN MIMD
COMPUTER.
T. Holman and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 87-03-07. 1987.]
108620 ORDERED VERTEX REMOVAL AND SUBGRAPH PROBLEMS.
R. Greenlaw.
[University of Washington. Department of Computer Science. Technical
report 87-05-03. 1987.]
108621 THE HOUGH TRANSFORM HAS O(N) COMPLEXITY ON SIMD NXN MESH ARRAY
ARCHITECTURES.
R. E. Cypher and J. L. C. Sanz.
[University of Washington. Department of Computer Science. Technical
report 87-07-01. 1987.]
108622 ACHIEVING SPEEDUPS FOR A SHARED MEMORY MODEL LANGUAGE ON A SIMD
PARALLEL COMPUTER.
R. Greenlaw and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 87-09-03. 1987.]
108623 TWO APPLICATIONS OF COMPLEMENTATION VIA INDUCTIVE COUNTING.
A. Borodin et al.
[University of Washington. Department of Computer Science. Technical
report 87-10-01. 1987.]
108624 CONCURRENT PROGRAMMING WITH TIME: A RESEARCH PROPOSAL.
K. Jeffay.
[University of Washington. Department of Computer Science. Technical
report 87-10-03. 1987.]
108625 THE COMMIT/ABORT PROBLEM IN TYPE-SPECIFIC LOCKING.
J. D. Noe et al.
[University of Washington. Department of Computer Science. Technical
report 87-10-04. 1987. "Revised version of Arbeitspapiereder GMD
#267, September 1987, Gesellschaft fuer Mathematik und
Datenverarbeitung, MBH."]
108626 AN INVESTIGATION OF MULITGAUGE ARCHITECTURES.
C. Yang.
[University of Washington. Department of Computer Science. Technical
report 87-10-05. 1987. Thesis (Ph.D.).]
108627 THE EMERALD PROGRAMMING LANGUAGE REPORT.
N. C. Hutchinson et al.
[University of Washington. Department of Computer Science. Technical
report 87-10-07. 1987. Also issued as DIKU report no. 87/22,
Department of Computer Science, University of Copenhagen. Also issued
as technical report no. 87-29, Department of Computer Science,
University of Arizona.]
108628 COOK IS FASTER THAN KARP: A STUDY OF REDUCIBILITIES IN NP.
L. Longpre and P. Young.
[University of Washington. Department of Computer Science. Technical
report 87-11-04. 1987.]
108629 ON THE INCLUSION PROPERTIES FOR MULTI-LEVEL CACHE HIERARCHIES.
J.-L. Baer and W.-H. Wang.
[University of Washington. Department of Computer Science. Technical
report 87-11-08. 1987.]
108630 A SIMULATION STUDY OF TWO-LEVEL CACHES.
R. T. Short and H. M. Levy.
[University of Washington. Department of Computer Science. Technical
report 87-11-09. 1987.]
108631 DISTRIBUTED SMALLTALK: INHERITANCE AND REACTIVENESS IN DISTRIBUTED
SYSTEMS.
J. K. Bennett.
[University of Washington. Department of Computer Science. Technical
report 87-12-04. 1987. Thesis (Ph.D.). "This report is an adaption of
the author's PhD dissertation."]
108632 PRACTICAL ALGORITHMS FOR IMAGE COMPONENT LABELING ON SIMD MESH
CONNECTED COMPUTERS.
R. E. Cypher, L. Snyder, and J. L. C. Sanz.
[University of Washington. Department of Computer Science. Technical
report 87-12-05. 1987.]
108633 THE LIMITED PERFORMANCE BENEFITS OF MIGRATING ACTIVE PROCESSES FOR
LOAD SHARING.
D. L. Eager, E. D. Lazowska, and J. Zahorjan.
[University of Washington. Department of Computer Science. Technical
report 87-12-10. 1987.]
108634 ADAPTIVE SELECTION OF QUERY PROCESSING STRATEGIES.
J. I. Icaza.
[University of Waterloo. Department of Computer Science. Research
report CS-87-46. 1987. Thesis (Ph.D.).]
108635 ON THE LIMIT SETS OF CELLULAR AUTOMATA.
K. Culik, J. Pachl, and S. Yu.
[University of Waterloo. Department of Computer Science. Research
report CS-87-47. 1987.]
108636 REPRESENTING FRAME AXIOMS AS DEFAULTS.
S. D. Goodwin.
[University of Waterloo. Department of Computer Science. Research
report CS-87-48. 1987. Thesis (Master of Mathematics in Computer
Science).]
108637 NETWORKS FOR EDUCATION AT THE UNIVERSITY OF WATERLOO.
D. D. Cowan et al.
[University of Waterloo. Department of Computer Science. Research
report CS-87-49. 1987.]
108638 A NETWORK OPERATING SYSTEM FOR INTERCONNECTED LANS WITH HETEROGENEOUS
DATA-LINK LAYERS.
D. D. Cowan, T. M. Stepien, and R. G. Veitch.
[University of Waterloo. Department of Computer Science. Research
report CS-87-50. 1987.]
108639 PROJECT ARIES: A NETWORK FOR CONVENIENT COMPUTING IN EDUCATION.
D. D. Cowan and T. M. Stepien.
[University of Waterloo. Department of Computer Science. Research
report CS-87-51. 1987.]
108640 NAMING OF OBJECTS IN THE CLUSTER SYSTEM.
F. C. M. Lau, J. P. Black, and E. G. Manning.
[University of Waterloo. Department of Computer Science. Research
report CS-87-52. 1987.]
108641 A STUDY OF DISTRIBUTED DEBUGGING.
W. H. Cheung, J. P. Black, and E. G. Manning.
[University of Waterloo. Department of Computer Science. Research
report CS-87-53. 1987.]
108642 DEFAULTS AND CONJECTURES: HYPOTHETICAL REASONING FOR EXPLANATION AND
PREDICTION.
D. L. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-87-54. 1987.]
108643 ROUGHLY SORTING: A GENERALIZATION OF SORTING.
Y. Igarashi and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-87-55. 1987.]
108644 A DYNAMIC FIXED WINDOWING PROBLEM.
R. Klein et al.
[University of Waterloo. Department of Computer Science. Research
report CS-87-56. 1987.]
108645 EXPLORATIONS IN RESTRICTED ORIENTATION GEOMETRY.
G. J. E. Rawlins.
[University of Waterloo. Department of Computer Science. Research
report CS-87-57. 1987. Thesis (Ph.D.).]
108646 A NEW MEASURE OF PRESORTEDNESS.
V. Estivill-Castro and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-87-58. 1987.]
108647 A LOGICAL FRAMEWORK FOR DEFAULT REASONING.
D. L. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-87-59. 1987.]
108648 ON CONSISTENT EQUIAREA TRIANGULATIONS.
R. B. Simpson.
[University of Waterloo. Department of Computer Science. Research
report CS-87-60. 1987.]
108649 AMALGAMATING FUNCTIONAL AND RELATIONAL PROGRAMMING THROUGH THE USE OF
EQUALITY AXIOMS.
K. Yukawa.
[University of Waterloo. Department of Computer Science. Research
report CS-87-61. 1987. Thesis (Ph.D.).]
108650 A DATA MODEL AND QUERY LANGUAGE FOR EXODUS.
M. J. Carey, D. J. DeWitt, and S. L. Vandenberg.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 734. 1987.]
108651 CONSTRUCTION AND DISPLAY ALGORITHMS FOR THE ASP.
W. H. Plantinga and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 735. 1987.]
108652 VISIBILITY, OCCLUSION AND THE ASPECT GRAPH.
W. H. Plantinga and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 736. 1987.]
108653 MU - A SYSTEM FOR SIMULATING AND IMPLEMENTING DISTRIBUTED AND
PARALLEL ALGORITHMS.
M. Livny and U. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 737. 1987.]
108654 EFFICIENT ALGORITHMS FOR POLYHEDRON COLLISION DETECTION.
D. A. Joseph and W. H. Plantinga.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 738. 1987.]
108655 MULTIPROCESSOR ALGORITHMS FOR GENERALIZED NETWORK FLOWS.
R. H. Clark and R. R. Meyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 739. 1987.]
108656 OPTIMIZATION OF MULTIPLE-RELATION MULTIPLE-DISJUNCT QUERIES.
M. Muralikrishna and D. J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 740. 1987.]
108657 A NOTE ON BI-IMMUNITY AND P-CLOSENESS OF P-CHEATABLE SETS IN P/POLY.
J. Goldsmith, D. A. Joseph, and P. Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 741. 1987.]
VOL. 10, NO. 4 04/13/88
108658 PBE: PROGRAMMING BY EAR (A PROGRAMMING ENVIRONMENT FOR THE VISUALLY
HANDICAPPED).
B. W. York.
[Boston University. Department of Computer Science. Technical report
87-009. 1987.]
108659 INCREMENTAL EVALUATION OF ATTRIBUTED GRAPHS.
B. Alpern et al.
[Brown University. Computer Science Department. Technical report
CS-87-29. 1987.]
108660 DECO - A DEVICE COMPILATION SYSTEM.
B. A. Dalio and J. E. Savage.
[Brown University. Computer Science Department. Technical report
CS-88-01. 1988.]
108661 CONSTANT PROPAGATION WITH CONDITIONAL BRANCHES.
M. N. Wegman and F. K. Zadeck.
[Brown University. Computer Science Department. Technical report
CS-88-02. 1988.]
108662 DECIDABLE OPTIMIZATION PROBLEMS FOR DATABASE LOGIC PROGRAMS.
S. S. Cosmadakis et al.
[Brown University. Computer Science Department. Technical report
CS-88-03. 1988.]
108663 TALISMAN: A PIECEWISE LINEAR SIMULATOR BASED ON TREE/LINK
REPARTITIONING.
X. Huang, L. Pillage, and R. A. Rohrer.
[Carnegie-Mellon University. Department of Electrical and Computer
Engineering. SRC-CMU Research Center for Computer-Aided Design.
Reserach report CMUCAD-87-35. 1987.]
108664 COMPUTING A TRUST REGION STEP FOR A PENALTY FUNCTION.
T. F. Coleman and C. Hempel.
[Cornell University. Department of Computer Science. Technical report
87-847. 1987.]
108665 VERIFYING TEMPORAL PROPERTIES WITHOUT USING TEMPORAL LOGIC.
B. Alpern and F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
87-848. 1987. December 1985. Revised: July 1987.]
108666 COMPARISON OF TWO-DIMENSIONAL FFT METHODS ON THE HYPERCUBE: THE
CHOICE BETWEEN STRIPS AND PATCHES.
C. Y. Chu.
[Cornell University. Department of Computer Science. Technical report
87-850. 1987.]
108667 FUNCTIONAL DECOMPOSITION OF POLYNOMIALS.
J. von zur Gathen, D. Kozen, and S. Landau.
[Cornell University. Department of Computer Science. Technical report
87-851. 1987.]
108668 ON PARITY AND NEAR-TESTABILITY: P SUPERSCRIPT A IS NOT EQUAL TO NT
SUPERSCRIPT A WITH PROBABILITY 1.
L. Hemachandra.
[Cornell University. Department of Computer Science. Technical report
87-852. 1987.]
108669 A PARADIGM FOR CONCURRENCY CONTROL PROTOCOLS FOR DISTRIBUTED
DATABASES.
A. E. Abbadi.
[Cornell University. Department of Computer Science. Technical report
87-853. 1987. Thesis (Ph.D.).]
108670 REAL-TIME CONCURRENT COLLECTION ON STOCK MULTIPROCESSORS.
J. R. Ellis, K. Li, and A. W. Appel.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 25. 1988.]
108671 TOWARDS AN INTEGRATED DON'T-KNOW STREAM-AND-PARALLEL LOGIC LANGUAGE.
R. Baghat.
[Imperial College of Science and Technology. Department of Computing.
Reserach report 88/1. 1988.]
108672 AN ABSTRACT MACHINE FOR THE IMPLEMENTATION OF PARLOG ON UNIPROCESSORS.
S. Gregory et al.
[Imperial College of Science and Technology. Department of Computing.
Research report 88/2. n.d. Draft: January 1987.]
108673 INVESTIGATION OF TERMINATION OF EQUATIONAL REWRITING.
I. Gnaedig.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 732. 1987.]
108674 KNUTH-BENDIX PROCEDURE AND NON DETERMINSTIC BEHAVIOR - AN EXAMPLE.
I. Gnaedig.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 733. 1987.]
108675 GETTING LIBERATED FROM THE FREE LIST.
O. Danvy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 735. 1987.]
108676 A LIMITING DISTRIBUTION FOR QUICKSORT.
M. Regnier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 739. 1987.]
108677 CIRCONSCRIPTIONS: CAS DE COMPLETUDE ET D'INCOMPLETUDE.
P. Besnard, J. Houdebine, and R. Rolland.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 745. 1987. Also issued as Publication
interne 373, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108678 PARALLEL MULTIGRID METHODS: IMPLEMENTATION ON SUPRENUM-LIKE
ARCHITECTURES AND APPLICATIONS.
K. Solchenbach, C.-A. Thole, and U. Trottenberg.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 746. 1987.]
108679 DEVELOPMENT OF VEDA, PROTOTYPING TOOL FOR DISTRIBUTED ALGORTHMS.
C. Jard, J.-F. Monin, and R. Groz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 87. 1987. Also issued as Publication
interne 372, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
108680 EVER: A FULL-SCREEN EDITOR FOR NESTED RELATIONS.
D. Plateau and P. Paute.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 88. 1987.]
108681 SYSTEM DESIGN FOR THE TESTING OF MATHEMATICAL SOFTWARE.
A. G. Buckley.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 90. 1987.]
108682 CO-OPERATIVE HIGH PERFORMANCE SEQUENTIAL INFERENCE MACHINE: CHI.
S. Habata et al.
[Institute for New Generation Computer Technology (ICOT). TM-0299.
1987.]
108683 DESIGN, IMPLEMENTATION, AND EVALUATION OF A RELATIONAL DATABASE
ENGINE FOR VARIABLE LENGTH RECORDS.
F. Itoh et al.
[Institute for New Generation Computer Technology (ICOT). TM-0300.
1987.]
108684 FIFTH GENERATION COMPUTER SYSTEMS PROJECT.
T. Kurozumi.
[Institute for New Generation Computer Technology (ICOT). TM-0303.
1987.]
108685 A COLLECTION OF KL1 PROGRAMS. PART 1.
S. Takagi.
[Institute for New Generation Computer Technology (ICOT). TM-0311.
1987.]
108686 AN ALGORITHM FOR PARTIAL EVALUATION WITH CONSTRAINTS.
H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TM-0367.
1987.]
108687 AN ABSTRACT SIGNAL FLOW MODEL BASED DIAGNOSIS EXPERT SYSTEM BUILDING
METHOD FOR TELECOMMUNICATION NETWORK MAINTENANCE.
Y. Koseki, S. Wada, and T. Nishida.
[Institute for New Generation Computer Technology (ICOT). TM-0377.
1987.]
108688 KNOWLEDGE BASE MACHINE BASED ON PARALLEL KERNEL LANGUAGE.
H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TM-0384.
1987. "Oral manuscript."]
108689 INFERENCE MACHINES IN FGCS PROJECT.
S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TM-0386.
1987. "Hardcopy of the slides."]
108690 ESP GUIDE.
S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TM-0388.
1987.]
108691 INFERRING PARSERS OF CONTEXT-FREE LANGUAGES FROM EXAMPLES OF THEIR
STRUCTURAL DESCRIPTIONS.
Y. Sakakibara.
[Institute for New Generation Computer Technology (ICOT). TM-0403.
1987.]
108692 PARALLEL PROGRAMMING WITH LAYERED STREAMS.
A. Okumura and U. Matsumoto.
[Institute for New Generation Computer Technology (ICOT). TR-241.
1987.]
108693 AN ABSTRACT KL1 MACHINE AND ITS INSTRUCTION SET.
Y. Kimura and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-246.
1987.]
108694 EXPERT MODEL FOR KNOWLEDGE ACQUISITION.
Y. Iwashita, K. Tsubaki, and K. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-254.
1987.]
108695 PARALLEL CONTROL TECHNIQUES FOR RETRIEVAL PROCESSES IN THE PARALLEL
LOGIC PROGRAMMING LANGUAGE AND THEIR EVALUATION.
T. Takewaki and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-255.
1987.]
108696 A SELF APPLICABLE PARTIAL EVALUATOR AND ITS USE IN INCREMENTAL
COMPILATION.
H. Fujita and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-258.
1987.]
108697 PERFORMANCE EVALUATION OF SUPERIMPOSED CODE SCHEME FOR RELATIONAL
OPERATIONS.
M. Wada et al.
[Institute for New Generation Computer Technology (ICOT). TR-259.
1987.]
108698 INDUCTIVE INFERENCE OF LOGIC PROGRAMS BASED ON ALGEBRAIC SEMANTICS.
Y. Sakakibara.
[Institute for New Generation Computer Technology (ICOT). TR-260.
1987.]
108699 A SIMULATION STUDY OF A KNOWLEDGE BASE MACHINE ARCHITECTURE.
H. Sakkai et al.
[Institute for New Generation Computer Technology (ICOT). TR-261.
1987.]
108700 POLYMORPHIC TYPE INFERENCE IN PROLOG BY ABSTRACT INTERPRETATION.
K. Horiuchi and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-263.
1987.]
108701 PARALLEL INFERENCE SYSTEM RESEARCHES IN THE FGCS PROJECT.
T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-264.
1987.]
108702 HARDWARE ARCHITECTURE OF SEQUENTIAL INFERENCE MACHINE: PSI-11.
H. Nakashima and K. Nakajima.
[Institute for New Generation Computer Technology (ICOT). TR-265.
1987.]
108703 RESTRICTED LEAST FIXED POINT AND RECURSIVE QUERY PROCESSING
STRATEGIES.
N. Miyazaki and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-270.
1987.]
108704 CONCURRENT PROGRAM SYNTHESIS WITH REUSABLE COMPONENTS USING TEMPORAL
LOGIC.
N. Uchihira et al.
[Institute for New Generation Computer Technology (ICOT). TR-271.
1987.]
108705 PERFORMANCE AND ARCHITECTURAL EVALUATION OF THE PSI MACHINE.
H. Nakashima et al.
[Institute for New Generation Computer Technology (ICOT). TR-274.
1987.]
108706 INFERENCE MACHINE IN FGCS PROJECT.
S. Uchida.
[Institute for New Generation Computer Technology (ICOT). TR-278.
1987.]
108707 ANALYZING SUCCESS PATTERNS OF LOGIC PROGRAMS BY ABSTRACT HYBRID
INTERPRETATION.
T. Kanamori and T. Kawamura.
[Institute for New Generation Computer Technology (ICOT). TR-279.
1987.]
108708 PROTON: AN EXPERT SYSTEM TOOL ON THE PSI.
S. Shindo et al.
[Institute for New Generation Computer Technology (ICOT). TR-281.
1987.]
108709 REMOTE OBJECT ACCESSING MECHANISM IN SIMPOS - ITS DESIGN AND
APPLICATION.
K. Yoshida.
[Institute for New Generation Computer Technology (ICOT). TR-283.
1987.]
108710 PARALLEL CONTROL TECHNIQUE AND PERFORMANCE OF AN MPPM KNOWLEDGE BASE
MACHINE.
H. Sakai et al.
[Institute for New Generation Computer Technology (ICOT). TR-284.
1987.]
108711 PROGRAMMING IN ESP - EXPERIENCES WITH SIMPOS.
T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-285.
1987.]
108712 ANALYSIS OF DESIGN SPECIFICATION IN A COMMUNICATION SYSTEM BY MEANS
OF PETRI NETS.
H. Hasegawa, W. Tanaka, and K. Shibata.
[Institute for New Generation Computer Technology (ICOT). TR-289.
1987.]
108713 TOP-DOWN ZOOMING DIAGNOSIS OF LOGIC PROGRAMS.
M. Maeji and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-290.
1987.]
108714 KNOWLEDGE BASE MACHINE BASED ON PARALLEL KERNEL LANGUAGE.
H. Yokota, H. Itoh, and T. Takewaki.
[Institute for New Generation Computer Technology (ICOT). TR-292.
1987.]
108715 A SUPERIMPOSED CODE SCHEME FOR DEDUCTIVE DATABASES.
M. Wada et al.
[Institute for New Generation Computer Technology (ICOT). TR-293.
1987.]
108716 A SIMULATION STUDY OF A KNOWLEDGE BASE MACHINE ARCHITECTURE.
H. Sakai and S. Shibayama.
[Institute for New Generation Computer Technology (ICOT). TR-294.
1987.]
108717 QPC: QJ-BASED PROOF COMPILER - SIMPLE EXAMPLES AND ANALYSIS.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-296.
1987.]
108718 A MINIMAL CHANGE OF BELIEF - A CRITERION OF BELIEF REVISION.
K. Satoh.
[Institute for New Generation Computer Technology (ICOT). TR-297.
1987.]
108719 T: A SIMPLE REDUCTION LANGUAGE BASED ON COMBINATORY TERM REWRITING.
T. Ida, Y. Toyama, and A. Aiba.
[Institute for New Generation Computer Technology (ICOT). TR-298.
1987.]
108720 CURRENT R & D RESULTS AND THEIR PERSECTIVE IN JAPANESE FIFTH
GENERATION COMPUTER SYSTEMS (FGCS).
T. Ichiko and T. Kurozumi.
[Institute for New Generation Computer Technology (ICOT). TR-300.
1987.]
108721 PARTIAL EVALUATION OF QUERIES IN DEDUCTIVE DATABASES.
C. Sakama and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-302.
1987.]
108722 CONSIDERATION OF A HYPOTHESIS-BASED REASONING SYSTEM.
S. Kunifuji, K. Tsurumaki, and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-306.
1987.]
108723 A'UM - PARALLEL OBJECT-ORIENTED LANGUAGE UPON KL1.
K. Yoshida and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-308.
1987.]
108724 PERFORMANCE ISSUES IN DYNAMIC DATA FLOW ARCHITECTURES.
M. Kumar and K. Ekanadham.
[International Business Machines Corporation (IBM). Research
Division. RC 13231. 1987.]
108725 PASSIVE OPTICAL STAR AS A BUILDING BLOCK OF A DISTRIBUTED SYSTEM.
Y. Ofek.
[International Business Machines Corporation (IBM). Research
Division. RC 13247. 1987.]
108726 CONNECTED COMPONENT LABELING ON POLYMORPHIC TORUS ARCHITECTURE.
M. Maresca and M. A. Lavin.
[International Business Machines Corporation (IBM). Research
Division. RC 13270. 1987.]
108727 ON THE ZEROS OF A POLYNOMIAL VECTOR FIELD.
T. Sakkalis.
[International Business Machines Corporation (IBM). Research
Division. RC 13303. 1987.]
108728 FAST FAULT SIMULATION AND TEST GENERATION FOR PLAS IN A PARALLEL
PROCESSING ENVIRONMENT.
P. Bose.
[International Business Machines Corporation (IBM). Research
Division. RC 13343. 1987.]
108729 A NOTE ON THE INDEPENDENCE NUMBER OF TRIANGLE-FREE GRAPHS II.
J. B. Shearer.
[International Business Machines Corporation (IBM). Research
Division. RC 13344. 1987.]
108730 USING SYMMETRIES AND ANTISYMMETRIES TO ANALYZE A PARALLEL MULTIGRID
ALGORITHM: THE ELLIPTIC BOUNDARY VALUE PROBLEM CASE.
C. C. Douglas and B. F. Smith.
[International Business Machines Corporation (IBM). Research
Division. RC 13355. 1987.]
108731 AGGREGATION SORTING ALGORITHMS.
C. C. Douglas and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. RC 13360. 1987.]
108732 ON A MODEL-ROBUST TRAINING METHOD FOR SPEECH RECOGNITION.
A. Nadas, D. Nahamoo, and M. A. Picheny.
[International Business Machines Corporation (IBM). Research
Division. RC 13362. 1987.]
108733 TLB CONSISTENCY ON HIGHLY-PARALLEL SHARED-MEMORY MULTIPROCESSORS.
P. J. Teller and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. RC 13366. 1987.]
108734 PERFORMANCE OF RELATIONAL JOIN OPERATIONS ON PARALLEL ARCHITECTURES.
M. S. Lakshmi and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. RC 13370. 1987.]
108735 VOLATILE LOGGING IN N-FAULT-TOLERANT DISTRIBUTED SYSTEMS.
R. E. Strom, D. F. Bacon, and S. A. Yemini.
[International Business Machines Corporation (IBM). Research
Division. RC 13373. 1987.]
108736 ANALYZING SCHEDULED MAINTENANCE POLICIES FOR REPAIRABLE COMPUTER
SYSTEMS.
E. de Souza e Silva and H. R. Gail.
[International Business Machines Corporation (IBM). Research
Division. RC 13379. 1987.]
108737 SQL INFERENCE ENGINE: THE ARCHITECTURE AND DESIGN.
K.-Y. Whang.
[International Business Machines Corporation (IBM). Research
Division. RC 13415. 1988.]
108738 ON IMPLEMENTING ADDITION IN VLSI TECHNOLOGY.
V. G. Oklobdzija and E. R. Barnes.
[International Business Machines Corporation (IBM). Research
Division. RC 13427. 1987.]
108739 THE INTERACTION OF NUMERICS AND MACHINES.
C. C. Douglas et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13429. 1987.]
108740 TGMS: AN OBJECT-ORIENTED SYSTEM FOR PROGRAMMING GEOMETRY.
W. C. Dietrich Jr. et al.
[International Business Machines Corporation (IBM). Research
Division. RC 13444. 1988.]
108741 LEARNING BY DOING WITH SIMULATED INTELLIGENT HELP.
J. M. Carroll and A. P. Aaronson.
[International Business Machines Corporation (IBM). Research
Division. RC 13453. 1988.]
108742 GRAMMAR-LIKE FUNCTIONAL RULES FOR REPRESENTING QUERY OPTIMIZATION
ALTERNATIVES.
G. M. Lohman.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5992. 1987.]
108743 NEURAL NETWORKS, ERROR-CORRECTING CODES AND POLYNOMIALS OVER THE
BINARY N-CUBES.
J. Bruck and M. Blaum.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6003. 1987.]
108744 THE COMPLEXITY OF THE PIGEONHOLE PRINCIPLE.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6006. 1987.]
108745 ON ORIENTATIONS AND SHORTEST PATHS.
R. Hassin and N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6008. 1987.]
108746 DECIDABILITY AND UNDECIDABILITY RESULTS FOR BOUNDEDNESS OF LINEAR
RECURSIVE QUERIES.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6009. 1987.]
108747 REASONING ABOUT KNOWLEDGE AND PROBABILITY: PRELIMINARY REPORT.
R. Fagin and J. Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6020. 1988.]
108748 FIXPOINT REPRESENTATIONS OF CHARACTERISTIC SETS OF LINEAR-TIME
TEMPORAL FORMULAS.
E. Kranakis and K. N. Oikonomou.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8754. 1987. "Extended abstract."]
108749 CONTRACTIONS IN COMPARING CONCURRENCY SEMANTICS.
J. N. Kok and J. J. M. M. Rutten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8755. 1987.]
108750 INTERACTION MANAGEMENT IN CAD SYSTEMS WITH A HISTORY MECHANISM.
Y. Yamaguchi, F. Kimura, and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8756. 1987.]
108751 A NETWORK APPROACH TO THE CERTAINTY FACTOR MODEL.
L. C. van der Gaag.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8757. 1987.]
108752 SIMPLE MULTIREADER REGISTERS USING TIME-STAMP SCHEMES.
A. Israeli, M. Li, and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8758. 1987. "Extended abstract."]
108753 A SEMANTIC APPROACH TO FAIRNESS.
J. J. M. M. Rutten and J. I. Zucker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8759. 1987.]
108754 MULTIGRID METHODS FOR ELLIPTIC PDES.
W. M. Lioen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8722. 1987.]
108755 A COMPARATIVE STUDY OF CHEBYSHEV ACCELERATION AND RESIDUE SMOOTHING
IN THE SOLUTION OF NONLINEAR ELLIPTIC DIFFERENCE EQUATIONS.
P. J. van der Houwen, B. P. Sommeijer, and G. Pontrelli.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8723. 1987.]
108756 STABILITY AND CONVERGENCE OF THE PEACEMAN-RACHFORD ADI METHOD FOR
INITIAL-BOUNDARY VALUE PROBLEMS.
W. H. Hundsdorfer and J. G. Verwer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8724. 1987.]
108757 SOLVING BIDIAGONAL SYSTEMS OF LINEAR EQUATIONS ON THE CDC CYBER 205.
J. J. F. M. Schlichting and H. A. van der Vorst.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8725. 1987.]
108758 NUMERICAL EXPERIENCE WITH SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHMS
FOR EQUALITY CONSTRAINED NONLINEAR PROGRAMMING.
D. F. Shanno and K. H. Phua.
[National University of Singapore. Department of Information Systems
and Computer Science. TR11/87. 1987.]
108759 AN INTEGRATED APPROACH TO GATE MATRIX LAYOUT.
H. W. Leong.
[National University of Singapore. Department of Information Systems
and Computer Science. TR21/87. 1987.]
108760 DISCRETIONARY CHANNEL ROUTING USING SCORE FUNCTION.
K.-P. Tan and T.-S. Tan.
[National University of Singapore. Department of Information Systems
and Computer Science. TR31/87. 1987.]
108761 SWITCHBOARD ROUTING USING SCORE FUNCTION.
K.-P. Tan and T.-S. Tan.
[National University of Singapore. Department of Information Systems
and Computer Science. TR41/87. 1987.]
108762 A METHOD FOR SEMANTIC VALIDATION OF A CLASS OF INTEGRITY CONSTRAINTS.
P. Rajagopalan and T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TR51/87. 1987.]
108763 A HIGH-SPEED CELLULAR-ARRAY MULTIPLIER WITH TWO-ADDER CELLS.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 595. 1986.]
108764 TOWARD AN ALGEBRAIC MODEL FOR COMMUNICATING PROCESSES.
J. Winkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 596. 1986.]
108765 INEVITABILITY IN DIAMOND-DISCRETE SYSTEMS.
W. Penczek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 598. 1987.]
108766 FREQUENTIST INTERPRETATION OF BAYES CONFIDENCE REGIONS AND THE
BINOMIAL SCHEME.
A. Matuszewski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 599. 1987.]
108767 A SELECTION THEOREM.
A. Idzik.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 600. 1987.]
108768 RIGHTS, SIMILARITY OF INDIVIDUALS AND N-PERSON SYMMETRICAL GAMES.
H. Sosnowska.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 602. 1987.]
108769 A FAST PARAMETRIC MAXIMUM FLOW ALGORITHM.
G. Gallo, M. D. Grigoriadis, and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-105-87.
1987.]
108770 FINDING MINIMUM-COST CICULATIONS BY SUCCESSIVE APPROXIMATION.
A. V. Goldberg and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-106-87.
1987. "A preliminary version of this paper appeared in the
'Proceedings of the Nineteenth Annual A.C.M. Symposium on Theory of
Computing, May 25-27, 1987.'"]
108771 FINDING MINIMUM-COST CIRCULATIONS BY CANCELING NEGATIVE CYCLES.
A. V. Goldberg and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-107-87.
1987.]
108772 A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSUEDOFOREST.
H. N. Gabow and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-108-87.
1987.]
108773 RELAXED HEAPS: AN ALTERNATIVE TO FIBONACCI HEAPS.
J. R. Driscoll et al.
[Princeton University. Department of Computer Science. CS-TR-109-87.
1987.]
108774 DISTRIBUTED REACHABILITY ANALYSIS FOR PROTOCOL VERIFICATION
ENVIRONMENTS.
S. Aggarwal, R. Alonso, and C. Courcoubetis.
[Princeton University. Department of Computer Science. CS-TR-110-87.
1987.]
108775 FASTER SCALING ALGORITHMS FOR NETWORK PROBLEMS.
H. N. Gabow and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-111-87.
1987.]
108776 AN EXPERIMENTAL EVALUATION OF LOAD BALANCING STRATEGIES.
R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-112-87.
1987.]
108777 DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS.
D. P. Dobkin, S. J. Friedman, and K. J. Supowit.
[Princeton University. Department of Computer Science. CS-TR-113-87.
1987.]
108778 COVERING MINIMA AND LATTICE POINT FREE CONVEX BODIES.
R. Kanna and L. Lovasz.
[Princeton University. Department of Computer Science. CS-TR-114-87.
1987.]
108779 A DENSITY THEOREM FOR PURELY ITERATIVE ZERO FINDING METHODS.
J. Friedman.
[Princeton University. Department of Computer Science. CS-TR-115-87.
1987.]
108780 RANDOM POLYNOMIALS AND APPROXIMATE ZEROS OF NEWTON'S METHOD.
J. Friedman.
[Princeton University. Department of Computer Science. CS-TR-116-87.
1987.]
108781 EXPLOITING SYMMETRIES FOR LOW-COST COMPARISON OF FILE COPIES.
D. Barbara and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-117-87.
1987.]
108782 IMPROVED TIME BOUNDS FOR THE MAXIMUM FLOW PROBLEM.
R. K. Ahuja, J. B. Orlin, and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-118-87.
1987.]
108783 CRASH RECOVERY FOR MEMORY-RESIDENT DATABASES.
K. Salem and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-119-87.
1987.]
108784 SHARING JOBS AMONG INDEPENDENTLY OWNED PROCESSORS.
R. Alonso and L. L. Cova.
[Princeton University. Department of Computer Science. CS-TR-120-87.
1987.]
108785 ON SELECTING THE SECOND LARGEST WITH MEDIAN TESTS.
A. C. Yao.
[Princeton University. Department of Computer Science. CS-TR-121-87.
1987.]
108786 REFLECTIONS IN CURVED SURFACES.
E. S. Panduranga.
[Princeton University. Department of Computer Science. CS-TR-122-87.
1987. Thesis (Ph.D.).]
108787 RELIABLE BROADCAST IN NETWORKS WITH NONPROGRAMMABLE SERVERS.
H. Garcia-Molina, B. Kogan, and N. A. Lynch.
[Princeton University. Department of Computer Science. CS-TR-123-87.
1987.]
108788 A PROBABILISTIC MODEL FOR CLOCK SKEW.
S. D. Kugelmass and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-124-87.
1987.]
108789 A DATA STRUCTURE FOR MANIPULATING THREE-DIMENSIONAL SUBDIVISIONS.
M. J. Laszlo.
[Princeton University. Department of Computer Science. CS-TR-125-87.
1987. Thesis (Ph.D.).]
108790 CHECKPOINTING MEMORY-RESIDENT DATABASES.
K. Salem and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-126-87.
1987.]
108791 A SHARED MEMORY ARCHITECTURE FOR DISTRIBUTED COMPUTING.
A. Park.
[Princeton University. Department of Computer Science. CS-TR-127-87.
1987. Thesis (Ph.D.).]
108792 ANALYSIS OF ALGORITHMS FOR THE CONFIGURATION OF WAFER SCALE LINEAR
ARRAYS IN THE PRESENCE OF DEFECTS.
D. A. Doukas and A. S. LaPaugh.
[Princeton University. Department of Computer Science. CS-TR-128-87.
1987.]
108793 SCHEDULING REAL-TIME TRANSACTIONS.
R. Abbott and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-129-87.
1987.]
108794 THE REUSE SYSTEM: CATALOGING AND RETRIEVAL OF REUSABLE SOFTWARE.
S. P. Arnold and S. L. Stepoway.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 86-CSE-22. 1986.]
108795 THE MAXIMUM CONCURRENT FLOW PROBLEM.
F. Shahrokhi and D. W. Matula.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-4. 1988.]
108796 AN ABSTRACT MACHINE MODEL TO SUPPORT LIMITED-OR(LOR)/RESTRICTED-AND
PARALLELISM(RAP) IN LOGIC PROGRAMS.
P. Biswas and S.-C. Su.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-5. 1987. February 1987. Revised:
July 1987.]
108797 A PARALLEL ARCHITECTURE MODEL SUPPORTING DATAFLOW OPERATIONS.
B. Shirazi.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-7. 1987.]
108798 PARALLEL RENDERING OF FRACTAL SURFACES.
S. L. Stepoway and M. Christiansen.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-8. 1987.]
108799 AN ANNOTATED BIBLIOGRAPHY ON SOFTWARE METRICS.
M. M. Tanik.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-9. 1987.]
108800 REUSABILITY AND CONCURRENCY ISSUES IN THE REAL-TIME USE OF ADA.
W. P. Yin, P. H. Liou, and M. M. Tanik.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-11. 1987.]
108801 A HYPERCUBE-BASED DATAFLOW MACHINE.
B. Shirazi.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-15. 1987.]
108802 AN AGENT FOR INTELLIGENT MODEL MANAGEMENT.
J. I. C. Liu, D. Y. Y. Yun, and G. Klein.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-17. 1987.]
108803 ANALYSIS OF AUTOMATED DEBUGGING AND AN AUTOMATIC DEBUGGING EXPERIMENT.
D. E. Langworthy, D. Y. Y. Yun, and M. M. Tanik.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-19. 1987.]
108804 VLSI DESIGN OF A SIGNAL PROCESSING CHIP.
B. Shirazi and P. Mukherjee.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-20. 1987.]
108805 A PARTIALLY ANNOTATED BIBLIOGRAPHY ON CRYPTOGRAPHY.
M. M. Tanik.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-25. 1987.]
108806 TOPICS IN STATIC DATA COLECTION AND PROGRAM COMPLEXITY.
M. M. Tanik.
[Southern Methodist University. Department of Computer Science and
Engineering. Technical report 87-CSE-26. 1987.]
035335 ALLOCATIONS OF OBJECTS CONSIDERED AS NONDETERMINISTIC EXPRESSIONS -
TOWARD A MORE ABSTRACT AXIOMATICS OF ACCESS TYPES.
S. Meldal.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-335.
September 1987. Also issued as Report no. 35, Program Analysis and
Verification Group, Computer Systems Laboratory, Stanford
University.]
035340 STORAGE RECLAMATION MODELS FOR ADA PROGRAMS.
G. O. Mendal.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-340.
October 1987. Also issued as Report no. 36, Program Analysis and
Verification Group, Computer Systems Laboratory, Stanford
University.]
035341 LINKING PROGRAMS INCREMENTALLY.
R. W. Quong and M. A. Linton.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-341.
December 1987.]
035342 INTERPROCEDURAL ANALYSIS USELESS FOR CODE OPTIMIZATION.
S. Richardson and M. Ganapathi.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-342.
November 1987.]
035343 EDITING GRAPHICAL OBJECTS USING PROCEDURAL REPRESENTATIONS.
P. J. Asente.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-343.
October 1987. Thesis (Ph.D.).]
035344 PERFORMANCE PREDICTION OF CONCURRENT SYSTEMS.
V. W. K. Mak.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-344.
December 1987. Thesis (Ph.D.).]
035345 TRADEOFFS IN PROCESSOR-ARCHITECTURE AND DATA-BUFFER DESIGN.
J. M. Mulder.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-345.
December 1987. Thesis (Ph.D.).]
035347 TRACE COMPACTION USING CACHE FILTERING WITH BLOCKING.
A. Agarwal.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-347.
December 1987.]
035348 THOR USER'S MANUAL: TUTORIAL AND COMMANDS.
R. Alverson et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-348.
January 1988.]
035349 THOR USER'S MANUAL: LIBRARY FUNCTIONS.
R. Alverson et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-349.
January 1988.]
035350 THE ILSP BEHAVIORAL DESCRIPTION LANGUAGE AND ITS GRAPH REPRESENTATION
FOR BEHAVIORAL SYNTHESIS.
M. Odani et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-350.
March 1988.]
048087 APPLYING A SEMANTIC MODEL TO AN IMMUNOLOGY DATABASE.
T. Barsalou and G. Wiederhold.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-23. 1988. Revised: February 1988.]
048087 UTILITY-DIRECTED PRESENTATION OF SIMULATION RESULTS.
J. McLaughlin.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-87-59. December 1987.]
048087 KNOWLEDGE BASE TOURS: INTRODUCING A KNOWLEDGE BASED SYSTEM TO A
NOVICE USER.
S. Barnhouse.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL 87-73. December 1987.]
048088 PROBLEMS WITH PROBLEM-SOLVING IN PARALLEL: THE POLIGON SYSTEM 1.0.
J. P. Rice.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-04. January 1988.]
048088 A PERFORMANCE COMPARISON OF SHARED VARIABLES VS. MESSAGE PASSING.
G. T. Byrd.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-10. January 1988.]
048088 OPERATIONALITY AND GENERALITY IN EXPLANATION-BASED LEARNING: SEPARATE
DIMENSIONS OR OPPOSITE ENDPOINTS.
R. M. Keller.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-11. February 1988.]
048088 INTEGRATION DISCONTINUITY: INTERFACING USERS AND SYSTEMS.
C. E. Wulfman et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-12. February 1988.]
108808 ON THE COMBINATION OF THE IDEAS OF MULTILEVEL SOLVERS USING
HIERARCHICAL BASES AND THE SUBSTRUCTURING TECHNIQUE FOR THE FINITE
ELEMENT METHOD.
G. Michael.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8709. 1987.]
108809 TWO CONTRIBUTIONS TO THE THEORY OF FINITE REPLACEMENT SYSTEMS.
V. Diekert.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8710. 1987.]
108810 AN APPROACH TO THE SEMANTICS OF APPROXIMATIVE COMPUTATION.
R. Obermeir.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8711. 1987.]
108811 OPERATING SYSTEM SUPPORT FOR PARALLEL NUMERICAL SOFTWARE DEVELOPMENT.
R. Foeschmeier and U. Ruede.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8712. 1987.]
108812 DBA: EFFICIENT INTELLIGENT SEARCH IN DEDUCTIVE DATABASES.
H. Schmidt et al.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8713. 1987.]
108813 ATTRIBUTIERTE TRANSITIONSNETZE UND IHRE ANWENDUNGEN IN
PROGRAMMIERUMGEBUNGEN.
J. Knopp.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8714. 1987.]
108814 FITTING A CIRCLE TO RADIALLY SUPPRESSED DATA.
A. B. Forbes.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 103/87. 1987.]
108815 MULTIPLE INHERITANCE, A STRUCTURING MECHANISM FOR DATA, PROCESSES AND
PROCEDURES.
K. S. Thomsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-209.
1986.]
108816 TIME REPRESENTATION AND USE IN EXPERT SYSTEMS.
N. Klarlund.
[University of Aarhus. Department of Computer Science. DAIMI PB-211.
1986.]
108817 STATIC EXCEPTION HANDLING IN BETA.
J. L. Knudsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-214.
1986.]
108818 SYNCHRONIZED TRANSITIONS.
A. P. Ravn and J. Staunstrup.
[University of Aarhus. Department of Computer Science. DAIMI PB-219.
1987.]
108819 A MODAL LOGIC FOR A SUBCLASS OF EVENT STRUCTURES.
K. Lodaya and P. S. Thiagarajan.
[University of Aarhus. Department of Computer Science. DAIMI PB-220.
1987.]
108820 TRANSFORMATIONS AND ABSTRACT PRESENTATIONS IN A LANGUAGE DEVELOMENT
ENVIRONMENT.
K. Normark.
[University of Aarhus. Department of Computer Science. DAIMI PB-222.
1987. Thesis (Ph.D.).]
108821 GRAPHICS AND THEIR GRAMMARS.
L. Hess and B. H. Mayoh.
[University of Aarhus. Department of Computer Science. DAIMI PB-223.
1987.]
108822 A DISTRIBUTED SPANNING TREE ALGORITHM.
K. E. Johansen et al.
[University of Aarhus. Department of Computer Science. DAIMI PB-226.
1987.]
108823 THE COMPUTATIONAL EFFICACY OF FINITE FIELD ARITHMETIC.
G. Frandsen and C. Sturtivant.
[University of Aarhus. Department of Computer Science. DAIMI PB-227.
1987.]
108824 SELF-TIMED ITERATION.
M. R. Greenstreet, J. Staunstrup, and T. E. Williams.
[University of Aarhus. Department of Computer Science. DAIMI PB-228.
1987.]
108825 THE BETA PROGRAMMING LANGUAGE.
B. B. Kristensen et al.
[University of Aarhus. Department of Computer Science. DAIMI PB-229.
1987.]
108826 BLOCK STRUCTURE AND OBJECT-ORIENTED LANGUAGES.
O. L. Madsen.
[University of Aarhus. Department of Computer Science. DAIMI PB-230.
1987.]
108827 CLASSIFICATION OF ACTIONS OR INHERITANCE ALSO FOR METHODS.
B. B. Kristensen et al.
[University of Aarhus. Department of Computer Science. DAIMI PB-231.
1987.]
108828 A DISTRIBUTED ELECTION AND SPANNING TREE ALGORITHM BASED ON DEPTH
FIRST SEARCH TRAVERSALS.
S. Skyum.
[University of Aarhus. Department of Computer Science. DAIMI PB-232.
1987.]
108829 PROTOTYPING REVISITED - DESIGN WITH USERS IN A COOPERATIVE SETTING.
S. Bodker.
[University of Aarhus. Department of Computer Science. DAIMI PB-233.
1987.]
108830 A COOPERATIVE WORK PERSPECTIVE ON USE AND DEVELOPMENT OF COMPUTER
ARTIFACTS.
P. Sorgaard.
[University of Aarhus. Department of Computer Science. DAIMI PB-234.
1987.]
108831 COROUTINE SEQUENCING IN BETA.
B. B. Kristensen et al.
[University of Aarhus. Department of Computer Science. DAIMI PB-235.
1987.]
108832 AN OBJECT ORIENTED METAPROGRAMMING SYSTEM.
O. L. Madsen and C. Norgaard.
[University of Aarhus. Department of Computer Science. DAIMI PB-236.
1987.]
108833 THE HEAD AND THE HEART: USING GENDER ANALYSIS TO STUDY THE SOCIAL
CONSTRUCTION OF COMPUTER SYSTEMS.
J. Greenbaum.
[University of Aarhus. Department of Computer Science. DAIMI PB-237.
1987.]
108834 ZEN AND THE ART OF TEACHING SYSTEMS DEVELOPMENT.
J. Greenbaum and L. Mathiassen.
[University of Aarhus. Department of Computer Science. DAIMI PB-238.
1987.]
108835 TEMPORAL ADVERBIALS IN THE TWO TRACK THEORY OF TIME.
E. Oversteegen.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-06. 1987.]
108836 TYPE CHANGE IN SEMANTICS: THE SCOPE OF QUANTIFICATION AND
COORDINATION.
H. Hendriks.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-09. 1987.]
108837 THE CONSTRUCTION OF PROPERTIES UNDER PERSPECTIVES.
R. Bartsch.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-08. 1987.]
108838 CATEGORICAL GRAMMAR AND TYPE THEORY.
J. van Bentham.
[University of Amsterdam. Institute for Language, Logic and
Information (ITLI). Report no. 87-07. 1987.]
108839 A SIMPLE SYSTEM FOR CONSTRUCTING DISTRIBUTED MIXED-LANGUAGE PROGRAMS.
R. Hayes, S. W. Manweiler, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 87-1a.
1987. December 19, 1986. Revised: September 1, 1987.]
108840 ON THE PRAGMATICS OF LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 87-3.
1987.]
108841 REAL-TIME GARBAGE COLLECTION OF STRINGS AND LINKED DATA STRUCTURES.
K. Nilsen.
[University of Arizona. Department of Computer Science. TR 87-5.
1987.]
108842 PROFILE: A SYSTEM FOR NAMING INTERNET RESOURCES.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 87-7a.
1987. Revised: June 10, 1987.]
108843 DRAGONMAIL: AN EXERCISE IN DISTRIBUTED COMPUTING.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 87-8.
1987.]
108844 APPROXIMATION DOMAINS FOR EFFICIENT FLOW ANALYSIS OF LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 87-9.
1987.]
108845 SYNTHESIZING CONTROL STRATEGIES FOR AND-PARALLEL LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 87-12.
1987.]
108846 MECHANISMS FOR FAILURE HANDLING IN DISTRIBUTED PROGRAMMING LANGUAGES.
R. D. Schlichting, F. Cristian, and T. D. M. Purdin.
[University of Arizona. Department of Computer Science. TR 87-13.
1987.]
108847 REASONING ABOUT NAMING SYSTEMS.
S. K. Debray and L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 87-16.
1987.]
108848 A YELLOW-PAGES SERVICE FOR A LOCAL-AREA NETWORK.
L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 87-17.
1987.]
108849 DISTRIBUTION-FREE BOUNDS ON THE EXPECTATION OF THE MAXIMUM.
P. J. Downey.
[University of Arizona. Department of Computer Science. TR 87-18.
1987.]
108850 INCREMENTAL ATTRIBUTE EVALUATION: AN ALGORITHM FOR LAZY EVALUATION IN
GRAPHS.
S. E. Hudson.
[University of Arizona. Department of Computer Science. TR 87-20.
1987.]
108851 MOMENT BOUNDS FOR ERLANG ORDER STATISTICS WITH AN APPLICATION TO
MAKESPAN SCHEDULING.
P. J. Downey.
[University of Arizona. Department of Computer Science. TR 87-21.
1987.]
108852 ANALYSIS OF PARALLEL ITERATION.
P. J. Downey.
[University of Arizona. Department of Computer Science. TR 87-22a.
1987.]
108853 THE GREEDY LOAD SHARING ALGORITHM.
S. Chowdhury.
[University of Arizona. Department of Computer Science. TR 87-23.
1987.]
108854 STATIC INFERENCE OF MODES AND DATA DEPENDENCIES IN LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 87-24.
1987.]
108855 OBSERVATIONS ON BUILDING DISTRIBUTED LANGUAGES AND SYSTEMS.
R. D. Schlichting et al.
[University of Arizona. Department of Computer Science. TR 87-25.
1987.]
108856 ENHANCING FILE AVAILABILITY IN DISTRIBUTED SYSTEMS (THE SAGUARO FILE
SYSTEM).
T. D. M. Purdin.
[University of Arizona. Department of Computer Science. TR 87-26.
1987. Thesis (Ph.D.).]
108857 REVISED REPORT ON THE SR PROGRAMMING LANGUAGE.
G. R. Andrews and R. A. Olsson.
[University of Arizona. Department of Computer Science. TR 87-27.
1987.]
108858 FINE-GRAINED MOBILITY IN THE EMERALD SYSTEM.
E. Jul et al.
[University of Arizona. Department of Computer Science. TR 87-28.
1987.]
108860 FLOW ANALYSIS OF DYNAMIC LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 87-30.
1987.]
054364 AN OMEGA(N SUPERSCRIPT 8/7) LOWER BOUND ON THE RANDOMIZED COMPLEXITY
OF GRAPH PROPERTIES.
V. King.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/364. 1987.]
054365 PRIMAL CONTENT AND ACTUAL CONTENT: AN ANTIDOTE TO LITERAL MEANING.
R. Wilensky.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/365. 1987.]
054366 RUN-TIME PARTITIONING OF SCIENTIFIC CONTINUUM CALCULATIONS RUNNING ON
MULTIPROCESSORS.
S. B. Baden.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/366. 1987. Thesis (Ph.D.). Also issued as LBL-23625,
Lawrence Berkeley Laboratory, University of California.]
054368 PARALLEL ALGORITHMS FOR ZERO-ONE SUPPLY-DEMAND PROBLEMS.
N. Nisan and D. Soroker.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/368. 1987.]
054369 CONTROL IMPLEMENTATION FOR THE SPUR FLOATING POINT COPROCESSOR.
D. Jensen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/369. 1987.]
054370 BUMB, A MOTION DESCRIPTION AND ANIMATION PACKAGE.
S. A. Oakland.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/370. 1987.]
054371 OPTIMAL PARALLEL CONSTRUCTION OF PRESCRIBED TOURNAMENTS.
D. Soroker.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/371. 1987.]
054372 CIRCUIT DESIGN TECHNIQUES FOR A FLOATING-POINT PROCESSOR.
T. Hu.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/372. 1987.]
054373 SPUR LISP: DESIGN AND IMPLEMENTATION.
B. Zorn et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/373. 1987.]
054374 EFFICIENT ANALYSIS OF CACHING SYSTEMS.
J. G. Thompson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/374. 1987. Thesis (Ph.D.).]
054375 AN AUTHENTICATION SCHEME FOR USE IN DYNAMIC LOAD BALANCING.
C. Parris.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/375. 1987. Also issued as Report no. 87.7, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054376 PERFORMANCE STUDIES OF DYNAMIC LOAD BALANCING IN DISTRIBUTED SYSTEMS.
S. Zhou.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/376. 1987. Also issued as Report no. 87.6, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054377 INHERITANCE IN COMPUTER-AIDED DESIGN DATABASES: SEMANTICS AND
IMPLEMENTATION ISSUES.
E. E. Chang and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/377. 1987.]
054378 BROWSING THE CHIP DESIGN DATABASE.
D. Gedye and R. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/378. 1987.]
054379 THE ANALYSIS OF DISKLESS WORKSTATION TRAFFIC ON AN ETHERNET.
R. Gusella.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/379. 1987. Also issued as Report no. 87.8, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054380 A PARALLEL EXECUTION MODEL FOR PROLOG.
B. S. Fagin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/380. 1987. Thesis (Ph.D.).]
054381 ASPECTS OF CACHE MEMORY AND INSTRUCTION BUFFER PERFORMANCE.
M. D. Hill.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/381. 1987. Thesis (Ph.D.).]
054382 A HIERARCHICAL APPROXIMATION ALGORITHM FOR LARGE MULTICHAIN PRODUCT
FORM QUEUEING NETWORKS.
H. R. Bahadori.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/382. 1987. Also issued as Report no. 87.9, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054383 HIGH-BANDWIDTH/LOW LATENCY TEMPORAL STORAGE FOR SUPERCOMPUTERS.
J. Swensen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/383. 1987. Thesis (Ph.D.).]
054384 COVERING ORTHOGONAL POLYGONS WITH STAR POLYGONS: THE PERFECT GRAPH
APPROACH.
R. Motwani, A. Raghunathan, and H. Saran.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/384. 1987.]
054385 EFFICIENT LOCAL DATA MOVEMENT IN SHARED-MEMORY MULTIPROCESSOR SYSTEMS.
S.-Y. Tzou, D. P. Anderson, and G. S. Graham.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/385. 1987. Also issued as Report no. 87.10, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054386 A SOFTWARE ARCHITECTURE FOR NETWORK COMMUNICATION.
D. P. Anderson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/386. 1987. Also issued as Report no. 87.11, PROGRES Group,
Computer Science Division, University of California, Berkeley.]
054387 A CHARACTERIZATION OF SHARING IN PARALLEL PROGRAMS AND ITS
APPLICABILITY TO COHERENCY PROTOCOL EVALUATION.
S. J. Eggers and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/387. 1987.]
054388 EPOXY: AN ELECTRICAL AND PHYSICAL LAYOUT OPTIMIZER THAT CONSIDERS
CIRCUIT CHANGES.
F. Obermeier and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/388. 1987.]
054389 SUBTREE ISOMORPHISM IS IN RANDOM NC.
P. B. Gibbons et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/389. 1987.]
054390 FAST PARALLEL ALGORITHMS FOR GRAPHS AND NETWORKS.
D. Soroker.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/390. 1987. Thesis (Ph.D.).]
054391 A CASE FOR REDUNDANT ARRAYS OF INEXPENSIVE DISKS (RAID).
D. A. Patterson, G. Gibson, and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/391. 1987.]
054392 PROBABILISTIC ANALYSIS OF NETWORK FLOW ALGORITHMS.
R. M. Karp, R. Motwani, and N. Nisan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/392. 1987.]
054393 MOCHA CHIP: A GRAPHICAL PROGRAMMING SYSTEM FOR IC MODULE ASSEMBLY.
R. N. Mayo.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/393. 1987. Thesis (Ph.D.).]
054394 SPUR MEMORY SYSTEM ARCHITECTURE.
D. A. Wood, S. J. Eggers, and G. Gibson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/394. 1987.]
054395 PERFECT GRAPHS AND ORTHOGONALLY CONVEX COVERS.
R. Motwani, A. Raghunathan, and H. Saran.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/395. 1988.]
108861 DISTRIBUTED DATA BASE MANAGEMENT FOR REAL-TIME BMD APPLICATIONS.
FINAL REPORT FOR PERIOD: MAY 29, 1986 TO SEPTEMBER 30, 1987.
W. W. Chu et al.
[University of California, Los Angeles. Computer Science Department.
CSD-870059. 1987.]
108862 ANALYTIC MODELING METHODOLOGY FOR EVALUATING THE PERFORMANCE OF
DISTRIBUTED, MULTIPLE-COMPUTER SYSTEMS.
A. Kapelnikov.
[University of California, Los Angeles. Computer Science Department.
CSD-870061. 1987. Thesis (Ph.D.).]
108863 PROCESS SYNCHRONIZATION: DESIGN AND PERFORMANCE EVALUATION OF
DISTRIBUTED ALGORITHMS.
R. Bagrodia.
[University of California, Los Angeles. Computer Science Department.
CSD-870062. 1987.]
108864 POLYA'S "PATTERNS OF PLAUSIBLE INFERENCE" AND THE QUEST FOR
MODULARITY.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870064. 1987. Also issued as R-71, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108865 TREE-CLUSTERING SCHEMES FOR CONSTRAINT-PROCESSING.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870065. 1987. Also issued as R-92, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108866 A SOUND FRAMEWORK FOR REASONING WITH DEFAULTS.
H. Geffner and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870066. 1987. "A condensed version of this report was submitted
to the 1988 Conference of the Canadian Society for Computational
Studies of Intelligence (CSCSI-88), Edmonton, Alberta, Canada." Also
issued as R-94-II, Cognitive Systems Laboratory, Computer Science
Department, University of California, Los Angeles.]
108867 PARTIAL ORDER PROGRAMMING.
D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-870067. 1987.]
108868 A PROBABILISTIC TREATMENT OF THE YALE SHOOTING PROBLEM.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-870068. 1987. Also issued as R-100, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
108869 QUEUEING NETWORK MODELS FOR LOAD BALANCING IN DISTRIBUTED SYSTEMS.
E. de Souza e Silva and M. Gerla.
[University of California, Los Angeles. Computer Science Department.
CSD-870069. 1987.]
108870 DISTRIBUTED COMPUTING WITH RPC: THE CAMBRIDGE APPROACH.
J. M. Bacon and K. G. Hamilton.
[University of Cambridge. Computer Laboratory. Technical report 117.
1987.]
108871 MATERIAL CONCERNING A STUDY OF CASES.
B. K. Boguraev and K. S. Jones.
[University of Cambridge. Computer Laboratory. Technical report 118.
1987.]
108872 PILGRIM: A DEBUGGER FOR DISTRIBUTED SYSTEMS.
R. Cooper.
[University of Cambridge. Computer Laboratory. Technical report 119.
1987.]
108873 BLOCK ENCRYPTION.
D. Wheeler.
[University of Cambridge. Computer Laboratory. Technical report 120.
1987.]
108874 A HIGH-LEVEL PETRI NET SPECIFICATION OF THE CAMBRIDGE FAST RING
M-ACCESS SERVICE.
J. Billington.
[University of Cambridge. Computer Laboratory. Technical report 121.
1987.]
108875 KNOWLEDGE RETRIEVAL AS SPECIALIZED INFERENCE.
A. M. Frisch.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1404. 1988. Thesis (Ph.D.).]
108876 THE FASE3 SYSTEM FOR EXECUTABLE DATA TYPE SPECIFICATION.
T. B. Kraus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1405. 1987. Thesis (M.S.).]
108877 TABLET: PERSONAL COMPUTER OF THE YEAR 2000.
B. W. Mel et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1406. 1988.]
108878 INTERACTIVE PARSER CONSTRUCTION.
J. P. Le Peau and T. Rus.
[University of Iowa. Department of Computer Science. Technical report
87-02. 1988.]
108879 A WINDOW ORIENTED DEBUGGING ENVIRONMENT FOR EMBEDDED REAL TIME ADA
SYSTEMS.
J. W. Gilles.
[University of Iowa. Department of Computer Science. Technical report
88-03. 1988. Thesis (M.S.).]
108890 HIERARCHICAL MOTION DETECTION.
F. C. Glazer.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-02. 1987. Thesis (Ph.D.).]
108891 USING PARTIAL GLOBAL PLANS TO COORDINATE DISTRIBUTED PROBLEM SOLVERS.
E. H. Durfee and V. R. Lesser.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-06. 1987.]
108892 INCREMENTAL PLANNING TO CONTROL A TIME-CONSTRAINED, BLACKBOARD-BASED
PROBLEM SOLVER.
E. H. Durfee and V. R. Lesser.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-07. 1987.]
108893 THE GRAPPLE PLAN FORMALISM.
K. E. Huff and V. R. Lesser.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-08. 1987.]
108894 META-PLANS THAT DYNAMICALLY TRANSFORM PLANS.
K. E. Huff and V. R. Lesser.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-10. 1987.]
108895 KNOWLEDGE ACQUISITION AS KNOWLEDGE ASSIMILATION.
L. S. Lefkowitz and V. R. Lesser.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-13. 1987.]
108896 REASONING ABOUT EXCEPTIONS IN AN INTERACTIVE PLANNING SYSTEM.
C. A. Broverman and W. B. Croft.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-16. 1987.]
108897 MEASURING VISUAL MOTION FROM IMAGE SEQUENCES.
P. Anandan.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-21. 1987. Thesis (Ph.D.).]
108898 GRAPH GRAMMAR BASED SPECIFICATION OF INTERCONNECTION STRUCTURES FOR
MASSIVELY PARALLEL COMPUTATION.
D. A. Bailey and J. E. Cuny.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-23. 1987.]
108899 AN APPROACH TO PROGRAMMING PROCESS INTERCONNECTION STRUCTURES:
AGGREGATE REWRITING GRAPH GRAMMARS.
D. A. Bailey and J. E. Cuny.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-25. 1987.]
108900 SHUFFLE AUTOMATA: A FORMAL MODEL FOR BEHAVIOR RECOGNITION IN
DISTRIBUTED SYSTEMS.
P. C. Bates.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-27. 1987.]
108901 DISTRIBUTED DEBUGGING TOOLS FOR HETEROGENEOUS DISTRIBUTED SYSTEMS.
P. C. Bates.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-28. 1987.]
108902 TOWARD DETERMINING VARIABLE OVERLAP IN RECURSIVE RULE EXPANSION.
D. A. Briggs.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-33. 1987.]
108903 ACHIEVING FLEXIBILITY, EFFICIENCY, AND GENERALITY IN BLACKBOARD
ARCHITECTURES.
D. D. Corkill, K. Q. Gallagher, and P. M. Johnson.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-37. 1987.]
108904 MANAGING STACK FRAMES IN SMALLTALK.
J. Eliot and B. Moss.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-38. 1987.]
108905 EXPRESSING LINEAR RECURSIONS AS GRAPH TRAVERSAL.
D. A. Briggs.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-39. 1987.]
108906 MODIFIABLE COMBINING FUNCTIONS.
P. R. Cohen, G. Shafer, and P. P. Shenoy.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-43. 1987. Revised: July 1987. Also
issued as Report no. 87-05, Experimental Knowledge Systems
Laboratory, Department of Computer and Information Science,
University of Massachusetts.]
108907 KNOWLEDGE ENGINEERING TOOLS AT THE ARCHITECTURAL LEVEL.
T. R. Gruber and P. R. Cohen.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-44. 1987.]
108908 STEPS TOWARD PROGRAMS THAT MANAGE UNCERTAINTY.
P. R. Cohen.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-45. 1987. Also issued as Report
no. 87-06, Experimental Knowledge Systems Laboratory, Department of
Computer and Information Science, University of Massachusetts.]
108909 PROSPECTIVE REASONING SYSTEMS.
P. R. Cohen, M. Greenberg, and J. DeLisio.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-46. 1987.]
108910 THE EDINBURGH DESIGNER SYSTEM AS A FRAMEWORK FOR ROBOTICS OR THE
DESIGN OF BEHAVIOR.
R. J. Popplestone.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-47. 1987.]
108911 FACTORS CONTRIBUTING TO EFFICIENCY IN NATURAL LANGUAGE GENERATION.
D. D. McDonald, M. W. Meteer, and J. D. Pustejovsky.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-49. 1987.]
108913 CONSTRAINTS ON THE GENERATION OF ADJUNCT CLAUSES.
A. K. Huettner, M. W. Meteer, and D. D. McDonald.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-51. 1987.]
108914 INFORMATION RETRIEVAL BY CONSTRAINED SPREADING ACTIVATION IN SEMANTIC
NETWORKS.
P. R. Cohen and R. Kjeldsen.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 87-66. 1987. Also issued as Report
no. 87-14, Experimental Knowledge Systems Laboratory, Department of
Computer and Information Science, University of Massachusetts.]
108915 THE EVOLUTION AND PERFORMANCE OF THE GRANT SYSTEM.
R. Kjeldsen and P. R. Cohen.
[University of Massachusetts. Department of Computer and Information
Science. COINS technical report 88-03. 1988.]
108916 THESIS PROPOSAL: A PLAN-BASED APPROACH TO CONVERSATIONAL IMPLICATURE.
E. Hinkelman.
[University of Rochester. Department of Computer Science. TR 202.
1987.]
108917 EYE MOVEMENTS AND SPATIAL COGNITION.
D. H. Ballard.
[University of Rochester. Department of Computer Science. TR 218.
1987.]
108918 ROVER: A PROTOTYPE ACTIVE VISION SYSTEM.
D. J. Coombs and B. D. Marsh.
[University of Rochester. Department of Computer Science. TR 219.
1987.]
108919 WHY WE CAN'T PROGRAM MULTIPROCESSORS THE WAY WE'RE TRYING TO DO IT
NOW.
D. Baldwin.
[University of Rochester. Department of Computer Science. TR 224.
1987.]
108920 COUNTING IS EASY.
J. I. Seiferas and P. M. B. Vitanyi.
[University of Rochester. Department of Computer Science. TR 225.
1987.]
108921 ELMWOOD - AN OBJECT-ORIENTED MULTIPROCESSOR SYSTEM.
J. M. Mellor-Crummey et al.
[University of Rochester. Department of Computer Science. TR 226.
1987.]
108922 ALGORITHMS AND DATA STRUCTURES FOR AN EXPANDED FAMILY OF MATROID
INTERSECTION PROBLEMS.
G. N. Fredrickson and M. A. Srinivas.
[University of Rochester. Department of Computer Science. TR 227.
1987.]
108923 THE TIMELOGIC TEMPORAL REASONING SYSTEM IN COMMON LISP.
J. A. G. M. Koomen.
[University of Rochester. Department of Computer Science. TR 231.
1987.]
108924 A PROBABILISTIC APPROACH TO LOW-LEVEL VISION.
D. B. Sher.
[University of Rochester. Department of Computer Science. TR 232.
1987. Thesis (Ph.D.).]
108925 ROCHESTER CONNECTIONIST SIMULATOR.
N. H. Goddard, K. J. Lynne, and T. Mintz.
[University of Rochester. Department of Computer Science. TR 233.
1987.]
108926 CALCULATING THE PRINCIPLE VIEWS OF A POLYHEDRON.
N. Watts.
[University of Rochester. Department of Computer Science. TR 234.
1987.]
108927 EFFICIENT LANGUAGE INSTANCE GENERATION.
L. A. Sanchis and M. A. Fulk.
[University of Rochester. Department of Computer Science. TR 235.
1987.]
108928 HIGHER ORDER PROBABILITIES AND INTERVALS.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 236.
1987.]
108929 THE SOFTWARE STRUCTURE OF EXTENDED NUCLEUS BASED ON BTRON
SPECIFICATION.
M. Kobayashi et al.
[University of Tokyo. Department of Information Science. Technical
report 87-16. 1987.]
108930 DESIGN PRINCIPLE AND CONFIGURATION OF CTRON.
T. Wasano et al.
[University of Tokyo. Department of Information Science. Technical
report 87-17. 1987.]
108931 A UNIFIED FORMALIZATION OF BASIC CONCEPTS IN COMPUTER GRAPHICS.
T. Onodera and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 87-18. 1987.]
108932 AN ENHANCEMENT TREATMENT OF HIDDEN LINES.
T. Kamada and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 87-19. 1987.]
108933 GRAPHS OF ORDER N WITH MINIMUM DEGREE AT LEAST N/3.
H. Enomoto, A. Kaneko, and Z. Tuza.
[University of Tokyo. Department of Information Science. Technical
report 87-20. 1987.]
108934 MACHINE TRANSLATION OF NATURAL LANGUAGE EXPRESSIONS INCLUDING
METAPHORS.
N. Satake and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-21. 1987.]
108935 THE VISUALIZING PIPELINE: A FORMALIZED MODEL OF VISUALIZATION OF
GRAPHICAL PRIMITIVES.
T. Onodera and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 87-22. 1987.]
108936 ASYMPTOTIC EVALUATION OF WINDOW VISIBILITY.
S. Matsuoka, T. Kamada, and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 87-23. 1987.]
108937 HIERARCHICAL OBJECT GROUPS IN DISTRIBUTED OPERATING SYSTEMS.
K. Shimizu, M. Maekawa, and J. Hamano.
[University of Tokyo. Department of Information Science. Technical
report 87-24. 1987.]
108938 SHARABLE MEMORY-MAPPED FILES: AN APPROACH TO SHARED MEMORY IN A
DISTRIBUTED SYSTEM.
J. Hamano, M. Maekawa, and K. Shimizu.
[University of Tokyo. Department of Information Science. Technical
report 87-25. 1987.]
108939 FILE ACCESS IMPROVEMENTS IN DISTRIBUTED SYSTEMS BY ON-DEMAND
REPLICATION OF FILES.
H. Ashihara et al.
[University of Tokyo. Department of Information Science. Technical
report 87-26. 1987.]
108940 IMPLEMENTATION OF MULTIWINDOW TERMINAL INTERFACE PROGRAMS ON PERSONAL
COMPUTERS.
K. Shimizu and H. Ishida.
[University of Tokyo. Department of Information Science. Technical
report 87-27. 1987. IN JAPANESE. English abstract.]
108941 THE DESIGN OF A PARALLEL PROCESSING SYSTEM FOR COMPUTER GRAPHICS.
T. L. Kunii, S. Nishimura, and T. Noma.
[University of Tokyo. Department of Information Science. Technical
report 87-28. 1987.]
108942 THE OBJECTIVES OF THE TRON PROJECT.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-29. 1987.]
108943 ITRON: AN OVERVIEW.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-30. 1987.]
108944 BTRON: AN OVERVIEW.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-31. 1987.]
108945 BTRON: HUMAN-MACHINE INTERFACE.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-32. 1987.]
108946 MULTI-LANGUAGE CHARACTER SETS HANDLING IN TAD.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-33. 1987.]
108947 AN IMPLEMENTATION BASED ON THE BTRON SPECIFICATION.
K. Sakamura et al.
[University of Tokyo. Department of Information Science. Technical
report 87-34. 1987.]
108948 MUBTRON BUS: DESIGN AND EVALUATION OF MUSICAL DATA TRANSFER.
K. Sakamura, K. Tsurumi, and H. Kato.
[University of Tokyo. Department of Information Science. Technical
report 87-35. 1987.]
108949 AN IMPLEMENTATION OF THE TRON KEYBOARD.
K. Sakamura and S. Tachibana.
[University of Tokyo. Department of Information Science. Technical
report 87-36. 1987.]
108950 CTRON: AN OVERVIEW.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-37. 1987.]
108951 DESIGN OF CTRON.
K. Sakamura et al.
[University of Tokyo. Department of Information Science. Technical
report 87-38. 1987.]
108952 TRON VSLI CPU: CONCEPT AND ARCHITECTURE.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 87-39. 1987.]
108953 AN IMPLEMENTATION BASED ON THE BTRON SPECIFICATION.
K. Sakamura et al.
[University of Tokyo. Department of Information Science. Technical
report 87-40. 1987.]
108954 THE LINE GRAPH OF A REGULAR AND PANCIRCULAR DIGRAPH IS ALSO REGULAR
AND PANCIRCULAR.
M. Imori, M. Matsumoto, and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 87-41. 1987.]
108955 THE QR DECOMPOSITION OF TOEPLITZ MATRICES.
A. W. Bojanczyk.
[Washington University. Department of Computer Science. Technical
report WUCS-87-1. n.d.]
108956 AN ARCHITECTURE FOR CONNECTION MANAGEMENT IN A BROADCAST PACKET
NETWORK.
K. Haserodt.
[Washington University. Department of Computer Science. Technical
report WUCS-87-3. 1987.]
108957 SYSTEM TESTING OF A BROADCAST PACKET SWITCH.
S. Khakoo and J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-4. 1987.]
108958 SPECIFICATION OF INTEGRATED CIRCUITS FOR BROADCAST PACKET NETWORK.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-5. 1987.]
108959 THE CHALLENGE OF MULTIPOINT COMMUNICATION.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-6. 1987.]
108960 A UNIFIED SYSTOLIC ARRAY FOR ADAPTIVE BEAMFORMING.
A. W. Bojanczyk.
[Washington University. Department of Computer Science. Technical
report WUCS-87-8. 1987.]
108961 DESIGN OF A BROADCAST TRANSLATION CHIP.
G. H. Robbert.
[Washington University. Department of Computer Science. Technical
report WUCS-87-9. 1987.]
108962 THESIS PROPOSAL: ROUTING OF MULTIPOINT CONNECTIONS.
B. M. Waxman.
[Washington University. Department of Computer Science. Technical
report WUCS-87-10. 1987.]
108963 GRAPH SEPARATION AND SEARCH NUMBER.
J. A. Ellis, I. H. Sudborough, and J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-11. 1987.]
108964 TOWARD A GENERALIZED DATABASE SYSTEM WITH MULTIPLE INTERFACES.
S. B. Cousins and G. R. Simari.
[Washington University. Department of Computer Science. Technical
report WUCS-87-13. 1987.]
108965 BEMAS: A BELIEF MAINTENANCE SYSTEM PROTOTYPE. USER'S MANUAL.
R. M. Fulcomer, S. M. Shieh, and W. E. Ball.
[Washington University. Department of Computer Science. Technical
report WUCS-87-14. 1987.]
108966 BELIEF MAINTENANCE SYSTEMS: INITIAL PROTOTYPE SPECIFICATION.
R. M. Fulcomer, W. E. Ball, and J. P. Tadloc.
[Washington University. Department of Computer Science. Technical
report WUCS-87-15. 1987.]
108967 FLUID FLOW LOADING ANALYSIS OF PACKET SWITCHING NETWORKS.
J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-16. 1987.]
108968 DISTRIBUTED PROTOCOLS FOR ACCESS ARBITRATION IN TREE-STRUCTURED
COMMUNICATION CHANNELS.
R. Melen and J. S. Turner.
[Washington University. Department of Computer Science. Technical
report WUCS-87-17. 1987.]
108969 INTERACTIVE COMPLEXITY CONTROL AND HIGH-SPEED STEREO MATCHING.
G.-C. Roman, A. F. Laine, and K. C. Cox.
[Washington University. Department of Computer Science. Technical
report WUCS-87-18. 1987. July 1987. Revised: December 1987.]
108970 LANGUAGE AND VISUALIZATION SUPPORT FOR LARGE-SCALE CONCURRENCY.
G.-C. Roman.
[Washington University. Department of Computer Science. Technical
report WUCS-87-20. 1987.]
108971 TRANSACTION NETWORK: A PARALLEL COMPUTATIONAL MODEL BASED ON
CONSUME/PRODUCE PARADIGM.
T. D. Kimura.
[Washington University. Department of Computer Science. Technical
report WUCS-87-26. 1987.]
108972 LOAD AND COMMUNICATIONS BALANCING ON MULTIPROCESSOR LOGIC SIMULATION
ENGINES.
K. Wong and M. A. Franklin.
[Washington University. Department of Computer Science. Technical
report WUCS-87-27. 1987.]
VOL. 10, NO. 5 05/04/88
108973 PARTIAL IMPLEMENTATIONS IN PROGRAM DERIVATION.
J. F. Prins.
[Cornell University. Department of Computer Science. Technical report
87-854. 1987. Thesis (Ph.D.).]
108974 UNDERSTANDING PROTOCOLS FOR BYZANTINE CLOCK SYNCHRONIZATION.
F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
87-859. 1987.]
108975 NC ALGORITHMS FOR COMPUTING THE NUMBER OF PERFECT MATCHINGS IN K
SUBSCRIPT 3,3-FREE GRAPHS AND RELATED PROBLEMS.
V. V. Vazirani.
[Cornell University. Department of Computer Science. Technical report
87-860. 1987.]
108976 THE COLLAPSING HIERARCHIES.
J. Hartmanis.
[Cornell University. Department of Computer Science. Technical report
87-861. 1987.]
108977 A UNITARY METHOD FOR THE ESPRIT DIRECTION-OF-ARRIVAL ESTIMATION
ALGORITHM.
C. Van Loan.
[Cornell University. Department of Computer Science. Technical report
87-862. 1987.]
108978 MATRIX COMPUTATIONS AND SIGNAL PROCESSING.
C. Van Loan.
[Cornell University. Department of Computer Science. Technical report
87-863. 1987.]
108979 A STORAGE EFFICIENT WY REPRESENTATION FOR PRODUCTS OF HOUSEHOLDER
TRANSFORMATIONS.
R. Schreiber and C. Van Loan.
[Cornell University. Department of Computer Science. Technical report
87-864. 1987.]
108980 COMPLETE, TRACE-BASED, NETWORK PROOF SYSTEMS: AN ADVISOR'S
PERSPECTIVE.
D. Gries.
[Cornell University. Department of Computer Science. Technical report
87-865. 1987.]
108981 PARALLEL COMPUTING IN COMBINATORIAL OPTIMIZATION.
G. A. P. Kindervater and J. K. Lenstra.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 727. 1987.]
108982 SHORTEST RECTILINEAR PATHS AMONG OBSTACLES.
J. S. B. Mitchell.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 739. 1987. Original: November 1985.
Revised: March 1987.]
108983 A VARIANT OF KARMARKAR'S LINEAR PROGRAMMING ALGORITHM FOR PROBLEMS
WITH SOME UNRESTRICTED VARIABLES.
J. E. Mitchell and M. J. Todd.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 741. 1988. Original: April 1987.
Revised: January 1988.]
108984 COMBINATORIAL PERSPECTIVES ON LINEAR PROGRAMMING. PART I: LINEAR
PROGRAMMING DUALITY AND MINTY'S LEMMA.
R. G. Bland.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 742. 1987.]
108985 AN OPTIMAL VISIBILITY ALGORITHM FOR A SIMPLE POLYGON WITH STAR-SHAPED
HOLES.
E. M. Arkin and J. S. B. Mitchell.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 746. 1987.]
108986 ON THE WORST CASE ARITHMETIC COMPLEXITY OF APPROXIMATING ZEROS OF
SYSTEMS OF POLYNOMIALS.
J. Renegar.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 748. 1987.]
108987 AN ANALOG OF KARMARKAR'S ALGORITHM FOR INEQUALITY CONSTRAINED LINEAR
PROGRAMS, WITH A "NEW" CLASS OF PROJECTIVE TRANSFORMATIONS FOR
CENTERING A POLYTOPE.
R. M. Freund.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 750. 1987.]
108988 A CENTERED PROJECTIVE ALGORITHM FOR LINEAR PROGRAMMING.
M. J. Todd and Y. Ye.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 763. 1987.]
108989 SHORTEST PATHS AMONG OBSTACLES, ZERO-COST REGIONS, AND ROADS.
J. S. B. Mitchell.
[Cornell University. School of Operations Research and Industrial
Engineering. Technical report 764. 1987.]
108990 PARALLEL COMPILATION ON A TIGHTLY COUPLED MULTIPROCESSOR.
M. T. Vandervoorde.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 26. 1988.]
108991 RANGE IMAGING SENSORS.
P. J. Besl.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6090. 1988.]
108992 STRATEGIES FOR INTERPRETING PRAGMATIC PRONOUNS.
K. Godden.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6208. 1988.]
108993 A VERY SIMPLE CONSTRUCTION FOR ATOMIC MULTIWRITER REGISTER.
M. Li and P. M. B. Vitanyi.
[Harvard University. Center for Research in Computing Technology.
TR-01-87. 1987.]
108994 EFFICIENT DISPERSAL OF INFORMATION FOR SECURITY LOAD BALANCING AND
FAULT TOLERANCE.
M. O. Rabin.
[Harvard University. Center for Research in Computing Technology.
TR-02-87. 1987.]
108995 LEARNING IN THE PRESENCE OF MALICIOUS ERRORS.
M. Kearns and M. Li.
[Harvard University. Center for Research in Computing Technology.
TR-03-87. 1987. "Preliminary report."]
108996 TWO PHASE GOSSIP: MANAGING DISTRIBUTED EVENT HISTORIES.
A. Heddaya, M. Hsu, and W. Weihl.
[Harvard University. Center for Research in Computing Technology.
TR-04-87. 1987.]
108997 AN INTEGRATED TOOLKIT FOR OPERATING SYSTEM SECURITY.
M. O. Rabin and J. D. Tygar.
[Harvard University. Center for Research in Computing Technology.
TR-05-87. 1987.]
108998 ON THE INFLUENCE OF SINGLE PARTICIPANT IN COIN FLIPPING SCHEMES.
B. Chor and M. Gereb-Graus.
[Harvard University. Center for Research in Computing Technology.
TR-06-87. 1987.]
108999 THE COMPLEXITY OF PARALLEL COMPARISON MERGING.
M. Gereb-Graus and D. Krizanc.
[Harvard University. Center for Research in Computing Technology.
TR-07-87. 1987.]
109000 THE APPROXIMATION OF THE PERMANENT IS STILL OPEN - A FLAW IN BRODER'S
PROOF.
M. Mihail.
[Harvard University. Center for Research in Computing Technology.
TR-08-87. 1987.]
109001 K+1 HEADS ARE BETTER THAN K PDA'S.
M. Chrobak and M. Li.
[Harvard University. Center for Research in Computing Technology.
TR-09-87. 1987.]
109002 TAPE VERSUS QUEUE AND STACKS: THE LOWER BOUNDS.
M. Li and P. M. B. Vitanyi.
[Harvard University. Center for Research in Computing Technology.
TR-10-87. 1987.]
109003 PLANS FOR DISCOURSE.
B. J. Grosz and C. L. Sidner.
[Harvard University. Center for Research in Computing Technology.
TR-11-87. 1987.]
109004 OBLIVIOUS SECRET COMPUTATION.
D. Beaver.
[Harvard University. Center for Research in Computing Technology.
TR-12-87. 1987.]
109005 POLYNOMIAL SIZED BOOLEAN CIRCUITS ARE NOT LEARNABLE.
D. Beaver.
[Harvard University. Center for Research in Computing Technology.
TR-13-87. 1987.]
109006 OBLIVOUS ROUTING WITH LIMITED BUFFER CAPACITY.
D. Krizanc.
[Harvard University. Center for Research in Computing Technology.
TR-14-87. 1987.]
109007 PARAMETER IDENTIFICATION AND SENSITIVITY ANALYSIS FOR A ROBOTIC
MANIPULATOR ARM.
D. W. Brewer and J. S. Gibson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-1. 1988.]
109008 IMPLEMENTATION AND ANALYSIS OF A NAVIER-STOKES ALGORITHM ON PARALLEL
COMPUTERS.
R. A. Fatoohi and C. E. Grosch.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-5. 1988.]
109009 A VISUAL PROGRAMMING ENVIRONMENT FOR THE NAVIER-STOKES COMPUTER.
S. Tomboulian, T. W. Crockett, and D. Middleton.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-6. 1988.]
109010 INTEGER SQUARES WITH CONSTANT SECOND DIFFERENCE.
D. A. Buell.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-86-001. 1986.]
109011 THE TWENTIETH FERMAT NUMBER IS COMPOSITE.
J. Young and D. A. Buell.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-86-002. 1986.]
109012 UNIQUELY DECODABLE CODES ON A CIRCLE.
P. Merkey.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-86-003. 1986.]
109013 PARALLEL ALGORITHMS FOR THE SOLUTION OF NARROW BANDED SYSTEMS.
J. M. Conroy.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-001. 1987.]
109014 A NOTE ON THE PARALLEL CHOLESKY FACTORIZATION OF WIDE BANDED MATRICES.
J. M. Conroy.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-002. 1986.]
109015 DATA STRUCTURES FOR ASSOCIATIVE SUPERCOMPUTERS.
J. L. Potter.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-003. 1987.]
109016 HORIZON ASSEMBLER REFERENCE MANUAL (WITH APPENDIX: SUPPORT SOFTWARE
MANUAL SET).
J. T. Kuehn.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-004. 1987.]
109017 ESTIMATION OF WIND-WAVE INTERACTION OF SPECTRA BY THE MAXIMUM ENTROPY
METHOD.
R. W. Barbieri.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-005. 1987.]
109018 PARALLEL ARCHITECTURES FOR VISION.
M. Maresca, M. A. Lavin, and H. Li.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13290. 1987.]
109019 DEDUCED RELEVANT TYPES AND CONSTRUCTIVE NEGATION IN LOGIC PROGRAMMING.
N. Foo et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13407. 1988.]
109020 THE W LANGUAGE.
C.-C. Wang and H. Li.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13428. 1988.]
109021 A FAULT-TOLERANT ROUTING SCHEME FOR UNIQUE-PATH MULTISTAGE
INTERCONNECTION NETWORKS.
A. Varma and B. D. Rathi.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13441. 1988.]
041673 CAULDRONS: AN ABSTRACTION FOR CONCURRENT PROBLEM SOLVING OR "A
PANDEMONIUM FOR REPRESENTING KNOWLEDGE."
K. Haase.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 673. 1986. Original: December 1982. Revised:
September 1986.]
041857 VARIABLE PRECISION LOGIC.
R. S. Michalski and P. H. Winston.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 857. 1985.]
041876 DIRECT PASSIVE NAVIGATION: ANALYTICAL SOLUTION FOR QUADRATIC PATCHES.
S. Negahdaripour and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 876. 1986.]
041893 ISSUES IN MODEL BASED TROUBLESHOOTING.
W. Hamscher and R. Davis.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 893. 1987.]
041927 STEREO AND EYE MOVEMENT.
D. Geiger and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 927. 1988.]
041951 COMPARATIVE ANALYSIS.
D. S. Weld.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 951. 1987.]
041958 SYNCHRONIZABLE SERIES EXPRESSIONS. PART I: USER'S MANUAL FOR THE OSS
MACRO PACKAGE.
R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 958. 1987.]
041959A OBVIOUSLY SYNCHRONIZABLE SERIES EXPRESSIONS. PART II: OVERVIEW OF THE
THEORY AND IMPLEMENTATION.
R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 959a. 1988.]
041965 INTERACTION OF DIFFERENT MODULES IN DEPTH PERCEPTION: STEREO AND
SHADING.
H. H. Buelthoff and H. A. Mallot.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 965. 1987. Also issued as C.B.I.P. memo 024,
Center for Biological Information Processing, Whitaker College.]
041970 VISUAL INTEGRATION AND DETECTION OF DISCONTINUITIES: THE KEY ROLE OF
INTENSITY EDGES.
E. Gamble and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 970. 1987. Also issued as C.B.I.P. memo 027,
Center for Biological Information Processing, Whitaker College.]
041973 SYNAPSES THAT COMPUTE MOTION.
T. Poggio and C. Koch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 973. 1987. Also issued as C.B.I.P. memo 018,
Center for Biological Information Processing, Whitaker College.]
041975 RELAXING THE BRIGHTNESS CONSTANCY ASSUMPTION IN COMPUTING OPTICAL
FLOW.
M. A. Gennert and S. Negahdaripour.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 975. 1987.]
041983 ON THE RECOGNITION OF CURVED OBJECTS.
W. E. L. Grimson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 983. 1987.]
041984 SELF CALIBRATION OF MOTION AND STEREO VISION FOR MOBILE ROBOT
NAVIGATION.
R. A. Brooks, A. M. Flynn, and T. Marill.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 984. 1987.]
041986 LISP: A LANGUAGE FOR STRATIFIED DESIGN.
H. Abelson and G. J. Sussman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 986. 1987.]
041987 ENERGY FUNCTIONS FOR EARLY VISION AND ANALOG NETWORKS.
A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 987. 1987.]
041989 RIGIDITY AND SMOOTHNESS OF MOTION.
S. Ullman and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 989. 1987.]
041994 RELATIVE ORIENTATION.
B. K. P. Horn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 994. 1987.]
041996 NON-RIGID MOTION AND REGGE CALCULUS.
R. Jasinschi and A. Yuille.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 996. 1987.]
041997 ABSTRACTION IN NUMERICAL METHODS.
M. Halfant and G. J. Sussman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 997. 1987.]
041999 EXPRESSING MATHEMATICAL SUBROUTINES CONSTRUCTIVELY.
G. L. Roylance.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 999. 1987.]
042004 THE PROGRAMMER'S APPRENTICE PROJECT: A RESEARCH OVERVIEW.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1004. 1987.]
042005 INSPECTION METHODS IN PROGRAMMING: CLICHES AND PLANS.
C. Rich.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1005. 1987.]
042007 QUALITATIVE DEPTH AND SHAPE FROM STEREO, IN AGREEMENT WITH
PSYCHOPHYSICAL EVIDENCE.
D. Weinshall.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1007. 1987. Also issued as C.B.I.P. memo 028,
Center for Biological Information Processing, Whitaker College.]
042013 UTILIZING DYNAMIC STABILITY TO ORIENT PARTS.
N. C. Singer and W. P. Seering.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1013. 1988.]
042016 HERBERT: A SECOND GENERATION MOBILE ROBOT.
R. A. Brooks, J. H. Connell, and P. Ning.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1016. 1988.]
042020 SYSTEM VALIDATION VIA CONSTRAINT MODELING.
R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1020. 1988.]
040963 HIERARCHICAL OBJECT RECOGNITION USING LIBRARIES OF PARAMETERIZED
MODEL SUB-PARTS.
G. J. Ettinger.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 963. 1987. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science of the Massachusetts Institute of
Technology on May 15, 1987 in partial fulfillment of the requirements
for the Degree of Master of Science in Electrical Engineering and
Computer Science."]
040978 FORMAL MULTILEVEL HIERARCHICAL VERIFICATION OF SYNCHRONOUS MOS VLSI
CIRCUITS.
D. W. Weise.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 978. 1987. Thesis (Ph.D.).]
040979 ONTIC: A KNOWLEDGE REPRESENTATION SYSTEM FOR MATHEMATICS.
D. A. McAllester.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 979. 1987. Thesis (Ph.D.).]
040980 IMAGE CHUNKING: DEFINING SPATIAL BUILDING BLOCKS FOR SCENE ANALYSIS.
J. V. Mahoney.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 980. 1987. Thesis (M.S.).]
040982 ERROR DETECTION AND RECOVERY FOR ROBOT MOTION PLANNING WITH
UNCERTAINTY.
B. R. Donald.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 982. 1987. Thesis (Ph.D.).]
040988 TYPICAL: A KNOWLEDGE REPRESENTATION SYSTEM FOR AUTOMATED DISCOVERY
AND INFERENCE.
K. W. Haase Jr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 988. 1987. Thesis (M.S.). "This is a
considerably revised version of a thesis submitted to the Department
of Electrical Engineering and Computer Science on May 9, 1986 in
partial fulfillment of the degree of Master of Science."]
040993 A GOVERNMENT-BINDING BASED PARAMETER FOR WALPIR, A FREE-WORD ORDER
LANGUAGE.
M. B. Kashket.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 993. 1987. Thesis (M.S.). "This is a
considerably revised version of a thesis submitted to the Department
of Electrical Engineering and Computer Science on January 30, 1987 in
partial fulfillment of the requirements for the degree of Master of
Science."]
040995 AN O(N) ALGORITHM FOR THREE-DIMENSIONAL N-BODY SIMULATIONS.
F. Zhao.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 995. 1987. Thesis (M.S.).]
041000 UNITRAN: A PRINCIPLE-BASED APPROACH TO MACHINE TRANSLATION.
B. J. Dorr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1000. 1987. Thesis (M.S.). "This report
is a revised version of a thesis submitted to the Department of
Electrical Engineering and Computer Science on May 7, 1987 in partial
fulfillment of the requirements for the degree of Master of
Science."]
041000A NATURAL OBJECT CATEGORIZATION.
A. F. Bobick.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1001. 1987. Thesis (Ph.D.). "Revised
version of a thesis submitted to the Department of Brain and
Cognitive Sciences on July 22, 1987 in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
109022 THEORY OF COMPUTATION GROUP RESEARCH SUMMARY: JUNE 1985 - JULY 1986.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-313. 1986.]
109023 ON THE MESSAGE COMPLEXITY OF BROADCAST: A BASIC LOWER BOUND.
B. Awerbuch, O. Goldreich, and R. Vainish.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-325. 1987.]
109024 CONTROLLING WORST-CASE PERFORMANCE OF A COMMUNICATION PROTOCOL AND
DYNAMIC RESOURCE MANAGEMENT.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-326. 1987.]
109025 ADAPTING COMMUNICATION PROTOCOLS TO DYNAMIC INPUT AND NETWORK
TOPOLOGY: RESEARCH SUMMARY.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-327. 1987.]
109026 ON THE CORRECTNESS OF ORPHAN ELIMINATION ALGORITHMS.
M. Herlihy et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-329. 1987.]
109027 TWO FUNDAMENTAL ISSUES IN MULTIPROCESSING.
Arvind. and R. A. Iannucci.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-330. 1987. Replaces Laboratory for Computer
Science technical memorandum MIT/LCS/TM-241.]
109028 TEMPORAL CONTROL STRUCTURES REFERENCE MANUAL.
T. A. Russ.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-331. 1987.]
109029 FORMULATION OF TRADEOFFS IN PLANNING UNDER UNCERTAINTY.
M. P. Wellman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-332. 1987. "A proposal for doctoral research at
the Massachusetts Institute of Technology."]
109030 FINDING MINIMUM-COST CIRCULATIONS BY SUCCESSIVE APPROXIMATION.
A. V. Goldberg and R. E. Tarjan.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-333. 1987.]
109031 FINDING MINIMUM-COST CIRCULATIONS BY CANCELING NEGATIVE CYCLES.
A. V. Goldberg and R. E. Tarjan.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-334. 1987.]
109032 THE SEMANTICS OF MIRANDA'S ALGEBRAIC TYPES.
K. B. Bruce and J. G. Riecke.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-335. 1987.]
109033 LOWER BOUNDS FOR RECOGNIZING SMALL CLIQUES ON CRCW PRAM'S.
P. Beame.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-336. 1987.]
109034 A MULTITHREADED PROCESSOR ARCHITECTURE FOR PARALLEL SYMBOLIC
COMPUTATION.
T. Fujita.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-338. 1987.]
109035 INFERRING DECISION TREES USING THE MINIMUM DESCRIPTION LENGTH
PRINCIPLE.
L. R. Quinlan and R. L. Rivest.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-339. 1987.]
109036 NESTED TRANSACTION, CONFLICT-BASED LOCKING, AND DYNAMIC ATOMICITY.
A. D. Fekete et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-340. 1987.]
109037 A MODULAR PROOF OF CORRECTNESS FOR A NETWORK SYCHRONIZER.
A. D. Fekete, N. A. Lynch, and L. Shira.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-341. 1987.]
109038 APPROXIMATE AGREEMENT.
A. D. Fekete.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-342. 1987.]
109039 A MIXED-INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY
SOLVABLE.
C. E. Leiserson and J. B. Saxe.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-343. 1987.]
109040 TOWARDS FULLY ABSTRACT SEMANTICS FOR LOCAL VARIABLES: PRELIMINARY
REPORT.
A. R. Meyer and K. Sieber.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-344. 1987.]
109041 BISIMULATION CAN'T BE TRACED: PRELIMINARY REPORT.
B. Bloom, S. Istrail, and A. R. Meyer.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-345. 1987.]
109042 SPACE EFFICIENT DYNAMIC PROTOCOLS: PART 1.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-346. 1987.]
109043 SPACE EFFICIENT DYNAMIC PROTOCOLS: PART 2.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-347. 1987.]
109044 USING NIKL IN A LARGE MEDICAL KNOWLEDGE BASE.
I. J. Haimowitz.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-348. 1987. "A revised version of a bachelor's
thesis at the Massachusetts Institute of Technology."]
109045 A PROOF OF THE KAHN PRINCIPLE FOR INPUT/OUTPUT AUTOMATA.
N. A. Lynch and E. W. Stark.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-349. 1988.]
020373 BOSTON COMMUNITY INFORMATION SYSTEM USER'S MANUAL (VERSION 8.17).
D. A. Segal et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-373. 1986.]
020375 MODELING THE PERFORMANCE OF THE CONCERT MULTIPROCESSOR.
R. B. Osborne.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-375. 1987. Thesis (M.S.).]
020385 DATA FLOW COMPUTER ARCHITECTURE.
J. B. Dennis.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-385. 1987.]
020387 HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS.
N. A. Lynch and M. R. Tuttle.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-387. 1987. Thesis (M.S.). "Submitted [by Mark R.
Tuttle] to the Department of Electrical Engineering and Computer
Science on April 3, 1987, in partial fulfillment of the requirements
for the degree of Master of Science in Computer Science." Thesis
supervisor: Nancy A. Lynch.]
020388 AN EXPERT SYSTEM FOR DIAGNOSING GAIT FOR CEREBRAL PALSY PATIENTS.
D. E. Hirsch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-388. 1987. Thesis (M.S.).]
020389 TEMPORAL REASONING IN MEDICAL EXPERT SYSTEMS.
I. S. Kohane.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-389. 1987. Thesis (Ph.D.). "This report is a
modified version of [the author's] PhD thesis."]
020390 DATA REPLICATION IN NESTED TRANSACTION SYSTEMS.
K. J. Goldman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-390. 1987. Thesis (M.S.).]
020391 EFFICIENT METHODS FOR CALCULATING MAXIMUM ENTROPY DISTRIBUTIONS.
S. A. Goldman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-391. 1987. Thesis (M.S.).]
020392 MAM: A SEMI-AUTOMATIC DEBUGGING TOOL FOR DISTRIBUTED PROGRAMS.
L. K. Kolodney.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-392. 1987. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering and Computer Science on January
22, 1987 in partial fulfillment of the requirements for the Degrees
of Master of Sciences and Bachelor of Science."]
020393 SYNTHESIS OF SELF-TIMED VLSI CIRCUITS FROM GRAPH-THEORETIC
SPECIFICATIONS.
T.-A. Chu.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-393. 1987. Thesis (Ph.D.).]
020394 DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH.
H. L. Bodlaender.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-394. 1987.]
020395 COMMUNICATION PATTERNS IN A SYMBOLIC MULTIPROCESSOR.
P. R. Nuth.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-395. 1987. Thesis (M.S.). "Submitted to the
Department of Electrical Engineering on May 14, 1987 in partial
fulfillment of the requiremnets for the degrees of Electrical
Engineer and Master of Science in Electrical Engineering."]
020397 BOSTON COMMUNITY INFORMATION SYSTEM: 1986 EXPERIMENTAL TEST DATA.
D. K. Gifford et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-397. 1987.]
020398 CLIPPING SERVICE USER'S MANUAL (VERSION 1.2).
D. K. Gifford, R. G. Cote, and D. A. Segal.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-398. 1987.]
020399 WALTER USER'S MANUAL (VERSION 1.0).
D. K. Gifford, R. G. Cote, and D. A. Segal.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-399. 1987.]
020400 ARGUS REFERENCE MANUAL.
B. Liskov et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-400. 1987. Edited by Gary Leavens.]
020402 MULTISCHEME: A PARALLEL PROCESSING SYSTEM BASED ON MIT SCHEME.
J. S. Miller.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-402. 1987. Thesis (Ph.D.).]
020403 SINGLE-LAYER WIRE ROUTING.
F. M. Maley.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-403. 1987. Thesis (Ph.D.).]
020404 RECOVERY USING VIRTUAL MEMORY.
E. K. Kolodner.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-404. 1987. Thesis (M.S.). "This report is a minor
revision of a thesis of the same title submitted to the Department of
Electrical Engineeering and Computer Science on May 8, 1987 in
partial fulfillment of the requirements for the Degree of Master of
Science."]
020405 A FRAMEWORK FOR INCORPORATING ABSTRACTION MECHANISMS INTO THE LOGIC
PROGRAMMING PARADIGM.
J. L. Zachary.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-405. 1987. Thesis (Ph.D.).]
020406 CALVIN: A RULE BASED EXPERT SYSTEM FOR IMPROVING ARRHYTHMIA DETECTOR
PERFORMANCE DURING NOISY ECGS.
W. K. Muldrow.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-406. 1987. Thesis (M.S.).]
020407 FX-87 REFERENCE MANUAL.
D. K. Gifford et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-407. 1987. Edition 1.0: September 1987.]
020408 TYPES AND EFFECTS: TOWARD THE INTEGRATION OF FUNCTIONAL AND
IMPERATIVE PROGRAMMING.
J. M. Lucassen.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-408. 1987. Thesis (Ph.D.).]
020409 A TECHNIQUE FOR CONSTRUCTING HIGHLY AVAILABLE SERVICES.
R. Ladin, B. Liskov, and L. Shrira.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-409. 1988.]
020410 CONSTRUCTING A HIGHLY-AVAILABLE LOCATION SERVICE FOR A DISTRIBUTED
ENVIRONMENT.
D. J.-H. Hwang.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-410. 1988. Thesis (M.S.).]
020411 ELLIPTIC CURVES AND CRYPTOGRAPHY: A PSEUDORANDOM BIT GENERATOR AND
OTHER TOOLS.
B. S. Kaliski Jr.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-411. 1988. Thesis (Ph.D.).]
109046 COMPARISON OF LINEAR SYSTEM SOLVERS APPLIED TO DIFFUSION-TYPE FINITE
ELEMENT EQUATIONS.
A. Greenbaum, C. Li, and H. Z. Chao.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 126. 1987.]
109047 CASCADING DIVIDE-AND-CONQUER: A TECHNIQUE FOR DESIGNING PARALLEL
ALGORITHMS.
M. J. Atallah, R. Cole, and M. T. Goodrich.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 127. 1987.]
109048 ON OPTIMAL PARALLEL ALGORITHM FOR BUILDING A DATA STRUCTURE FOR
PLANAR POINT LOCATION.
R. Cole and O. Zajicek.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 128. 1987.]
109049 TLB CONSISTENCY ON HIGHLY-PARALLEL SHARED-MEMORY MULTIPROCESSORS.
P. J. Teller, R. Kenner, and M. Snir.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 129. 1987.]
109050 ADAPTIVE MESH REFINEMENT FOR PARALLEL PROCESSORS.
M. J. Berger.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 130. 1987.]
109051 AN ADDITIVE VARIANT OF THE SCHWARZ ALTERNATING METHOD FOR THE CASE OF
MANY SUBREGIONS.
M. Dryja and O. Widlund.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 131. 1987.]
109052 DELTA NETWORK PERFORMANCE AND "HOT SPOT" TRAFFIC.
Y.-S. Liu.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 132. 1988.]
109053 A QUALITATIVE MATCHING SCHEME FOR POSTULATING ENZYME KINETIC MODELS
AND EXPERIMENTAL CONDITIONS: REASONING WITH CONSTRAINTS.
V.-W. Soo.
[Rutgers. Department of Computer Science. CBM-TR-151. 1987. Thesis
(Ph.D.).]
109054 OPPOSING GRAPHS ARE QUASI-PARITY GRAPHS.
C. T. Hoang and F. Maffray.
[Rutgers. Department of Computer Science. DCS-TR-220. 1988.]
109056 UPDATES IN PROPOSITIONAL DATABASES.
M. Dalal.
[Rutgers. Department of Computer Science. DCS-TR-222. 1988.]
109057 THE ANALOGY BETWEEN NUMERICAL WAVE PROPAGATION AND QUANTUM MECHANICS.
R. Vichnevetsky.
[Rutgers. Department of Computer Science. DCS-TR-223. 1988.]
109058 MURKY GRAPHS (UNEXPURGATED).
R. B. Hayward.
[Rutgers. Department of Computer Science. DCS-TR-224. 1988.]
109059 ENVIRONMENT-GUIDED PROGRAM TRANSFORMATION.
A. E. Prieditis.
[Rutgers. Department of Computer Science. ML-TR-21. 1987.]
109060 DESIGN BY DERIVATIONAL ANALOGY: ISSUES IN THE AUTOMATED REPLAY OF
DESIGN PLANS.
J. Mostow.
[Rutgers. Department of Computer Science. ML-TR-22. 1987. Original:
March 1987. Revised: December 1987.]
109061 IN KUHN'S WAKE.
C. Schaffer.
[Rutgers. Department of Computer Science. ML-TR-23. 1987.]
109062 GRASPING A POLYGON.
D. L. Souvaine and C. J. Van Wyk.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-98. 1988.]
109063 THE INTERPROCEDURAL STRUCTURE OF C PROGRAMS: AN EMPIRICAL STUDY.
B. G. Ryder and H. D. Pande.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-99. 1988.]
109064 PERFORMANCE EVALUATION OF A STORAGE MODEL FOR OR-PARALLEL EXECUTION
OF LOGIC PROGRAMS.
A. Ciepielewski and B. Hausman.
[Swedish Institute of Computer Science. Research report R86003. 1986.]
109065 A SOPHISTICATED ENVIRONMENT FOR PROTOCOL SIMULATION AND TESTING.
G. Karjoth, P. Sjoedin, and S. Weckner.
[Swedish Institute of Computer Science. Research report R86004. 1986.]
109066 OR-PARALLEL EXECUTION OF PROLOG ON A MULTI-SEQUENTIAL MACHINE.
K. A. M. Ali.
[Swedish Institute of Computer Science. Research report R86006B.
1986.]
109067 PROCESS MODELS OF LOGIC PROGRAMS: A COMPARISON.
A. Waern.
[Swedish Institute of Computer Science. Research report R86007. 1986.]
109068 ON THE LEARNING OF FUNCTIONAL DEPENDENCIES IN DEDUCTIVE DATABASES.
P. Mathieu.
[Swedish Institute of Computer Science. Research report R86008. 1986.]
109069 GARBAGE COLLECTION FOR PROLOG BASED ON WAM.
K. Appleby, S. Haridi, and D. Sahlin.
[Swedish Institute of Computer Science. Research report R86009. 1986.]
109070 GENERALIZED HORN CLAUSES.
L. Hallnaes.
[Swedish Institute of Computer Science. Research report R86010. 1986.]
109071 AN IMPLEMENTATION OF DIF AND FREEZE IN THE WAM.
M. Carlsson.
[Swedish Institute of Computer Science. Research report R86012. 1986.]
109072 TIME, CLOCKS AND COMMITTED CHOICE PARALLELISM FOR LOGIC PROGRAMMING
OF REAL TIME CLOCKS.
N. A. Elshiewy.
[Swedish Institute of Computer Science. Research report R86013. 1987.]
109073 A METHOD FOR IMPLEMENTING CUT IN PARALLEL EXECUTION OF PROLOG.
K. A. M. Ali.
[Swedish Institute of Computer Science. Research report R87001. 1987.]
109074 EPISTEMIC REASONING, LOGIC PROGRAMMING, AND THE INTERPRETATION OF
QUESTIONS.
M. Rayner and S. Janson.
[Swedish Institute of Computer Science. Research report R87002. 1987.]
109075 ORPWAM: AN IMPLEMENTATION STUDY.
C. Gadener, M. Liden, and J. Riboe.
[Swedish Institute of Computer Science. Research report R87004. 1987.]
109076 GLOBAL GARBAGE COLLECTION FOR DISTRIBUTED HEAP STORAGE SYSTEMS.
K. A. M. Ali and S. Haridi.
[Swedish Institute of Computer Science. Research report R87005. 1987.]
109077 OR-PARALLEL PROLOG MADE EFFICIENT ON SHARED MEMORY MULTIPROCESSORS.
B. Hausman, A. Ciepielewski, and S. Haridi.
[Swedish Institute of Computer Science. Research report R87006. 1987.]
109078 A SCHEME FOR COMPILING GHC TO PROLOG USING FREEZE.
F. Holmgren and A. Waern.
[Swedish Institute of Computer Science. Research report R87007. 1987.]
109079 MAKING GARBAGE COLLECTION INDEPENDENT OF THE AMOUNT OF GARBAGE.
D. Sahlin.
[Swedish Institute of Computer Science. Research report R87008. 1987.
"Appendix to SICS Research Report R86009 'Garbage Collection for
Prolog based on WAM.'"]
109080 ALGORITHMIC ASPECTS OF INTUITIONISTIC PROPOSITIONAL LOGIC.
T. Franzen.
[Swedish Institute of Computer Science. Research report R87010. 1987.]
109082 FITTING AN ELLIPSE TO DATA.
A. B. Forbes.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 95/87. 1987.]
109083 A DENOTATIONAL DEFINITION OF PROLOG.
N. D. North.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 106/88. 1988.]
109084 MODELLING OF TASK FLOW IN SYSTEMS OF FUNCTIONAL UNITS.
R. Valk.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 124. 1987.]
109085 SCHNELLE DIGITALE BILDKORRELATION - FERMAT-TRANSFORMATION VERSUS DFT.
C. Siemens.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 128. 1987.]
109086 TEMPORAL ABSTRACTION OF DIGITAL DESIGNS.
J. Herbert.
[University of Cambridge. Computer Laboratory. Technical report 122.
1988. Thesis (Ph.D.). "This report is essentially a self-contained
portion of [the author's] thesis."]
109087 CASE STUDY OF THE CAMBRIDGE FAST RING ECL CHIP USING HOL.
J. Herbert.
[University of Cambridge. Computer Laboratory. Technical report 123.
1988. Thesis (Ph.D.). "This report is essentially a self-contained
portion of [the author's] thesis."]
109088 FORMAL VERIFICATION OF BASIC MEMORY DEVICES.
J. Herbert.
[University of Cambridge. Computer Laboratory. Technical report 124.
1988. Thesis (Ph.D.). "This report is essentially a self-contained
portion of [the author's] thesis."]
109089 AN OPERATIONAL SEMANTICS FOR OCCAM.
J. Camilleri.
[University of Cambridge. Computer Laboratory. Technical report 125.
1988.]
109090 REASONING ABOUT THE FUNCTION AND TIMING OF INTEGRATED CIRCUITS WITH
PROLOG AND TEMPORAL LOGIC.
M. E. Leeser.
[University of Cambridge. Computer Laboratory. Technical report 126.
1988.]
109091 A DEVELOPMENT ENVIRONMENT FOR LARGE NATURAL LANGUAGE GRAMMARS.
J. Carroll et al.
[University of Cambridge. Computer Laboratory. Technical report 127.
1988.]
109092 DEBUGGING CONCURRENT AND DISTRIBUTED PROGRAMS.
R. C. B. Cooper.
[University of Cambridge. Computer Laboratory. Technical report 128.
1988. Thesis (Ph.D.).]
109093 CHORALEARN: A SYSTEM THAT LEARNS FROM EXAMPLES TO WRITE SIMPLIFIED
FIGURED BASS HARMONIZATIONS OF CHORALES USING THE PLS1 CLUSTERER.
D. W. Sirkin.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-87-1313. 1987. Thesis (M.S.).]
109094 FUNDAMENTALS OF GEOMETRIC LEARNING.
S. M. Omohundro.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1408. 1988.]
109095 FAST TEXTURE RECOGNITION USING INFORMATION TREES.
D. R. Hougen and S. M. Omohundro.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1409. 1988.]
109096 A LOWER BOUND ON THE NUMBER OF UNIT DISTANCES BETWEEN THE VERTICES OF
A CONVEX POLYGON.
H. Edelsbrunner and P. Hajnal.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1412. 1988.]
109097 SEARCHING FOR EMPTY CONVEX POLYGONS.
D. P. Dobkin, H. Edelsbrunner, and M. H. Overmars.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1413. 1988.]
109098 PROCESS MANAGEMENT AND EXCEPTION HANDLING IN MULTIPROCESSOR OPERATING
SYSTEMS USING OBJECT-ORIENTED DESIGN TECHNIQUES.
V. Russo, G. Johnston, and R. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1415. 1988.]
109099 VERIFICATION OF SYSTEMS OF PROCESSES AND MONITORS - TWO EXAMPLES.
S. Gjessing.
[University of Oslo. Institute for Informatics. Research report 110.
1987.]
109100 WEAK LOGIC THEORY.
M. Holden.
[University of Oslo. Institute for Informatics. Research report 111.
1988. Thesis (D.Sci.).]
109101 CUT ELIMINATION AND AUTOMATIC PROOF PROCEDURES.
W. Zhang.
[University of Oslo. Institute for Informatics. Research report 112.
1988. Thesis (D.Sci.).]
109102 INTRODUCING GIRARD'S QUANTITATIVE DOMAINS: THE QUANTITATIVE DOMAINS
AS A MODEL FOR NONDETERMINISM AND TYPED LAMBDA-CALCULUS WITH
RECURSIVE TYPES.
C.-E. S. Ore.
[University of Oslo. Institute for Informatics. Research report 113.
1988. Thesis (D.Sci.).]
109103 THEORY AND COMPUTATION OF UNCERTAIN INFERENCE AND DECISION.
R. P. Loui.
[University of Rochester. Department of Computer Science. TR 228.
1987. Thesis (Ph.D.).]
109104 CONCURRENT QUEUES: PRACTICAL FETCH-AND-PHI ALGORITHMS.
J. M. Mellor-Crummey.
[University of Rochester. Department of Computer Science. TR 229.
1987.]
109105 PROBABILISTIC INFERENCE.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 230.
1987.]
109106 A MEAN-VALUE PERFORMANCE ANALYSIS OF A NEW MULTIPROCESSOR
ARCHITECTURE.
S. T. Leutenegger and M. K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 748. 1988.]
109107 USING SELF-REDUCIBILITIES TO CHARACTERIZE POLYNOMIAL TIME.
J. Goldsmith, D. Joseph, and P. Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 749. 1988.]
109108 OPTIMIZATION OF MULTIPLE-DISJUNCT QUERIES IN A RELATIONAL DATABASE
SYSTEM.
M. Muralikrishna.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 750. 1988. Thesis (Ph.D.).]
109109 DESIGN AND ANALYSIS OF A GRACEFULLY-DEGRADING INTERLEAVED MEMORY
SYSTEM.
K. C. Cheung et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 751. 1988.]
109110 THE PERFORMANCE POTENTIAL OF MULTIPLE FUNCTIONAL UNIT PROCESSORS.
A. R. Pleszkun and G. S. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 752. 1988.]
109111 LOGICAL DATA SKEWING SCHEMES FOR INTERLEAVED MEMORIES IN VECTOR
PROCESSORS.
G. S. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 753. 1988.]
109112 A MECHANISM FOR EFFICIENT DEBUGGING OF PARALLEL PROGRAMS.
B. P. Miller and J.-D. Choi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 754. 1988.]
VOL. 10, NO. 6 06/10/88
109113 A MODAL PROCESS LOGIC.
K. G. Larsen and B. Thomsen.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 88-5. 1988.]
109114 MARKED NET BASE MODELLING OF CONTROL STRUCTURES IN DDBS - A SYSTEMS
VIEW.
B. Chamberlain and P. W. Proszynski.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 88-9. 1988.]
109115 CONCURRENT READING AND WRITING OF CLOCKS.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 27. 1988.]
109116 SEMANTIC MEANING IN INFORMATION RETRIEVAL.
H. P. Frei, H. P. Giger, and P. Schaeuble.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 84. 1987.]
109117 GEOMETRIC MODELING AND COMPUTER VISION.
P. J. Besl.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6248. 1988.]
109118 COMMUNICATING HETEROGENEOUS SOFTWARE MODELS.
A. J. Dempster and K. P. Twidle.
[Imperial College of Science and Technology. Department of Computing.
Research report 88/3. 1988.]
109119 CONCURRENCY AND ATOMICITY.
G. Boudol and I. Castellani.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 748. 1987.]
109120 MODELLING INFINITARY BEHAVIORS OF COMMUNICATING SYSTEMS.
P. Darondeau and B. Gamatie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 749. 1987. Also issued as Publication
interne 375, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109121 ANALYSIS OF THE M/GI/1 -> ./M/1 QUEUEING MODEL.
H. P. C. Blanc, R. Iasnogorodski, and P. Nain.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 754. 1987.]
109122 LOAD BALANCING IN A SYSTEM OF TWO QUEUES WITH RESEQUENCING.
A. Jean-Marie.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 755. 1987.]
109123 ELLIPTIC FUNCTIONS, CONTINUED FRACTIONS, AND DOUBLED PERMUTATIONS.
P. Flajolet and J. Francon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 758. 1987.]
109124 PARALLEL MACHINES FOR MULTISET TRANSFORMATION AND THEIR PROGRAMMING
STYLE.
J.-P. Banatre, A. Coutant, and D. Le Metayer.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 759. 1987. Also issued as Publication
interne 378, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109125 EXACT REAL COMPUTER ARITHMETIC WITH CONTINUED FRACTIONS.
J. Vuillemin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 760. 1987.]
109126 SIGNAL: A DECLARATIVE LANGUAGE FOR SYNCHRONOUS PROGRAMMING OF
REAL-TIME SYSTEMS.
T. Gautier, P. Le Guernic, and L. Besnard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 761. 1987. Also issued as Publication
interne 379, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109127 SYNCHRONIZING PROCESSORS THROUGH MEMORY REQUESTS IN A TIGHTLY COUPLED
MULTIPROCESSOR.
A. Seznec and Y. Jegou.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 762. n.d. Also issued as Publication
interne 380, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109128 AN OPERATIONAL FORMAL DEFINITION OF PROLOG.
P. Deransart and G. Ferrand.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 763. 1987. Revised edition of INRIA
rapport de recherche 598.]
109129 MACROTEX: A LATEX CODE GENERATOR IN MACSYMA.
J.-P. Chancelier and A. Sulem.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 93. 1987.]
109130 DATA TRAFFIC REDUCTION SCHEMES FOR SPARSE CHOLESKY FACTORIZATIONS.
V. K. Naik and M. L. Patrick.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-14. 1988.]
109131 SEMI-AUTOMATIC PROCESS PARTITIONING FOR PARALLEL COMPUTATION.
C. Koelbel, P. Mehrotra, and J. Van Rosendale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-16. 1988.]
109132 PROGRAMMING PARALLEL ARCHITECTURES: THE BLAZE FAMILY OF LANGUAGES.
P. Mehrotra.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-21. 1988.]
109133 DESTINATION TAG ROUTING TECHNIQUES BASED ON A STATE MODEL FOR THE
IADM NETWORK.
D. Rau, J. A. B. Fortes, and H. J. Siegel.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-006. 1987.]
109134 A MODEL FOR AN INTELLIGENT OPERATING SYSTEM FOR EXECUTING TASKS ON A
RECONFIGURABLE PARALLEL ARCHITECTURE.
C. H. Chu et al.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-87-007. 1987.]
109135 PROPERTIES OF DISJOINT PATHS IN DATA MANIPULATOR NETWORKS.
W. G. Nation and H. J. Siegel.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-001. 1988.]
109136 AN IMPROVED CONTROL DEPENDENCE ALGORITHM.
R. Cytron and J. Ferrante.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13291. 1988.]
109137 ON GENES AND GRAPHICS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13316. 1987.]
109138 YES/L1: AN EXPERIMENTAL EXPERT SYSTEM SHELL.
N. B. Waite and K. R. Milliken.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13358. n.d.]
109139 DEPENDENCE ON ADA TASK SCHEDULING IS NOT "ERRONEOUS."
N. H. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13363. 1987.]
109140 HILL CLIMBING WITH REDUCED SEARCH SPACE AND ITS COMPLETENESS.
D. Brand.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13374. 1987.]
109141 IMPROVING CONTROL IN RULE-BASED SYSTEMS BY SYMBOLIC ANALYSIS OF DATA
PATTERNS.
W. H. Santos.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13388. 1987.]
109142 OPTIMAL TRANSISTOR ORIENTATION IN CMOS CELL LAYOUT.
R. Nair and A. Stauffer.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13419. 1988.]
109143 THE RESERACH QUEUEING PACKAGE MODELING ENVIRONMENT.
R. F. Gordon et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13428. 1988.]
109144 THE COMPLEXITY OF SHORT TWO-PERSON GAMES.
A. K. Chandra and M. Tompa.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13435. 1988.]
109145 ARTIFACTS AS PSYCHOLOGICAL THEORIES: THE CASE OF HUMAN-COMPUTER
INTERACTION.
J. M. Carroll and R. L. Campbell.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13454. 1988.]
109146 FAMILIES OF CONSENSUS ALGORITHMS.
A. Bar-Noy and D. Dolev.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6025. 1988.]
109147 A THEORY AND SYSTEM FOR NON-MONOTONIC REASONING.
J. W. Goodwin.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Dissertation
165. 1987. Thesis (Ph.D.).]
109148 HEURISTICS FOR MINIMUM DECOMPOSITIONS OF POLYGONS.
C. Levcopoulos.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Dissertation
155. 1987. Thesis (Ph.D.).]
109149 ICONSTRAINT, A DEPENDENCY DIRECTED CONSTRAINT MAINTENANCE SYSTEM.
J. Maleki.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Thesis 71.
1987. Thesis (Licentiate of Engineering).]
109150 NEW RESULTS ABOUT THE APPROXIMATION BEHAVIOR OF THE GREEDY
TRIANGULATION.
C. Levcopoulos.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Thesis 74.
1986. Thesis (Licentiate of Engineering).]
109151 SPORT-SORT, SORTING ALGORITHMS AND SPORT TOURNAMENTS: INVESTIGATIONS
TO ARRANGE FAIR, TRANSITIVE SPORT TOURNAMENTS GIVING THE FULL RANKING
LIST IN AS FEW ROUNDS AS POSSIBLE.
H. Block.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Thesis 111.
1987. Thesis (Licentiate of Engineering).]
109152 NETWORK AND LATTICE BASED APPROACHES TO THE REPRESENTATION OF
KNOWLEDGE.
R. Roennquist.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Thesis 113.
1987. Thesis (Licentiate of Engineering).]
109153 INFERENCE WITH CONSISTENT PROBABILITIES IN EXPERT SYSTEMS.
D. Driankov.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-12. 1986.]
109154 A REPRESENTATION OF ACTION STRUCTURES.
E. Sandewall and R. Roennquist.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-13. 1986.]
109155 A CALCULUS FOR BELIEF-INTERVALS REPRESENTATION OF UNCERTAINTY.
D. Driankov.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-17. 1986.]
109156 PROVING RUN-TIME PROPERTIES OF LOGIC PROGRAMS.
W. Drabent and J. Maluszynski.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-23. 1986.]
109157 NORMALIZED DIVIDE AND CONQUER: A SCALING TECHNIQUE FOR SOLVING
MULTI-DIMENSIONAL PROBLEMS.
R. G. Karlsson and M. H. Overmars.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-37. 1986.]
109158 A SYSTEM FOR STUDYING HUMAN-COMPUTER DIALOGUES IN NATURAL LANGUAGE.
N. Dahlbaeck and A. Joensson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-42. 1986.]
109159 DO LOGIC PROGRAMS RESEMBLE PROGRAMS IN CONVENTIONAL LANGUAGES?
W. Drabent.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-01. 1987.]
109160 A FORMAL APPROACH TO REASON-MAINTENANCE BASED ON ABSTRACT DOMAINS.
P. Haneclou.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-07. 1987.]
109161 NEARLY OPTIMAL HEURISTICS FOR BINARY SEARCH TREES WITH GEOMETRIC
GENERALIZATIONS.
C. Levcopoulos, A. Lingas, and J.-R. Sack.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-08. 1987.]
109162 SUBTREE ISOMORPHISM AND BIPARTITE PERFECT MATCHING ARE MUTUALLY NC
REDUCIBLE.
A. Lingas and M. Karpinski.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-09. 1987.]
109163 ON PARALLEL COMPLEXITY OF THE SUBGRAPH ISOMORPHISM PROBLEM.
A. Lingas.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-10. 1987.]
109164 STATE OF THE ART STATISTICAL EXPERT SYSTEMS.
S. I. Chowdhury.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-16. 1987.]
109165 SPECIFICATION AND VERIFICATION OF VLSI SYSTEMS: ACTIONAL BEHAVIOR.
T. Larsson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-17. 1987.]
109166 REUSE AND MAINTENANCE TECHNIQUES IN KNOWLEDGE-BASED SYSTEMS.
H. Nordin.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-18. 1987.]
109167 CONSTRUCTION OF ASYNCHRONOUS CONCURRENT SYSTEMS FROM THEIR BEHAVIORAL
SPECIFICATIONS.
Z. Peng.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-19. 1987.]
109168 PARALLELISM EXTRACTION FROM SEQUENTIAL PROGRAMS FOR VLSI APPLICATIONS.
K. Kuchcinski and Z. Peng.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-20. 1987.]
109169 AN INTERACTIVE SYSTEM FOR TAGGING DIALOGUES.
L. Ahrenberg and A. Joensson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-87-22. 1987.]
109170 ARTIFICIAL INTELLIGENCE AND CATALOGING: BUILDING EXPERT SYSTEMS FOR
SIMPLE CHOICE OF ACCESS POINT FOR ENTRIES. RESULTS AND REVELATIONS.
R. Hjerppe and B. Olander.
[Linkoeping University. Department of Computer and Information
Science. LIBLAB (Laboratory for Library and Information Science).
Research report LiU-LIBLAB-R:1985:1. 1985.]
109171 LINS - LIBLAB'S NAME HANDLING SYSTEM: A KNOWLEDGE-BASED SYSTEM FOR
AUTHORITY CONTROL OF PERSONAL NAMES ACCORDING TO AACR2, CH.22.,
HEADINGS FOR PERSONS.
R. Hjerppe.
[Linkoeping University. Department of Computer and Information
Science. LIBLAB (Laboratory for Library and Information Science).
Research report LiU-LIBLAB-R:1987:1. 1987.]
041933A THE PROGRAMMER'S APPRENTICE: A PROGRAM DESIGN SCENARIO.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 933A. 1987.]
041947 PRINCIPLE-BASED PARSING FOR MACHINE-TRANSLATION.
B. J. Dorr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 947. 1987.]
041985 ON THE RECOGNITION OF PARAMETRIZED OBJECTS.
W. E. L. Grimson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 985. 1987.]
041998 UNITRAN: AN INTERLINGUAL MACHINE TRANSLATION SYSTEM.
B. J. Dorr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 998. 1987.]
042015 A LEXICAL CONCEPTUAL APPROACH TO GENERATION FOR MACHINE TRANSLATION.
B. J. Dorr.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1015. 1988.]
099091 A HIGH-PERFORMANCE VLSI QUATERNARY SERIAL MULTIPLIER.
-418 W. J. Dally.
[1987.]
099091 A FINE-GRAIN, MESSAGE-PASSING PROCESSING NODE.
-421 W. J. Dally.
[1987.]
099091 CONCURRENT COMPUTER ARCHITECTURE.
-422 W. J. Dally.
[1987.]
099091 DESIGN OF A SELF-TIMED VLSI MULTICOMPUTER COMMUNICATION CONTROLLER.
-423 W. J. Dally and P. Song.
[1987.]
099091 PERFORMANCE ANALYSIS OF K-ARY N-CUBE INTERCONNECTION NETWORKS.
-424 W. J. Dally.
[1987.]
099091 FORMAL HIERARCHICAL MULTILEVEL VERIFICATION OF SYNCHRONOUS MOS VLSI
-425 DESIGNS.
D. W. Weiss.
[1987. Thesis (Ph.D.).]
099091 SPACE-EFFICIENT QUEUE MANAGEMENT USING FIXED-CONNECTION NETWORKS.
-426 F. T. Leighton and E. Schwabe.
[1987.]
099091 OPTIMAL SIMULATIONS BY BUTTERFLY NETWORKS: EXTENDED ABSTRACT.
-427 S. N. Bhatt et al.
[1987.]
099091 A GRAPH WITH E EDGES HAS PAGENUMBER O(SQUARE-ROOT-OF E LOG E).
-428 S. M. Malitz.
[1987.]
099091 A METHOD FOR THE DESIGN OF STABLE LATERAL INHIBITION NETWORKS THAT IS
-429 ROBUST IN THE PRESENCE OF CIRCUIT PARASITICS.
J. L. Wyatt Jr. and D. L. Standley.
[1988.]
109172 A NOTE ON PERFECT ORDERS.
C. T. Hoang and N. V. R. Mahadev.
[Rutgers. Department of Computer Science. DCS-TR-221. 1988.]
109173 THE REWRITE MACHINE PROJECT.
J. A. Goguen et al.
[SRI International. Computer Science Laboratory. SRI-CSL-87-1. 1987.
"This report contains four papers given at the Second International
Conference on Supercomputing (Santa Clara, CA, May 4-7, 1987) on the
Rewrite Rule Machine Project at SRI International."]
109174 CONCURRENT TERM REWRITING AS A MODEL OF COMPUTATION.
J. A. Goguen, C. Kirchner, and J. Meseguer.
[SRI International. Computer Science Laboratory. SRI-CSL-87-2. 1987.]
109175 AN ABSTRACT MACHINE FOR FAST PARALLEL MATCHING OF LINEAR PATTERNS.
U. Montanari and J. A. Goguen.
[SRI International. Computer Science Laboratory. SRI-CSL-87-3. 1987.]
109176 SECURITY AND INFERENCE IN MULTILEVEL DATABASE AND KNOWLEDGE-BASE
SYSTEMS.
M. Morgenstern.
[SRI International. Computer Science Laboratory. SRI-CSL-87-4. 1987.]
109177 AN INTRUSION-DETECTION MODEL.
D. E. Denning.
[SRI International. Computer Science Laboratory. SRI-CSL-87-5. 1987.]
109178 A MULTILEVEL RELATIONAL DATA MODEL.
D. E. Denning et al.
[SRI International. Computer Science Laboratory. SRI-CSL-87-6. 1987.]
109179 UNIFYING FUNCTIONAL, OBJECT-ORIENTED AND RELATIONAL PROGRAMMING WITH
LOGICAL SEMANTICS.
J. A. Goguen and J. Meseguer.
[SRI International. Computer Science Laboratory. SRI-CSL-87-7. 1987.]
109180 HIGHER ORDER FUNCTIONS CONSIDERED UNNECESSARY FOR HIGHER ORDER
PROGRAMMING.
J. A. Goguen.
[SRI International. Computer Science Laboratory. SRI-CSL-88-1. 1988.]
109181 WHAT IS UNIFICATION? A CATEGORICAL VIEW OF SUBSTITUTION, EQUATION AND
SOLUTION.
J. A. Goguen.
[SRI International. Computer Science Laboratory. SRI-CSL-88-2. 1988.]
109182 PETRI NETS ARE MONOIDS.
J. Meseguer and U. Montanari.
[SRI International. Computer Science Laboratory. SRI-CSL-88-3. 1988.]
109183 OBJ AS A THEOREM PROVER.
J. A. Goguen.
[SRI International. Computer Science Laboratory. SRI-CSL-88-4. 1988.]
109184 GODEL, LUCAS, AND MECHANICAL MODELS OF THE MIND.
R. F. Hadley.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 85-5. 1987. "Revised version."]
109190 COMPLEXITY OF GRAPH CONNECTIVITY FUNCTIONS.
F. Ling and T. Kameda.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-5. 1987.]
109191 ON RESTRICTED TWO-FACTORS.
P. Hell et al.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-6. 1987.]
109192 DISAMBIGUATING QUERIES USING DEPENDENCY GRAPHS.
G. Hall, W. Luk, and N. Cercone.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-7. 1987.]
109193 TOWARD A THEORY OF NATURAL LANGUAGE GENERATION: THE CONNECTION
BETWEEN SYNTAX AND SEMANTICS.
C. Brown, T. Pattabhiraman, and P. Massicotte.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-8. 1987.]
109194 AN APPROACH TO DEFAULT REASONING BASED ON A FIRST-ORDER CONDITIONAL
LOGIC: REVISED AND EXTENDED REPORT.
J. P. Delgrande.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-9. 1987.]
109195 MODEL-THEORETIC VS. PROCEDURAL SEMANTICS.
R. F. Hadley.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-10. 1987.]
109196 THE COMPLEXITY OF TOURNAMENT COLOURINGS OF DIGRAPHS.
P. Hell and G. MacGillivray.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-12. 1987.]
109197 COMPUTING ON AN ANONYMOUS NETWORK.
M. Yamashita and T. Kameda.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-15. 1987.]
109198 COMPUTING FUNCTIONS ON AN ANONYMOUS NETWORK.
M. Yamashita and T. Kameda.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-16. 1987.]
109199 A DEFAULT-ORIENTED THEORY OF PROCEDURAL SEMANTICS.
R. F. Hadley.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-17. 1987.]
109200 BYZANTINE AGREEMENT UNDER NETWORK FAILURES.
F. Ling and T. Kameda.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-18. 1987.]
109201 A FOUNDATIONAL APPROACH TO AUTONOMOUS KNOWLEDGE ACQUISITION.
J. P. Delgrande.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 87-19. 1987.]
109202 AN O(N LOG N) ALGORITHM FOR BOTTLENECK RESOURCE ALLOCATION.
P. Hell and C. E. Yang.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 88-2. 1988.]
109203 TRUTH CONDITIONS AND PROCEDURAL SEMANTICS.
R. F. Hadley.
[Simon Fraser University. Laboratory for Computer and Communications
Research. LCCR TR 88-6. 1988.]
109204 ON COMPUTING TEST VECTORS FOR MULTIPLE FAULTS IN GATE LEVEL
COMBINATORIAL CIRCUITS.
S. Chakravarty and H. B. Hunt III.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-01. 1987.]
109205 ON KNOWLEDGE REPRESENTATION USING SEMANTIC NETWORKS AND SANSKRIT.
S. N. Srihari, W. J. Rapaport, and D. Kumar.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-03. 1987.]
109206 A NOTE ON RANDOM VERSUS DETERMINISTIC TESTING OF GATE LEVEL
COMBINATORIAL CIRCUITS.
S. Chakravarty.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-05. 1987.]
109207 ON THE GENERALIZED PROBABILITY PROBLEM WITH APPLICATION TO TESTING
AND RELIABILITY ANALYSES.
S. Chakravarty and H. B. Hunt III.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-06. 1987.]
109208 REPRESENTATION OF DEVICE KNOWLEDGE FOR VERSATILE FAULT DIAGNOSIS.
M. R. Taie.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-07. 1987. Thesis (Ph.D.).]
109209 A MODEL OF PROBABILISTIC INFERENCE FOR DECISION-MAKING UNDER RISK AND
UNCERTAINTY.
G. L. Sicherman.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-08. 1987. Thesis (Ph.D.).]
109210 PARALLEL DYNAMIC COMPUTATIONAL GEOMETRY.
L. Boxer and R. Miller.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-11. 1987.]
109211 ANALYSIS OF THE FORK-JOIN QUEUE.
C. Kim and A. K. Agrawala.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-12. 1987.]
109212 TESTING OF NON-FEEDBACK BRIDGING FAULTS.
S. Chakravarty.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-13. 1987.]
109213 EFFICIENT PARALLEL AND SEQUENTIAL ALGORITHMS FOR 4-COLORING PERFECT
PLANAR GRAPHS.
X. He.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-14. 1987.]
109214 FTMC: A FAULT-TOLERANT MULTISTAGE CUBE NETWORK.
S. Chakravarty.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-15. 1987.]
109215 A SEMANTIC APPROACH TO FAIRNESS.
J. J. M. M. Rutten and J. Zucker.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-16. 1987.]
109216 COMPUTING DETECTABILITY IS HARDER THAN COMPUTING TEST VECTORS.
S. Chakravrty.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-17. 1987.]
109217 A UNIFIED APPROACH TO DESIGNING FAULT-TOLERANT PROCESSOR ENSEMBLES.
S. Chakravarty and S. J. Updhyaya.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 87-18. 1987.]
109218 AN INTRODUCTION TO PANELTOOL & THE CGI GRAPHICS INTERFACE.
A. Van Hoff.
[Turing Institute. TIOP-88-009. 1988.]
109219 VALIDATION TESTS FOR STANDARD PASCAL AND EXTENDED PASCAL.
A. W. Idema.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 108/88. 1988.]
109220 THEORIE UND ANWENDUNGEN SEMILINEARER VEKTORMENGEN.
J.-P. Haas.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 130. 1987.]
109221 EIN ANSATZ ZUR SEGMENTATION VON FARBBILDERN DURCH HIERARCHISCHE
BALLUNGSANALYSE.
C. Schroeder.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 132. 1987.]
109222 MATCHING - A SPECIAL CASE OF UNIFICATION.
H.-J. Buerckert.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-08. 1987.]
109223 GRAPH ISOMORPHISM: SOME SPECIAL CASES.
R. Socher.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-10. 1987.]
109224 TEL (VERSION 0.9) REPORT AND USER MANUAL.
G. Smolka.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-11. 1987.]
109225 TOWARD EFFICIENT KNOWLEDGE-BASED AUTOMATED THEOREM PROVING FOR
NON-STANDARD LOGICS.
M. McRobbie.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-12. 1987.]
109226 AN OPTIMIZED TRANSFORMATION INTO CONJUNCTIVE (OR DISJUNCTIVE) NORMAL
FORM.
R. Socher.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-13. 1987.]
109227 UNIFICATION IN A COMBINATION OF ARBITRARY DISJOINT EQUATIONAL
THEORIES.
M. Schmidt-Schauss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-16. 1987.]
109228 REPRESENTING AND ANALYZING CAUSAL, TEMPORAL, AND HIERARCHICAL
RELATIONS OF DEVICES.
H. Voss.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI report
SR-87-17. 1987.]
109229 EXTENDING THE WARREN ABSTRACT MACHINE TO FEATURE PROLOG.
P. Forster.
[Universitaet Kaiserslautern. Fachbereich Informatik. SEKI working
paper SWP-87-10. 1987.]
109230 ITERATIVE ALGORITHMS FOR GRAM-SCHMIDT ORTHOGONALIZATION.
W. Hoffman.
[University of Amsterdam. Department of Mathematics. Report no.
87-22. 1987.]
109231 NONUNIFORM TRAFFIC SPOTS (NUTS) IN MULTISTAGE INTERCONNECTION
NETWORKS.
T. Lang and L. Kurisaki.
[University of California, Los Angeles. Computer Science Department.
CSD-880001. 1988.]
109232 RECOGNIZING AND RESPONDING TO PLAN-ORIENTED MISCONCEPTIONS.
A. Quilici, M. Dyer, and M. Flowers.
[University of California, Los Angeles. Computer Science Department.
CSD-880002. 1988. Also issued as UCLA-AI-88-1, Artificial
Intelligence Laboratory, University of California, Los Angeles.]
109233 HIGH-PERFORMANCE MULTI-QUEUE BUFFERS FOR VLSI COMMUNICATION SWITCHES.
Y. Tamir and G. L. Frazier.
[University of California, Los Angeles. Computer Science Department.
CSD-880003. 1988.]
109234 THE IMPLEMENTATION AND APPLICATION OF MICRO ROLLBACKS IN FAULT
TOLERANT VLSI SYSTEMS.
Y. Tamir, M. Tremblay, and D. A. Rennels.
[University of California, Los Angeles. Computer Science Department.
CSD-880004. 1988.]
109235 APPLICATION-TRANSPARENT PROCESS-LEVEL ERROR RECOVERY FOR
MULTICOMPUTERS.
Y. Tamir and T. Gaber.
[University of California, Los Angeles. Computer Science Department.
CSD-880005. 1988.]
109236 KNOWLEDGE REPRESENTATION FOR DESIGN CREATIVITY.
J. Hodges, M. Flowers, and M. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-880006. 1988.]
109237 AN ARCHITECTURAL MODEL FOR A FLAT CONCURRENT PROLOG PROCESSOR.
L. Alkalaj and E. Y. Shapiro.
[University of California, Los Angeles. Computer Science Department.
CSD-880007. 1988.]
109238 IDENTIFYING AND SELECTING SEQUENTIAL THREADS IN DATA FLOW PROGRAMS.
D. R. Greening and M. D. Ercegovac.
[University of California, Los Angeles. Computer Science Department.
CSD-880008. 1988.]
109239 MODELING GRANULARITY IN DATA FLOW PROGRAMS.
D. R. Greening.
[University of California, Los Angeles. Computer Science Department.
CSD-880009. 1988. Thesis (M.S.).]
109240 PARALLEL RETRIEVAL AND APPLICATION OF CONCEPTUAL KNOWLEDGE.
C. P. Dolan and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-880010. 1988.]
109241 THE FAST HARTLEY TRANSFORM ON THE HYPERCUBE MULTIPROCESSORS.
X. Lin, T. F. Chan, and W. J. Karplus.
[University of California, Los Angeles. Computer Science Department.
CSD-880011. 1988.]
109242 DESIGNING ARRAYS FOR THE FADDEEV ALGORITHM.
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880013. 1988.]
109243 REDUCING THE NUMBER OF CELLS IN ARRAYS FOR MATRIX COMPUTATIONS.
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880014. 1988. "This report is a revised version of [Computer
Science Department] technical report CSD-870040, 'Removing Algorithm
Irregularities in the Design of Arrays for Matrix Computations,'
...August 1987."]
109244 GRAPH-BASED PARTITIONING OF MATRIX ALGORITHMS FOR SYSTOLIC ARRAYS.
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880015. 1988.]
109245 ON CONSTRAINT-ORIENTED ENVIRONMENTS FOR CONTINUOUS SYSTEMS SIMULATION.
R. A. Huntsinger.
[University of California, Los Angeles. Computer Science Department.
CSD-880018. 1988.]
109246 REPRESENTATION TRANSFORMATION IN CONSTRAINT SATISFACTION SYSTEMS.
R. A. Huntsinger.
[University of California, Los Angeles. Computer Science Department.
CSD-880020. 1988.]
109247 PRODUCT FORM QUEUEING NETWORKS: STATE DEPENDENCE REVISITED.
J. Bannister.
[University of California, Los Angeles. Computer Science Department.
CSD-880021. 1988.]
109248 SET CONTAINMENT INFERENCE AND SYLLOGISMS.
P. Atzeni and D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-880022. 1988. "Revision of UCLA Computer Science Department
technical report CSD-860012, December 1986." Revised: July 1987.]
109249 UNIFICATION AND PREDICATE LOCKING.
T. A. Wheeler.
[University of California, Los Angeles. Computer Science Department.
CSD-880023. 1988. Thesis (M.S.).]
109250 IMPROVING CLAUSE ACCESS IN PROLOG.
D. S. Parker, T. W. Page Jr., and R. Muntz.
[University of California, Los Angeles. Computer Science Department.
CSD-880024. 1988.]
109251 A METHODOLOGY FOR AUTOMATED DESIGN OF COMPUTER INSTRUCTION SETS.
J. P. Bennett.
[University of Cambridge. Computer Laboratory. Technical report 129.
1988. Thesis (Ph.D.).]
109252 THE FOUNDATION OF A GENERIC THEOREM PROVER.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 130.
1988. "This paper is a revised version of [technical] report 113,
'The Representation of Logics in Higher-order Logic,' (1987)."]
109253 THE EVOLUTION OF THE FRED MACHINE.
G. Brebner and F. King.
[University of Edinburgh. Department of Computer Science. CSR-246-87.
1987.]
109254 ON THE DESIGN AND PERFORMANCE OF PIPELINED ARCHITECTURES.
N. Topham, A. Omondi, and R. Ibbett.
[University of Edinburgh. Department of Computer Science. CSR-247-87.
n.d.]
109255 VERIFICATION OF PROGRAMS THAT DESTRUCTIVELY MANIPULATE DATA.
I. A. Mason.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-40. 1987. Also
issued as CSR-248-87, Department of Computer Science, University of
Edinburgh.]
109256 FIFTH WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES, 1-4 SEPTEMBER
1987. ABSTRACTS.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-41. 1987. Foreword
by Don Sannella. Also issued as CSR-249-87, Department of Computer
Science, University of Edinburgh.]
109257 THE ESSENCE OF ML.
J. C. Mitchell and R. Harper.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-42. 1988. Also
issued as CSR-250-87, Department of Computer Science, University of
Edinburgh.]
109258 BEHAVIORAL ABSTRACTION AND CIRCUIT VERIFICATION USING CIRCAL.
M. Pezze'.
[University of Edinburgh. Department of Computer Science. CSR-251-87.
1987.]
109259 RELATIVE COMPLETENESS IN ALGEBRAIC SPECIFICATIONS.
H. Lin.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-87-43. 1987. Also
issued as CSR-252-87, Department of Computer Science, University of
Edinburgh.]
109260 A DIAGRAMMING PARADIGM FOR HIERARCHICAL PROCESS ORIENTED DISCRETE
EVENT SIMULATION.
R. J. Pooley and M. W. Brown.
[University of Edinburgh. Department of Computer Science. CSR-254-88.
1988.]
109261 CHROMATIC IDIOMS FOR AUTOMATED VLSI FLOORPLANNING.
A. Deas.
[University of Edinburgh. Department of Computer Science. CSR-255-88.
1988.]
109262 A TYPED LAMBDA CALCULUS WITH CATEGORICAL TYPE CONSTRUCTORS.
T. Hagino.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-44. 1988. Also
issued as CSR-256-88, Department of Computer Science, University of
Edinburgh.]
109263 ANALYSING MUTUAL EXCLUSION ALGORITHMS USING CCS.
D. Walker.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-45. 1988. Also
issued as CSR-257-88, Department of Computer Science, University of
Edinburgh.]
109264 OPERATIONAL AND ALGEBRAIC SEMANTICS OF CONCURRENT PROCESSES.
R. Milner.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-46. 1988. Also
issued as CSR-258-88, Department of Computer Science, University of
Edinburgh.]
109265 A TAXONOMY FOR CONJUGATE GRADIENT METHODS.
S. F. Ashby, T. A. Manteuffel, and P. E. Saylor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1414. 1988.]
109266 DOCUMENT MODE: A DOCUMENT PROCESSING APPLICATION FOR THE TREEMACS
CUSTOMIZABLE TREE EDITOR.
L. A. Van Daele.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1416. 1988. Thesis (M.S.).]
109267 THE COMPLEXITY OF MANY FACES IN ARRANGEMENTS OF LINES AND OF SEGMENTS.
H. Edelsbrunner, L. J. Guibas, and M. Sharir.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1418. 1988.]
109268 AN OPTIMAL ALGORITHM FOR INTERSECTING LINE SEGMENTS IN THE PLANE.
B. Chazelle and H. Edelsbrunner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1419. 1988.]
109269 A PRACTICAL SHIFTED ADAMS ALGORITHM.
H.-W. Tam.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1420. 1988.]
109270 ROUTING AND ACCESS CONTROL IN A METROPOLITAN AREA NETWORK.
B. Rajagopalan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1422. 1987. Thesis (M.S.).]
109271 LANGUAGE ACQUISITION BY A COMPUTER PROGRAM BASED ON FIRST-ORDER LOGIC.
S. S. Nicholl.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1423. 1988. Thesis (M.S.).]
109272 A DOMAIN THEORY FOR KNOWLEDGE ACQUISITION.
B. A. Buchner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1424. 1988. Thesis (M.S.).]
109273 INTEGRATED TOOLS FOR HARDWARE/SOFTWARE DEBUGGING. FINAL REPORT [ON]
S.E.R.C. RESEARCH PROJECT GR/C/35974.
C. R. Snow.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 247. 1987.]
109274 A TECHNIQUE FOR SUBCLASSING AND ITS IMPLEMENTATION EXPLOITING
POLYMORPHIC PROCEDURES.
L. V. Mancini.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 249. 1987.]
109275 AN ASSOCIATIVE CONSTRUCTIVE LOGIC.
C. M. Holt.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 250. 1988.]
109276 IF STATEMENTS AS LOGICAL DISJUNCTION.
C. M. Holt.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 251. 1988.]
109277 WITH LESS MALICIOUS BYZANTINE GENERALS: AGREEMENT ALGORITHMS UNDER
VALUE FAULTS.
P. D. Ezhilchelvan.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 252. 1988.]
109278 RELIABILITY AND PERFORMANCE MODELS FOR RECONFIGURABLE COMPUTER
SYSTEMS.
R. Varadarajan.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-65. 1987.
Thesis (Ph.D.).]
109279 QUERYING INDEPENDENT DATABASES.
O. P. Buneman, S. B. Davidson, and A. Watters.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-67. 1987.]
109280 RELATING LOGIC PROGRAMS AND ATTRIBUTE GRAMMARS.
T. Isakowitz.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-68. 1987.
Also issued as LINC LAB 79, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109281 A COMPACT MULTIRESOLUTION REPRESENTATION: THE WAVELET MODEL.
S. G. Mallat.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-69. 1987.
Also issued as GRASP LAB 113, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109282 THE SEMANTIC DATA MODEL AND LARGE INFORMATION REQUIREMENTS.
D. P. Cebula.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-72. 1987.
Also issued as GRAPHICS LAB 18, Computer Graphics Laboratory, Moore
School of Electrical Engineering, University of Pennsylvania.]
109283 OPTICAL FLOW USING SPATIOTEMPORAL FILTERS.
D. J. Heeger.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-73. 1987.
Also issued as GRASP LAB 116, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109284 REMOTE PREDICATE INVOCATION FOR DISTRIBUTED PROLOG PROGRAMS.
I. Lee, O. M. Yasuda, and G. Hager.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-76. 1987.
Also issued as GRASP LAB 117, General Robotis and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109285 MODELLING USER BELIEFS FOR GOOD EXPLANATION.
R. Kass.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-77. 1987.
Also issued as LINC LAB 82, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109286 RECONFIGURABLE PARALLEL ARCHITECTURES FOR SPECIAL PURPOSE COMPUTING.
R. Krishnamurti.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-81. 1987.
Thesis (Ph.D.).]
109287 A MEDIUM-COMPLEXITY COMPLIANT END EFFECTOR.
N. Ulrich, R. P. Paul, and R. Bajcsy.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-82. 1987.
Also issued as GRASP LAB 118, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109288 THE NEED FOR USER MODELS IN GENERATING EXPERT SYSTEM EXPLANATIONS.
R. Kass and T. Finin.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-86. 1987.
Also issued as LINC LAB 88, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109289 COOPERATIVE FOCUS AND STEREO RANGING.
E. Krotkov and R. Kories.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-88. 1987.
Also issued as GRASP LAB 119, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109290 EGOMOTION AND THE STABILIZED WORLD.
D. J. Heeger and G. Hager.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-90. 1987.
Also issued as GRASP LAB 120, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109291 MODELS FOR MOTION PERCEPTION.
D. J. Heeger.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-91. 1987.
Thesis (Ph.D.). Also issued as GRASP LAB 121, General Robotics and
Active Sensory Processing Laboratory, Moore School of Electrical
Engineering, University of Pennsylvania.]
109292 USING POWERDOMAINS TO GENERALIZE RELATIONAL DATABASES.
O. P. Buneman and A. Ohori.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-92. 1987.]
109293 A LOGICAL ANALYSIS OF MODULES IN LOGIC.
D. Miller.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-96. 1987.
Also issued as LINC LAB 91, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109294 WORD-ORDER VARIATION IN NATURAL LANGUAGE GENERATION.
A. K. Joshi.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-97. 1987.
Also issued as LINC LAB 92, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109295 MINIMAL CONSEQUENCE.
M.-A. Papalaskari and S. Weinstein.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-98. 1987.
Also issued as LINC LAB 93, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109296 A SEMANTICS FOR COMPLEX OBJECTS AND APPROXIMATE QUERIES: EXTENDED
ABSTRACT.
O. P. Buneman, S. B. Davidson, and A. Watters.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-99. 1987.]
109297 A PERFORMANCE ANALYSIS OF TIMED SYNCHRONOUS COMMUNICATION PRIMITIVES.
I. Lee and S. B. Davidson.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-101. 1987.]
109298 RECONFIGURATION FOR FAULT TOLERANCE AND PERFORMANCE ANALYSIS.
H. H. Kollmeier.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-106. 1987.
Thesis (M.S.).]
109299 A NEW COMPUTATIONAL STRUCTURE FOR REAL TIME DYNAMICS.
A. Izaguirre et al.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-107. 1987.]
109300 TYPE INFERENCE IN A DATABASE PROGRAMMING LANGUAGE.
A. Ohori and O. P. Buneman.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-108. 1987.]
109301 IMPLEMENTING THEOREM PROVERS IN LOGIC PROGRAMMING.
A. Felty.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-109. 1987.
Also issued as LINC LAB 87, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109302 AN ALGEBRA OF COMMUNICATING TIME DEPENDENT PROCESSES.
I. Lee and A. Zwarico.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-110. 1987.
Also issued as GRASP LAB 127, General Robotics and Active Sensory
Processing Laboratory, Moore School of Electrical Engineering,
University of Pennsylvania.]
109303 SHAPE RECOVERY AND SEGMENTATION WITH DEFORMABLE PART MODELS.
F. Solina.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-111. 1987.
Thesis (Ph.D.). Also issued as GRASP LAB 128, General Robotics and
Active Sensory Processing Laboratory, Moore School of Electrical
Engineering, University of Pennsylvania.]
109304 A LOGIC PROGRAMMING APPROACH TO MANIPULATING FORMULAS AND PROGRAMS.
D. Miller and G. Nadathur.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-87-113. 1987.
Also issued as LINC LAB 85, Laboratory for Language, Information and
Computation, Moore School of Electrical Engineering, University of
Pennsylvania.]
109305 EXTENSIONAL MODELS FOR POLYMORPHISM.
V. Breazu-Tannen and T. Coquand.
[University of Pennsylvania. Moore School of Electrical Engineering.
Department of Computer and Information Science. MS-CIS-88-25. 1987.
"This is a slightly revised version of [Department of Computer and
Information Science report] MS-CIS-87-75/LINC LAB 81." Also issued as
LINC LAB 109, Laboratory for Language, Information and Computation,
Moore School of Electrical Engineering, University of Pennsylvania.]
109306 MODELING CONCEPTS FOR SPECIFICATION ENVIRONMENTS.
A. J. McAllister.
[University of Saskatchewan. Department of Computational Science.
Research report 88-1. 1988. Thesis (Ph.D.).]
109307 THE ISI GRAPHER: A PORTABLE TOOL FOR DISPLAYING GRAPHS PICTORIALLY.
G. Robins.
[University of Southern California. Information Sciences Institute.
ISI/RS-87-196. 1987.]
109308 THE ISI GRAPHER MANUAL.
G. Robins.
[University of Southern California. Information Sciences Institute.
ISI/TM-88-197. 1988.]
109309 ALGORITHMS FOR INFERRING FUNCTIONAL DEPENDENCE.
H. Mannila and K.-J. Raeihae.
[University of Tampere. Department of Computer Science. A-1988-3.
1988.]
109310 A GARBAGE COLLECTION ALGORITHM FOR TRICIA.
J. Barklund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 37B. 1987.]
109311 GARBAGE CUT.
J. Barklund and H. Millroth.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 38. 1986.]
109312 EFFICIENT INTERPRETATION OF PROLOG PROGRAMS.
J. Barklund.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 39. 1987.]
109313 HASH TABLES IN LOGIC PROGRAMMING.
J. Barklund and H. Millroth.
[University of Uppsala. Department of Computer Science. Uppsala
Programming Methodology and Artificial Intelligence Laboratory.
Technical report 40. 1987.]
109314 BLACKBOARD SYSTEMS.
I. D. Craig.
[University of Warwick. Department of Computer Science. RR110. 1987.]
109315 QUANTISATION OF DIGITISED COLOUR.
R. W. McColl and G. R. Martin.
[University of Warwick. Department of Computer Science. RR112. n.d.]
109316 A HETEROGENEOUS PYRAMID ARRAY ARCHITECTURE FOR IMAGE UNDERSTANDING.
R. Howarth.
[University of Warwick. Department of Computer Science. RR115. 1987.]
109317 A PERFORMANCE ANALYSIS OF THE GAMMA DATABASE MACHINE.
D. J. DeWitt, S. Ghandeharizadeh, and D. Schneider.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 742. 1988.]
109318 DISTRIBUTED ROUND-ROBIN AND FIRST-COME FIRST-SERVE PROTOCOLS AND
THEIR APPLICATION TO MULTIPROCESSOR BUS ARBITRATION.
M. K. Vernon and U. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 745. 1988.]
109319 AN ACCURATE AND EFFICIENT PERFORMANCE ANALYSIS TECHNIQUE FOR
MULTIPROCESSOR SNOOPING CACHE-CONSISTENCY PROTOCOLS.
M. K. Vernon, E. D. Lazowska, and J. Zahorjan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 746. 1987.]
109320 THE TREEBUS ARCHITECTURE AND ITS ANALYSIS.
R. Jog, G. S. Sohi, and M. K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 747. 1988.]
109321 INTERPROCEDURAL SLICING USING DEPENDENCE GRAPHS.
S. Horwitz, T. Reps, and D. Binkley.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 756. 1988.]
109322 FACTORING POLYNOMIALS USING FEWER RANDOM BITS.
E. Bach and V. Shoup.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 757. 1988.]
109323 DISTRIBUTED CONCURRENCY CONTROL PERFORMANCE: A STUDY OF ALGORITHMS,
DISTRIBUTION, AND REPLICATION.
M. J. Carey and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 758. 1988.]
109324 THE FREQUENCY OF DYNAMIC POINTER REFERENCES IN "C" PROGRAMS.
B. P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 759. 1988.]
109325 SIMULATION OF A CONNECTIONIST STEREO ALGORITHM ON A SHARED-MEMORY
MULTIPROCESSOR.
C. V. Stewart and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 760. 1988.]
109326 DATA MODELING IN DELAB.
Y. E. Ioannidis and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 761. 1988.]
109327 A PARALLEL ALGORITHM FOR MINIMAL COST NETWORK FLOW PROBLEMS.
J. Peters.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 762. 1988.]
109328 NEW ALGORITHMS FOR FINDING IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS.
V. Shoup.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 763. 1988.]
109329 PROCESS-STRUCTURED ARCHITECTURES TO TRANSFORM INFORMATION FLOWING
THROUGH.
L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 764. 1988.]
109330 EFFICENT TRANSITIVE CLOSURE ALGORITHMS.
Y. E. Ioannidis and R. Ramakrishnan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 765. n.d.]
109331 THE WISCONSIN MULTICUBE: A NEW LARGE-SCALE CACHE-COHERENT
MULTIPROCESSOR.
J. R. Goodman and P. J. Woest.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 766. 1988.]
VOL. 10, NO. 7 07/15/88
109332 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 1 APRIL 1987 - 31 OCTOBER 1987.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Report no. 5258:TR:87. 1987. Principal investigator: Charles L.
Seitz. Faculty investigators: William C. Athas, K. Mani Chandy, Alain
J. Martin, Martin Rem, Charles L. Seitz.]
109333 THE C PROGRAMMER'S ABBREVIATED GUIDE TO MULTICOMPUTER PROGRAMMING.
C. L. Seitz, J. Seizovic, and W.-K. Su.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-1. 1988.]
109334 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 1 NOVEMBER 1987 - 31 MARCH 1988.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-5. 1988. Principal investigator: Charles L. Seitz.
Faculty investigators: William C. Athas, K. Mani Chandy, Alain J.
Martin, Martin Rem, Charles L. Seitz.]
109335 THEOREMS ON COMPUTATIONS OF DISTRIBUTED SYSTEMS.
K. M. Chandy.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-6. 1988.]
109336 HIGHER-DIMENSIONAL VORONOI DIAGRAMS IN LINEAR EXPECTED TIME.
R. A. Dwyer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-100. 1988.]
109337 SEPARATING THE USER INTERFACE FROM THE FUNCTIONALITY OF APPLICATION
PROGRAMS.
P. Szekely.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-101. 1988. Thesis (Ph.D.).]
109338 ON THE PROJECTION PROBLEM IN SYSTOLIC DESIGN.
C. Lengauer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-102. 1988.]
109339 WHY SOME CHUNKS ARE EXPENSIVE.
M. Tambe and A. Newell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-103. 1988.]
109340 AUTOMATICALLY ACHIEVING ELASTICITY IN THE IMPLEMENTATION OF
PROGRAMMING LANGUAGES.
M. L. Horowitz.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-104. 1988. Thesis (Ph.D.).]
109341 WARP PROGRAMMING ENVIRONMENT: USER MANUAL.
B. Bruegge.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-105. 1988.]
109342 TOOLS FOR CREATING USER INTERFACES: AN INTRODUCTION AND SURVEY.
B. A. Myers.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-107. 1988.]
109343 ROTATION DISTANCE, TRIANGULATIONS, AND HYPERBOLIC GEOMETRY.
D. D. Sleator, R. E. Tarjan, and W. P. Thurston.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-108. 1988. "This is a revised and expanded version of a
paper that appeared in the [proceedings of the] 18th Annual ACM
Symposium on Theory of Computing, [1986]."]
109344 PATTERN KNOWLEDGE AND SEARCH: THE SUPREM ARCHITECTURE.
H. Berliner and C. Ebeling.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-109. 1988.]
109345 ON UNIVERSAL THEORIES OF DEFAULTS.
J. Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-111. 1988.]
109346 PROCEEDINGS FROM THE SECOND WORKSHOP ON LARGE-GRAINED PARALLELISM,
OCTOBER 11-14, 1987, HIDDEN VALLEY, PENNSYLVANIA.
J. Wing, M. Herlihy, and M. Barbacci.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-112. 1988. This proceedings consists of abstracts of the
thirty-eight talks delivered at the Workshop. Edited by Jeannette
Wing, Maurice Herlihy, and Mario Barbacci.]
109347 CHUNKING AS AN ABSTRACTION MECHANISM.
M. S. Campbell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-116. 1988. Thesis (Ph.D.).]
109348 RESEARCH ON SEMANTICALLY BASED PROGRAM-DESIGN ENVIRONMENTS: THE ERGO
PROJECT IN 1988.
P. Lee et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-118. 1988.]
109349 TRACE THEORY FOR AUTOMATIC HIERARCHICAL VERIFICATION OF
SPEED-INDEPENDENT CIRCUITS.
D. L. Dill.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-119. 1988. Thesis (Ph.D.).]
109350 LINEARIZABILITY: A CORRECTNESS CONDITION FOR CONCURRENT OBJECTS.
M. P. Herlihy and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-120. 1988.]
109351 A MODEST MODEL OF RECORDS, INHERITANCE AND BOUNDED QUANTIFICATION.
K. B. Bruce and G. Longo.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-126. 1988.]
109352 A FAST PARALLEL ALGORITHM TO DETERMINE EDIT DISTANCE.
T. R. Mathies.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-130. 1988.]
109353 CONSTRUCTIVE NATURAL DEDUCTION AND ITS "MODEST" INTEPRETATION.
G. Longo and E. Moggi.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-131. 1988.]
109354 IMAGE FOCUSING IN SPACE AND TIME.
M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-87-19.
1988.]
109355 MODEL-BASED VISION SYSTEM BY OBJECT-ORIENTED PROGRAMMING.
H. Chang, K. Ikeuchi, and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-3.
1988.]
109356 1987 YEAR END REPORT FOR ROAD FOLLOWING AT CARNEGIE MELLON.
C. E. Thorpe and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-4.
1988. "This report describes progress in vision and navigation for
outdoor mobile robots at the Carnegie Mellon Robotics Institute
during 1987. This research was...concentrated on five areas: 1. Road
following. 2. Range data interpretation. 3. Expert systems for image
interpretation. 4. Car recognition. 5. Geometric camera
calibration...this report...includes papers describing each of the
research areas." Principal investigators: Charles Thorpe and Takeo
Kanade.]
109357 KNOWLEDGE BASED SIMULATION: AN ARTIFICIAL INTELLIGENCE APPROACH TO
SYSTEM MODELING AND AUTOMATING THE SIMULATION LIFE CYCLE.
M. S. Fox et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-5.
1988.]
109358 INORDER TRAVERSAL OF A BINARY TREE AND ITS INVERSION.
D. Gries and J. L. A. van de Snepscheut.
[Cornell University. Department of Computer Science. Technical report
87-876. 1987.]
109359 LAZY EVALUATION AND THE LOGIC VARIABLE.
K. Pingali.
[Cornell University. Department of Computer Science. Technical report
87-877. 1987.]
109360 TOWARDS TASK-LEVEL ROBOT PROGRAMMING.
B. Donald.
[Cornell University. Department of Computer Science. Technical report
87-878. 1987.]
109361 SIMPLIFIED VORONOI DIAGRAMS.
J. Canny and B. Donald.
[Cornell University. Department of Computer Science. Technical report
87-879. 1987.]
109362 PLANNING MULTI-STEP ERROR DETECTION AND RECOVERY STRATEGIES.
B. Donald.
[Cornell University. Department of Computer Science. Technical report
87-880. 1987.]
109363 TERM WEIGHTING APPROACHES IN AUTOMATIC TEXT RETRIEVAL.
G. Salton and C. Buckley.
[Cornell University. Department of Computer Science. Technical report
87-881. 1987.]
109364 THE FAST FOURIER TRANSFORM ON HYPERCUBE PARALLEL COMPUTERS.
C. Y. Chu.
[Cornell University. Department of Computer Science. Technical report
87-882. 1987. Thesis (Ph.D.).]
109365 COMPUTATIONS, RESIDUALS AND THE POWER OF INDETERMINACY.
P. Panangaden and E. W. Stark.
[Cornell University. Department of Computer Science. Technical report
87-883. 1987.]
109366 AN ENVIRONMENT FOR AUTOMATED REASONING ABOUT PARTIAL FUNCTIONS.
D. A. Basin.
[Cornell University. Department of Computer Science. Technical report
87-884. 1987.]
109367 ROPE: A NEW TWIST IN COMPUTER ARCHITECTURES.
K. Karplus and A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
87-885. 1987.]
109368 PFAFFIAN ORIENTATIONS, 0/1 PERMANENTS, AND EVEN CYCLES IN DIRECTED
GRAPHS.
V. V. Vazirani and M. Yannakakis.
[Cornell University. Department of Computer Science. Technical report
87-886. 1987.]
109369 SOLVING SYSTEMS OF NONLINEAR EQUATIONS ON A MESSAGE-PASSING
MULTIPROCESSOR.
T. F. Coleman and G. Li.
[Cornell University. Department of Computer Science. Technical report
87-887. 1987.]
109370 SUPPLYING HIGH AVAILABILITY WITH A STANDARD NETWORK FILE SYSTEM.
K. Marzullo and F. Schmuck.
[Cornell University. Department of Computer Science. Technical report
87-888. 1987.]
109371 THE COMPLEXITY OF PLANAR COMPLIANT MOTION PLANNING UNDER UNCERTAINTY.
B. Donald.
[Cornell University. Department of Computer Science. Technical report
87-889. 1987.]
109372 ON PLANNING: WHAT IS TO BE DONE?
B. Donald.
[Cornell University. Department of Computer Science. Technical report
87-890. 1987.]
109373 ON THE EXPRESSIVE POWER OF INDETERMINATE NETWORK PRIMITIVES.
P. Panangaden and V. Shanbhogue.
[Cornell University. Department of Computer Science. Technical report
87-891. 1987.]
109374 METAMATHEMATICAL EXTENSIBILITY IN TYPE THEORY.
T. Knoblock.
[Cornell University. Department of Computer Science. Technical report
87-892. 1987. Thesis (Ph.D.).]
109375 PARALLEL CHOLESKY FACTORIZATION OF SPARSE MATRICES.
J. R. Gilbert and H. Hafsteinsson.
[Cornell University. Department of Computer Science. Technical report
87-893. 1987.]
109376 AN ASSERTIONAL CHARACTERIZATION OF SERIALIZABILITY AND LOCKING.
E. R. McCurley.
[Cornell University. Department of Computer Science. Technical report
88-894. 1988. Thesis (Ph.D.).]
109377 A GEOMETRIC APPROACH TO ERROR DETECTION AND RECOVERY FOR ROBOT MOTION
PLANNING WITH UNCERTAINTY.
B. Donald.
[Cornell University. Department of Computer Science. Technical report
88-895. 1988.]
109378 STATIC ANALYSIS OF ALIASES AND SIDE EFFECTS IN HIGHER-ORDER LANGUAGES.
A. Neirynck.
[Cornell University. Department of Computer Science. Technical report
88-896. 1988. Thesis (Ph.D.).]
109379 THE 1986-1987 TAULBEE SURVEY REPORT: THE COMPUTING RESEARCH BOARD'S
SURVEY ON THE PRODUCTION AND EMPLOYMENT OF PH.D.'S AND FACULTY IN
COMPUTER SCIENCE AND ENGINEERING.
D. Gries and D. Marsh.
[Cornell University. Department of Computer Science. Technical report
88-897. 1988.]
109380 IMPROVING RETRIEVAL PERFORMANCE BY RELEVANCE FEEDBACK.
G. Salton and C. Buckley.
[Cornell University. Department of Computer Science. Technical report
88-898. 1988.]
109381 PARALLEL ALGORITHMS FOR MAPPING PIPELINED AND PARALLEL COMPUTATIONS.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-2. 1988.]
109382 LEAPFROG VARIANTS OF ITERATIVE METHODS FOR LINEAR ALGEBRAIC EQUATIONS.
P. E. Saylor.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-7. 1988.]
109383 NUMERICAL EXPERIMENTS ON THE STABILITY OF CONTROLLED BOUNDARY LAYERS.
T. A. Zang and M. Y. Hussaini.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-20. 1988.]
109384 WAVE INTERACTIONS IN A THREE-DIMENSIONAL ATTACHMENT LINE BOUNDARY
LAYER.
P. Hall and S. O. MacKerrell.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-22. 1988.]
109385 BOUNDARY SHAPE IDENTIFICATION PROBLEMS IN TWO-DIMENSIONAL DOMAINS
RELATED TO THERMAL TESTING OF MATERIALS.
H. T. Banks and F. Kojima.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-23. 1988.]
109386 AN APPROXIMATION THEORY FOR THE IDENTIFICATION OF NONLINEAR
DISTIBUTED PARAMETER SYSTEMS.
H. T. Banks, S. Reich, and I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-26. 1988.]
109387 ON THE PREDICTION OF EQUILIBRIUM STATES IN HOMOGENEOUS TURBULENCE.
C. G. Speziale and N. M. G. Mhuiris.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-27. 1988.]
109388 ALGORITHMS FOR POLYNOMIALS IN BERNSTEIN FORM.
R. T. Rarouki and V. T. Rajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12873. 1987.]
109389 AN EXPERIMENTAL STUDY OF MEMORY FAULT LATENCY.
R. Chillarege and R. K. Iyer.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12930. 1987.]
109390 REGULAR GRAPHS WITH SMALL DIAMETER AS MODELS FOR INTERCONNECTION
NETWORKS.
D. V. Chudnovsky, G. V. Chudnovsky, and M. M. Denneau.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13125. 1987. "Preliminary report."]
109391 ON LOCATING MINIMUM FEEDBACK VERTEX SETS.
E. L. Lloyd, M. L. Soffa, and C.-C. Wang.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13239. 1987.]
109392 APPROXIMATIONS AND COMPLEX MULTIPLICATION ACCORDING TO RAMANUJAN.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13334. 1987.]
109393 TECHNIQUES FOR PARALLEL MANIPULATION OF SPARSE MATRICES.
C. P. Kruskal, L. Rudolph, and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13364. 1987.]
109394 DISK ARM MOVEMENT IN ANTICIPATION OF FUTURE REQUESTS.
R. P. King.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13367. 1987.]
109395 EVALUATING ONLINE ASSISTANCE EMPIRICALLY.
R. L. Campbell.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13410. 1988.]
109396 DESIGN OF LARGE NON-BLOCKING CROSSPOINT SWITCHING NETWORKS.
A. Varma, J. Ghosh, and C. J. Georgiou.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13449. 1987.]
109397 RELIABLE DESIGN OF LARGE CROSSPOINT SWITCHING NETWORKS.
A. Varma, J. Ghosh, and C. J. Georgiou.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13450. 1987.]
109398 SEMANTICS OF DYNAMIC EPISTEMIC SYSTEMS.
A. S. Rao and N. Y. Foo.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13461. 1988.]
109399 EQUALOG: AN EXPERIMENTAL PROLOG-BASED EQUATION SOLVER.
P. B. Sheridan, S. Haridi, and D. Sahlin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13464. 1988.]
109400 HEURISTIC, RULE-BASED PROGRAM TRANSFORMATIONS FOR ENHANCED
VECTORIZATION.
P. Bose.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13472. 1988.]
109401 AN EXAMINATION OF UNDETECTED TYPING ERRORS.
F. J. Damerau and E. Mays.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13479. 1988.]
109402 SYNCHRONIZATION USING COUNTING SEMAPHORES.
V. Sarkar.
[RC 13482. Research report RC 12482. 1988.]
109403 REGULAR GRAPHS WITH SMALL DIAMETER AS MODELS FOR INTERCONNECTION
NETWORKS.
D. V. Chudnovsky, G. V. Chudnovsky, and M. M. Denneau.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13484. 1988.]
109404 SPARTA: MULTIPLE SIGNAL PROCESSORS FOR HIGH-PERFORMANCE ROBOT CONTROL.
J. Ish-Shalom and P. Kazanzides.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13494. 1988.]
109405 CORRECTNESS OF A LOGIC PROGRAM TRANSFORMATION SYSTEM.
M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13496. 1988.]
109407 SINGLE RULES FORM CANONICAL LOGIC PROGRAMS.
M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13528. 1988.]
109408 A TOOL FOR INVESTIGATING THE SYNONYMY RELATION IN A SENSE
DISAMBIGUATED THESAURUS.
M. S. Chodorow, Y. Ravin, and H. E. Sachar.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13534. 1988.]
109409 A DYNAMIC TRANSITIVE CLOSURE ALGORITHM.
D. Yellin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13535. 1988.]
109410 DESIGN OF LMT: A PROLOG-BASED MACHINE TRANSLATION SYSTEM.
M. C. McCord.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13536. 1988.]
109411 SHARED MEMORY CHARACTERISTICS OF PARALLEL SCIENTIFIC PROGRAMS.
F. Darema and K. So.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13538. 1988.]
109412 A HIGH AVAILABLE STORAGE SYSTEM USING THE CHECKSUM METHOD.
Y. Dishon, C. J. Georgiou, and D. Dias.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13546. 1988.]
109413 UNIFORM REFINEMENT OF CURVES.
C. A. Micchelli and H. Prautzsch.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13548. 1988.]
109414 HIGHER LEVEL MODELING IN RESQME.
R. F. Gordon et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13554. 1988.]
109415 FINDING THE EDGE CONNECTIVITY OF DIRECTED GRAPHS.
Y. Mansour and B. Schieber.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13556. 1988.]
109416 SELECTING EXPLANATIONS USING MULTIPLE SOURCES OF KNOWLEDGE.
R. Bhaskar and N. Hass.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13562. 1988.]
109417 A USER INTERFACE FOR AN ENVIRONMENT TO SUPPORT PROGRAM UNDERSTANDING.
L. Cleveland.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13565. 1988.]
109418 COMPUTER ALGEBRA IN THE SERVICE OF MATHEMATICAL PHYSICS AND NUMBER
THEORY.
D. V. Chudnovsky and G. V. Chudnovsky.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13567. 1988.]
109419 APPLICATIONS OF GLOBAL FLOW ANALYSIS IN LOGIC SYNTHESIS.
L. Berman, L. Trevillyan, and D. Brand.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13568. 1988.]
109420 USER INTERFACE ENHANCEMENT USING ANIMATION AND THE SOFTWARE TOOL.
P. Y. F. Wu and K.-T. Huang.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13570. 1988.]
109421 ON VHV-ROUTING IN CHANNELS WITH IRREGULAR BOUNDARIES.
G. Vijayan, H. Chen, and C. K. Wong.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13573. 1987.]
109422 THE IBM 3990 MODEL 3 DISK CACHE.
J. Menon and M. Hartung.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 5994. 1987.]
109423 THE COMPLEXITY OF ORDERING SUBGOALS.
J. D. Ullman and M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6049. 1988.]
109424 ROBUST MULTI-AGENT DECISION MAKING IN FAULTY ENVIRONMENT.
A. Bar-Noy and D. Dolev.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6053. 1988.]
109425 PROJECTION-BASED HIGH ACCURACY MEASUREMENT OF STRAIGHT LINE EDGES.
D. Petkovic, W. Niblack, and M. Flickner.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6088. 1988.]
109426 CHINESE CHARACTER RECOGNITION: A TWENTY-FIVE-YEAR RETROSPECTIVE.
R. G. Casey and G. Nagy.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6095. 1988.]
109427 INTERCONNECTING HETEROGENEOUS NETWORKS TO OSI WITH GLOBAL NAMING
SCHEME AND GATEWAY ADDRESS MAPPING.
S. Zatti and P. Janson.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1651. 1987.]
109428 INTERNETWORK NAMING, ADDRESSING, AND DIRECTORY SYSTEMS: TOWARDS A
GLOBAL OSI CONTEXT.
S. Zatti and P. Janson.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1669. 1988.]
109429 EXT-DFD: A VISUAL LANGUAGE FOR EXTENDED DFD.
T. S. Chua, K. P. Tan, and P. T. Lee.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA1/88. 1988.]
109430 AN EFFICIENT DIRECT METHOD OF SOLVING SPARSE LINEAR SYSTEMS.
K. H. Phua.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA2/88. 1988.]
109431 DATABASE REPRESENTATION AND MANIPULATION USING ENTITY-RELATIONSHIP
DATABASE LOGIC.
J. Grant and T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB3/88. 1988.]
109432 EXTERNAL SCHEMAS OF ENTITY-RELATIONSHIP BASED DATA BASE MANAGEMENT
SYSTEMS.
T. W. Ling.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC3/88. 1988.]
044063 SPECIFYING SYSTEM IMPLEMENTATIONS IN Z.
J. Bowen, R. Gimson, and S. Topp-Jorgensen.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-63. 1988.]
044064 A CALCULUS OF FUNCTIONS FOR PROGRAM DERIVATION.
R. Bird.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-64. 1987.]
044065 AN INTRODUTION TO CSP.
J. W. Sanders.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-65. 1988.]
044066 THE SLIDING-WINDOW PROTOCOL IN CSP.
K. Paliwoda and J. W. Sanders.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-66. 1988.]
109433 AN ALGEBRAIC MODEL FOR COMMUNICATING PROCESSES.
J. Winkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 604. 1987.]
109434 DENOTATIONAL ENGINEERING OR FROM DENOTATIONS TO SYNTAX.
A. Bilkle.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 605. 1987.]
109435 HIGH-SPEED GENERATION OF POLYNOMIAL ROOT CURVES.
J. Jurkowski and S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 606. 1987.]
109436 HIGH-SPEED GENERATING OF HILBERT CURVES.
W. Skarbek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 608. 1987.]
109437 PARAMETRIZED PSEUDO-UTILITY REPRESENTATIONS.
A. Wieczorek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 611. 1987.]
109438 GRADE DISCRIMINANT FUNCTION IN TWO-CLASS PROBLEMS.
M. Niewiadomska-Bugaj and W. Szczesny.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 612. 1987.]
109439 PROJECTIVE LINE GEOMETRY OF THE VISUAL OPERATOR.
A. Naeve.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8606. 1986. Also issued as
CVAP 29, Computer Vision and Associative Pattern Processing
Laboratory, Department of Numerical Analysis and Computer Science,
Royal Institute of Technology, Stockholm.]
109440 ON PROJECTIVE GEOMETRY AND THE RECOVERY OF 3-D STRUCTURE.
A. Naeve and J.-O. Eklundh.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8608. 1986. Also issued as
CVAP 28, Computer Vision and Associative Pattern Processing
Laboratory, Department of Numerical Analysis and Computer Science,
Royal Institute of Technology, Stockholm.]
109441 COGNITIVE VERIFICATION AND ELIMINATION OF ERROR SOURCES - PRACTICAL
METHODS FOR QUALITY ASSURANCE OF COMPUTER SOFTWARE.
B. Friman.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8702. 1987.]
109442 AN IMPLEMENTATION AND STUDY OF THE OPTIMAL ONE-LEG COLLOCATION METHOD
FOR NON-STIFF ORDINARY DIFFERENTIAL EQUATIONS.
OE. Olafsson.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8801. 1988.]
052089 RATIONAL INTERACTION AS THE BASIS FOR COMMUNICATION.
P. R. Cohen and H. J. Levesque.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-89. March 1987.]
052109 COGNITIVE SIGNIFICANCE AND NEW THEORIES OF REFERENCE.
J. Perry.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-109. November 1987.]
052111 FOURTH YEAR REPORT TO THE SYSTEM DEVELOPMENT FOUNDATION: SITUATED
LANGUAGE RESEARCH PROGRAM. ABBREVIATED VERSION.
J. Barwise et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-111. October 1987. "Submitted by: Jon Barwise,
Principal Investigator, Stanford University. David Israel, Principal
Investigator, SRI International. John Perry, Principal Investiga tor,
Stanford University. Brian Cantwell Smith, Principal Investigator,
Xerox PARC." "With the assistance of: Thomas Wasow, Chair of the CSLI
Site Directors. Elizabeth Macken, Assistance Director, CSLI. Susan
Stucky, Assistant to the Principal Investigators." Elizabeth Macken,
Editor.]
052113 EVENTS AND "LOGICAL FORM."
S. Neale.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-113. November 1987.]
052116 FUZZY LOGIC.
L. A. Zadeh.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-116. January 1988.]
052117 DISPOSITIONAL LOGIC AND COMMONSENSE REASONING.
L. A. Zadeh.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-117. January 1988.]
052118 INTENTION AND PERSONAL POLICIES.
M. Bratman.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-118. January 1988.]
052119 PROPOSITIONAL ATTITUDES AND RUSSELLIAN PROPOSITIONS.
R. C. Moore.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-119. February 1988.]
052120 UNIFICATION AND AGREEMENT.
M. Barlow.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-120. February 1988.]
052122 THE SITUATION IN LOGIC - IV: ON THE MODEL THEORY OF COMMON KNOWLEDGE.
J. Barwise.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-122. March 1988.]
052123 UNACCUSATIVE VERBS IN DUTCH AND THE SYNTAX-SEMANTICS INTERFACE.
A. Zaenen.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-123. April 1988.]
052124 WHAT IS UNIFICATION? A CATAGORICAL VIEW OF SUBSTITUTION, EQUATION AND
SOLUTION.
J. A. Goguen.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-124. April 1988.]
052125 TYPES AND TOKENS IN LINGUISTICS.
S. Bromberger.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-125. April 1988.]
048088 FRAMEWORKS FOR CONCURRENT PROBLEM SOLVING: A REPORT ON CAGE AND
-02 POLIGON.
H. P. Nii, N. Aiello, and J. Rice.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-02. March 1988.]
048088 GENERATION OF KNOWLEDGE-ACQUISITION TOOLS FROM CLINICAL TRIAL MODELS.
-26 M. A. Musen.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-26. March 1988.]
109443 PARTIAL INDUCTIVE DEFINITIONS.
L. Hallnaes.
[Swedish Institute of Computer Science. Research report R86005C.
1986.]
109444 INTERACTIVE PROOF SYSTEMS: PROVERS THAT NEVER FAIL AND RANDOM
SELECTION.
O. Goldreich and Y. Mansour.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 459. 1987.]
109445 HIGHLY PARALLEL DISTRIBUTED ALGORITHM FOR SHORTEST PATH ROUTING IN
DYNAMICALLY RECONFIGURABLE NETWORKS.
I. Chlamtac, A. Elazar, and Y. I. Gold.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 461. 1987.]
109446 THREE TREE-PATHS.
A. Zehavi and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 462. 1987. Revised version of TECHNION
Department of Computer Science technical report no. 406.]
109447 ALGORITHMS FOR DISTRIBUTED SPANNING TREE CONSTRUCTION IN DYNAMIC
NETWORKS.
E. Korach and M. Markowitz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 464. 1987. Extended version of TECHNION
Department of Computer Science technical report no. 401.]
109448 DISTRIBUTED PROCESSING OF LOGIC PROGRAMS.
O. Wolfson and A. Silberschatz.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 466. 1987. "Preliminary version."]
109449 ON SEARCHING AN ORDERED LIST: ARE TWO YARDSTICKS BETTER THAN ONE?
M. Hofri.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 467. 1987.]
109450 LEARNABILITY BY FIXED DISTRIBUTIONS.
G. M. Benedek and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 468. 1987. "Extended abstract."]
109451 INTERACTIVE BLACKBOX DEBUGGING FOR CONCURRENT LANGUAGES.
G. S. Goldzmidt, S. Katz, and S. Yemeni.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 469. 1987.]
109452 THE GLOBAL TIME ASSUMPTION AND SEMANTICS FOR CONCURRENT SYSTEMS.
S. Ben-David.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 471. 1987. "Extended abstract."]
109453 PLACEMENT OF REPLICATED ITEMS IN DISTRIBUTED DATABASES.
A. Milo and O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 473. 1987. "Preliminary version."]
109454 NONUNIFORM LEARNABILITY.
G. M. Benedek and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 474. 1987. "Extended abstract."]
109455 PROVING UNPROVABILITY.
M. Tiomkin.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 478. 1987.]
109456 SHARING THE LOAD OF LOGIC-PROGRAM EVALUATION.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 482. 1987. "Preliminary version."]
109457 ON THE TIME-COMPLEXITY OF BROADCAST IN RADIO NETWORKS: AN EXPONENTIAL
GAP BETWEEN DETERMINISM AND RANDOMIZATION.
R. Bar-Yehuda, O. Goldreich, and A. Itai.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 484. 1987. "A preliminary version of this
paper...appeared in the [Proceedings of the] '6th ACM Symposium on
Principles of Distributed Computing (PODC).'"]
109458 A COMBINATORIAL CHARACTERIZATION OF THE DISTRIBUTED TASKS WHICH ARE
SOLVABLE IN THE PRESENCE OF ONE FAULTY PROCESSOR.
O. Biran, S. Moran, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 485. 1987. "Extended abstract."]
109459 THE INDUCTION OF FAULT DIAGNOSIS SYSTEMS FROM QUALITATIVE MODELS.
D. A. Pearce.
[Turing Institute. TIRM-88-029. 1988.]
109460 INTERACTIVE INDUCTION.
W. Buntine and D. Stirling.
[Turing Institute. TIRM-88-030. 1988.]
109461 MODULARITY IN THE PASCAL MODEL COMPILER.
G. O'Neill and P. T. Wilkinson.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 111/88. 1988.]
109462 APPRAISAL OF PROTOTYPE PASCAL PROGRAM VALIDATION SUITE.
A. R. Lawrence.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 112/88. 1988.]
109463 MODELING NOVICE-TO-EXPERT SHIFTS IN PROBLEM-SOLVING STRATEGY AND
KNOWLEDGE ORGANIZATION.
R. Elio and P. B. Scharf.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 88-01. 1988.]
109464 TRANSLATING NATURAL SEMANTIC SPECIFICATIONS TO ATTRIBUTE GRAMMARS.
V. E. Tavernini.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1407. 1988. Thesis (M.S.).]
109465 EMPIRICAL CONCEPT LEARNING AS A FUNCTION OF DATA SAMPLING AND CONCEPT
CHARACTER.
L. Rendell and H. Cho.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1410. 1988.]
109466 THE DESIGN OF A PRACTICAL CONFIGURATION LIBRARIAN.
H. S. Render and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1417. 1988.]
109467 GEOMETRIC PROBING.
S. S. Skiena.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1425. 1988. Thesis (Ph.D.).]
109468 TREEMACS MANUAL.
D. Hammerslag.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1427. 1988.]
109469 REASONING ABOUT ACTION USING A POSSIBLE MODELS APPROACH.
M. Winslett.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1428. 1988.]
109470 VISUAL TEXTURE RECOGNITION USING INFORMATION TREES.
D. R. Hougen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1429. 1988. Thesis (M.S.).]
109471 CONSTRAINT DRIVEN BEHAVIORAL SYNTHESIS.
F. D. Brewer.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1430. 1988. Thesis (Ph.D.).]
109472 ORDER-K VORONOI DIAGRAMS OF SITES WITH ADDITIVE WEIGHTS IN THE PLANE.
H. Rosenberger.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1431. 1988.]
109473 BUFFERING AND DISK ACCESSES.
Y. Pang and S. M. Kuck.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1432. 1988.]
109474 CLEMMA: A SOFTWARE CONFIGURATION LIBRARIAN.
H. S. Render.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1433. 1988. Thesis (M.S.).]
109475 THE UIPRL PROOF DEVELOPMENT SYSTEM.
V. Swarup.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1434. 1988. Thesis (M.S.).]
109476 UNIFIED MULTILEVEL ADAPTIVE FINITE ELEMENT METHODS FOR ELLIPTIC
PROBLEMS.
W. F. Mitchell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1436. 1988. Thesis (Ph.D.).]
109477 USING TEMPORAL LOGIC IN THE COMPOSITIONAL SPECIFICATION OF CONCURRENT
SYSTEMS.
H. Barringer.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-10-1. 1986.]
109478 A STUDY OF AN EXTENDED TEMPORAL LOGIC AND A TEMPORAL FIXED POINT
CALCULUS.
B. Banieqbal and H. Barringer.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-10-2. 1987. October 1986. Revised: June 1987.]
109479 PROGRAM LOGICS - A SHORT SURVEY.
M. Fisher and H. Barringer.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-11-1. 1987. November 1986. Revised: June 1987.]
109480 UNIFICATION IN BOOLEAN RINGS AND UNQUANTIFIED FORMULAE OF FIRST ORDER
PREDICATE CALCULUS.
U. Martin.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-11-2. 1986.]
109481 LOAD BALANCING, LOCALITY AND PARALLELISM CONTROL IN FINE-GRAIN
PARALLEL MACHINES.
J. Sargeant.
[University of Manchester. Department of Computer Science. Technical
report UMCS-86-11-5. n.d.]
109482 SOME ASPECTS OF INDUCTION.
W. P. R. Mitchell.
[University of Manchester. Department of Computer Science. Technical
report UMCS-87-5-1. 1987.]
109483 HOW TO CHOOSE THE WEIGHTS IN THE KNUTH BENDIX ORDERING.
U. Martin.
[University of Manchester. Department of Computer Science. Technical
report UMCS-87-5-2. 1987.]
109484 REVIEW OF EXISTING THEOREM PROVERS.
P. A. Lindsay, R. C. Moore, and B. Ritchie.
[University of Manchester. Department of Computer Science. Technical
report UMCS-87-8-2. 1987.]
109485 A SEMANTICS DRIVEN TEMPORAL VERIFICATION SYSTEM.
G. D. Gough and H. Barringer.
[University of Manchester. Department of Computer Science. Technical
report UMCS-87-12-5. 1987.]
109487 COLLINEARITY AND LEAST SQUARES REGRESSION.
G. W. Stewart.
[University of Maryland. Department of Computer Science. TR-1701.
1986.]
109488 APPROXIMATE SCHUR COMPLEMENT PRECONDITIONERS FOR SERIAL AND PARALLEL
COMPUTERS.
H. C. Elman.
[University of Maryland. Department of Computer Science. TR-1704.
1986.]
109489 REPORT OF THE WORKSHOP ON DESIGN AND PERFORMANCE ISSUES IN PARALLEL
ARCHITECTURES, MARCH 17-18, 1986.
S. K. Tripathi et al.
[University of Maryland. Department of Computer Science. CS-TR-1705.
1986. Also issued as UMIACS-TR-86-18, Institute for Advanced Computer
Studies, University of Maryland.]
109490 INTERPRETATION OF VISUAL MOTION: A COMPUTATIONAL STUDY.
M. Subbarao.
[University of Maryland. Department of Computer Science. CS-TR-1706.
1986. Thesis (Ph.D.). Also issued as CAR-TR-221, Center for
Automation Research, University of Maryland.]
109491 A COMPARISON OF THE SPACE REQUIREMENTS OF MULTI-DIMENSIONAL
QUADTREE-BASED FILE STRUCTURES.
H. Samet and R. E. Webber.
[University of Maryland. Department of Computer Science. CS-TR-1711.
1986. Also issued as CAR-TR-225, Center for Automation Research,
University of Maryland.]
109492 SOFTWARE MODELING WITH TIMED PETRI NETS IN THE PFG ENVIRONMENT.
P. D. Stotts.
[University of Maryland. Department of Computer Science. CS-TR-1712.
1986. Also issued as UMIACS-TR-86-19, Institute for Advanced Computer
Studies, University of Maryland.]
109493 THE HOUGH TRANSFORM ON THE BUTTERFLY AND THE NCUBE.
S. Chandran and L. S. Davis.
[University of Maryland. Department of Computer Science. CS-TR-1713.
1986. Also issued as CAR-TR-226, Center for Automation Research,
University of Maryland.]
109494 PARALLEL DIRECT SOLUTION OF SPARSE LINEAR SYSTEMS OF EQUATIONS.
J. M. Conroy.
[University of Maryland. Department of Computer Science. TR-1714.
1986. Thesis (Ph.D.).]
109495 VIEWING THE HISTORY OF SCIENCE AS COMPILED HINDSIGHT.
L. Darden.
[University of Maryland. Department of Computer Science. CS-TR-1715.
1986. Also issued as UMIACS-TR-86-20, Institute for Advanced Computer
Studies, University of Maryland.]
109496 SEMANTIC QUERY OPTIMIZATION: ADDITIONAL CONSTRAINTS AND CONTROL
STRATEGIES.
U. S. Chakravarthy, J. Minker, and J. Grant.
[University of Maryland. Department of Computer Science. TR-1717.
n.d.]
109497 FOUNDATIONS OF SEMANTIC QUERY OPTIMIZATION FOR DEDUCTIVE DATABASES.
U. S. Chakravarthy, J. Grant, and J. Minker.
[University of Maryland. Department of Computer Science. TR-1718.
n.d.]
109498 ORDER STATISTICS ON A HYPERCUBE.
S. Chandran and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1719.
1986. Also issued as CAR-TR-228, Center for Automation Research,
University of Maryland.]
109499 DIGITAL TOPOLOGY: INTRODUCTION AND SURVEY.
T. Y. Kong and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1720.
1986. Also issued as CAR-TR-229, Center for Automation Research,
University of Maryland.]
109500 DOMAIN-DEPENDENT REASONING FOR VISUAL NAVIGATION OF ROADWAYS.
J. Le Moigne.
[University of Maryland. Department of Computer Science. CS-TR-1721.
1986. Also issued as CAR-TR-230, Center for Automation Research,
University of Maryland.]
109501 IS BIGGER BETTER? THE EFFECTS OF DISPLAY SIZE ON PROGRAM READING.
J. F. Reisel and B. Shneiderman.
[University of Maryland. Department of Computer Science. CS-TR-1722.
1986. Also issued as CAR-TR-231, Center for Automation Research,
University of Maryland.]
109502 AN EFFICIENT TWO DIMENSIONAL PATTERN MATCHING ALGORITHM.
K. Krithivasan and R. Sitalakshmi.
[University of Maryland. Department of Computer Science. CS-TR-1724.
1986. Also issued as CAR-TR-233, Center for Automation Research,
University of Maryland.]
109503 APPROXIMATION SCHEMES FOR A CLASS OF COMBINATORIAL OPTMIZATION
PROBLEMS ON A PARALLEL MACHINE.
P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal.
[University of Maryland. Department of Computer Science. TR-1725.
1986.]
109504 SIMULATION OF A PROLOG VIRTUAL MACHINE.
Y. Chu, K. Itano, and L. Fang.
[University of Maryland. Department of Computer Science. TR-1726.
1986.]
109505 INCLUDING PREFIXES IN DOUBLY-CHAINED TRIES.
G. D. Knott.
[University of Maryland. Department of Computer Science. CS-TR-1730.
1986. Also issued as CAR-TR-236, Center for Automation Research,
University of Maryland.]
109506 THE PFG LANGUAGE: VISUAL PROGRAMMING FOR CONCURRENT COMPUTATION.
P. D. Stotts.
[University of Maryland. Department of Computer Science. CS-TR-1731.
1986. Also issued as UMIACS-TR-86-21, Institute for Advanced Computer
Studies, University of Maryland.]
109507 A PARALLEL IMPLEMENTATION OF A COMPETITION-BASED MODEL OF COMPUTATION
IN A MESSAGE-PASSING ENVIRONMENT.
M. A. Tagamets and J. A. Reggia.
[University of Maryland. Department of Computer Science. TR-1732.
1987.]
109508 REQUIREMENTS FOR A SOFTWARE ENGINEERING ENVIRONMENT: PROCEEDINGS OF
THE UNIVERSITY OF MARYLAND WORKSHOP, MAY 5-8, 1986.
[University of Maryland. Department of Computer Science. CS-TR-1733.
1986. "Draft report...a final version will be published by Ablex
Publishing Company as part of its Software Engineering Book series."
Also issued as UMIACS-TR-86-22, Institute for Advanced Computer
Studies, University of Maryland.]
109509 A HIERARCHICAL STRATEGY FOR PATH PLANNING AMONG MOVING OBSTACLES.
K. Fujimura and H. Samet.
[University of Maryland. Department of Computer Science. CS-TR-1736.
1986. Also issued as CAR-TR-237, Center for Automation Research,
University of Maryland.]
109510 AN ANALYSIS OF B-TREES AND THEIR VARIANTS.
J.-H. Chu and G. D. Knott.
[University of Maryland. Department of Computer Science. CS-TR-1737.
1986. Also issued as CAR-TR-238, Center for Automation Research,
University of Maryland.]
109511 AN EFFICIENT LINE SEARCH ALGORITHM FOR OPTIMIZATION OF MULTIVARIATE
FUNCTIONS.
B. Kamgar-Parsi.
[University of Maryland. Department of Computer Science. CS-TR-1738.
1986. Also issued as CAR-TR-239, Center for Automation Research,
University of Maryland.]
109512 CALIBRATION OF A STEREO SYSTEM WITH SMALL RELATIVE ANGLES.
B. Kamgar-Parsi and R. Eastman.
[University of Maryland. Department of Computer Science. CS-TR-1739.
1986. Also issued as CAR-TR-240, Center for Automation Research,
University of Maryland.]
109513 A POPULATION ANALYSIS OF QUADTREES WITH VARIABLE NODE SIZE.
R. Nelson and H. Samet.
[University of Maryland. Department of Computer Science. CS-TR-1740.
1986. Also issued as CAR-TR-241, Center for Automation Research,
University of Maryland.]
109514 RECOGNIZING UNEXPECTED OBJECTS: A PROPOSED APPROACH.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1742.
1986. Also issued as CAR-TR-243, Center for Automation Research,
University of Maryland.]
109515 ARTIFICIAL INTELLIGENCE AND NATURAL PERCEPTION.
L. Kanal and T. Tsao.
[University of Maryland. Department of Computer Science. CS-TR-1743.
1986. Also issued as UMIACS-TR-86-23, Institute for Advanced Computer
Studies, University of Maryland.]
109516 THE SYNTAX OF PARALLELISM.
A. Amir and C. H. Smith.
[University of Maryland. Department of Computer Science. CS-TR-1744.
1986. Also issued as UMIACS-TR-86-24, Institute for Advanced Computer
Studies, University of Maryland.]
109517 DIRECT MANIPULATION USER INTERFACES FOR EXPERT SYSTEMS.
J. Baroff et al.
[University of Maryland. Department of Computer Science. CS-TR-1745.
1986. Also issued as CAR-TR-244, Center for Automation Research,
University of Maryland.]
109518 VERIFIED DATA TRANSFER PROTOCOLS WITH VARIABLE FLOW CONTROL.
A. U. Shankar.
[University of Maryland. Department of Computer Science. CS-TR-1746.
1986. Also issued as UMIACS-TR-86-25, Institute for Advanced Computer
Studies, University of Maryland.]
109519 LEARNING CONCEPTS FROM SUBCONCEPTS.
W. I. Gasarch and C. Smith.
[University of Maryland. Department of Computer Science. CS-TR-1747.
1986. Also issued as UMIACS-TR-86-26, Institute for Advanced Computer
Studies, University of Maryland.]
109520 COMPUTING THE VISIBILITY POLYGON FROM A CONVEX SET.
S. K. Ghosh.
[University of Maryland. Department of Computer Science. CS-TR-1749.
1986. Also issued as CAR-TR-246, Center for Automation Research,
University of Maryland.]
109521 A DISTRIBUTED ALGORITHM FOR DEADLOCK AND TERMINATION DETECTION OF
DISTRIBUTED COMPUTATIONS.
S.-T. Levi and B. D. Plateau.
[University of Maryland. Department of Computer Science. TR-1750.
1986.]
109522 THE VERIFICATION OF DISTRIBUTED REDUNDANT SYSTEMS.
L. V. Mancini and G. Pappalardo.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 253. 1988.]
109523 AN INTRODUCTION TO INTEGRATED PROJECT SUPPORT ENVIRONMENTS.
A. W. Brown.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 254. 1988.]
109524 A NOTE ON THE MEDIAN HEURISTIC FOR DRAWING BIPARITE GRAPHS.
E. Maekinen.
[University of Tampere. Department of Computer Science. A-1988-4.
1988.]
105993 IMPLEMENTATION CONCEPTS FOR AN EXTENSIBLE DATA MODEL AND DATA
LANGUAGE.
D. S. Batory, T. Y. Leung, and T. E. Wise.
[University of Texas, Austin. Department of Computer Sciences.
TR-86-24. 1988. October 1986. Revised: February 1988.]
109525 ATOMIC SEMANTICS OF NONATOMIC PROGRAMS.
J. H. Anderson and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-20. 1988. May 1987. Revised: March 1988.]
109526 BUILDING BLOCKS OF DATABASE MANAGEMENT SYSTEMS.
D. S. Batory.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-23. 1987.]
109527 PAM - A NONITERATIVE APPROACH SOLUTION METHOD FOR CLOSED MULTICHAIN
QUEUEING NETWORKS.
C.-T. Hsieh and S. S. Lam.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-28. 1988. July 1987. Revised: March 1988.]
109528 CONCEPTS FOR A DATABASE SYSTEM COMPILER.
D. S. Batory.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-01. 1988.]
109529 ON THE REUSABILITY OF QUERY OPTIMIZATION ALGORITHMS.
D. S. Batory.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-02. 1988.]
109530 A TAXONOMY OF FAIRNESS AND TEMPORAL LOGIC PROBLEMS FOR PETRI NETS.
R. R. Howell, L. E. Rosier, and H.-C. Yen.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-03. 1988.]
109531 A GENERAL APPROACH TO MULTIPROCESSOR SCHEDULING.
S. J. Kim.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-04. 1988.]
109532 SCHEMA VERSIONS AND DAG REARRANGEMENT VIEWS IN OBJECT-ORIENTED
DATABASES.
H.-J. Kim and H. F. Korth.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-05. 1988.]
109533 CONCURRENT ACCESS OF PRIORITY QUEUES.
V. N. Rao and V. Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-06. 1988.]
109534 FAST RAY TRACING USING K-D TREES.
D. Fussell and K. R. Subramanian.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-07. 1988.]
109535 SEPARATION PAIR DETECTION.
D. Fussell and R. Thurimella.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-08. 1988.]
109536 ARITHMETIC CLASSIFICATION OF PERFECT MODELS OF STRATIFIED PROGRAMS.
K. R. Apt and H. A. Blair.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-09. 1988.]
109537 APPRAISING FAIRNESS IN LANGUAGES FOR DISTRIBUTED PROGRAMMING.
K. R. Apt, N. Francez, and S. Katz.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-10. 1988.]
109538 PERFORMANCE MODELLING OF PARALLEL COMPUTATIONS.
A. K. Adiga.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-11. 1988. Thesis (Ph.D.).]
109539 SPECIFYING AN IMPLEMENTATION TO SATISFY INTERFACE SPECIFICATIONS: A
STATE TRANSITION APPROACH.
S. S. Lam and A. U. Shankar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-12. 1988.]
109540 RELATIONAL DATABASE STRUCTURE FOR STORAGE AND MANIPULATION OF
DEPENDENCY GRAPHS.
S. R. Easwar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-13. 1988. Thesis (M.S.).]
109541 PARALLEL HEURISTIC SEARCH OF STATE-SPACE GRAPHS: A SUMMARY OF RESULTS.
V. Kumar, K. Ramesh, and V. N. Rao.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-14. 1988.]
109542 AND-PARALLEL EXECUTION OF LOGIC PROGRAMS ON A SHARED MEMORY
MULTIPROCESSOR: A SUMMARY OF RESULTS.
Y.-J. Lin and V. Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-15. 1988.]
109543 PARALLEL DEPTH FIRST SEARCH ON THE RING ARCHITECTURE.
V. Kumar, V. N. Rao, and K. Ramesh.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-16. 1988.]
109544 OFFICE AND DATA BASE SYSTEMS RESEARCH '87.
F. H. Lochovsky et al.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-195. 1987. "This report contains a collection
of [13] papers that represent the research directions of the Office
and Data Base Systems Group in the Computer Systems Research
Institute at the University of Toronto over the past year (August
1986 to July 1987)." Edited by F. H. Lochovsky.]
109545 COMPARISON OF THE SINGLE PHASE AND TWO PHASE NUMERICAL MODEL
FORMULATION FOR SATURATED-UNSATURATED GROUNDWATER FLOW.
P. A. Forsyth.
[University of Waterloo. Department of Computer Science. Research
report CS-87-62. 1987.]
109546 ON THE EXISTENCE OF SPEED-INDEPENDENT CIRCUITS.
C.-J. Seger.
[University of Waterloo. Department of Computer Science. Research
report CS-87-63. 1987.]
109547 COMPLETE SETS OF FRONTIERS IN LOGIC-BASED PROGRAM TRANSFORMATION.
M. H. M. Cheng, M. H. van Emden, and P. A. Strooper.
[University of Waterloo. Department of Computer Science. Research
report CS-87-64. 1987.]
109548 AN ALGEBRA FOR NESTED RELATIONS.
V. Deshpande and P.-A. Larson.
[University of Waterloo. Department of Computer Science. Research
report CS-87-65. 1987.]
109549 ON THE AVERAGE CASE OF STRING MATCHING ALGORITHMS.
R. A. Baeza-Yates.
[University of Waterloo. Department of Computer Science. Research
report CS-87-66. 1987.]
109550 PERCEPTUAL REASONING: A LOGICAL FOUNDATION FOR COMPUTER VISION.
J. D. D. Gagne.
[University of Waterloo. Department of Computer Science. Research
report CS-87-67. 1987. Thesis (Master of Mathematics in Computer
Science).]
109551 SEARCHING WITH UNCERTAINTY.
R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins.
[University of Waterloo. Department of Computer Science. Research
report CS-87-68. 1987.]
109552 COMPILING A DEFAULT REASONING SYSTEM INTO PROLOG.
D. L. Poole.
[University of Waterloo. Department of Computer Science. Research
report CS-88-01. 1988.]
109553 SIMULATION OF NONAQUEOUS PHASE GROUNDWATER CONTAMINATION.
P. A. Forsyth.
[University of Waterloo. Department of Computer Science. Research
report CS-88-02. 1988.]
109554 DIVERSITY, ACCESSIBILITY AND ADAPTABILITY: DATA COMMUNICATION NEEDS
FOR HIGHER EDUCATION, THE UNIVERSITY OF WATERLOO EXPERIENCE.
D. D. Cowan et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-03. 1988.]
109555 PERFORMANCE OF A MULTIFRONTAL SCHEME FOR PARTIALLY SEPARABLE
OPTIMIZATION.
A. R. Conn et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-04. 1988.]
VOL. 10, NO. 8 08/29/88
109556 BISIMULATION THROUGH PROBABILISTIC TESTING.
K. G. Larsen and A. Skou.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 88-18. 1988. "Preliminary report."]
109557 SOFTWARE IMPLEMENTED FAULT INSERTION: AN FTMP EXAMPLE.
E. W. Czeck, Z. Z. Segall, and D. P. Siewiorek.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-101. 1987.]
109558 AUTOMATING KNOWLEDGE ACQUISITION FOR AERIAL IMAGE INTERPRETATION.
D. M. McKeown Jr. and W. A. Harvey.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-102. 1987.]
109559 CHARACTERIZING KRIPKE STRUCTURES IN TEMPORAL LOGIC.
M. C. Browne, E. M. Clarke, and O. Grumberg.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-104. 1987.]
109560 RESEARCH ON AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS.
E. M. Clarke and O. Grumberg.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-105. 1987.]
109561 TWO PAPERS ON A SYMBOLIC ANALYZER FOR MOS CIRCUITS.
R. E. Bryant.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-106. 1987.]
109562 STOCHASTIC ITERATED GENETIC HILLCLIMBING.
D. H. Ackley.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-107. 1987. Thesis (Ph.D.).]
109563 TIMESTAMP-BASED ORPHAN ELIMINATION.
M. P. Herlihy and M. S. McKendry.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-108. 1987. "A preliminary version of this paper appeared in
the proceedings of the Fifth Symposium on Reliability in Distributed
Software and Database Systems, January 1986."]
109564 ALGORITHMS FOR PARALLEL EXECUTION OF PROGRAMS WITH MEMORY ALIASING.
T. S. Anantharaman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-109. 1987.]
109565 ARCTIC: PROGRAMMER'S MANUAL AND TUTORIAL.
D. Rubine and R. Dannenberg.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-110. 1987.]
109566 INTEGRATING MODEL-BASED AND SYNDROME-BASED DIAGNOSIS. AQUA: A
QUALITATIVE APPROACH TO PROCESS DIAGNOSIS.
Y. Ishida and L. Eshelman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-111. 1987.]
109567 HETEROGENEOUS PARALLEL PROCESSING: THE AGORA SHARED MEMORY.
R. Bisiani et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-112. 1987.]
109568 HETEROGENEOUS PARALLEL PROCESSING: THE AGORA PROGRAMMING ENVIRONMENT.
R. Bisiani et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-113. 1987.]
109569 PARTITIONING IN PARALLEL PROCESSING OF PRODUCTION SYSTEMS.
K. Oflazer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-114. 1987. Thesis (Ph.D.).]
109570 CONNECTIONIST LEARNING PROCEDURES.
G. E. Hinton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-115. 1987. Version 2.]
109571 CHUNKING AS AN ABSTRACTION MECHANISM.
M. S. Campbell.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-116. 1987. Thesis (Ph.D.).]
109572 ON THE CONVEX HULL OF RANDOM POINTS IN A POLYTOPE.
R. A. Dwyer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-118. 1987.]
109573 PARTS-R-US: A CHIP APART(S)... .
E. Brunvand.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-119. 1987.]
109574 SPECIFYING GRACEFUL DEGRADATION IN DISTRIBUTED SYSTEMS.
M. P. Herlihy and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-120. 1987.]
109575 THE USE OF COPY-ON-REFERENCE IN A PROCESS MIGRATION SYSTEM.
E. R. Zayas.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-121. 1987. Thesis (Ph.D.).]
109576 VISUAL SPECIFICATION OF SECURITY CONSTRAINTS.
J. D. Tygar and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-122. 1987.]
109577 A GRAPH SEPARATOR THEOREM AND ITS APPLICATION TO GAUSSIAN ELIMINATION
TO OPTIMIZE BOOLEAN EXPRESSIONS FOR PARALLEL EVALUATION.
T. J. Sheffler.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-123. 1987. Thesis (M.S.).]
109578 EXPERIMENTAL ANALYSIS OF ALGORITHMS.
C. C. McGeoch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-124. 1986. Thesis (Ph.D.).]
109579 THE ACOUSTIC-MODELING PROBLEM IN AUTOMATIC SPEECH RECOGNITION.
P. F. Brown.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-125. 1987. Thesis (Ph.D.).]
109580 ON VISUAL FORMALISMS.
D. Harel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-126. 1987.]
109581 AN INTRODUCTION TO OBJECT ORIENTED PROGRAMMING, INHERITANCE AND
METHOD COMBINATION.
B. L. Horn.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-127. 1987.]
109582 A METHODOLOGY FOR HARDWARE VERIFICATION BASED ON LOGIC SIMULATION.
R. E. Bryant.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-128. 1987.]
109583 CAMELOT: A DISTRIBUTED TRANSACTION FACILITY FOR MACH AND THE INTERNET
-- AN INTERIM REPORT.
A. Z. Spector et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-129. 1987.]
109584 ON THE INCONSISTENCY OF RIGID-BODY FRICTIONAL PLANAR MECHANICS.
M. T. Mason and Y. Wang.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-130. 1987.]
109585 GENERATING BEHAVIOR EQUATIONS FROM EXPLICIT REPRESENTATION OF
MECHANISMS.
Y. Iwasaki.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-131. 1987.]
109586 ALGORITHMS FOR TWO GRAPH PROBLEMS: COMPUTING MAXIMUM-GENUS IMBEDDINGS
AND THE TWO-SERVER PROBLEM.
L. A. McGeoch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-132. 1987. Thesis (Ph.D.).]
109587 INHERITANCE OF SYNCHRONIZATION AND RECOVERY PROPERTIES IN AVALON/C++.
D. Detlefs, M. P. Herlihy, and J. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-133. 1987.]
109588 AN EFFICIENT COMMON LISP FOR THE IBM RT PC.
D. B. McDonald, S. E. Fahlman, and A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-134. 1987.]
109589 THEORY-BASED INDUCTIVE LEARNING: AN INTEGRATION OF SYMBOLIC AND
QUANTITATIVE METHODS.
S. Star.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-135. 1987.]
109590 MULTIRPC: A PARALLEL REMOTE PROCEDURE CALL MECHANISM.
M. Satyanarayanan and E. H. Siegel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-136-A. 1987.]
109591 TOWARDS AUTOMATIC GENERATION OF OBJECT RECOGNITION PROGRAMS.
K. Ikeuchi and T. Kanade.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-138. 1988.]
109592 MACH: A BASIS FOR FUTURE UNIX DEVELOPMENT.
A. Tevanian Jr. and R. F. Rashid.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-139. 1987.]
109593 MACHINE-INDEPENDENT VIRTUAL MANAGEMENT FOR PAGED UNIPROCESSOR AND
MULTIPROCESSOR ARCHITECTURE.
R. F. Rashid et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-140. 1987.]
109594 BUILDING A SECURE DISTRIBUTED COMPUTER SYSTEM.
R. D. Sansom.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-141. 1988. Thesis (Ph.D.).]
109595 A STUDY OF TWELVE SPECIFICATIONS OF THE LIBRARY PROBLEM.
J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-142. 1987.]
109596 HOW TO MAKE REPLICATED DATA SECURE.
M. P. Herlihy and J. D. Tygar.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-143. 1987.]
109597 MODELING SENSOR DETECTABILITY AND RELIABILITY IN THE CONFIGURATION
SPACE FOR MODEL-BASED VISION.
K. Ikeuchi and T. Kanade.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-144. 1987.]
095238 VIEWS FOR TOOLS IN INTEGRATED ENVIRONMENTS.
D. Garlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-147. 1987. Thesis (Ph.D.).]
109598 PERFORMANCE OF WARP ON THE DARPA ARCHITECTURE BENCHMARKS.
J. Deutch et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-148. 1987.]
109599 MACH THREADS AND THE UNIX KERNEL: THE BATTLE FOR CONTROL.
A. Tevanian Jr. et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-149. 1987.]
109600 MACH AND MATCHMAKER: KERNEL AND LANGUAGE SUPPORT FOR OBJECT-ORIENTED
DISTRIBUTED SYSTEMS.
M. B. Jones and R. F. Rashid.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-150. 1986.]
109601 OPTIMAL DIAGNOSIS FOR CAUSAL CHAINS.
I. S. Bhandari, H. A. Simon, and D. P. Siewiorek.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-151. 1987.]
109602 AN INTERPROCESS COMMUNICATION PROCESSOR: EXPLOITING OS/APPLICATION
CONCURRENCY.
J. W. Wendorf and H. Tokuda.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-152. 1987.]
109603 OS/APPLICATION CONCURRENCY: A MODEL.
J. W. Wendorf.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-153. 1987.]
109604 THE DUALITY OF MEMORY AND COMMUNICATION IN THE IMPLEMENTATION OF A
MULTIPROCESSOR OPERATING SYSTEM.
M. Young et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-155. 1987.]
109605 CMU COMMON LISP USER'S MANUAL: MACH/IBM RT PC EDITION.
D. B. McDonald.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-156. 1987. Edited by David B. McDonald.]
109606 INTERNAL DESIGN OF CMU COMMON LISP ON THE IBM RT PC.
D. B. McDonald, S. E. Fahlman, and S. Wholey.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-157. 1988.]
109607 HEMLOCK USER'S MANUAL.
R. MacLachlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-158. 1987.]
109608 HEMLOCK COMMAND IMPLEMENTOR'S MANUAL.
R. MacLachlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-159. 1987.]
109609 ON THE INFLUENCE OF SCALE IN A DISTRIBUTED SYSTEM.
M. Satyanarayanan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-162. 1987.]
109610 DEADLOCK AVOIDANCE FOR SYSTOLIC COMMUNICATION.
H. T. Kung.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-163. 1987.]
109611 A METASTABILITY TESTER.
A. Nowatzyk.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-164. 1987.]
109612 THE META-GENERALIZED DELTA RULE: A NEW ALGORITHM FOR LEARNING IN
CONNECTIONIST NETWORKS.
D. A. Pomerleau.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-165. 1987. Thesis (B.A.). "This report is a revised version
of a thesis submitted to Williams College as partial fulfillment of
the requirements for the degree of Bachelor of Arts...in computer
science."]
109613 THE WARP COMPUTER: ARCHITECTURE, IMPLEMENTATION AND PERFORMANCE.
M. Annaratone et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-166. 1987.]
109614 LEARNING BY EXPERIMENTATION: THE OPERATOR REFINEMENT METHOD.
J. G. Carbonell and Y. Gil.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-167. 1987.]
109615 WHEN ARE BEST FIT AND FIRST FIT OPTIMAL?
C. C. McGeoch and J. D. Tygar.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-168. 1987.]
109616 AN IMPLEMENTATION OF ADA TASKING.
T. D. Newton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-169. 1987.]
109617 VIRTUAL CHANNELS FOR FAULT-TOLERANT PROGRAMMABLE TWO-DIMENSIONAL
PROCESSOR ARRAYS.
H. T. Kung and O. Menzilcioglu.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-171. 1986.]
109618 CONCURRENCY VS. AVAILABILITY: ATOMICITY MECHANISMS FOR REPLICATED
DATA.
M. P. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-172. 1987.]
109619 A PARALLEL ALGORITHM FOR COLOURING GRAPHS.
I. S. Bhandari, C. M. Krishna, and D. P. Siewiorek.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-173. 1987.]
109620 COMPILING CP(DOWN ARROW, |, &) ON TOP OF PROLOG.
V. A. Saraswat.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-174. 1987.]
109621 A SKEPTICAL THEORY OF INHERITANCE IN NONMONOTONIC SEMANTIC NETWORKS.
J. F. Horty, R. H. Thomason, and D. S. Touretzky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-175. 1987.]
109622 REASONING ABOUT ATOMIC OBJECTS.
M. P. Herlihy and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-176. 1987.]
109623 PROGRAMMING WITH VIEWS.
A. N. Habermann et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-177. 1987.]
109624 SCALING UP: SEGMENTATION AND CONCURRENCY IN LARGE SOFTWARE DATABASES.
C. W. Krueger and A. Bogliolo.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-178. 1988.]
109625 INTEGRATING SECURITY IN A LARGE DISTRIBUTED SYSTEM.
M. Satyanarayanan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-179. 1987.]
109626 PATH PLANNING ON THE WARP COMPUTER: USING A LINEAR SYSTOLIC ARRAY IN
DYNAMIC PROGRAMMING.
F. Bitz and H. T. Kung.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-180. 1987.]
109627 PRIORITY INHERITANCE PROTOCOLS: AN APPROACH TO
REAL-TIME-SYNCHRONIZATION.
L. Sha, R. Rajkumar, and J. P. Lehoczky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-181. 1987.]
109628 FOUR CAPACITY MODELS FOR COARSE-CODED SYMBOL MEMORIES.
R. Rosenfeld and D. S. Touretzky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-182. 1987.]
109629 PARALLEL PROCESSING WITH AGORA.
A. Forin, R. Bisiani, and F. Correrini.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-183. 1987.]
109630 STRONGBOX: A SELF-SECURING PROTECTION SYSTEM FOR DISTRIBUTED PROGRAMS.
B. S. Yee, J. D. Tygar, and A. Z. Spector.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-184. 1988.]
109631 KALMAN FILTER-BASED ALGORITHMS FOR ESTIMATING DEPTH FROM IMAGE
SEQUENCES.
L. Matthies, R. Szeliski, and T. Kanade.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-185. 1987.]
109632 TALKING TO COMPUTERS: AN EMPIRICAL INVESTIGATION.
A. G. Hauptmann and A. I. Rudnicky.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-186. 1987.]
109633 A SYSTOLIC ARRAY OPTIMIZING COMPILER.
M. S.-L. Lam.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-187. 1987. Thesis (Ph.D.).]
109634 PRELIMINARY DESIGN OF THE PROGRAMMING LANGUAGE FORSYTHE.
J. C. Reynolds.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-159. 1988.]
109635 INTELLIGENT SENSORS FOR ATOMIZATION PROCESSING OF MOLTEN METALS AND
ALLOYS.
G. Jiang, H. Henein, and M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-6.
1988.]
109636 THE CMU RECONFIGURABLE MODULAR MANIPULATOR SYSTEM.
D. Schmitz, P. Khosla, and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-7.
1988.]
109637 THE DRIVING PIPELINE: A DRIVING CONTROL SCHEME FOR MOBILE ROBOTS.
Y. Goto, S. A. Shafer, and A. Stentz.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-8.
1988.]
109638 SPACE-TIME FILTERING, SAMPLING AND MOTION UNCERTAINTY.
R. S. Jasinschi.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-9.
1988.]
109639 JUNE 1987 ANNUAL REPORT: DEVELOPMENT OF AN INTEGRATED MOBILE ROBOT
SYSTEM AT CARNEGIE MELLON.
S. Shafer and W. Whittaker.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-10.
1987. Steve Shafer and William Whittaker, Principal Investigators.]
109640 A THEOREM ON ATOMICITY IN DISTRIBUTED ALGORITHMS.
L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 28. 1988.]
109641 IMPLEMENTING ABSTRACT DATA TYPES IN MODULA-2.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-66. 1987. March 1986. Second edition:
October 1987.]
109642 USING CASE ANALYSIS TO DEVELOP AND DOCUMENT EQUATIONAL SPECIFICATIONS.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-67. 1987.]
109643 OPAQUE TYPES AND STORAGE MANAGEMENT IN MODULA-2.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-68. 1987.]
109644 OPAQUE TYPES AND STORAGE MANAGEMENT IN MODULA-2. PART 2:
VALUE-RETURNING PROCEDURES.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-69. 1987.]
109645 CHOOSING NAMES IN PROGRAMS.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-71. 1987.]
109646 LITERATE PROGRAMMING.
R. J. Mitchell.
[Hatfield Polytechnic. School of Information Sciences. Computer
science technical report TR-75. 1988. Thesis (Ph.D.).]
109647 HIGH RESOLUTION FINITE VOLUME METHODS ON ARBITRARY GRIDS VIA WAVE
PROPAGATION.
R. J. LeVeque.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 87-68. 1987.]
109648 PARALLEL PSEUDOSPECTRAL DOMAIN DECOMPOSITION TECHNIQUES.
D. Gottlieb and R. S. Hirsh.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-15. 1988.]
109649 ADAPTIVE CONTROL OF A MANIPULATOR WITH A FLEXIBLE LINK.
Y. P. Yang and J. S. Gibson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-17. 1988.]
109650 TURBULENCE MODELING IN NON-INERTIAL FRAMES OF REFERENCE.
C. G. Speziale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-18. 1988.]
109651 AN O(N SQUARED) METHOD FOR COMPUTING THE EIGENSYSTEM OF N X N
SYMMETRIC TRIDIAGONAL MATRICES BY THE DIVIDE AND CONQUER APPROACH.
D. Gill and E. Tadmor.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-19. 1988.]
109652 EFFICIENT IMPLEMENTATION OF ESSENTIALLY NON-OSCILLATORY SHOCK
CAPTURING SCHEMES, II.
C.-W. Shu and S. Osher.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-24. 1988.]
109653 ESTIMATION OF TIME- AND STATE-DEPENDENT DELAYS AND OTHER PARAMETERS
IN FUNCTIONAL DIFFERENTIAL EQUATIONS.
K. A. Murphy.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-25. 1988.]
109654 PARAMETER ESTIMATION FOR BOUNDARY VALUE PROBLEMS BY INTEGRAL
EQUATIONS OF THE SECOND KIND.
F. Kojima.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-28. 1988.]
109655 PARALLEL DISCRETE-EVENT SIMULATION OF FCFS STOCHASTIC QUEUEING
NETWORKS.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-29. 1988.]
109656 ACCURACY VERSUS CONVERGENCE RATES FOR A THREE DIMENSIONAL MULTISTAGE
EULER CODE.
E. Turkel.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-30. 1988.]
109657 AUTOMATICALLY GENERATED ACCEPTANCE TEST: A SOFTWARE RELIABILITY
EXPERIMENT.
P. W. Protzel.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-31. 1988.]
109658 SPATIAL STABILITY OF A COMPRESSIBLE MIXING LAYER.
T. L. Jackson and C. E. Grosch.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-33. 1988.]
109659 SCALING LAWS FOR HOMOGENEOUS TURBULENT SHEAR FLOWS IN A ROTATING
FRAME.
C. G. Speziale and N. Mac Giolla Mhuiris.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-34. 1988.]
109660 HIGH DEGREE INTERPOLATION POLYNOMIAL IN NEWTON FORM.
H. Tal-Ezer.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-39. 1988.]
109661 THE PARALLEL COMPLEXITY OF FINDING ALL NEAREST NEIGHBORS IN CONVEX
POLYGONS.
B. Schieber and U. Vishkin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13234. 1987.]
109662 MENTAL MODELS IN HUMAN-COMPUTER INTERACTION: RESEARCH ISSUES ABOUT
WHAT THE USER OF SOFTWARE KNOWS.
J. M. Carroll and J. R. Olson.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13426. 1987.]
109663 ROUTING MULTIPLE POWER AND GROUND NETS ON A SINGLE LAYER.
J.-M. Ho, G. Vijayan, and C. K. Wong.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13549. 1987.]
109664 THE INFORMATION LATTICE OF NETWORKS USED FOR KNOWLEDGE REPRESENTATION.
R. Roennquist.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-86-02. 1986. Revised.]
109665 MANAGEMENT OF STRATIFIED DATABASES.
K. R. Apt and J. M. Pugin.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8760. 1987.]
109666 INCREMENTAL GENERATION OF LEXICAL SCANNERS.
J. Heering, P. Klint, and J. Rekers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8761. 1987.]
109667 FRACTALS (MATHEMATICS, PROGRAMMING AND APPLICATIONS).
H. A. Lauwerier and J. A. Kaandorp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8762. 1987.]
109668 IMPLEMENTATION OF MODULAR ALGEBRAIC SPECIFICATIONS.
N. W. P. van Diepen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8801. 1988.]
109669 A VECTOR-LIKE ARCHITECTURE FOR RASTER GRAPHICS.
V. Akman, P. J. W. ten Hagen, and A. A. M. Kuijk.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8802. 1988.]
109670 METRIC SEMANTICS FOR CONCURRENCY.
J. W. de Bakker and J.-J. Ch Meyer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8803. 1988.]
109671 USING A GRAPH REWRITING SYSTEM FOR DATABASES.
M. L. Kersten, A. P. J. M. Siebes, and C. A. van den Berg.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8805. 1988.]
109672 A TIME AND SPACE EFFICIENT IMPLEMENTATION OF A DYNAMIC INDEX IN A
MAIN-MEMORY DBS.
M. L. Kersten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8806. 1988.]
109673 THE ALGEBRA OF SYNCHRONOUS PROCESSES.
W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8807. 1988.]
109674 FUNCTIONAL DEPENDENCIES OF VARIABLES IN WAIT-FREE PROGRAMS.
E. Kranakis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8808. 1988.]
109675 A COMPOSITIONAL SEMANTICS FOR CONCURRENT PROLOG.
J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8809. 1988.]
109676 ARITHMETIC CLASSIFICATION OF PERFECT MODELS OF STRATIFIED PROGRAMS.
K. R. Apt and H. A. Blair.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8810. 1988.]
109677 APPRAISING FAIRNESS IN LANGUAGES FOR DISTRIBUTED PROGRAMMING.
K. R. Apt, N. Francez, and S. Katz.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8811. 1988.]
109678 SOME OBSERVATIONS ON REDUNDANCY IN A CONTEXT.
F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8812. 1988.]
109679 TWO DECADES OF APPLIED KOLMOGOROV COMPLEXITY: IN MEMORIAM ANDREI
NIKOLAEVICH KOLMOGOROV, 1903-1987.
M. Li and P. M. B. Vitanyi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8813. 1988.]
109680 MATRIXDEPENDENT PROLONGATIONS AND RESTRICTIONS IN A BLACKBOX
MULTIGRID SOLVER.
P. M. de Zeeuw.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8801. 1988.]
109681 THE USE OF SMOOTHING TECHNIQUES IN THE METHOD OF LINES.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8802. 1988.]
109682 MULTIGRID AND DEFECT CORRECTION FOR THE STEADY NAVIER-STOKES
EQUATIONS.
B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8803. 1988.]
109683 AN ADAPTIVE MOVING GRID METHOD FOR ONE-DIMENSIONAL SYSTEMS OF PARTIAL
DIFFERENTIAL EQUATIONS.
J. G. Verwer, J. G. Blom, and J. M. Sanz-Serna.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8804. 1988.]
109684 KOLMOGOROV COMPLEXITY AND DEGREES OF TALLY SETS.
E. W. Allender and O. Watanabe.
[Rutgers. Department of Computer Science. DCS-TR-225. 1988.]
109685 SOME CONSEQUENCES OF THE EXISTENCE OF PSEUDORANDOM GENERATORS.
E. W. Allender.
[Rutgers. Department of Computer Science. DCS-TR-226. 1988.]
109686 P-PRINTABLE SETS.
E. W. Allender and R. S. Rubinstein.
[Rutgers. Department of Computer Science. DCS-TR-227. 1987.]
109687 TWO CLASSES OF PERFECT GRAPHS.
L. Sun.
[Rutgers. Department of Computer Science. DCS-TR-228. 1988.]
109688 MODELING CLASS HIERARCHIES WITH CONTRADICTIONS.
A. Borgida.
[Rutgers. Department of Computer Science. DCS-TR-229. 1988.]
109689 ARBITRARY SPLITTING IN SPLAY TREES.
J. M. Lucas.
[Rutgers. Department of Computer Science. DCS-TR-234. 1988.]
109690 GENERALIZING NUMBER AND LEARNING FROM MULTIPLE EXAMPLES IN
EXPLANATION BASED LEARNING.
W. W. Cohen.
[Rutgers. Department of Computer Science. ML-TR-24. 1988.]
109691 PROPOSAL OF RESEARCH: CONSTRAINT INCORPORATION USING CONSTRAINED
REFORMULATION.
W. Braudaway.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-100.
1988.]
109692 LAW-GOVERNED SYSTEMS.
N. H. Minsky.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-101.
1988.]
109693 DELEGATION NEEDS CONTROL.
D. Rozenshtein and N. H. Minsky.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-102.
1988.]
109694 PROPERTIES OF DATA FLOW FRAMEWORKS: A UNIFIED MODEL.
T. J. Marlowe and B. G. Ryder.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-103.
1988.]
109695 A LAW-GOVERNED OBJECT-ORIENTED SYSTEM.
D. Rozenshtein and N. H. Minsky.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-104.
1988.]
109696 GAUSSIAN ELIMINATION AND GAUSS-JORDAN ON MIMD ARCHITECTURES.
A. Gerasoulis and I. Nelken.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-105.
1988.]
109697 MINIMIZING ERROR RATES FOR INDUCED PRODUCTION RULES.
S. M. Weiss.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-106.
1988.]
052121 EXTENDED CATEGORICAL GRAMMAR.
S. Yoo and K. Lee.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-121. February 1988.]
052126 DETERMINATION, UNIFORMITY, AND RELEVANCE: NORMATIVE CRITERIA FOR
GENERALIZATION AND REASONING BY ANALOGY.
T. R. Davies.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-126. May 1988.]
052127 MODAL SUBORDINATION AND PRONOMINAL ANAPHORA IN DISCOURSE.
C. Robert.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-127. May 1988. September 1986. Revised: April
1988.]
052128 THE PRINCE AND THE PHONE BOOTH: REPORTING PUZZLING BELIEFS.
M. Crimmins and J. Perry.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-128. June 1988.]
035338 SPARSE DISTRIBUTED MEMORY PROTOTYPE: PRINCIPLES OF OPERATION.
M. J. Flynn et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-87-338.
February 1988.]
035351 EMPIRICAL ANALYSIS OF A LISP SYSTEM.
R. A. Shaw.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-351.
February 1988. Thesis (Ph.D.).]
035352 PARTITIONING OF REGULAR COMPUTATION ON MULTIPROCESSOR SYSTEMS.
F. F. Lee.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-352.
February 1988.]
035353 THE MEANING OF TSL: AN ABSTRACT IMPLEMENTATION OF TSL-1.
D. P. Helmbold.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-353.
March 1988.]
035355 INTRODUCTORY USER'S GUIDE TO THE ARCHITECT'S WORKBENCH TOOLS.
J. Torrellas et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-355. May
1988.]
035356 COMPUTER-AIDED DESIGN AND OPTIMIZATION OF CONTROL UNITS FOR VLSI
PROCESSORS.
G. De Micheli.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-356.
March 1988.]
038337 LOGIC DESIGN EDUCATION AT STANFORD UNIVERSITY.
J. F. Wakerly and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
87-19. October 1987. "This report is a preprint of a paper to be
presented at the 21st Annual Hawaii International Conference on
System Sciences, January 5-8, 1988." Also issued as CSL-TN-87-337,
Computer Systems Laboratory, Stanford University.]
038338 DETECTING BRIDGING FAULTS WITH STUCK-AT TEST SETS.
S. D. Millman and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
87-20. December 1987. Also issued as CSL-TN-87-338, Computer Systems
Laboratory, Stanford University.]
038339 TECHNIQUES FOR INJECTING NON STUCK-AT FAULTS.
M. L. Cortes et al.
[Stanford University. Center for Reliable Computing. Report no.
87-21. March 1987. Also issued as CSL-TN-87-339, Computer Systems
Laboratory, Stanford University.]
038340 BIBLIOGRAPHY OF 1987 CRC PUBLICATIONS.
D. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-0.
January 1988. Also issued as CSL-TN-88-340, Computer Systems
Laboratory, Stanford University.]
038341 A DESIGNER'S GUIDE TO SYNCHRONIZERS AND METASTABILITY.
J. F. Wakerly.
[Stanford University. Center for Reliable Computing. Report no. 88-1.
February 1988. Also issued as CSL-TN-88-341, Computer Systems
Laboratory, Stanford University.]
038343 THE BYZANTINE HARDWARE FAULT MODEL.
H. A. Goosen and T. Nanya.
[Stanford University. Center for Reliable Computing. Report no. 88-3.
May 1988. Also issued as CSL-TN-88-343, Computer Systems Laboratory,
Stanford University.]
038344 DESIGN TECHNIQUES FOR TESTABLE EMBEDDED ERROR CHECKERS.
E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-4.
June 1988. Also issued as CSL-TN-88-344, Computer Systems Laboratory,
Stanford University.]
038345 PREPRINTS.
E. J. McCluskey et al.
[Stanford University. Center for Reliable Computing. Report no. 88-5.
June 1988. "This technical report contains preprints of the 1988
International Test Conference, to be held in Washington, D.C.,
September 12-14, 1988, and the Fault-Tolerant Computing Symposium-18,
to be held in Tokyo, Japan, June 27-30, 1988." Also issued as
CSL-TN-88-345, Computer Systems Laboratory, Stanford University.]
038346 AN EXPERIMENTAL STUDY OF SUPERGATES.
M. Marhoefer and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-6.
June 1988. Also issued as CSL-TN-88-346, Computer Systems Laboratory,
Stanford University.]
048088 A PROCESS-ORIENTED MODEL OF BACTERIAL GENE REGULATION.
-18 P. D. Karp.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-18. June 1988.]
048088 REASONING UNDER VARYING AND UNCERTAIN RESOURCE CONSTRAINTS.
-35 E. J. Horvitz.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-35. April 1988.]
048088 SOLACE: AN INTELLIGENT BACK END FOR A LARGE NONLINEAR OPTIMIZATION
-39 PACKAGE.
A. Zygmont.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-39. May 1988.]
048088 KNET: INTEGRATING HYPERTEXT AND NORMATIVE BAYESIAN MODELING.
-47 R. M. Chavez and G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-47. June 1988.]
109698 FAST AND EFFICIENT SOLUTION OF PATH ALGEBRA PROBLEMS.
V. Pan and J. Reif.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-3. n.d.]
109699 ON THE REPRESENTATION OF ISA HIERARCHIES, EXCEPTIONS, METAPHORS, AND
OTHER 'ANOMALIES.'
M. Balaban.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-4. 1987.]
109700 ACCELERATION OF PARALLEL COMPUTATIONS OF THE MINIMUM COST PATHS IN AN
UNDIRECTED GRAPH HAVING A SMALL SEPARATOR FAMILY.
V. Pan and D. Bini.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-10. n.d.]
109701 THE COMPLEXITY OF ROUTING THROUGH AN OMEGA NETWORK.
P. J. Bernhard and D. J. Rosenkrantz.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-12. 1987.]
109702 COMPUTING THE DETERMINANT AND THE CHARACTERISTIC POLYNOMIAL OF A
MATRIX VIA SOLVING LINEAR SYSTEMS OF EQUATIONS.
V. Pan.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-13. n.d.]
109703 USING FIRST ORDER LOGIC TO REPRESENT AND TO REASON WITH TEMPORAL
KNOWLEDGE.
M. Balaban and N. V. Murray.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-15. 1987.]
109704 MATRIX MULTIPLICATION FOR FINITE ALGEBRAIC SYSTEMS.
D. J. Rosenkrantz and H. B. Hunt III.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-16. 1987.]
109705 MINIMIZING TIME-SPACE COST FOR DATABASE VERSION CONTROL.
L. Yu and D. J. Rosenkrantz.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-17. 1987.]
109706 ON SAT AND THE RELATIVE COMPLEXITIES OF NP-HARD PROBLEMS.
R. E. Stearns and H. B. Hunt III.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-21. n.d. "Extended abstract."]
109707 THE COMPLEXITY OF EQUIVILENCE FOR COMMUTATIVE RINGS.
H. B. Hunt III and R. E. Stearns.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-22. n.d.]
109708 COMPLEXITY OF VERY SIMPLE BOOLEAN FORMULAS WITH APPLICATIONS.
H. B. Hunt III and R. E. Stearns.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-23. n.d.]
109709 TIME STRUCTURES.
M. Balaban and N. V. Murray.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-24. 1987.]
109710 SUFFICIENT-COMPLETENESS, QUASI-REDUCIBILITY AND THEIR COMPLEXITY.
D. Kapur et al.
[State University of New York, Albany. Department of Computer
Science. Technical report 87-26. n.d.]
109711 TOWARDS CONSTRUCTIVE INDUCTION IN FIRST-ORDER PREDICATE CALCULUS.
S. Muggleton and W. Buntine.
[Turing Institute. TIRM-88-031. 1988.]
109712 VALIDATION CODE FOR THE WHETSTONE BENCHMARK.
B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 107/88. 1988.]
109713 A STATE-OF-THE-ART SURVEY OF LOW-COST SECURITY IN LOCAL AREA NETWORKS.
W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 113/88. 1988.]
109714 PROGRESS REPORT ON A FRAMEWORK FOR THE SEMANTICS OF OBJECT-ORIENTED
LANGUAGES.
N. D. North.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 114/88. 1988.]
109715 MODELLING USER'S COGNITIVE ABILITIES IN AN ADAPTIVE SYSTEM.
D. Benyon, S. Milan, and D. Murray.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 115/88. 1988.]
109716 ARCHITECTURE PROBLEMS IN THE CONSTRUCTION OF EXPERT SYSTEMS FOR
DOCUMENT RETRIEVAL.
K. S. Jones.
[University of Cambridge. Computer Laboratory. Technical report 131.
1988.]
109717 REASONING ABOUT THE FUNCTION AND TIMING OF INTEGRATED CIRCUITS WITH
PROLOG AND TEMPORAL LOGIC.
M. E. Leeser.
[University of Cambridge. Computer Laboratory. Technical report 132.
1988. Thesis (Ph.D.).]
109718 A PRELIMINARY USER'S MANUAL FOR ISABELLE.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 133.
1988.]
109719 CORRECTNESS PROPERTIES OF THE VIPER BLOCK MODEL: THE SECOND LEVEL.
A. Cohn.
[University of Cambridge. Computer Laboratory. Technical report 134.
1988.]
109720 USING RECURSIVE TYPES TO REASON ABOUT HARDWARE IN HIGHER ORDER LOGIC.
T. F. Melham.
[University of Cambridge. Computer Laboratory. Technical report 135.
1988.]
109721 GEOMETRIC CONSTRAINTS FROM 2 1/2D SKETCH DATA AND OBJECT MODELS.
R. B. Fisher and M. J. L. Orr.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 318. 1987.]
109722 IKBS: A KNOWLEDGE MEDIUM.
J. Howe.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 320. 1987.]
109723 LEARNING CONTROL KNOWLEDGE WITHIN AN EXPLANATION-BASED LEARNING
FRAMEWORK.
R. Desimone.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 321. 1987.]
109724 A FEATURE-BASED CATEGORICAL MORPHO-SYNTAX FOR JAPANESE.
P. J. Whitelock.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 324. 1987.]
109725 FORMULATING PROOF SYSTEMS FOR AUTOMATED DEDUCTION.
L. A. Wallen.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 325. 1987.]
109726 A PARALLEL SHIFT-REDUCE PARSER FOR COMMITTED CHOICE NON-DETERMINISTIC
LOGIC LANGUAGES.
R. Trehan and P. F. Wilk.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 327. 1987.]
109727 DESIGN AND SENSOR-BASED ROBOTIC ASSEMBLY IN THE "DESIGN TO PRODUCT"
ASSEMBLY.
P. Fehrenbach and T. Smithers.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 328. 1987.]
109728 AI-BASED DESIGN AND PERSISTENT OBJECT SYSTEMS.
T. Smithers.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 329. 1987.]
109729 AUTONOMOUS VEHICLES AS REAL-TIME EXPERT SYSTEMS.
J. Hallam.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 332. 1987.]
109730 MODELING SECOND-ORDER VOLUMETRIC FEATURES.
R. B. Fisher.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 333. 1987.]
109731 SOLVING GEOMETRIC CONSTRAINTS IN A PARALLEL NETWORK.
R. B. Fisher and M. J. L. Orr.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 334. 1987.]
109723 HOW TO IMPROVE THE RELIABILITY OF EXPERT SYSTEMS.
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 336. 1987.]
109733 HELPING INEXPERIENCED USERS TO CONSTRUCT SIMULATION PROGRAMS: AN
OVERVIEW OF THE ECO PROJECT.
D. Robertson et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 338. 1987.]
109734 ARTIFICIAL INTELLIGENCE AND PRODUCT CREATION: AN AI-BASED VIEW.
T. Smithers.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 342. 1987.]
109735 TOWARDS AN ARCHITECTURE FOR ADVICE-GIVING SYSTEMS.
P. Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 344. 1987.]
109736 ON GAME-THEORETIC INTERACTIONS WITH FIRST-ORDER KNOWLEDGE BASES.
P. Jackson.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 345. 1987.]
109737 CONFRONTING SCIENCE MISCONCEPTIONS: A COMPUTER-BASED METHODOLOGY.
P. Brna.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 346. 1987.]
109738 EXPLANATION-BASED GENERALISATION = PARTIAL EVALUATION.
F. van Harmelen and A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 347. 1986.]
109739 THE USE OF EXPLICIT PLANS TO GUIDE INDUCTIVE PROOFS.
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 349. 1987.]
109740 LEARNING CONTROL APPLICATIONS THROUGH PROGRAMMING.
P. Chung.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 350. 1987.]
109741 EVALUATING PROLOG ENVIRONMENTS: A PROGRESS REPORT.
A. Bundy, H. Pain, and P. Brna.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 351. 1987.]
109742 CONFRONTING MISCONCEPTIONS IN THE DOMAIN OF SIMPLE ELECTRICAL
CIRCUITS.
P. Brna.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 352. 1988.]
109743 A METHODOLOGY FOR CONFRONTING SCIENCE MISCONCEPTIONS.
P. Brna.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 353. 1988.]
109744 SCHEDULING VIA REINFORCEMENT.
B. Liu.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 354. 1988.]
109745 CONFRONTING DYNAMICS MISCONCEPTIONS.
P. Brna.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 356. 1988.]
109746 ARTIFICIAL INTELLIGENCE: ART OR SCIENCE?
A. Bundy.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 358. 1988.]
109747 BUILDING COMPLEX DERIVED INFERENCE RULES: A DECIDER FOR THE CLASS OF
PRENEX UNIVERSAL-EXISTENTIAL FORMULAS.
F. Giunchiglia and E. Giunchiglia.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 359. 1988.]
109748 A RATIONAL RECONSTRUCTION OF BOYER AND MOORE'S TECHNIQUE FOR
CONSTRUCTING INDUCTION FORMULAS.
A. Stevens.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 360. 1988.]
109749 PROVING PROPERTIES OF LOGIC PROGRAMS: A PROGRESS REPORT.
A. Bundy et al.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 361. 1988.]
109750 TEMPORAL ONTOLOGY AND TEMPORAL REFERENCE.
M. Moens and M. Steedman.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 362. 1988.]
109751 EXPLAINING COMPLEX PHYSICAL SYSTEMS.
A. Cawsey.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 363. 1988.]
109752 BS*: AN ADMISSIBLE BIDIRECTIONAL STATED HEURISTIC SEARCH ALGORITHM.
J. B. H. Kwa.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 364. 1988.]
109753 SOME DESIGN PRINCIPLES FOR PROLOG SUPPORT ENVIRONMENTS.
A. W. Bowles and P. F. Wilk.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 365. 1988.]
109754 A PARALLEL CHART PARSER FOR THE COMMITTED CHOICE NON-DETERMINISTIC
(CCND) LOGIC LANGUAGES.
R. Trehan and P. F. Wilk.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 366. 1988.]
109755 OBJECT MODELS IN THE COMMITTED CHOICE NON-DETERMINISTIC LOGIC
LANGUAGES.
R. Trehan, P. F. Wilk, and M. Buckley.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 368. 1988.]
109756 CHOICE MAKING IN PLANNING SYSTEMS.
D. Croft.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 369. 1988.]
109757 A GENERAL PROOF METHOD FOR MODAL PREDICATE LOGIC WITHOUT THE BARCAN
FORMULA OR ITS CONVERSE.
P. Jackson and H. Reichgelt.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 370. 1988.]
109758 DESCRIBING DAI MODELS: A FRAMEWORK AND EXAMPLES.
L. E. Castillo-Hern and P. F. Wilk.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 371. 1988.]
109759 PREDICTIVE COMPUTER VISION FOR ROBOTIC ASSEMBLY.
J. C. Aylett, R. B. Fisher, and A. P. Fothergill.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 372. 1988.]
109760 ANALYTIC ABDUCTION FROM QSIM.
C. P. Williams.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 373. 1988.]
109761 TOLERANT PLANNING AND NEGOTIATION IN GENERATING COORDINATED MOVEMENT
PLANS IN AN AUTOMATED FACTORY.
J. B. H. Kwa.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 374. 1988.]
109762 REFLECTION IN CONSTRUCTIVE AND NON-CONSTRUCTIVE AUTOMATED REASONING.
F. Giunchiglia and A. Smaill.
[University of Edinburgh. Department of Artificial Intelligence.
Research paper 375. 1988.]
109763 IMPROVED METHODS FOR PERFORMANCE ENGINEERING. SIMMER II, EDINBURGH
REPORT.
R. J. Pooley and M. W. Brown.
[University of Edinburgh. Department of Computer Science. CSR-253-88.
1988.]
109764 LOOPING LR PARSERS.
E. Soisalon-Soininen and J. Tarhio.
[University of Helsinki. Department of Computer Science. n.d.]
109765 HELSINKI PROLOG LANGUAGE - REFERENCE MANUAL.
P. Kilpelaeinen et al.
[University of Helsinki. Department of Computer Science. A-1987-1.
1987.]
109766 HELSINKI PROLOG SYSTEM (HPS) - USER GUIDE.
P. Kilpelaeinen et al.
[University of Helsinki. Department of Computer Science. A-1987-2.
1987.]
109767 HELSINKI PROLOG SYSTEM (HPS) - SYSTEM OVERVIEW.
P. Kilpelaeinen et al.
[University of Helsinki. Department of Computer Science. A-1987-3.
1987.]
109768 SORTING IN HIERARCHICAL MEMORIES.
A. I. Verkamo.
[University of Helsinki. Department of Computer Science. A-1988-1.
1988. This report summarizes five papers by the author.]
109769 TOOLS/HLP84 REPORT AND USER MANUAL.
K. Koskimies et al.
[University of Helsinki. Department of Computer Science. A-1988-2.
1988.]
109770 INCREMENTAL MATLAB - A PROGRAM WITH AN INCREMENTAL USER INTERFACE.
N. Holsti.
[University of Helsinki. Department of Computer Science. A-1988-3.
1988.]
109771 TIME PARAMETER AND ARBITRARY DEUNIONS IN THE SET UNION PROBLEM.
H. Mannila and E. Ukkonen.
[University of Helsinki. Department of Computer Science. A-1988-4.
1988.]
109772 PROTAN88 - A SOFTWARE TOOL FOR VERIFYING COMMUNICATION PROTOCOLS
SPECIFIED WITH AN EXTENDED STATE TRANSITION MODEL.
M. Tienari et al.
[University of Helsinki. Department of Computer Science. A-1988-5.
1988.]
109773 INTEROPERABILITY OF HETEROGENEOUS INFORMATION SYSTEMS: INTERIM REPORT
OF THE COST 11TER PROJECT.
H. Tirri et al.
[University of Helsinki. Department of Computer Science. A-1988-6.
1988. This report consists of nine research papers in four
sub-project areas: (I) Knowledge based integration, (II) Generalized
transaction model, (III) Multidatabase languages, and (IV)
Performance issues. Edited by Henry Tirri.]
109774 GENERATING ONE-PASS SEMANTIC ANALYSIS FOR A COMPILER.
J. Paakki.
[University of Helsinki. Department of Computer Science. A-1988-8.
1988.]
109775 INCREMENTAL ATTRIBUTE EVALUATION AND PASSING BASED ON ECLR-ATTRIBUTED
GRAMMARS.
M. Sassa.
[University of Helsinki. Department of Computer Science. A-1988-9.
1988.]
109776 EXPERIENCES IN USING ESTELLE IN X.411/P1 PROTOCOL SPECIFICATION.
K. Lehtinen.
[University of Helsinki. Department of Computer Science. A-1988-10.
1988.]
109777 GENERATING AND STRUCTURING TERRAIN FEATURES ON PARALLEL VECTOR
ARCHITECTURES.
E.-K. Koh and D. D. Hearn.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1435. 1988.]
109778 AN OVERVIEW OF PROMAN: A PROJECT MANAGEMENT SYSTEM IN THE SAGA
ENVIRONMENT.
R. N. Sum Jr. and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1437. 1988.]
109779 COMPUTING MEDIAN-OF-SQUARES REGRESSION LINES AND GUIDED TOPOLOGICAL
SWEEP.
H. Edelsbrunner and D. L. Souvaine.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1438. 1988.]
109780 MENTAT: AN OBJECT-ORIENTED MACRO DATAFLOW SYSTEM.
A. S. Grimshaw.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1440. 1988. Thesis (Ph.D.).]
109781 INCREMENTAL DEVELOPMENT OF SEMANTICS USING RELATIONAL ATTRIBUTE
GRAMMARS.
S. R. Sataluri and A. C. Fleck.
[University of Iowa. Department of Computer Science. Technical report
88-04. 1988.]
109782 LOGICAL FRAMES FOR INTERACTIVE THEOREM PROVING.
P. A. Lindsay.
[University of Manchester. Department of Computer Science. Technical
report UMCS-87-12-7. 1987.]
109783 TOWARDS A THEORY OF REPLICATED PROCESSING.
L. V. Mancini and G. Pappalardo.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 258. 1988.]
109784 IMPLEMENTING CONCURRENCY CONTROL IN RELIABLE DISTRIBUTED
OBJECT-ORIENTED SYSTEMS.
G. D. Parrington and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 259. 1988.]
109785 SEMANTIC TRANSFORMATIONS FOR NATURAL LANGUAGE PRODUCTION.
R. Whitney.
[University of Southern California. Information Sciences Institute.
ISI/RR-88-192. 1988.]
109786 ON PARALLELISM AND THE PENMAN NATURAL LANGUAGE GENERATION SYSTEM.
Y.-W. Tung, C. Matthiessen, and N. Sondheimer.
[University of Southern California. Information Sciences Institute.
ISI/RR-88-195. 1988.]
109787 SIMS: SINGLE INTERFACE TO MULTIPLE SYSTEMS.
J. Pavlin and R. L. Bates.
[University of Southern California. Information Sciences Institute.
ISI/RR-88-200. 1988.]
109788 VECTORIZATION OF LOW ORDER EXPLICIT RUNGE-KUTTA NYSTROM PAIRS.
P. W. Sharp.
[University of Toronto. Department of Computer Science. Technical
report 203/87. 1987.]
109789 FEASIBLY CONSTRUCTIVE ANALYSIS.
H. J. Hoover.
[University of Toronto. Department of Computer Science. Technical
report 206/87. 1987. Thesis (Ph.D.).]
109790 ON THE COMPUTATIONAL COMPLEXITY OF FINDING STABLE STATE VECTORS IN
CONNECTIONIST MODELS (HOPFIELD NETS).
G. H. Godbeer, J. Lipscomb, and M. Luby.
[University of Toronto. Department of Computer Science. Technical
report 208/88. 1988. "This technical report consists of two M. Sc.
theses, one after the other. The first is authored by Gail H.
Godbeer, the second by John Lipscomb. Both were supervised by Michael
Luby. The work may be generally regarded as joint-work between the
three...." (from the overview).]
109791 PARTITIONING SPACE FOR RANGE QUERIES.
F. F. Yao et al.
[University of Warwick. Department of Computer Science. RR118. 1988.]
109792 WINNSOME: A NEURAL NETWORK SIMULATION PACKAGE.
I. D. Craig.
[University of Warwick. Department of Computer Science. RR120. 1988.]
109793 A SEMANTIC MODEL FOR THE SPECIFICATION OF REAL-TIME PROCESSES.
A. Goswami and M. Joseph.
[University of Warwick. Department of Computer Science. RR121. 1988.]
109794 PLANAR ACYCLIC COMPUTATION.
W. F. McColl and M. S. Paterson.
[University of Warwick. Department of Computer Science. RR122. 1988.]
109795 WHAT'S 'REAL' ABOUT REAL-TIME SYSTEMS?
M. Joseph and A. Goswami.
[University of Warwick. Department of Computer Science. RR123. 1988.]
109796 DEFINITIONS FOR MODELLING AND SIMULATING CONCURRENT SYSTEMS.
M. Beynon, M. Norris, and M. Slade.
[University of Warwick. Department of Computer Science. RR124. 1988.]
109797 SELF-REDUCIBLE, P-SELECTIVE, NEAR-TESTABLE, AND P-CHEATABLE SETS: THE
EFFECT OF INTERNAL STRUCTURE ON THE COMPLEXITY OF A SET.
J. Goldsmith, D. Joseph, and P. Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 743. 1988.]
109798 ASYNCHRONOUS PARALLEL SUCCESSIVE OVERRELAXATION FOR THE SYMMETRIC
LINEAR COMPLEMENTARITY PROBLEM.
R. De Leone and O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 755. 1988.]
109799 MEASUREMENT AND PREDICTION OF CONTENTION IN MULTIPROCESSOR OPERATING
SYSTEMS WITH SCIENTIFIC APPLICATION WORKLOADS.
G. E. Bier and M. K. Vernon.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 767. 1988.]
109800 THE TRINOCULAR GENERAL SUPPORT ALGORITHM: A THREE CAMERA STEREO
ALGORITHM FOR OVERCOMING BINOCULAR MATCHING ERRORS.
C. V. Stewart and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 768. 1988.]
109801 A STUDY OF FULLY OPEN COMPUTING SYSTEMS.
Y. Artsy.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 769. 1987. Thesis (Ph.D.).]
109802 ON THE POWER OF MAGIC.
C. Beeri and R. Ramakrishnan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 770. 1988.]
109803 MAGIC TEMPLATES: A SPELLBINDING APPROACH TO LOGIC PROGRAMS.
R. Ramakrishnan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 771. 1988.]
109804 AN AMATEUR'S INTRODUCTION TO RECURSIVE QUERY PROCESSING STRATEGIES.
R. Bancilhon and R. Ramakrishnan.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 772. 1988.]
109805 SOME REMARKS ON THE COMPLETED DATABASE.
K. Kunnen.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 775. 1988.]
109806 CONNECTIONIST MODELS OF STEREO VISION.
C. V. Stewart.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 776. 1988. Thesis (Ph.D.).]
109807 THE SEMANTICS OF PROGRAM SLICING.
T. Reps and W. Yang.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 777. 1988.]
109808 A CASE FOR DIRECT-MAPPED CACHES.
M. D. Hill.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 778. 1988.]
109809 WEAK SHARP MINIMA AND EXACT PENALTY FUNCTIONS.
M. C. Ferris.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 779. 1988.]
109810 DISTRIBUTED SCHEDULING FOR A CHANGING ENVIRONMENT.
P. E. Krueger.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 780. 1988. Thesis (Ph.D.).]
VOL. 10, NO. 9 09/12/88
109811 FUNCTIONAL COMPLETENESS OF THE MIXED LAMBDA-CALCULUS AND COMBINATORY
LOGIC.
H. R. Nielson and F. Nielson.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Report no. 88-23. 1988.]
109812 COMPUTER GENERATION OF PICTORIAL EXPLANATIONS.
S. K. Feiner.
[Brown University. Computer Science Department. Technical report
CS-87-30. 1987. Thesis (Ph.D.). "This report is a revised version of
a thesis submitted in partial fulfillment of the requirements for the
degree of Doctor of Philosophy in the Department of Computer Science
at Brown University, May 1987."]
109813 EFFICIENT PARALLELISM FOR STRUCTURED DATA: DIRECTED REACHABILITY IN
SP DAGS.
F. N. Afrati, D. Q. Goldin, and P. C. Kanellakis.
[Brown University. Computer Science Department. Technical report
CS-88-07. 1988.]
109814 OBSERVER: AN OBJECT SERVER FOR AN OBJECT-ORIENTED DATABASE SYSTEM.
A. H. Skarra, S. B. Zdonik, and S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-88-08. 1987.]
109815 ELEMENTS OF RELATIONAL DATABASE THEORY.
P. C. Kanellakis.
[Brown University. Computer Science Department. Technical report
CS-88-09. 1988.]
109816 INHERITANCE AS AN INCREMENTAL MODIFICATION MECHANISM OR WHAT LIKE IS
AND ISN'T LIKE.
P. Wegner and S. B. Zdonik.
[Brown University. Computer Science Department. Technical report
CS-88-10. 1988.]
109817 THE DESIGN AND VERIFICATION OF FINITE STATE HARDWARE CONTROLLERS.
E. M. Clarke et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-145. 1987.]
109818 RESULTS OF PARALLEL IMPLEMENTATION OF OPS5 ON THE ENCORE
MULTIPROCESSOR.
A. Gupta et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-87-146. 1987.]
109819 TOWARD A REFORM OF THE DEFENSE DEPARTMENT SOFTWARE ACQUISITION POLICY.
P. Samuelson.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-86-TR-1. 1986.]
109820 EVALUATION OF ADA ENVIRONMENTS. EXECUTIVE SUMMARY. CHAPTER 1.
CHAPTER 2.
N. H. Weiderman et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-1. 1987. Principal investigators: Nelson H. Weiderman
and Nico Haberman. Project members: Mark W. Borger, Mark H. Klein,
Stefan F. Landherr, and Roger Smeaton. Contributors: Neal Altman,
Richard D'Ippolito, John Kochmar, and Alice Sun.]
109821 ADA ADOPTION HANDBOOK: A PROGRAM MANAGER'S GUIDE. VERSION 1.0.
J. Foreman and J. B. Goodenough.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-9. 1987.]
109822 A GUIDE TO THE CLASSIFICATION AND ASSESSMENT OF SOFTWARE ENGINEERING
TOOLS.
R. Firth et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-10. 1987.]
109823 CHARACTERIZING THE SOFTWARE PROCESS: A MATURITY FRAMEWORK.
W. S. Humphrey.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-11. 1987.]
109824 THE USE OF REPRESENTATION CLAUSES AND IMPLEMENTATION-DEPENDENT
FEATURES IN ADA: 1. OVERVIEW.
B. C. Meyers and A. L. Cappellini.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-14. 1987.]
109825 TIMING VARIATION IN DUAL LOOP BENCHMARKS.
N. Altman and N. H. Weiderman.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-21. 1987.]
109826 FACTORS CAUSING UNEXPECTED VARIATIONS IN ADA BENCHMARKS.
N. Altman.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-22. 1987.]
109827 FINAL EVALUATION OF MIPS M/500.
D. V. Klein and R. Firth.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-25. 1987.]
109828 ADA FOR EMBEDDED SYSTEMS: ISSUES AND QUESTIONS.
N. H. Weiderman et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-26. 1987.]
109829 ADA PERFORMANCE BENCHMARKS ON THE MICROVAX II: SUMMARY AND RESULTS.
VERSION 1.0.
P. Donohoe.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-27. 1987.]
109830 A SURVEY OF REAL-TIME PERFORMANCE BENCHMARKS FOR THE ADA PROGRAMMING
LANGUAGE.
P. Donohoe.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-28. 1987.]
109831 ANNUAL TECHNICAL REPORT FOR ADA EMBEDDED SYSTEMS TEST PROJECT.
N. H. Wiederman et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-31. 1987.]
109832 PROTOTYPE REAL-TIME MONITOR: EXECUTIVE SUMMARY.
R. Van Scoy.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-35. 1987.]
109833 ADA PERFORMANCE BENCHMARKS ON THE MOTOROLA MC68020: SUMMARY AND
RESULTS. VERSION 1.0.
P. Donohoe.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-40. 1987.]
109834 REPORT ON THE SEI WORKSHOP ON ADA IN FRESHMAN COURSES.
G. Ford.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-44. 1987. Workshop held in June 1987. Gary Ford,
editor.]
109835 VIEWS FOR EVOLUTION IN PROGRAMMING ENVIRONMENTS.
J. R. Nestor.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-45. 1987.]
109836 EVOLVING PERSISTENT OBJECTS IN A DISTRIBUTED ENVIRONMENT.
J. R. Nestor.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-46. 1987.]
109837 IDL: BACKGROUND AND STATUS.
D. L. Stone and J. R. Nestor.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-47. 1987.]
109838 INTERFACING ADA AND SQL.
C. Engle et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-87-TR-48. 1987.]
109839 A PRACTICAL APPLICATION OF THE CEILING PROTOCOL IN A REAL-TIME SYSTEM.
C. D. Locke and J. B. Goodenough.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-SR-3. 1988.]
109840 THE PRIORITY CEILING PROTOCOL: A METHOD FOR MINIMIZING THE BLOCKING
OF HIGH-PRIORITY ADA TASKS.
J. B. Goodenough and L. Sha.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-SR-4. 1988.]
109841 INTRODUCTION TO THE SERPENT USER INTERFACE MANAGEMENT SYSTEM.
L. Bass et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-5. 1988.]
109842 DETERMINATION OF A DEPTH MAP FROM AN IMAGE SEQUENCE.
L. Marce and P. Bouthemy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 765. 1987. Also issued as Publication
interne 382, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109843 AVERAGE CASE COMPLEXITY ANALYSIS OF THE RETE MULTI-PATTERN MATCH
ALGORITHM.
L. Albert and F. Fages.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 773. 1987.]
109844 EFFECTIVE BEHAVIOUR ALGEBRAS.
P. Darondeau and S. Yoccoz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 776. 1987. Also issued as Publication
interne 383, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109845 CENTAUR: THE SYSTEM.
P. Borras et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 777. 1987.]
109846 A SYSTOLIC MACHINE FOR STRING CORRECTION.
P. Frison and D. Lavenier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 780. 1987. Also issued as Publication
interne 384, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109847 BOUNDARY CONTROL OF QUASILINEAR ELLIPTIC EQUATIONS.
E. Casas and L. A. Fernandez.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 782. 1988.]
109848 ON WEAK LUMPABILITY IN MARKOV CHAINS.
G. Rubino and B. Sericola.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 787. 1987. Also issued as Publication
interne 387, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109849 REPRESENTING STEREO DATA WITH THE DELAUNAY TRIANGULATION.
J. D. Boissonnat, O. D. Faugeras, and E. Le Bras-Mehlman.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 788. 1988.]
109850 MAINTAINING REPRESENTATIONS OF THE ENVIRONMENT OF A MOBILE ROBOT.
N. Ayache and O. D. Faugeras.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 789. 1988.]
109851 A FEW STEPS TOWARD ARTIFICIAL 3D VISION.
O. D. Faugeras.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 790. 1988.]
109852 PARALLEL MANIPULATORS. PART 2: THEORY. SINGULAR CONFIGURATIONS AND
GRASSMANN GEOMETRY.
J.-P. Merlet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 791. 1988.]
109853 ON POSITIVE OCCUR-CHECKS IN UNIFICATION.
P. Le Chenadec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 792. 1988.]
109854 AN IMPLEMENTATION MODEL FOR REASONING WITH COMPLEX OBJECTS.
Q. Chen and G. Gardarin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 793. 1988.]
109855 A UNIFORM APPROACH TO TYPE THEORY.
G. Huet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 795. 1988.]
109856 PERMUTATION OF TRANSITIONS: AN EVENT STRUCTURE SEMANTICS FOR CCS.
G. Boudol and I. Castellani.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 798. 1988.]
109857 POSTPROCESSING SCHEMES FOR SOME MIXED FINITE ELEMENTS.
R. Stenberg.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 800. 1988.]
109858 THE SOS OBJECT-ORIENTED COMMUNICATION SERVICE.
M. Makpangou and M. Shapiro.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 801. 1988.]
109859 VARIATIONAL FORMULATION AND ALGORITHM FOR TRACE OPERATOR IN DOMAIN
DECOMPOSITION CALCULATIONS.
J.-F. Bourgat et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 804. 1988.]
109860 IMPLEMENTING QUERIES AND UPDATES ON UNIVERSAL SCHEME INTERFACES.
C. Lecluse and N. Spyratos.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 805. 1988.]
109861 PRACTICAL CELLULAR DIVIDERS.
F. P. Preparata and J. E. Vuillemin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 807. 1988.]
109862 GAUSSIAN LIMITING DISTRIBUTIONS FOR THE NUMBER OF COMPONENTS IN
COMBINATORIAL STRUCTURES.
P. Flajolet and M. Soria.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 809. 1988.]
109863 ALGORITHM PR SUPERSCRIPT 2 FOR THE PARALLEL SIZE REDUCTION OF THE 0.1
MULTIKNAPSACK PROBLEM.
G. Plateau, C. Roucairol, and I. Valabregue.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 811. 1988.]
109864 SOJOURN TIMES IN FINITE MARKOV PROCESSES.
G. Rubino and B. Sericola.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 812. 1988. Also issued as Publication
interne 395, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109865 INDUCTION ON OPEN PROPERTIES.
J.-C. Raoult.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 813. 1988. Also issued as Publication
interne 393, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109866 GIVING UP A HIERARCHICAL PLAN IN DESIGN ACTIVITY.
W. Visser.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 814. 1988. "This text is an English,
slightly revised version of a paper, presented in French, at the
COGNITIVA87 conference...."]
109867 SEMANTIQUE DE PARLOG: UN LANGAGE LOGIQUE PARALLELE.
G. Richard and A. Rizk.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 815. 1988.]
109868 PARTIAL EVALUATION WITH INFERENCE RULES.
L. Hascoeet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 817. 1988.]
109869 A SIMPLE ANALYSIS OF EXPRESSNET.
P. Jacquet and P. Muhlethaler.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 818. 1988.]
109870 INTRODUCING SYMBOLIC PROBLEM SOLVING TECHNIQUES IN THE DEPENDENCE
TESTING PHASES OF A VECTORIZER.
A. Lichnewsky and F. Thomasset.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 820. 1988.]
109871 ON THE EXPRESSION OF GOVERNMENT AND BINDING PRINCIPLES BY CONTEXTUAL
DISCONTINUOUS GRAMMARS.
P. Saint-Dizier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 821. 1988. Also issued as Publication
interne 397, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109872 CONFLUENCE RESULTS FOR THE PURE STRONG CATEGORICAL C.C.L. -
LAMBDA-CALULI AS SUB-SYSTEMS OF C.C.L.
T. Hardin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 822. 1988.]
109873 THE FINITE AUTOMATON OF AN ELEMENTARY CYCLIC SET.
P. Le Chenadec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 824. 1988.]
109874 SINGULARITY ANALYSIS OF GENERATING FUNCTIONS.
P. Flajolet and A. Odlyzko.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 826. 1988.]
109875 NORMAL LIMITING DISTRIBUTION FOR THE SIZE AND THE EXTERNAL PATH
LENGTH OF TRIES.
P. Jacquet and M. Regnier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 827. 1988.]
109876 MORE ON SPEEDING UP CIRCULARITY TESTS FOR ATTRIBUTE GRAMMARS.
M. Jourdan and D. Parigot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 828. 1988.]
109877 ANALYSIS OF A STACK ALGORITHM FOR RANDOM LENGTH PACKET COMMUNICATION.
P. Jacquet and E. Merle.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 831. 1988.]
109878 DETERMINING THE EXIT TIME DISTRIBUTION FOR A CLOSED CYCLIC NETWORK.
F. Baccelli, W. A. Massey, and P. E. Wright.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 832. 1988.]
109879 ON THE EXECUTION OF PARALLEL PROGRAMS ON MULTIPROCESSOR SYSTEMS - A
QUEUEING THEORY APPROACH.
F. Baccelli and Z. Liu.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 833. 1988.]
109880 THE FNC-2 SYSTEM: ADVANCES IN ATTRIBUTE GRAMMARS TECHNOLOGY.
M. Jourdan and D. Parigot.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 834. 1988.]
109881 SPECIFYING THE BEHAVIOR OF GRAPHICAL OBJECTS USING ESTEREL.
D. Clement and J. Incerpi.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 836. 1988.]
109882 PRESENTATION ET EVALUATION DE LA COMPLEXITE EN MOYENNE D'ALGORITHMES
DE FILTRAGE DANS LES MOEURS D'INFERENCE (ALGORITHMES RETE ET ARBRE
D'UNIFICATION).
L. Albert.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 837. 1988.]
109883 HYBRID DYNAMICAL SYSTEMS THEORY AND THE LANGUAGE "SIGNAL."
A. Benveniste, B. Le Goff, and P. Le Guernic.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 838. 1988. Also issued as Publication
interne 403, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
109884 TYPOL: A FORMALISM TO IMPLEMENT NATURAL SEMANTICS.
T. Despeyroux.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 94. 1988.]
109885 OPTIMAL DISCRETE-TIME LQR PROBLEMS FOR PARABOLIC SYSTEMS WITH
UNBOUNDED INPUT - APPROXIMATION AND CONVERGENCE.
I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-35. 1988.]
109886 FINITE-DIMENSIONAL APPROXIMATION FOR OPTIMAL FIXED-ORDER COMPENSATION
OF DISTRIBUTED PARAMETER SYSTEMS.
D. S. Bernstein and I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-36. 1988.]
109887 NON-OSCILLATORY SPECTRAL FOURIER METHODS FOR SHOCK WAVE CALCULATIONS.
W. Cai, D. Gottlieb, and C.-W. Shu.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-37. 1988.]
109888 GALERKIN APPROXIMATION FOR INVERSE PROBLEMS FOR NONAUTONOMOUS
NONLINEAR DISTRIBUTED SYSTEMS.
H. T. Banks, S. Reich, and I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-38. 1988.]
109889 THE IMAGINARY QUADRATIC FIELDS FOR CLASS NUMBER 4.
S. Arno.
[Institute for Defense Analysis (IDA). Supercomputing Research
Center. SRC-TR-88-002. 1988.]
109890 SOME LARGE PRIMES AND THE SIERPINSKI PROBLEM.
D. A. Buell and J. Young.
[Institute for Defense Analysis (IDA). Supercomputing Research
Center. SRC-TR-88-004. 1988.]
109891 ACTIVE ZONES IN CSG FOR ACCELERATING BOUNDARY EVALUATION, REDUNDANCY
ELIMINATION, INTERFERENCE DETECTION, AND SHADING ALGORITHMS.
J. R. Rossignac and H. B. Voelcker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13490. 1988.]
109892 AN INVESTIGATION OF THE SWITCH LEVEL APPROACH FOR VLSI TIMING
ANALYSIS.
O. H. P. Hallot.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR054. 1988.]
109893 A SEMANTICS FOR DEFAULT LOGIC.
R. A. T. Guerreiro.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR055. 1988.]
109894 APL2 AND LISP: A COMPARISON.
R. A. T. Guerreiro.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR057. 1988.]
109895 ON THE UNIQUENESS OF SOLUTION TO THE CAUCHY PROBLEM FOR ELLIPTIC
EQUATIONS IN TWO VARIABLES.
S. Fujii.
[Kyoto University. Research Institute for Mathematical Sciences.
RIMS-627. 1988.]
109896 LINEAR TIME ALGORITHM FOR MINIMUM NETWORK PARTITION.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-350. 1988.]
109897 ESTIMATED PERFORMANCE OF A GATEWAY ROUTING-TABLE CACHE.
D. C. Feldmeier.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-352. 1988.]
020414 A HIGH-LEVEL SIGNAL PROCESSING PROGRAMMING LANGUAGE.
J. E. Hicks Jr.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-414. 1988. Thesis (Master of Computer Science and
Engineering). "Submitted to the Department of Electrical Engineering
and Computer Science on January 15, 1988, in partial fulfillment of
the requirements for the degrees of Bachelor of Computer Science and
Engineering and Bachelor of Electrical Science and Engineering and
Master of Computer Science and Engineering."]
020416 AUTOMATIC QUALITATIVE ANALYSIS OF ORDINARY DIFFERENTIAL EQUATIONS
USING PIECEWISE LINEAR APPROXIMATIONS.
E. P. Sacks.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-416. 1988. Thesis (Ph.D.). Also issued as
AI-TR-1031, Artificial Intelligence Laboratory, Massachusetts
Institute of Technology.]
109898 SATURATED IDEALS OBTAINED VIA RESTRICTED COLLAPSE OF (ALMOST) HUGE
CARDINALS.
F. Franek.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-09. 1987.]
109899 SPECIFYING MULTI-LANGUAGE ENVIRONMENTS.
S. Jarzabek.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-07. n.d.]
109900 A METHOD FOR SPECIFYING FORM-ORIENTED USER INTERFACES.
S. Jarzabek.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-06. n.d.]
109901 WHAT IS THE DIFFERENCE BETWEEN ADAPTIVE SYSTEMS AND LEARNING SYSTEMS?
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-05. 1988.]
109902 ON THE SEMANTICS OF PRIORITY SYSTEMS.
R. Janicki and P. E. Lauer.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-04. 1988.]
109903 THE PROBLEM OF UNSTRUCTURED TRAINING PATTERNS IN A STRUCTURE-LEARNING
SYSTEM.
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-03. 1988.]
109904 STRATEGIES: A TOOL TO CHARACTERIZE DIFFERENT EXECUTION SEMANTICS OF
NON-SEQUENTIAL SYSTEMS, VERSION II.
R. Janicki and M. Koutny.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-02. n.d.]
109905 REPRESENTATION OF STRUCTURES AND GARBAGE COLLECTION IN MCMASTER
POPLOG.
I. Bruha.
[McMaster University. Department of Computer Science and Systems.
Technical report 88-01. 1987.]
109906 HOW TO RELIEVE A PROGRAMMER FROM SYNCHRONIZATION DETAILS.
R. Janicki.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-10. n.d.]
109907 ISOMORPHISMS OF INFINITE STEINER TRIPLE SYSTEMS II.
F. Franek.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-08. n.d.]
109908 COMPUTER CONTROL PROTOTYPE FOR BEAM STEERING SYSTEMS WITHIN THE
TANDEM VAN DE GRAAFF ACCELERATOR.
W. F. S. Poehlman, J. Wong, and R. A. McNaught.
[McMaster University. Department of Computer Science and Systems.
Technical report 87-07. n.d.]
109909 B++-TREE: A NEW ACCESS METHOD SUPPORTING LEAST FIXPOINT COMPUTATION
OF RECURSIVE RELATIONS.
H. Lu and M.-C. Shan.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB2/88. 1988.]
109910 A STUDY OF INSTRUCTION PREFETCHING AND PIPELINING OF 8088/286/386
MICROPROCESSORS.
K. T. Lua.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA4/88. 1988.]
109911 ANALYSIS OF A SIMPLE YET EFFICIENT CONVEX HULL ALGORITHM.
M. Golin and R. Sedgewick.
[Princeton University. Department of Computer Science. CS-TR-130-87.
1987.]
109912 ROTATION DISTANCE, TRIANGULATIONS, AND HYPERBOLIC GEOMETRY.
D. D. Sleator, R. E. Tarjan, and W. P. Thurston.
[Princeton University. Department of Computer Science. CS-TR-131-88.
1988. "This is a revised and expanded version of a paper that
appeared in the [Proceedings of the] 18th Annual ACM Symposium on
Theory of Computing [1986]."]
109913 A FAST LAS VEGAS ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON.
K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk.
[Princeton University. Department of Computer Science. CS-TR-132-88.
1988.]
109914 REAL-TIME CONCURRENT COLLECTION ON STOCK MULTIPROCESSORS.
A. W. Appel, J. R. Ellis, and K. Li.
[Princeton University. Department of Computer Science. CS-TR-133-88.
1988.]
109915 LOWER BOUNDS TO RANDOMIZED ALGORITHMS FOR GRAPH PROPERTIES.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-134-88.
1988.]
109916 PROPERTIES OF MULTISTAGE INTERCONNECTION NETWORKS.
A. S. Youssef.
[Princeton University. Department of Computer Science. CS-TR-135-88.
1988. Thesis (Ph.D.).]
109917 ON THE COMPLEXITY OF PARTIAL ORDER PRODUCTIONS.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-136-88.
1988.]
109918 TIGHT LOWER BOUNDS FOR SHELLSORT.
M. A. Weiss and R. Sedgewick.
[Princeton University. Department of Computer Science. CS-TR-137-88.
1988.]
109919 ON SELECTING THE K LARGEST WITH MEDIAN TESTS.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-138-88.
1988.]
109920 NEAR-OPTIMAL TIME-SPACE TRADEOFF FOR ELEMENT DISTINCTNESS.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-139-88.
1988.]
109921 COMPILING SEPARABLE RECURSIONS.
J. F. Naughton.
[Princeton University. Department of Computer Science. CS-TR-140-88.
1988.]
109922 BENCHMARKING MULTI-RULE RECURSION EVALUATION STRATEGIES.
J. F. Naughton.
[Princeton University. Department of Computer Science. CS-TR-141-88.
1988.]
109923 RUNTIME TAGS AREN'T NECESSARY.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-142-88.
1988.]
109924 SIMPLE GENERATIONAL GARBAGE COLLECTION AND FAST ALLOCATION.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-143-88.
1988.]
109925 RECIPES FOR GEOMETRY AND NUMERICAL ANALYSIS. PART I: AN EMPIRICAL
STUDY.
D. Dobkin and D. Silver.
[Princeton University. Department of Computer Science. CS-TR-144-88.
1988.]
109926 MINIMEAN OPTIMAL KEY ARRANGEMENTS IN HASH TABLES.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-145-88.
1988.]
109927 SCHEDULING REAL-TIME TRANSACTIONS: A PERFORMANCE EVALUATION.
R. Abbott and H. Garcia-Molina.
[Princeton University. Department of Computer Science. CS-TR-146-88.
1988.]
109928 SUPPORTING PROBABILISTIC DATA IN A RELATIONAL SYSTEM.
H. Garcia-Molina and D. Porter.
[Princeton University. Department of Computer Science. CS-TR-147-88.
1988.]
109929 AN OPTIMAL ALGORITHM FOR INTERSECTING LINE SEGMENTS IN THE PLANE.
B. Chazelle and H. Edelsbrunner.
[Princeton University. Department of Computer Science. CS-TR-148-88.
1988.]
109930 ALGORITHMS FOR FINDING A MAXIMUM BIPARTITE SUBGRAPH FOR SPECIAL
CLASSES OF GRAPHS.
S. S. Yeh and A. S. LaPaugh.
[Princeton University. Department of Computer Science. CS-TR-149-88.
1988.]
109931 MINIMIZING EXPANSIONS OF RECURSIONS.
J. F. Naughton and Y. Sagiv.
[Princeton University. Department of Computer Science. CS-TR-150-88.
1988.]
109932 TELEMATICS RESEARCH AT PRINCETON - 1987.
R. Abbott et al.
[Princeton University. Department of Computer Science. CS-TR-151-88.
1988.]
109933 AN EFFICIENT ALGORITHM FOR FINDING THE CSG REPRESENTATION OF A SIMPLE
POLYGON.
D. P. Dobkin et al.
[Princeton University. Department of Computer Science. CS-TR-152-88.
1988.]
109934 SEARCHING FOR EMPTY CONVEX POLYGONS.
D. P. Dobkin, H. Edelsbrunner, and M. H. Overmars.
[Princeton University. Department of Computer Science. CS-TR-153-88.
1988.]
109935 FASTER ALGORITHMS FOR THE SHORTEST PATH PROBLEM.
R. K. Ahuja et al.
[Princeton University. Department of Computer Science. CS-TR-154-88.
1988.]
109936 TIGHT BOUNDS ON THE STABBING NUMBER OF SPANNING TREES IN EUCLIDEAN
SPACE.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-155-88.
1988.]
109937 ARCHITECTURES FOR TWO-DIMENSIONAL LATTICE COMPUTATIONS WITH LINEAR
SPEEDUP.
S. D. Kugelmass.
[Princeton University. Department of Computer Science. CS-TR-156-88.
1988. Thesis (Ph.D.).]
109938 A FAST LAS VEGAS ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON.
K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk.
[Princeton University. Department of Computer Science. CS-TR-157-88.
1988.]
109939 QUERY PROCESSING IN A HETEROGENEOUS RETRIEVAL NETWORK.
P. Simpson.
[Princeton University. Department of Computer Science. CS-TR-158-88.
1988.]
109940 MULTIPROCESSOR MAIN MEMORY TRANSACTION PROCESSING.
K. Li and J. F. Naughton.
[Princeton University. Department of Computer Science. CS-TR-159-88.
1988.]
109941 NEGOTIATING DATA ACCESS IN FEDERATED DATABASE SYSTEMS.
R. Alonso and D. Barbara.
[Princeton University. Department of Computer Science. CS-TR-160-88.
1988.]
109942 MESSAGE ORDERING IN A MULTICAST ENVIRONMENT.
H. Garcia-Molina and A. Spauster.
[Princeton University. Department of Computer Science. CS-TR-161-88.
1988.]
109943 COPYING GARBAGE COLLECTION IN THE PRESENCE OF AMBIGUOUS REFERENCE.
A. W. Appel and D. R. Hanson.
[Princeton University. Department of Computer Science. CS-TR-162-88.
1988.]
109944 A TIGHT AMORTIZED BOUND FOR PATH REVERSAL.
D. Ginat, D. D. Sleator, and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-163-88.
1988.]
109945 FINDING MINIMUM-COST FLOWS BY DOUBLE SCALING.
R. K. Ahuja et al.
[Princeton University. Department of Computer Science. CS-TR-164-88.
1988.]
109946 LOAD BALANCING IN TWO TYPES OF COMPUTATIONAL ENVIRONMENTS.
L. L. Cova.
[Princeton University. Department of Computer Science. CS-TR-165-88.
1988.]
109947 LOWER BOUNDS ON THE COMPLEXITY OF POLYTOPE RANGE SEARCHING.
B. Chazelle.
[Princeton University. Department of Computer Science. CS-TR-166-88.
1988. "A preliminary version of this work...appeared in the
proceedings of the 28th Annual IEEE Symposium on Foundations of
Computer Science (1987)."]
109948 VISIBILITY AND INTERSECTION PROBLEMS IN PLANE GEOMETRY.
B. Chazelle and L. J. Guibas.
[Princeton University. Department of Computer Science. CS-TR-167-88.
1988. "A preliminary version of this paper was presented at the First
Annual ACM Symposium on Computational Geometry, June 1985."]
109949 OBSERVATIONAL EQUIVALENCE WITH NONSEQUENTIAL OBSERVATIONS.
J. Winkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 615. 1987.]
109950 THE TEMPORAL LOGIC FOR EVENT STRUCTURES.
W. Penczek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 616. 1987.]
109951 BACKPROJECTION METHODS: COMPARATIVE STUDY USING THE IRRAD SYSTEM OF
IMAGE RECONSTRUCTION.
W. L. Nowinski, M. Tataj, and A. Torun.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 617. 1988.]
109952 IMPROVING DATABASE SYSTEM BY QUERY FILES.
W. Rzeczkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 618. 1988.]
109953 GEOMETRICAL ASPECTS OF MEASURES OF DEPENDENCE FOR RANDOM VECTORS.
W. Wysocki.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 619. 1988.]
109954 ECONOMICAL AND OPTIMAL CARRY-LOOKAHEAD (CLA) UNITS FOR HIGH-SPEED
BINARY ADDERS.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 620. 1988.]
109955 HIGH-SPEED GENERATION OF CERTAIN PARAMETRIC SPACE-CURVES.
J. Jurkowski and S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 621. 1988.]
109956 THE CORE KNOWLEDGE SYSTEM.
T. M. Strat and G. B. Smith.
[SRI International. Artificial Intelligence Center. Technical note
426. 1987.]
109957 LOCALIZING EXPRESSION OF AMBIGUITY.
J. Bear and J. R. Hobbs Sr.
[SRI International. Artificial Intelligence Center. Technical note
428. 1987.]
109958 LOCAL PRAGMATICS.
J. R. Hobbs Sr. and P. Martin.
[SRI International. Artificial Intelligence Center. Technical note
429. 1987.]
109959 EXPLAINING EVIDENTIAL ANALYSES.
T. M. Strat and J. D. Lowrance.
[SRI International. Artificial Intelligence Center. Technical note
430. 1988.]
109960 A PRACTICAL NONMONOTONIC THEORY FOR REASONING ABOUT SPEECH ACTS.
D. Appelt and K. Konolige.
[SRI International. Artificial Intelligence Center. Technical note
432. 1988.]
109961 RATIONAL INTERACTION AS THE BASIS FOR COMMUNICATION.
P. R. Cohen and H. J. Levesque.
[SRI International. Artificial Intelligence Center. Technical note
433. 1988.]
109962 METHODOLOGICAL NOTES ON A COMPUTATIONAL MODEL OF REFERRING.
A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
434. 1988.]
109963 THE DESCRIPTIVE APPROACH TO REFERENCE: WHY IT IS DIFFICULT TO WORK
WITH, AND WHY WE HAVE TO.
A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
435. 1988.]
109964 DONNELLAN'S DISTINCTION AS AN ADEQUACY TEST FOR A REFERRING MODEL.
A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
436. 1988.]
109965 A UNIFORM ARCHITECTURE FOR PARSING AND GENERATION.
S. M. Shieber.
[SRI International. Artificial Intelligence Center. Technical note
437. 1988.]
109966 MANAGEMENT OF MISCOMMUNICATIONS: TOWARD A SYSTEM FOR AUTOMATIC
TELEPHONE INTERPRETATION OF JAPANESE-ENGLISH DIALOGUES.
S. L. Oviatt.
[SRI International. Artificial Intelligence Center. Technical note
438. 1988.]
109967 THE LITERAL GOAL AND DISCOURSE PURPOSE OF REFERRING.
A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
439. 1988.]
109968 A DESCRIPTIVE MODEL OF REFERENCE USING DEFAULTS.
D. Appelt and A. Kronfeld.
[SRI International. Artificial Intelligence Center. Technical note
440. 1988.]
025190 VIEWPOINT: TOWARD A COMPUTER FOR VISUAL THINKERS.
S. E. Kim.
[Stanford University. Department of Computer Science.
STAN-CS-88-1190. January 1988. Thesis (Ph.D.). "A dissertation
submitted to the Committee on Graduate Studies of Stanford University
in partial fulfillment of the requirements for the degree of Doctor
of Philosophy in Computers and Graphic Design."]
025191 INSTANTANEOUS ROBOT MOTION WITH CONTACT BETWEEN SURFACES.
C. Cai.
[Stanford University. Department of Computer Science.
STAN-CS-88-1191. January 1988. Thesis (Ph.D.).]
025193 MATHEMATICAL WRITING.
D. E. Knuth, T. Larrabee, and P. M. Roberts.
[Stanford University. Department of Computer Science.
STAN-CS-88-1193. January 1988. "This report is based on a course [CS
209] of the same name given at Stanford University during autumn
quarter, 1987."]
025194 GENERATION OF MODEL-BASED KNOWLEDGE-ACQUISITION TOOLS FOR
CLINICAL-TRIAL ADVICE SYSTEMS.
M. A. Musen.
[Stanford University. Department of Computer Science.
STAN-CS-88-1194. January 1988. Thesis (Ph.D.).]
025195 A LOWER BOUND FOR RADIO BROADCAST.
A. Bar-Noy, N. Linial, and D. Peleg.
[Stanford University. Department of Computer Science.
STAN-CS-88-1195. February 1988.]
025197 THE VMP MULTIPROCESSOR: INITIAL EXPERIENCE, REFINEMENTS AND
PERFORMANCE EVALUATION.
D. R. Cheriton et al.
[Stanford University. Department of Computer Science.
STAN-CS-88-1197. March 1988.]
025198 A UNIFIED SYSTEM OF PARAMETERIZATION FOR PROGRAMMING LANGUAGES.
J. Lamping.
[Stanford University. Department of Computer Science.
STAN-CS-88-1198. April 1988. Thesis (Ph.D.).]
025199 PROJECTIONS OF VECTOR ADDITION SYSTEM REACHABILITY SETS ARE
SEMILINEAR.
H. K. Buening, T. Lettmann, and E. W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-88-1199. March 1988.]
025200 PARALLEL APPROXIMATION ALGORITHMS FOR BIN PACKING.
R. J. Anderson, E. W. Mayr, and M. K. Warmuth.
[Stanford University. Department of Computer Science.
STAN-CS-88-1200. March 1988.]
025201 SINGULARITY ANALYSIS OF GENERATING FUNCTIONS.
P. Flajolet and A. Odlyzko.
[Stanford University. Department of Computer Science.
STAN-CS-88-1201. April 1988.]
025202 PROVING TERMINATION PROPERTIES OF PROLOG PROGRAMS: A SEMANTIC
APPROACH.
M. Baudinet.
[Stanford University. Department of Computer Science.
STAN-CS-88-1202. March 1988.]
025203 ON THE SEMANTICS OF TEMPORAL LOGIC PROGRAMMING.
M. Baudinet.
[Stanford University. Department of Computer Science.
STAN-CS-88-1203. May 1988. "Preliminary report."]
025204 EXPLOITING CONSTRAINTS IN DESIGN SYNTHESIS.
J. J. Finger.
[Stanford University. Department of Computer Science.
STAN-CS-88-1204. April 1987. Thesis (Ph.D.).]
025205 DYNAMICS FOR ROBOT CONTROL: FRICTION MODELING AND ENSURING EXCITATION
DURING PARAMETER IDENTIFICATION.
B. S. R. Armstrong.
[Stanford University. Department of Computer Science.
STAN-CS-88-1205. May 1988. Thesis (Ph.D.).]
025206 A PARALLEL LISP SIMULATOR.
J. S. Weening.
[Stanford University. Department of Computer Science.
STAN-CS-88-1206. May 1988.]
025207 KINEMATIC ANALYSIS AND DESIGN OF REDUNDANT ROBOT MANIPULATORS.
J. W. Burdick IV.
[Stanford University. Department of Computer Science.
STAN-CS-88-1207. March 1988. Thesis (Ph.D).]
025208 TOETJES.
T. Feder.
[Stanford University. Department of Computer Science.
STAN-CS-88-1208. June 1988.]
025209 COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEM.
A. V. Goldberg, S. A. Plotkin, and E. Tardos.
[Stanford University. Department of Computer Science.
STAN-CS-88-1209. June 1988.]
025210 STRING-FUNCTIONAL SEMANTICS FOR FORMAL VERIFICATION OF SYNCHRONOUS
CIRCUITS.
A. Bronstein and C. L. Talcott.
[Stanford University. Department of Computer Science.
STAN-CS-88-1210. June 1988.]
025211 SUBLINEAR-TIME PARALLEL ALGORITHMS FOR MATCHING AND RELATED PROBLEMS.
A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya.
[Stanford University. Department of Computer Science.
STAN-CS-88-1211. June 1988.]
025212 INFORMATION REQUIREMENTS AND THE IMPLICATIONS FOR PARALLEL
COMPUTATION.
P. H. Worley.
[Stanford University. Department of Computer Science.
STAN-CS-88-1212. June 1988. Thesis (Ph.D.).]
025213 EXPLOITING RECURSION TO SIMPLIFY RPC COMMUNICATION ARCHITECTURES.
D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-88-1213. June 1988. Also issued as CSL-TR-88-360, Computer
Systems Laboratory, Stanford University.]
109969 A CONSTRUCTIVE VERSION OF GPSG FOR MACHINE TRANSLATION.
C. Hauenschild and S. Busemann.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 59. 1988.]
109970 A CONSTRUCTIVE VIEW OF GPSG OR HOW TO MAKE IT WORK.
S. Busemann and C. Hauenschild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 60. 1988.]
109971 USING CONSTRAINTS IN A CONSTRUCTIVE VERSION OF GPSG.
W. Weisweber.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 61. 1988.]
109972 DISCOURSE STRUCTURE - SOME IMPLICATIONS FOR MACHINE TRANSLATION.
C. Hauenschild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 62. 1988.]
109973 VIBRATION OF A LEVITATED DROP.
A. G. P. Warham.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 110/88. 1988.]
109974 AN AUTOMATIC ALGORITHM FOR IMMUNOASSAY CURVE CALIBRATION USING
CONTROLLED QUADRATIC SPLINES.
M. G. Cox and H. M. Jones.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 116/88. 1988.]
109975 EMPLOYING USABILITY ENGINEERING CONCEPTS IN THE EVALUATION OF A
CBT/IV WORKSTATION.
R. E. Rengger and M. C. R. Turner.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 117/88. 1988.]
109976 INFLUENTIAL SUBSETS DIAGNOSTICS BASED ON MULTIPLE CORRELATIONS.
R. Cleroux, J.-M. Helbling, and N. Ranger.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 581. 1988.]
109977 CONTINUITY PROPERTIES OF THE NORMAL CONE TO THE LEVEL SETS OF A
QUASICONVEX FUNCTION.
J. Borde and J.-P. Crouzeix.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 622. 1987.]
109978 ADDING PERFORMANCE ASPECTS TO SPECIFICATION LANGUAGES.
G. v. Bochmann and J. G. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 630. 1987.]
109979 TELEMAC: A REMOTE-CONTROLLED USER INTERFACE SERVER.
G. Gagnon and J. G. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 631. 1987.]
109980 A SURVEY ON FIFO NETS.
A. Finkel and L. Rosier.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 632. 1987.]
109981 CONCEPTION D'UN SYSTEME EXPERT POUR LA MODELISATION DES DONNEES.
R. Planche, C. St-Jacques, and J. G. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 633. 1987.]
109982 PRINCIPLES OF AN ICONS-BASED COMMAND LANGUAGE.
C. Frasson and M. Er-radi.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 635. 1987.]
109983 VHDL: TESTS, PERFORMANCE MEASUREMENTS AND GUIDELINES.
M. Loughzail et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 636. 1987.]
109984 A NEW CLASS OF ANALYZABLE CFSMS WITH UNBOUNDED FIFO CHANNELS:
APPLICATION TO COMMUNICATION PROTOCOL AND DISTRIBUTED SOLUTION OF THE
MUTUAL EXCLUSION PROBLEM +.
A. Finkel.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 639. 1988.]
109985 CALCULUS OF COMMUNICATING SYSTEMS FOR REFINED OBSERVATION OF ACTIONS.
M. Itoh.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 640. 1988.]
109986 BGC: BIBLIOTHEQUE DE FONCTIONS GRAPHIQUES EN LANGAGE C.
J.-F. Mondou, T. G. Crainic, and S. Couture.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 641. 1987.]
109987 PROTOCOL TESTING USING AUTOMATIC TRACE ANALYSIS.
G. v. Bochmann et al.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 642. 1988.]
109988 AN EQUIVALENT MATHEMATICAL PROGRAM FOR MONOTONE VARIATIONAL
INEQUALITY PROBLEMS SUBJECT TO LINEAR EQUALITY CONSTRAINTS.
O. Drissi-Kaitouni.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 644. 1988.]
109989 ASYMPTOTIC DISTRIBUTION OF THE SAMPLE AUTOCORRELATIONS OF A SEASONAL
NONSTATIONARY PROCESS.
A. Latour and R. Roy.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 645. 1988.]
109990 LE LIVRE ELECTRONIQUE EBOOK3.
J. Savoy.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 646. 1988.]
109991 COOP: CONCURRENT OBJECT ORIENTED PROLOG.
J. G. Vaucher, G. Lapalme, and J. Malenfant.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 647. 1988.]
109992 VERIFICATION OF INPUT CONSTRAINTS FOR SYNCHRONOUS CIRCUITS.
M. Langevin, C. Berthet, and E. Cerny.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 648. 1988.]
109993 GENERALIZED EULER OPERATORS FOR R-SETS.
H. Desaulniers and N. F. Stewart.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 649. 1988.]
109994 IMPACT OF QUEUED INTERACTION ON PROTOCOL SPECIFICATION AND
VERIFICATION.
G. v. Bochmann and A. Finkel.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 650. 1988.]
109995 AN ICONIC LANGUAGE FOR INTELLIGENT MANIPULATION OF SPATIAL
INFORMATION.
R. Carrier, C. Frasson, and J. Fugere.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 652. 1988.]
109996 REDUCTION TECHNIQUES FOR THE PROTOCOL REACHABILITY ANALYSIS.
M. Itoh.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 656. 1988.]
109997 METHODES DE TEST DE PROTOCOLES: ARCHITECTURES ET SELECTION DE TESTS.
G. v. Bochmann, R. Dssouli, and B. Sarikaya.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 657. 1988.]
109998 RECORD MANIPULATION IN PROLOG.
J. G. Vaucher.
[Universite de Montreal. Departement d'Informatique et de Recherche
Operationnelle. Publication 658. 1988.]
109999 WINSTON CHURCHILL FELLOWSHIP REPORT.
B. J. Reilly.
[University of Auckland. Department of Computer Science. Report no.
40. 1988. "A report on programs which promote the participation of
girls and women, and minorities, in computing, mathematics and
science in the United States of America."]
054396 INTELLIGENT AGENTS AS A BASIS FOR NATURAL LANGUAGE INTERFACES.
D. N. Chin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/396. 1988. Thesis (Ph.D.).]
054397 A COMPARISON BETWEEN THE PLM AND THE MC 68020 AS PROLOG PROCESSORS.
Y. N. Patt and C. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 87/397. 1988.]
054398 EXPLOITING CONCURRENCY TO ACHIEVE HIGH PERFORMANCE IN A SINGLE-CHIP
MICROARCHITECTURE.
W. W. Hwu.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/398. 1988. Thesis (Ph.D.).]
054399 IMPLEMENTING PROLOG VIA MICROPROGRAMMING A GENERAL PURPOSE HOST
COMPUTER.
J. Gee.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/399. 1987.]
054400 MODELING AND IMPLEMENTATION OF VISIBILITY IN PROGRAMMING LANGUAGES.
P. Garrison.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/400. 1987. Thesis (Ph.D.).]
054401 PERSISTENT LISP: STORING INTEROBJECT REFERENCES IN A DATABASE.
M. H. Butler.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/401. 1987. Thesis (Ph.D.).]
054402 COMPUTING THE ASPECT GRAPH FOR LINE DRAWING OF POLYHEDRAL OBJECTS.
Z. Gigus and J. Malik.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/402. 1988.]
054403 DIRECT FUNCTION CALLS IN LISP.
B. Zorn and P. N. Hilfinger.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/403. 1988.]
054404 A MEMORY ALLOCATION PROFILER FOR C AND LISP.
B. Zorn and P. N. Hilfinger.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/404. 1988.]
054405 THE DASH PROJECT: AN OVERVIEW.
D. P. Anderson and D. Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/405. 1988. Also issued as PROGRES report 88.1, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054406 FEATURES FOR MULTIPROCESSING IN SPUR LISP.
B. Zorn et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/406. 1988.]
054407 AN ADDRESS TRACE GENERATOR FOR TRACE-DRIVEN SIMULATION OF SHARED
MEMORY MULTIPROCESSORS.
F. Lacy.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/407. 1988. Master's Report.]
054408 A SURVEY OF PARALLEL ALGORITHMS FOR SHARED MEMORY MACHINES.
R. M. Karp and V. Ramachandran.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/408. 1988.]
054409 THE ARCHITECTURE OF PAN I.
R. A. Ballance, M. L. Van de Vanter, and S. L. Graham.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/409. 1987. Also issued as Working paper 87-4, PIPER Group,
Computer Science Division, University of California, Berkeley.]
054410 PAN I: AN INTRODUCTION FOR USERS.
R. A. Ballance and M. L. Van de Vanter.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/410. 1987. Also issued as Working paper 87-5, PIPER Group,
Computer Science Division, University of California, Berkeley.]
054411 OPD: A TOOLSET FOR OPTIMIZED PIPELINE DESIGN.
S. Krishna.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/411. 1988.]
054412 DESIGN AND IMPLEMENTATION OF A CMOS CHIP FOR PROLOG.
V. P. Srini et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/412. 1988.]
054413 OPTIMIZATION OF FILE MIGRATION IN DISTRIBUTED SYSTEMS.
OE. Kure.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/413. 1988. Thesis (Ph.D.).]
054415 PARALLEL UNIFICATION SCHEDULING IN PROLOG.
W. V. Citrin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/415. 1988. Thesis (Ph.D.).]
054416 SNAP-DRAGGING: INTERACTIVE GEOMETRIC DESIGN IN TWO AND THREE
DIMENSIONS.
E. A. Bier.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/416. 1988. Thesis (Ph.D.).]
054417 THREE CHARACTERIZATIONS OF GEOMETRIC CONTINUITY FOR PARAMETRIC CURVES.
B. A. Barsky and T. D. DeRose.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/417. 1988.]
054418 THE AQUARIUS NUMERIC PROCESSOR.
R. Yung.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/418. 1988. "Research Project submitted to the Department
of Electrical Engineering and Computer Sciences, University of
California, Berkeley, in partial satisfaction of the requirements for
the degree of Master of Science, Plan II."]
054419 DUES (DISPLAY UTILITIES AND ENVIRONMENTS FOR SIMULATION).
A. J. Wei.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/419. 1988. "Research Project submitted to the Department
of Electrical Engineering and Computer Sciences, University of
California, Berkeley, in partial satisfaction of the requirements for
the degree of Master of Sciences, Plan II."]
054420 WISH - A WINDOW-BASED SHELL FOR X.
M. Gray.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/420. 1988. Thesis (Ph.D.). Also issued as PROGRES report
88.3, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054421 APPROXIMATE ALGORITHMS FOR SOLVING QUEUEING NETWORK MODELS OF LARGE
DISTRIBUTED SYSTEMS.
H. R. Bahadori.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/421. 1988.]
054422 INTELLIGENT DECENTRALIZED CONTROL IN LARGE DISTRIBUTED COMPUTER
SYSTEMS.
J. C. Pasquale.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/422. 1988. Thesis (Ph.D.). Also issued as PROGRES report
88.2, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054424 PSEUDO DEVICES: USER-LEVEL EXTENSIONS TO THE SPRITE FILE SYSTEM.
B. B. Welch and J. K. Ousterhout.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/424. 1988.]
054425 ABSTRACT TIMING VERIFICATION FOR SYNCHRONOUS DIGITAL SYSTEMS.
D. E. Wallace.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/425. 1988. Thesis (Ph.D.). "This technical report consists
of the main body of [the author's] dissertation of the same title."]
054426 USER'S GUIDE TO ATV, AN ABSTRACT TIMING VERIFIER.
D. E. Wallace.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/426. 1988.]
054429 ON INFORMATION RETRIEVAL AND EVIDENTIAL REASONING.
L. A. Chen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/429. 1988.]
054430 A NEW INTERFACE SPECIFICATION METHODOLOGY AND ITS APPLICATION TO
TRANSDUCER SYNTHESIS.
G. Borriello.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/430. 1988. Thesis (Ph.D.).]
054433 KNOWLEDGE INTENSIVE PLANNING.
M. Luria.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/433. 1988. Thesis (Ph.D.).]
110000 FORMAL SPECIFICATION AND VERIFICATION OF ASYNCHRONOUS PROCESSES IN
HIGHER-ORDER LOGIC.
J. J. Joyce.
[University of Cambridge. Computer Laboratory. Technical report 136.
1988.]
110001 MASS TERMS AND PLURALS FROM LINGUISTIC THEORY TO NATURAL LANGUAGE
PROCESSING. AN INVESTIGATION INTO TWO LINGUISTIC THEORIES AND THEIR
POTENTIAL FOR COMPUTATIONAL MECHANISATION.
P. F. V. Hasle.
[University of Cambridge. Computer Laboratory. Technical report 137.
1988.]
110002 AUTHENTICATION: A PRACTICAL STUDY IN BELIEF AND ACTION.
M. Burrows, M. Abadi, and R. Needham.
[University of Cambridge. Computer Laboratory. Technical report 138.
1988.]
110003 PETRI NET THEORY: A SURVEY.
P. R. Manson.
[University of Cambridge. Computer Laboratory. Technical report 139.
1988.]
110004 LEARNING HARD CONCEPTS THROUGH CONSTRUCTIVE INDUCTION: FRAMEWORK AND
RATIONALE.
L. Rendell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1426. 1988.]
110005 IMPLEMENTATION OF FITTED SECOND ORDER ODE INTEGRATORS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1441. 1988.]
110006 MASSIVE PARALLELISM ACROSS THE METHOD IN ODES.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1442. 1988.]
110007 LEARNING STRATEGIC CONCEPTS IN COMPETITIVE PLANNING: AN
EXPLANATION-BASED APPROACH TO THE TRANSFER OF KNOWLEDGE ACROSS
DOMAINS.
G. Collins and L. Brinbaum.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1443. 1988.]
110008 THE LEIF LANGUAGE ORIENTED EDITOR: USER MANUAL, LANGUAGE DESCRIPTION
MANUAL, AND INSTALLATION GUIDE.
W. W. Smith, D. LaLiberte, and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1444. 1988.]
110009 DATA TRAFFIC MANAGEMENT SYSTEM: THE PROTOTYPE REPORT GENERATION
FACILITY.
G. G. Belford et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1445. 1988.]
110010 A STUDY OF THE INTERACTIONS BETWEEN OPERATING SYSTEM MEMORY
MANAGEMENT AND DATABASE BUFFER MANAGEMENT STRATEGIES.
K. Kim.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1446. 1988. Thesis (Ph.D.).]
110011 CONCURRENT CONSTRUCTIVE LOGIC.
C. M. Holt.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 255. 1988.]
110012 THE JOIN ALGORITHM: ORDERING MESSAGES IN REPLICATED SYSTEMS.
L. V. Mancini and G. Pappalardo.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 256. 1988.]
110013 CONTINUOUS ORTHONORMALIZATION ALGORITHMS FOR BOUNDARY VALUE PROBLEMS.
K. Wright.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 257. 1988.]
110014 OM: A VIRTUAL PROCESSOR FOR PARALLEL LOGIC PROGRAMS.
J. S. Conery and D. M. Meyer.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-01. 1987.]
110015 PERMUTATION GROUPS IN NC.
L. Babai, E. M. Luks, and A. Seress.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-02. 1987.]
110016 DESIGN AND IMPLEMENTATION OF A QUALITATIVE CONSTRAINT SATISFACTION
SYSTEM.
P. Thyagarajan and A. M. Farley.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-03. 1987.]
110017 RELIABLE MINIMUM-TIME BROADCAST NETWORKS.
A. M. Farley.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-06. 1987.]
110018 IMMUNITY TO SUBGRAPH FAILURES IN COMMUNICATION NETWORKS.
A. M. Farley and A. Proskurowski.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-07. 1988.]
110019 OBJECT ORIENTED PROGRAMMING WITH FIRST ORDER LOGIC.
J. S. Conery.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-09. 1987.]
110020 AUTOMATIC DERIVATION OF SYSTOLIC ARRAYS FOR LU DECOMPOSITION.
S. V. Rajopadhye.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-12. 1987.]
110021 I/O BEHAVIOR OF SYSTOLIC ARRAYS.
S. V. Rajopadnye.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-87-16. 1988.]
110022 CRITIQUING A SOFTWARE SPECIFICATION.
S. Fickas and P. Nagarajan.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-88-01. 1988.]
110023 QUALITATIVE REASONING IN ECONOMICS.
A. M. Farley and K.-P. Lin.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-88-03. 1988.]
110024 FAST PARALLEL ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM AND THE
SUBGRAPH ISOMORPHISM PROBLEMS FOR CLASSES OF PLANAR GRAPHS.
A. Lingas and A. Proskurowski.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-88-04. 1988.]
110025 PLAN ABSTRACTION BASED ON OPERATOR GENERALIZATION.
J. S. Anderson and A. M. Farley.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-88-05. 1988.]
110026 ALGORITHMS FOR STATIC TASK ASSIGNMENT AND SYMMETRIC CONTRACTION IN
DISTRIBUTED COMPUTING SYSTEMS.
V. M. Lo.
[University of Oregon. Department of Computer and Information
Science. CIS-TR-88-06. 1988.]
110027 NEAR-TESTABLE SETS.
J. Goldsmith et al.
[University of Washington. Department of Computer Science. Technical
report 87-11-06. n.d.]
110028 PARALLEL TRACE-DRIVEN SIMULATION OF MULTIPROCESSOR CACHE PERFORMANCE:
ALGORITHMS AND ANALYSIS.
Y.-B. Lin, J.-L. Baer, and E. D. Lazowska.
[University of Washington. Department of Computer Science. Technical
report 88-01-02. 1988.]
110029 AN OPEN ENVIRONMENT FOR BUILDING PARALLEL PROGRAMMING SYSTEMS.
B. N. Bershad et al.
[University of Washington. Department of Computer Science. Technical
report 88-01-03. 1988.]
110030 SPINNING VERSUS BLOCKING IN PARALLEL SYSTEMS WITH UNCERTAINTY.
J. Zahorjan, E. D. Lazowska, and D. L. Eager.
[University of Washington. Department of Computer Science. Technical
report 88-03-01. 1988.]
110031 TAILORING A PARALLEL TRACE-DRIVEN SIMULATION TECHNIQUE TO SPECIFIC
MULTIPROCESSOR CACHE COHERENCE PROTOCOLS.
Y.-B. Lin, J.-L. Baer, and E. D. Lazowska.
[University of Washington. Department of Computer Science. Technical
report 88-03-02. 1988.]
110032 AN ACCURATE AND EFFICIENT PERFORMANCE ANALYSIS TECHNIQUE FOR
MULTIPROCESSOR SNOOPING CACHE-CONSISTENCY PROTOCOLS.
M. K. Vernon, E. D. Lazowska, and J. Zahorjan.
[University of Washington. Department of Computer Science. Technical
report 88-03-04. 1988.]
110033 DESIGN AND IMPLEMENTATION OF THE UW ILLUSTRATED COMPILER.
K. Andrews, R. R. Henry, and W. K. Yamamoto.
[University of Washington. Department of Computer Science. Technical
report 88-03-07. 1988.]
110034 AN EXPERIMENTAL STUDY OF PARALLEL MERGE SORT.
R. J. Anderson.
[University of Washington. Department of Computer Science. Technical
report 88-05-01. 1988.]
110035 SUPER REGISTERS.
J.-L. Baer and S. L. Min.
[University of Washington. Department of Computer Science. Technical
report 88-05-03. 1988.]
110036 A STUDY OF MESSAGE COMBINING NETWORKS FOR LARGE SCALE PARALLEL
PROCESSOR SYSTEMS WITH MEMORY HOTSPOTS.
J. S. Cameron.
[University of Washington. Department of Computer Science. Technical
report 88-05-04. 1988.]
110037 INTERCONNECTED LANS: PERFORMANCE TOOLS AND PERFORMANCE MEASUREMENTS.
R. Day.
[University of Washington. Department of Computer Science. Technical
report 88-06-06. n.d. Thesis (Ph.D.).]
VOL. 10, NO. 10 10/28/88
110038 COMPLETE PROBLEMS AND STRONG POLYNOMIAL REDUCIBILITIES.
K. Ganesan and S. Homer.
[Boston University. Department of Computer Science. Technical report
88-001. 1988.]
110039 AUTOMATIC SYNTHESIS OF COMPUTER PERFORMANCE MODELS (A PMA PROGRESS
REPORT).
B. W. York.
[Boston University. Department of Computer Science. Technical report
88-002. 1988.]
110040 OPTIMAL COMBINATORIAL POWER FOR MULTISTAGE INTERCONNECTION NETWORKS.
L. Stiller.
[Boston University. Department of Computer Science. Technical report
88-003. 1988.]
110041 P-CREATIVE SETS VS. P-COMPLETELY CREATIVE SETS.
J. Wang.
[Boston University. Department of Computer Science. Technical report
88-008. 1988. Preliminary version: May 1988.]
110042 METAPHOR AND COGNITION.
B. Indurkhya.
[Boston University. Department of Computer Science. Technical report
88-009. 1988. "This paper presents a condensed form of the ideas that
... form the basis of ... [the author's] book 'Cognition and
Metaphor' under preparation for the MIT Press."]
110043 SELF-ORGANIZING NEURAL NETWORKS FOR PERCEPTION OF VISUAL MOTION.
J. A. Marshall.
[Boston University. Department of Computer Science. Technical report
88-010. 1988.]
110044 SPECULATIONS ON THE PERSONAL COMPUTER OF THE YEAR 2000.
B. H. Myers et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-115. 1988. "In fall of 1987, Apple Computer, Inc. sponsored
a contest for teams of undergraduate and graduate students from
twelve universities to propose designs for what the personal computer
of the year 2000 would be like. This report includes the two entries
from Carnegie Mellon University." Edited by Brad A. Myers.]
110045 SPEAKER-INDEPENDENT PHONE RECOGNITION USING HIDDEN MARKOV MODELS.
K.-F. Lee and H.-W. Hon.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-121. 1988.]
110046 ON RATIONALITY AND LEARNING.
J. Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-122. 1988.]
110047 SIMILARITY, CONSERVATISM, AND RATIONALITY.
J. Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-123. 1988.]
110048 ARTIFICIAL INTELLIGENCE AND RATIONAL SELF-GOVERNMENT.
J. Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-124. 1988.]
110049 PLANNING SEQUENCES OF SQUEEZE-GRASPS TO ORIENT AND GRASP POLYGONAL
OBJECTS.
M. T. Mason, K. Y. Goldberg, and R. H. Taylor.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-127. 1988.]
110050 THE MACH EXCEPTION HANDLING FACILITY.
D. L. Black et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-129. 1988.]
110051 AVERAGE-CASE ANALYSIS OF ALGORITHMS FOR CONVEX HULLS AND VORONOI
DIAGRAMS.
R. A. Dwyer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-132. 1988. Thesis (Ph.D.).]
110052 LEARNING EFFECTIVE SEARCH CONTROL KNOWLEDGE: AN EXPLANATION-BASED
APPROACH.
S. Minton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-133. 1988. Thesis (Ph.D.).]
110053 IMPLICIT KNOWLEDGE AND RATIONAL REPRESENTATION.
J. Doyle.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-134. 1988.]
110054 SOME ASPECTS OF IMPREDICATIVITY: NOTES ON WEYL'S PHILOSOPHY OF
MATHEMATICS AND ON TODAY'S TYPE THEORY.
G. Longo.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-135. n.d.]
110055 THE META-DEVICE: AN OBJECT BASED, NON-RETAINED GRAPHICAL LAYER.
D. Giuse and L. Baumeister.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-136. 1988.]
110056 TOWARDS AUTOMATIC GENERATION OF OBJECT RECOGNITION PROGRAMS.
K. Ikeuchi and T. Kanade.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-138. 1988.]
110057 PROGRAMMABLE COMMAND LANGUAGES FOR WINDOW SYSTEMS.
R. J. Cohn.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-139. 1988. Thesis (Ph.D.).]
110058 IMPOSSIBILITY AND UNIVERSALITY RESULTS FOR WAIT-FREE SYNCHRONIZATION.
M. P. Herlihy.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-140. 1988.]
110059 BUILDING A SECURE DISTRIBUTED COMPUTER SYSTEM.
R. D. Sansom.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-141. 1988. Thesis (Ph.D.).]
110060 THE IMPACT OF NOISE ON LEARNING.
M. Tan and L. Eshelman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-144. 1988.]
110061 A COMPREHENSIVE STUDY OF ANALYSIS AND SYNTHESIS OF TONES BY SPECTRAL
ANALYSIS.
M.-H. Serra, D. Rubine, and R. Dannenberg.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-146. 1988.]
110062 LARGE-VOCABULARY SPEAKER-INDEPENDENT CONTINUOUS SPEECH RECOGNITION:
THE SPHINX SYSTEM.
K.-F. Lee.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-148. 1988. Thesis (Ph.D.).]
110063 REDUCING COMPUTATION BY UNIFYING INFERENCE WITH USER INTERFACE.
M. W. Perlin.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-150. 1988.]
110064 A CATEGORY-THEORETIC CHARACTERIZATION OF FUNCTIONAL COMPLETENESS.
G. Longo and E. Moggi.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-151. 1988.]
110065 C THREADS.
E. C. Cooper and R. P. Draves.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-154. 1988.]
110066 KNACK: SAMPLE-DRIVEN KNOWLEDGE ACQUISITION FOR REPORTING SYSTEMS.
G. Klinker.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-158. 1988.]
110067 AN EMPIRICAL STUDY OF LEARNING SPEED IN BACK-PROPAGATION NETWORKS.
S. E. Fahlman.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-162. 1988.]
110068 COMPUTATIONAL MODELS FOR PARALLEL COMPUTERS.
H. T. Kung.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-164. 1987.]
110069 PARTIAL EVALUATION: ITS APPLICATION TO COMPUTER GENERATOR GENERATION.
A. De Niel.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-166. 1988.]
110070 END OF YEAR REPORT FOR PARALLEL VISION ALGORITHM DESIGN AND
IMPLEMENTATION, JANUARY 15, 1987 - JANUARY 14, 1988.
T. Kanade and J. A. Webb.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-11.
1988.]
110071 THE EXISTENCE OF REFINEMENT MAPS.
M. Abadi and L. Lamport.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 29. 1988. "A shorter version of this paper appeared in [the]
'Proceedings of the LICS Conference,' Edinburgh, Scotland, July
1988."]
110072 MODULA-3 REPORT.
L. Cardelli et al.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 31. 1988.]
110073 DEVELOPMENT AND ANALYSIS OF A WORKSTATION COMPUTER.
J. J. Eberle.
[Eidgenoessiche Technische Hochschule Zurich. Dissertation ETH 8431.
1987. Thesis (Doctor of Technical Sciences). "A dissertation
submitted to the Swiss Federal Institute of Technology, Zurich, for
the degree of Doctor of Technical Sciences."]
110074 ELECTRONIC MAIL SYSTEMS AND PROTOCOLS: OVERVIEW AND CASE STUDY.
B. Plattner and H. Lubich.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 87. 1988.]
110075 THE OBERON SYSTEM.
N. Wirth and J. Gutknecht.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 88. 1988.]
110076 GENERALIZED RAY TRACING AND POINT LOCATION.
S. Youssef.
[Florida State University. Supercomputer Computations Research
Institute. FSU-SCRI-88T-71. 1988.]
110077 SEMANTICS OF THE CONCURRENT LOGIC PROGRAMMONG LANGUAGE PARLOG.
G. Richard and A. Rizk.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 848. 1988.]
110078 MINIMAC: A HIGH-SPEED ACCESS PROTOCOL BASED ON A FREE ACCESS TREE
ALGORITHM.
P. Jacquet and P. Muhlethaler.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 849. 1988.]
110079 FREQUENCY ALLOCATION FOR HIGH SPEED COMMUNICATIONS.
P. Jacquet and P. Muhlethaler.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 850. 1988.]
110080 MAXIMUM QUEUE SIZE AND HASHING WITH LAZY DELETION.
C. M. Mathieu and J. S. Vitter.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 851. 1988.]
110081 A TRANSIENT ANALYSIS OF THE TWO-NODE SERIES JACKSON NETWORK.
F. Baccelli and W. A. Massey.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 852. 1988.]
110082 DYNAMIC, TRANSIENT AND STATIONARY BEHAVIOR OF THE M/G1/1 QUEUE VIA
MARTINGALES.
F. Baccelli and A. M. Makowski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 853. 1988.]
110083 OPTIMISATION D'UN ARBRE DE DECISION PAR UN ALGORITHME DE RECUIT
SIMULE: APPLICATION A LA RECONNAISSANCE DES VOYELLES ET
SEMI-VOYELLES.
V. Le Maire.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 854. 1988. Also issued as Publication
interne 402, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110084 ATOME: A BLACKBOARD ARCHITECTURE WITH TEMPORAL AND HYPOTHETICAL
REASONING.
H. Laasri et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 855. 1988.]
110085 MOTION AND STRUCTURE FROM MOTION IN A PIECEWISE PLANAR ENVIRONMENT.
O. Faugeras and F. Lustman.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 856. 1988.]
110086 LIGHTNET: A SET OF EFFICIENT HIGH SPEED ACCESS PROTOCOLS.
P. Jacquet and P. Muhlethaler.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 857. 1988.]
110087 NONAXISYMMETRIC VISCOUS LOWER BRANCH MODES IN AXISYMMETRIC SUPERSONIC
FLOWS.
P. W. Duck and P. Hall.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-42. 1988.]
110088 ON THE GENERATION OF MEAN FLOWS BY THE INTERACTION OF GOERTLER
VORTICES AND TOLLMEIN-SCHLICHTING WAVES IN CURVED CHANNEL FLOWS.
A. P. Bassom and P. Hall.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-43. 1988.]
110089 RECENT INSIGHTS INTO INSTABILITY AND TRANSITION TO TURBULENCE IN
OPEN-FLOW SYSTEMS.
M. V. Morkovin.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-44. 1988.]
110090 THE STRONG NONLINEAR INTERACTION OF TOLLMIEN-SCHLICHTING WAVES AND
TAYLOR-GOERTLER VORTICES IN CURVED CHANNEL FLOW.
J. Bennett, P. Hall, and F. T. Smith.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-45. 1988.]
110091 NONLINEAR TOLLMIEN-SCHLICHTING/VORTEX INTERACTION IN BOUNDARY LAYERS.
P. Hall and F. T. Smith.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-46. 1988.]
110092 COMPILING FOR THE HORIZON INSTRUCTION SET.
J. M. Draper.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-006. 1988.]
110093 THE FAST FOURIER TRANSFORM AND SPARSE MATRIX COMPUTATIONS: A STUDY OF
TWO APPLICATIONS ON THE HORIZON SUPERCOMPUTER.
D. A. Carlson and J. M. Conroy.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-007. 1988.]
110094 VECTORIZED MONTE CARLO MOLECULAR AERODYNAMICS SIMULATION OF THE
RALEIGH PROBLEM.
D. V. Pryor and P. J. Burns.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-008. 1988.]
110095 SUPPORT SYSTEM FOR SPECIFICATION PHASE OF COMMUNICATION SOFTWARE.
K. Shibata, W. Tanaka, and H. Hasegawa.
[Institute for New Generation Computer Technology (ICOT). TM-0406.
1987.]
110096 INTRODUCTION TO CAL.
K. Sakai and A. Aiba.
[Institute for New Generation Computer Technology (ICOT). TM-0422.
1987. Extended abstract.]
110097 CO-OPERATIVE HIGH PERFORMANCE SEQUENTIAL INFERENCE MACHINE: CHI-II.
S. Habata et al.
[Institute for New Generation Computer Technology (ICOT). TM-0426.
1987.]
110098 A GHC LANGUAGE PROCESSOR IN PROLOG AND GHC SAMPLE PROGRAMS FOR BENCH
MARKING.
S. Takagi, K. Ueda, and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TM-0439.
1988.]
110099 TOEST: A PROLOG BENCHMARK.
E. Tich and K. Susaki.
[Institute for New Generation Computer Technology (ICOT). TM-0451.
1988.]
110100 AN INTRODUCTION TO FIFTH GENERATION COMPUTER SYSTEMS (FGCS).
T. Kurozumi and T. Ichiko.
[Institute for New Generation Computer Technology (ICOT). TM-0453.
1988.]
110101 TOWARD AN EXPERT SYSTEM ARCHITECTURE FOR ROUTINE DESIGN - FOCUSING ON
CONSTRAINT REPRESENTATION AND AN APPLICATION MECHANISM FOR MECHANICAL
DESIGN.
Y. Nagai.
[Institute for New Generation Computer Technology (ICOT). TM-0456.
1988. Extended abstract.]
110102 LEARNING GENERAL RULES WITH EXCEPTIONS: AN APPLICATION OF
CIRCUMSCRIPTION.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TM-0476.
1988.]
110103 ABSTRACT INTERPRETATION AND PARTIAL EVALUATION OF PROLOG PROGRAMS.
H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TM-0484.
1988. Original edition: September 9, 1986. Revised: October 17, 1986.
Reprinted: March 11, 1988.]
110104 BOOLEAN GROEBNER BASES.
K. Sakai and Y. Sato.
[Institute for New Generation Computer Technology (ICOT). TM-0488.
1988.]
110105 AN EXPERT SYSTEM ARCHTECTURE FOR SWITCHING SYSTEM DIAGNOSIS.
S. Wada and Y. Koseki.
[Institute for New Generation Computer Technology (ICOT). TM-0491.
1988.]
110106 INFORMATION STRUCTURING FOR ADVANCED DECISION SUPPORT SYSTEMS -
PROPOSAL OF A RESEARCH DECISION SUPPORT SYSTEM AND ITS
IMPLEMENTATIONS.
M. Toda et al.
[Institute for New Generation Computer Technology (ICOT). TM-0493.
1988.]
110107 A FAST PROLOG-BASED INFERENCE ENGINE KORE/IE.
T. Shintani.
[Institute for New Generation Computer Technology (ICOT). TM-0496.
1988.]
110108 LEARNING CONTEXT-FREE GRAMMARS FROM STRUCTURAL DATA IN POLYNOMIAL
TIME.
Y. Sakakibara.
[Institute for New Generation Computer Technology (ICOT). TM-0498.
1988.]
110109 DESIGN, IMPLEMENTATION, AND EVALUATION OF A RELATIONAL DATABASE
ENGINE FOR VARIABLE LENGTH RECORDS.
F. Itoh et al.
[Institute for New Generation Computer Technology (ICOT). TR-295.
1987.]
110110 AN EXPERIMENTAL KNOWLEDGE BASE MACHINE WITH UNIFICATION-BASED
RETRIEVAL CAPABILITY.
S. Shibayama et al.
[Institute for New Generation Computer Technology (ICOT). TR-311.
1987.]
110111 ASCRIPTION: APPLICATION OF THE CIRCUMSCRIPTION TECHNIQUE TO VARIOUS
CONJECTURAL REASONING.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TR-315.
1987.]
110112 A CONSTRUCTIVE METHOD FOR GRAMMATICAL INFERENCE OF LINEAR LANGUAGES
BASED ON CONTROL SETS.
Y. Takada.
[Institute for New Generation Computer Technology (ICOT). TR-317.
1987.]
110113 PARSING GAPPING GRAMMARS IN PARALLEL.
Y. Matsumoto.
[Institute for New Generation Computer Technology (ICOT). TR-318.
1987.]
110114 CONSTRAINT ANALYSIS ON JAPANESE DEPENDENCY STRUCTURE.
R. Sugimura and K. Mukai.
[Institute for New Generation Computer Technology (ICOT). TR-320.
1987.]
110115 EFFICIENT STREAM PROCESSING IN GHC AND ITS EVALUATION ON A PARALLEL
INFERENCE MACHINE.
N. Itoh, E. Kuno, and T. Oohara.
[Institute for New Generation Computer Technology (ICOT). TR-323.
1987.]
110116 PARALLEL INFERENCE MACHINE RESEARCH IN FGCS PROJECT.
A. Goto.
[Institute for New Generation Computer Technology (ICOT). TR-324.
1987.]
110117 GENERATING NATURAL LANGUAGE RESPONSES APPROPRIATE TO CONVERSATIONAL
SITUATIONS - ON THE CASE OF THE JAPANESE.
N. Noguchi, M. Takahashi, and H. Yasukawa.
[Institute for New Generation Computer Technology (ICOT). TR-326.
1987.]
110118 LOCALLY PARALLEL CACHE DESIGN BASED ON KL1 MEMORY ACCESS
CHARACTERISTICS.
A. Matsumoto et al.
[Institute for New Generation Computer Technology (ICOT). TR-327.
1987.]
110119 PROOF COMPILING TECHNIQUE BASED ON REALIZABILITY AND PROOF
NORMALIZATION.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-328.
1987.]
110120 COMPUTING PRIMITIVE ELEMENTS FOR EXTENSION FIELDS.
K. Yokoyama, M. Noro, and T. Takeshima.
[Institute for New Generation Computer Technology (ICOT). TR-329.
1987.]
110121 INFERRING PARSERS OF CONTEXT-FREE LANGUAGES FROM STRUCTURAL EXAMPLES.
Y. Sakakibara.
[Institute for New Generation Computer Technology (ICOT). TR-330.
1987.]
110122 DETECTING FUNCTIONALITY OF LOGIC PROGRAMS BASED ON ABSTRACT HYBRID
INTERPRETATION.
T. Kanamori, K. Horiuchi, and T. Kawamura.
[Institute for New Generation Computer Technology (ICOT). TR-331.
1988.]
110123 HANDLING KNOWLEDGE BY ITS REPRESENTATIVE.
C. Sakama and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-332.
1988.]
110124 PRUNING SEARCH TREES IN ASSUMPTION-BASED REASONING.
K. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-333.
1988.]
110125 DEDUCTIVE APPROACH FOR NESTED RELATIONS.
K. Yokota.
[Institute for New Generation Computer Technology (ICOT). TR-334.
1988.]
110126 A'UM - PARALLEL OBJECT-ORIENTED LANGUAGE UPON KL1.
K. Yoshida and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-335.
1988.]
110127 A MODEL THEORY FOR HYPOTHETICAL REASONING.
K. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-336.
1988.]
110128 AN EVALUATION METHOD FOR STRATIFIED PROGRAMS UNDER THE EXTENDED
CLOSED WORLD ASSUMPTION.
H. Seki and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-337.
1988.]
110129 LAZY REFERENCE COUNTING METHOD - AN INCREMENTAL GARBAGE COLLECTION
METHOD FOR PARALLEL INFERENCE MACHINES.
A. Goto et al.
[Institute for New Generation Computer Technology (ICOT). TR-338.
1988.]
110130 AN AXIOMATIC VERIFICATION METHOD FOR SYNCHRONIZATIONS OF GUARDED HORN
CLAUSES PROGRAMS.
M. Murakami.
[Institute for New Generation Computer Technology (ICOT). TR-339.
1988.]
110131 AN EFFICIENT TERMINATION DETECTION AND ABORTION ALGORITHM FOR
DISTRIBUTED PROCESSING SYSTEMS.
K. Rosusawa, N. Ichiyoshi, and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-341.
1988.]
110132 A SIMPLE PROGRAMMING SYSTEM WRITTEN IN GHC AND ITS REFLECTIVE
OPERATIONS.
J. Tanaka.
[Institute for New Generation Computer Technology (ICOT). TR-343.
1988.]
110133 PARTIAL EVALUATION OF GHC PROGRAMS BASED ON UR-SET WITH CONSTRAINT
SOLVING.
H. Fujita, A. Okumura, and K. Furukawa.
[Institute for New Generation Computer Technology (ICOT). TR-344.
1988.]
110134 A NEW DECLARATIVE SEMANTICS OF FLAT GUARDED HORN CLAUSES.
G. Levi.
[Institute for New Generation Computer Technology (ICOT). TR-345.
1988.]
110135 STRUCTURAL SUPERIMPOSED CODEWORD AS AN INDEXING SCHEME FOR TERMS.
A. Nakase et al.
[Institute for New Generation Computer Technology (ICOT). TR-347.
1988.]
110136 EVALUATION OF THE KL1 PARALLEL SYSTEM ON A SHARED MEMORY
MULTIPROCESSOR.
M. Sato and A. Goto.
[Institute for New Generation Computer Technology (ICOT). TR-349.
1988.]
110137 DERIVING A COMPILATION METHOD FOR PARALLEL LOGIC LANGUAGES.
Y. Kohda and J. Tanaka.
[Institute for New Generation Computer Technology (ICOT). TR-350.
1988.]
110138 ANALYSIS OF PARALLEL INFERENCE MACHINES TO ACHIEVE DYNAMIC LOAD
BALANCING.
S. Sugie, M. Yoneyama, and A. Goto.
[Institute for New Generation Computer Technology (ICOT). TR-352.
1988.]
110139 PILING GC-EFFICIENT GARBAGE COLLECTION FOR AI LANGUAGES.
K. NakaJima.
[Institute for New Generation Computer Technology (ICOT). TR-354.
1988.]
110140 TOWARD MECHANIZATION OF MATHEMATICS - PROOF CHECKER AND TERM
REWRITING SYSTEM.
K. Sakai.
[Institute for New Generation Computer Technology (ICOT). TR-355.
1988.]
110141 NONMONOTONIC PARALLEL INHERITANCE NETWORK.
C. Sakama and A. Okumura.
[Institute for New Generation Computer Technology (ICOT). TR-356.
1988.]
110142 ON THE SEMANTICS OF HYPOTHETICAL REASONING AND TRUTH MAINTENANCE.
K. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-357.
1988.]
110143 LEARNING SIMPLE LANGUAGES IN POLYNOMIAL TIME.
T. Yokomori.
[Institute for New Generation Computer Technology (ICOT). TR-358.
1988.]
110144 COMPETITIVE PARTIAL EVALUATION - SOME REMAINING PROBLEMS OF PARTIAL
EVALUATION.
A. Takeuchi and H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TR-361.
1988.]
110145 CAL: A THEORETICAL BACKGROUND OF CONSTRAINT LOGIC PROGRAMMING AND ITS
APPLICATIONS.
K. Sakai and A. Aiba.
[Institute for New Generation Computer Technology (ICOT). TR-364.
1988.]
110146 CONTROL OF AN ACTIVE SUSPENSION SYSTEM FOR A WHEELED VEHICLE.
E. Horiuchi et al.
[Institute for New Generation Computer Technology (ICOT). TR-368.
1988.]
110147 A PARALLEL-INFERENCE PROBLEM-SOLVING MECHANISM FOR COMPUTER ROOM
LAYOUT CAD SYSTEM.
Y. Iizuka, T. Watanabe, and F. Mori.
[Institute for New Generation Computer Technology (ICOT). TR-369.
1988.]
110148 JULIA SETS IN QUATERNIONS.
A. Norton.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13416. 1988.]
110149 SUBASSEMBLY STABILITY.
N. Boneschanscher and H. van der Drift.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13569. n.d.]
110150 RANDOM SEQUENTIAL PACKING SIMULATIONS IN THREE DIMENSIONS FOR ALIGNED
CUBES.
D. W. Cooper.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13810. 1988.]
110151 THE DATA TRANSFORM METHOD: JACKSON METHOD + DATA TYPE CONSTRUCTORS.
R. C. B. Martins and P. A. S. Veloso.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR051. 1988.]
110152 AN EXPERT SYSTEM FOR WEATHER FORECASTING.
V. H. A. Duarte, F. A. C. Giorno, and S. A. Sandri.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR058. 1988.]
099091 SOFTWARE STRUCTURING FOR VLSI CAD.
-438 J. Katzenelson and R. Zippel.
[1988.]
099091 CIRCUIT DESIGN CRITERIA FOR STABLE LATERAL INHIBITION NEURAL NETWORKS.
-439 J. L. Wyatt Jr. and D. L. Standley.
[1988.]
099091 REDUCING THE PARALLEL SOLUTION TIME OF SPARSE CIRCUIT MATRICES USING
-440 REORDERED GAUSSIAN ELIMINATION AND RELAXATION.
D. Smart and J. White.
[1988.]
099091 WAVEFORM RELAXATION APPLIED TO TRANSIENT DEVICE SIMULATION.
-441 M. Reichelt et al.
[1988.]
099091 A MIXED FREQUENCY-TIME APPROACH FOR FINDING THE STEADY-STATE SOLUTION
-444 OF CLOCKED ANALOG CIRCUITS.
K. Kundert, J. White, and A. Sangiovanni-Vincentelli.
[1988.]
099091 TECHNOLOGICAL DEVELOPMENT, STRATEGIC BEHAVIOR, AND GOVERNMENT POLICY
-446 IN INFORMATION TECHNOLOGY INDUSTRIES.
C. H. Ferguson.
[1988. Thesis (Ph.D.). "Submittted to the Department of Political
Science and Center for Technology, Policy, and Industrial Development
in January 1988 in partial fulfillment of the requirement for the
Degree of Doctor of Philosophy in Political Science."]
099091 THE RECONFIGURABLE ARITHMETIC PROCESSOR.
-449 S. Fiske and W. J. Dally.
[1988.]
099091 OBJECT-ORIENTED CONCURRENT PROGRAMMING IN CST.
-450 W. J. Dally and A. A. Chien.
[1988.]
110153 I/O AUTOMATA: A MODEL FOR DISCRETE EVENT SYSTEMS.
N. A. Lynch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-351. 1988.]
110154 IMPROVED ROUTING STRATEGIES WITH SUCCINCT TABLES.
B. Awerbuch et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-354. 1988.]
110155 TOWARD SHORTER ALGEBRAIC SPECIFICATIONS: A SIMPLE LANGUAGE DEFINITION
AND ITS COMPILATION TO PROLOG.
J. Heering and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8814. 1988.]
110156 TERM REWRITING SYSTEMS WITH RULE PRIORITIES.
J. C. M. Baeten et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8815. 1988.]
110157 THE CERTAINTY FACTOR MODEL AND ITS BASIS IN PROBABILITY THEORY.
L. C. van der Gaag.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8816. 1988.]
110158 STDWIN - A STANDARD WINDOW SYSTEM INTERFACE.
G. van Rossum.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8817. 1988.]
110159 AN EXACT INCREMENTAL HIDDEN SURFACE REMOVAL ALGORITHM.
A. A. M. Kujik, P. J. W. ten Hagen, and V. Akman.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8818. 1988.]
110160 THE POWER OF PHYSICAL REPRESENTATIONS.
V. Akman and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8819. 1988.]
110161 AN INTEGRATED TEXT AND SYNTAX-DIRECTED EDITOR.
M. H. Logger.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8820. 1988.]
110162 MODULAR SPECIFICATIONS IN PROCESS ALGEBRA - WITH CURIOUS QUEUES.
R. J. van Glabbeek and F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8821. 1988.]
110163 INCREMENTAL GENERATION OF PARSERS.
J. Heering, P. Klint, and J. G. Rekers.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8822. 1988.]
110164 ASF SYSTEM USER'S GUIDE.
P. R. H. Hendriks.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8823. 1988.]
110165 FACTORING WITH THE QUADRATIC SIEVE ON LARGE VECTOR COMPUTERS.
H. J. J. te Riele, W. M. Lioen, and D. T. Winter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8805. 1988.]
110166 A NUMERICAL STUDY OF THREE MOVING GRID METHODS FOR ONE-DIMENSIONAL
PARTIAL DIFFERENTIAL EQUATIONS WHICH ARE BASED ON THE METHOD OF
LINES.
R. M. Furzeland, J. G. Verwer, and P. A. Zegeling.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8806. 1988.]
044067 TWO PAPERS ON CSP.
A. W. Roscoe.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-67. 1988.]
044068 Z: GRAMMAR AND CONCRETE AND ABSTRACT SYNTAXES.
S. King, I. H. Sorensen, and J. Woodcock.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-68. 1988. Version 2.0.]
110167 INFINITE SETS OF PRIMES WITH FAST PRIMALITY TESTS AND QUICK
GENERATION OF LARGE PRIMES.
J. Pintz, W. L. Steiger, and E. Szemeredi.
[Rutgers. Department of Computer Science. DCS-TR-235. 1988.]
110168 SMALL TRANSVERSALS IN HYPERGRAPHS.
V. Chvatal and C. McDiarmid.
[Rutgers. Department of Computer Science. DCS-TR-236. 1988.]
110169 PACKING PATHS PERFECTLY.
J. Akiyama and V. Chvatal.
[Rutgers. Department of Computer Science. DCS-TR-237. 1988.]
110170 ON CUTTING-PLANE PROOFS IN COMBINATORIAL OPTIMIZATION.
V. Chvatal, W. Cook, and M. Hartmann.
[Rutgers. Department of Computer Science. DCS-TR-238. 1988.]
110171 P SUBSCRIPT 4 COMPARABILITY GRAPHS.
C. T. Hoang and B. A. Reed.
[Rutgers. Department of Computer Science. DCS-TR-239. 1988.]
110172 FORMULATING CONCEPTS AND ANALOGIES ACCORDING TO PURPOSE.
S. T. Kedar-Cabelli.
[Rutgers. Department of Computer Science. ML-TR-26. 1988. Thesis
(Ph.D.).]
110173 COMPUTING MEDIAN-OF-SQUARES REGRESSION LINES AND GUIDED TOPOLOGICAL
SWEEP.
H. Edelsbrunner and D. L. Souvaine.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-107.
1988.]
110174 KNOWLEDGE-BASED CIRCUIT DESIGN.
C. H. Tong.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-108.
1988. Thesis (Ph.D.). Dissertation submitted to the Department of
Computer Science, Stanford University.]
110175 CANONICAL PROBLEMS FOR QUADRATIC PROGRAMMING AND PROJECTIVE METHODS
FOR THEIR SOLUTIONS.
B. Kalantari.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-109.
1988.]
110176 AN APPROACH TO PROBLEM REDUCTION LEARNING.
S. C. Marsella.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-110.
1988.]
110177 DATA FLOW UPDATE VIA DOMINATOR AND ATTRIBUTE UPDATES.
M. D. Carroll.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-111.
1988. Thesis (Ph.D.).]
110178 AN ALGORITHM FOR QUADRATIC ZERO-ONE.
B. Kalantari and A. Bagchi.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-112.
1988.]
052095 CHANGE, PROCESS AND EVENTS.
C. E. Cleland.
[Stanford University. Center for the Study of Language and
Information. CSLI-87-95. 1987.]
052130 FIFTH YEAR REPORT TO THE SYSTEM DEVELOPMENT FOUNDATION: SITUATED
LANGUAGE RESEARCH PROGRAM.
J. Barwise et al.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-130. 1988. "Submitted by Jon Barwise, Principal
Investigator, Stanford University. David Israel, Principal
Investigator, SRI International John Perry, Principal Investigator,
Stanford University. Brian Cantwell Smith, Principal Investigator,
XEROX PARC." "With the assistance of: Stanley Peters, Director, CSLI.
Elizabeth Macken, Associate Director, CSLI. Ingrid Deiwiks, Assistant
to the Governing Board." "Elizabeth Macken, Editor."]
052131 LOCATIVE INVERSION IN CHICHEWA: A CASE STUDY OF FACTORIZATION IN
GRAMMAR.
J. Bresnan and J. M. Kanerva.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-131. 1988.]
048088 MEDICAL KNOWLEDGE AND DECISION MAKING.
-61 E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-61. 1988.]
110179 SUMEX: STANFORD UNIVERSITY MEDICAL EXPERIMENTAL COMPUTER RESOURCE,
RR-00785. ANNUAL REPORT - YEAR 15. SUBMITTED TO BIOMEDICAL RESEARCH
TECHNOLOGY PROGRAM, NATIONAL INSTITUTES OF HEALTH.
E. H. Shortliffe and E. A. Feigenbaum.
[United States. Public Health Service.$b(USPHS) 5 P41 RR00785-15.
June 1, 1988. Edward H. Shortliffe, Principal Investigator. Edward A.
Feigenbaum, Co-Principal Investigator.]
110180 IMAGE PROCESSING ON HYPERCUBE MULTIPROCESSORS.
R. Miller and S. E. Miller.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-05. 1988.]
110181 AN EFFICIENT ALGORITHM FOR EDGE COLORING PLANAR GRAPHS WITH DELTA
COLORS.
X. He.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-09. 1988.]
110182 A TESTABLE COMPLEX CMOS GATE REALIZATION OF BOOLEAN FUNCTIONS.
S. Chakravarty.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-10. 1988.]
110183 INTERACTIVE TESTING ENVIRONMENT USING CONNECTIONIST NETWORK
REPRESENTATION: THE 16PF TEST AS A CASE STUDY.
S. L. Hardt and K. U. Shin.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-11. 1988.]
110184 COMPUTER MEDIATED LESSON PLANNING FOR LANGUAGE ACQUISITION: REPORT
ONE.
S. L. Hardt, L. Kingsbury, and G. Phillips.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-12. 1988.]
110185 A METHOD FOR ORDERING CANDIDATE SUBMODULES IN FAULT DIAGNOSIS.
J. Chen and S. N. Srihari.
[State University of New York, Buffalo. Department of Computer
Science. Technical report 88-13. 1988.]
110186 APPLICATION OF ALGEBRAIC MULTIGRID (AMG) TO CONSTRAINED QUADRATIC
OPTIMIZATION.
P. Muszynski, U. Ruede, and C. Zenger.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8801. 1988.]
110187 PROGRAMMIERUNG MIT FUNKTIONSOBJEKTEN: KONSTRUKTIVE ERZEUGUNG
SEMANTISCHER BEREICHE UND ANWENDUNG AUF DIE PARTIELLE AUSWERTUNG.
H. Zierer.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8803. 1988.]
110188 AN AIRTRAVEL EXPERT DATABASE.
B. Freitag and O. Biernath.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8804. 1988.]
110189 ZUR VERTEILTEN IMPLEMENTIERUNG VON PETRINETZEN.
D. Taubner.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8805. 1988.]
110190 AN ALGORITHM FOR LEAST-SQUARES CIRCLE FITTING TO DATA WITH SPECIFIED
UNCERTAINTY ELLIPSES.
M. G. Cox and H. M. Jones.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 118/88. 1988.]
110191 EXPLORING EXPERIMENTALLY DERIVED USABILITY METRICS BY A LABORATORY
EVALUATION OF ELECTRONIC PAPER.
R. E. Rengger.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 119/88. 1988.]
110192 AN ALGORITHM FOR LOOP DETECTION IN CURSIVE SCRIPT RECOGNITION.
M. G. Cox and P. M. Harris.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 120/88. 1988.]
110193 PROBABILISTIC ANALYSIS OF OPTIMAL ALGORITHMS FOR THREE NP-HARD
PROBLEMS.
R. Terada.
[Universidade de Sao Paulo. Departamento de Ciencia da Computacao.
RT-MAC-8807. 1988.]
110194 ZUR GESTALTUNG DER BENUTZERSCHITTSTELLE BEIM EINSATZ VON
PROZESSLEITSYSTEMEN AUF SEESCHIFFEN.
A. M. Heinecke.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 129. 1987.]
110195 UNTERSUCHUNGEN ZUR DETEKTION UND LOKALISATION MARKANTER PUNKTE IN
FARBBILDERN.
T. Bartsch.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 131. 1987.]
110196 REMARKS ON THE STATUS OF 'INFERENCE' IN THE AREA OF 'KNOWLEDGE
REPRESENTATION.'
C. Habel.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 133. 1987.]
110197 PROTOCOL AND SERVICE SPECIFICATION WITH SDL: THE X.25 CASE STUDY.
D. Hogrefe.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 134. 1988.]
110198 HIERARCHIEN UEBER RELATIONENGEBILDEN.
C. Sielaff.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 135. 1988.]
110199 A DYNAMIC LOGIC PROGRAMMING LANGUAGE FOR RELATIONAL UPDATES.
S. Manchanda.
[University of Arizona. Department of Computer Science. TR 88-2.
1988. Thesis (Ph.D.). "A dissertation presented to ... The Graduate
School in Partial Fulfillment for the Degree of Doctor of Philosophy
in Computer Science, State University of New York at Stony Brook,
December 1987."]
110200 MU - A SYSTEM FOR SIMULATING AND IMPLEMENTING DISTRIBUTED AND
PARALLEL ALGORITHMS.
M. Livny and U. Manber.
[University of Arizona. Department of Computer Science. TR 88-4.
1987. "Preliminary version."]
110201 STATIC ANALYSIS OF PARALLEL LOGIC PROGRAMS.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 88-12.
1988.]
110202 THE DEVELOPMENT OF TWO DISTRIBUTED ALGORITHMS FOR NETWORK TOPOLOGY.
I. J. P. Elshoff and G. R. Andrews.
[University of Arizona. Department of Computer Science. TR 88-13.
1988.]
110203 DESIGN OF THE X-KERNEL.
N. C. Hutchinson and L. L. Peterson.
[University of Arizona. Department of Computer Science. TR 88-16.
1988.]
110204 UNIVERS: A NAME SERVER FOR THE NEXT GENERATION INTERNET.
M. Bowman, L. L. Peterson, and H. Rao.
[University of Arizona. Department of Computer Science. TR 88-17.
1988.]
110205 INTEGRATING AN OBJECT-ORIENTED PROGRAMMING LANGUAGE INTO A SYSTEM FOR
MIXED-LANGUAGE PROGRAMMING.
R. Hayes, N. C. Hutchinson, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 88-18.
1988.]
110206 DISTRIBUTED ROUND-ROBIN AND FIRST-COME FIRST-SERVE PROTOCOLS AND
THEIR APPLICATION TO MULTIPROCESSOR BUS ARBITRATION.
M. K. Vernon and U. Manber.
[University of Arizona. Department of Computer Science. TR 88-19.
1988.]
110207 CACTIS: A SELF-ADAPTIVE, CONCURRENT IMPLEMENTATION OF AN
OBJECT-ORIENTED DATABASE MANAGEMENT SYSTEM.
S. E. Hudson and R. King.
[University of Arizona. Department of Computer Science. TR 88-20.
1988.]
110208 FLOW ANALYSIS OF LOGIC PROGRAMS OVER ABSTRACT DOMAINS OF INFINITE
HEIGHT.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 88-21.
1988.]
110209 A METHOD FOR SOLVING SYNCHRONIZATION PROBLEMS.
G. R. Andrews.
[University of Arizona. Department of Computer Science. TR 88-22.
1988.]
110210 PRESERVING AND USING CONTEXT INFORMATION IN INTERPROCESS
COMMUNICATION.
L. L. Peterson, N. C. Buchholz, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 88-23.
1988.]
110211 USING INDUCTION TO DESIGN ALGORITHMS.
U. Manber.
[University of Arizona. Department of Computer Science. TR 88-24.
1988. "A preliminary version of this paper appeared as technical
report #660, Department of Computer Science, University of
Wisconsin-Madison, August 1986."]
110212 ON MESSAGE RESEQUENCING IN COMPUTER NETWORKS.
S. Chowdhury.
[University of Arizona. Department of Computer Science. TR 88-26.
1988.]
110213 IDEAS IN THE AIR: SPECULATIONS ON SMALL GROUP LEARNING, ENVIRONMENTAL
AND CULTURAL INFLUENCES ON COGNITION, AND EPISTEMOLOGY.
A. H. Schoenfeld.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 52.
1988.]
054423 REWRITE SYSTEMS, PATTERN MATCHING, AND CODE GENERATION.
E. Pelegri-Llopart.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/423. 1988. Thesis (Ph.D.). "This technical report is an
updated version of a dissertation submitted in partial satisfaction
of the requirements for the degree of Doctor of Philosophy in
Computer Science in the Graduate Division of the University of
California, Berkeley."]
054428 BARKING UP THE WRONG TREE: WHY OPTIMIZING COMPILERS ARE STILL UNABLE
TO MATCH ASSEMBLY LANGUAGE.
M. Sabatella.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/428. 1988.]
054431 A TREE TRANSFORMATION FACILITY USING TYPED REWRITE SYSTEMS.
C. Farnum.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/431. 1988.]
110214 A NEW PROPOSAL FOR A STANDARD HANGUL (OR KOREAN SCRIPT) CODE.
K. Kim, G. G. Belford, and B. W. Kong.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1447. 1988.]
110215 SLED: A MULTI-COLOR, TEXT-AND-GRAPHICS SLIDE EDITOR.
E. D. Grantston.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1448. 1988.]
110216 APPROXIMATION METHODS FOR THE CONSISTENT INITIALIZATION OF
DIFFERENTIAL-ALGEBRAIC EQUATIONS.
B. J. Leimkuhler.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1450. 1988. Thesis (Ph.D.).]
110217 THE CHARE-KERNEL LANGUAGE FOR PARALLEL PROGRAMMING: A PERSPECTIVE.
L. V. Kale and W. Shu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1451. 1988.]
110218 INTRODUCING ACTIONS INTO QUALITATIVE SIMULATION.
K. D. Forbus.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1452. 1988.]
110219 GENERALIZING SEMANTIC RULES OF ATTRIBUTE GRAMMARS USING LOGIC
PROGRAMS.
S. R. Sataluri.
[University of Iowa. Department of Computer Science. Technical report
88-05. 1988. Thesis (Ph.D.).]
110220 A UNIFORM METHOD FOR PROVING LOWER BOUNDS ON THE COMPUTATIONAL
COMPLEXITY OF LOGICAL THEORIES.
K. J. Compton and C. W. Henson.
[University of Michigan. Computing Research Laboratory. CRL-TR-04-87.
1987.]
110221 PERFORMANCE VARIABLE DRIVEN CONSTRUCTION METHODS FOR STOCHASTIC
ACTIVITY NETWORKS.
W. H. Sanders and J. F. Meyer.
[University of Michigan. Computing Research Laboratory. CRL-TR-05-87.
1987.]
110222 INTENSIVE HYPERCUBE COMMUNICATION I: PREARRANGED COMMUNICATION IN
LINK-BOUND MACHINES.
Q. F. Stout and B. Wager.
[University of Michigan. Computing Research Laboratory. CRL-TR-09-87.
1987. "A preliminary condensed version of this paper appears as
'Passing Messages in Link-Bound Hypercubes,' [in] 'Hypercube
Multiprocessors 1987,' M. Heath, ed., pp.251-257."]
110223 ALGEBRAIC OPERATIONAL SEMANTICS FOR MODULA-2.
Y. Gurevich and J. M. Morris.
[University of Michigan. Computing Research Laboratory. CRL-TR-10-87.
1987.]
110224 ZERO-ONE LAWS IN LOGIC AND COMBINATORICS.
K. J. Compton.
[University of Michigan. Computing Research Laboratory. CRL-TR-11-87.
1987.]
110225 PERFORMABILITY EVALUATION TECHNIQUES AND TOOLS.
J. F. Meyer.
[University of Michigan. Computing Research Laboratory. CRL-TR-13-87.
1987.]
110226 A VERSATILE APPROACH TO ACTION REASONING.
J. C. Weber.
[University of Rochester. Department of Computer Science. TR 237.
1988.]
110227 THE RHETORICAL KNOWLEDGE REPRESENTATION SYSTEM: A USER'S MANUAL (FOR
RHET VERSON 14.45).
J. F. Allen and B. W. Miller.
[University of Rochester. Department of Computer Science. TR 238.
1988. Revised: September 1988.]
110228 LEARNING AUTOMATA FROM ORDERED EXAMPLES.
S. Porat and J. A. Feldman.
[University of Rochester. Department of Computer Science. TR 241.
1988.]
110229 SOME EXPERIMENTS ON MULTIPLE-WAY NETWORK PARTITIONING ALGORITHMS.
L. A. Sanchis.
[University of Rochester. Department of Computer Science. TR 242.
1988.]
110230 PLAN-BASED GOAL-ORIENTED CLASSIFICATION.
J. C. Weber.
[University of Rochester. Department of Computer Science. TR 243.
1988.]
110231 FULL BELIEF.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 245.
1988.]
110232 PROBABILISTIC INFERENCE AND PROBABILISTIC REASONING.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 248.
1988.]
110233 PROBABILISTIC INFERENCE AND NON-MONOTONIC INFERENCE.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 249.
1988.]
110234 ABSTRACTION IN PLANNING.
J. D. Tenenberg.
[University of Rochester. Department of Computer Science. TR 250.
1988. Thesis (Ph.D.).]
110235 EPISTEMOLOGICAL RELEVANCE AND STATISTICAL KNOWLEDGE.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 251.
1988.]
110236 LEARNING IN STRUCTURED CONNECTIONIST NETWORKS.
M. A. Fanty.
[University of Rochester. Department of Computer Science. TR 252.
1988. Thesis (Ph.D.).]
110237 AGAINST CONDITIONALIZATION.
F. Bacchus, H. E. Kyburg Jr., and M. Thalos.
[University of Rochester. Department of Computer Science. TR 256.
1988.]
110238 HCI IN MAN-MACHINE STUDIES.
G. R. S. Weir.
[University of Tampere. Department of Computer Science. A-1988-5.
1988.]
110239 A NOTE ON THE COMPLEXITY OF TRIE COMPACTION.
J. Katajainen and E. Maekinen.
[University of Tampere. Department of Computer Science. A-1988-6.
1988.]
110240 GENERATING ARMSTRONG DATABASES FOR SETS OF FUNCTIONAL AND INCLUSION
DEPENDENCIES.
H. Mannila and K.-J. Raeihae.
[University of Tampere. Department of Computer Science. A-1988-7.
1988.]
110241 ON SOLVING SYSTEMS OF ALGEBRAIC EQUATIONS.
H. Kobayashi, S. Moritsugu, and R. W. Hogan.
[University of Tokyo. Department of Information Science. Technical
report 88-001. 1987.]
110242 INTEGRATED POLYTREES: A GENERALIZED MODEL FOR INTEGRATING SPATIAL
DECOMPOSITION AND BOUNDARY REPRESENTATION.
M. J. Duerst and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 88-002. 1988.]
110243 GEMSTONEFIRE: ADAPTIVELY DISPERSIVE RAY TRACING OF POLYHEDRONS.
Y. Yuan et al.
[University of Tokyo. Department of Information Science. Technical
report 88-003. 1988.]
110244 ON THE POWER SERIES SOLUTION OF A SYSTEM OF ALGEBRAIC EQUATIONS.
S. Moritsugu et al.
[University of Tokyo. Department of Information Science. Technical
report 88-004. 1988.]
110245 DRAWING INPUT THROUGH GEOMETRICAL CONSTRUCTIONS: SPECIFICATION AND
APPLICATIONS.
T. Noma et al.
[University of Tokyo. Department of Information Science. Technical
report 88-005. n.d.]
110246 THE STAR-ARBORICITY OF THE COMPLETE REGULAR MULTIPARTITE GRAPHS.
Y. Aoki.
[University of Tokyo. Department of Information Science. Technical
report 88-006. 1987.]
110247 AUTOMATIC DISPLAY OF NETWORK STRUCTURES FOR HUMAN UNDERSTANDING.
T. Kamada and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 88-007. 1988.]
110248 "MOD-" - ON ATTACHING MODULE CONCEPT TO STATIC SEMANTICS OF LANGUAGES.
Y. Kinoshita.
[University of Tokyo. Department of Information Science. Technical
report 88-008. 1988.]
110249 ON THE YONEDA LEMMA AND ADJUNCTIONS.
M. Matsumoto.
[University of Tokyo. Department of Information Science. Technical
report 88-009. 1988.]
110250 GRAPH-BASED REPRESENTATION OF FUZZY DATA.
Y. Shirai, I. Fujishiro, and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 88-010. 1988.]
110251 THE EXACT BOUND IN THE ERDOES-KO-RADO THEOREM FOR CROSS-INTERSECTING
FAMILIES.
M. Matsumoto and N. Tokushige.
[University of Tokyo. Department of Information Science. Technical
report 88-012. 1988.]
110252 USING TUPLE SPACE COMMUNICATION IN DISTRIBUTED OBJECT-ORIENTED DESIGN.
S. Matsuoka and S. Kawai.
[University of Tokyo. Department of Information Science. Technical
report 88-013. 1988.]
110253 A COMPUTER READABILITY FORMULA OF JAPANESE TEXTS FOR MACHINE SCORING.
Y. Tateisi, Y. Ono, and H. Yamada.
[University of Tokyo. Department of Information Science. Technical
report 88-014. 1988.]
110254 AUTOMATIC MENU-BASED SOFTWARE GENERATOR - SPECIFICATION DEFINITION BY
EXAMPLES.
Y. Shirota and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 88-015. 1988.]
110255 NAMES AND NAME RESOLUTION IN DISTRIBUTED OPERATING SYSTEMS [IN
JAPANESE].
K. Shimizu and M. Maekawa.
[University of Tokyo. Department of Information Science. Technical
report 88-016. 1988.]
110256 OPTICAL MASS STORAGE SYSTEMS AND THEIR PERFORMANCE.
S. Christodoulakis et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-05. 1988.]
110257 PERFORMANCE ANALYSIS AND FUNDAMENTAL PERFORMANCE TRADE OFFS FOR CLV
OPTICAL DISKS.
S. Christodoulakis and D. A. Ford.
[University of Waterloo. Department of Computer Science. Research
report CS-88-06. 1988.]
110258 WAVEFRONT ELIMINATION AND RENORMALIZATION.
W. P. Tang.
[University of Waterloo. Department of Computer Science. Research
report CS-88-07. 1988.]
110259 ORTHOGONAL DECOMPOSITION OF DENSE AND SPARSE MATRICES ON
MULTIPROCESSORS.
E. C. L. Chu.
[University of Waterloo. Department of Computer Science. Research
report CS-88-08. 1988. Thesis (Ph.D.).]
110260 ADAPTIVE IMPLICIT CRITERIA FOR TWO PHASE FLOW WITH GRAVITY AND
CAPILLARY PRESSURE.
P. A. Forsyth.
[University of Waterloo. Department of Computer Science. Research
report CS-88-09. 1988.]
110261 A COMMUNICATION SYSTEM FOR LOCAL AREA NETWORKS.
T. M. Stepien.
[University of Waterloo. Department of Computer Science. Research
report CS-88-11. 1988.]
110262 EXPLORING THE PROPERTIES OF UNIFORM B-SPLINES USING THE FOURIER
INTEGRAL.
E.-W. Chionh.
[University of Waterloo. Department of Computer Science. Research
report CS-88-10. 1988.]
110263 A MODEL FOR SEQUENTIAL MACHINE TESTING.
J. A. Brzozowski and H. Juergensen.
[University of Waterloo. Department of Computer Science. Research
report CS-88-12. 1988.]
110264 INTERVAL HEAPS.
J. van Leeuwen and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-88-13. 1988.]
110265 A STABILIZED ALGORITHM FOR TRIDIAGONALIZATION OF AN UNSYMMETRIC
MATRIX.
W. P. Tang.
[University of Waterloo. Department of Computer Science. Research
report CS-88-14. 1988.]
110266 ON OPTIMAL INTERPOLATION TRIANGLE INCIDENCES.
E. F. D'Azevedo and R. B. Simpson.
[University of Waterloo. Department of Computer Science. Research
report CS-88-17. 1988.]
110267 INDEPENDENCE-REDUCIBLE DATABASE SCHEMES.
E. P. F. Chan and H. J. Hernandez.
[University of Waterloo. Department of Computer Science. Research
report CS-88-18. 1988. "A preliminary version of this paper appears
in the 'Proceedings of the ACM Symposium on Principles of Database
Systems,' Austin, 1988, pp.163-173."]
110268 MODULAR ATTRIBUTE GRAMMARS.
G. D. P. Dueck and G. V. Cormack.
[University of Waterloo. Department of Computer Science. Research
report CS-88-19. 1988.]
110269 EFFICIENT IMPLEMENTATION OF SUBSEQUENTIAL TRANSDUCERS.
G. G. Trowsdale.
[University of Waterloo. Department of Computer Science. Research
report CS-88-20. 1988. Thesis (Master of Mathematics in Computer
Science).]
110270 FILE ORGANIZATION AND ACCESS METHODS FOR CLV OPTICAL DISKS.
S. Christodoulakis and D. A. Ford.
[University of Waterloo. Department of Computer Science. Research
report CS-88-21. 1988.]
110271 ON THE DETERMINISTIC COMPLEXITY OF FACTORING POLYNOMIALS OVER FINITE
FIELDS.
V. Shoup.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 782. 1988.]
110272 IPS-2: THE SECOND GENERATION OF A PARALLEL PROGRAM MEASUREMENT SYSTEM.
B. P. Miller et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 783. 1988.]
110273 THE ASP: A CONTINUOUS, VIEWER-CENTERED OBJECT REPRESENTATION FOR
COMPUTER VISION.
W. H. Plantinga.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 784. 1988. Thesis (Ph.D.).]
110274 SHARING IN A PRIVATELY OWNED WORKSTATION ENVIRONMENT.
M. W. Mutka.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 781. 1988. Thesis (Ph.D.).]
110275 VLSI DESIGN AIDS: CAPTURE, INTEGRATION, AND LAYOUT GENERATION.
R. Barth et al.
[Xerox Corporation. Palo Alto Research Center. CSL-88-1. 1988.]
110276 MAINTAINING THE ILLUSION OF A FUNCTIONAL LANGUAGE IN THE PRESENCE OF
SIDE EFFECTS.
H. E. Sturgis.
[Xerox Corporation. Palo Alto Research Center. CSL-88-2. 1988.]
110277 COLOR GAMUT MAPPING AND THE PRINTING OF DIGITAL COLOR IMAGES.
M. C. Stone, W. B. Cowan, and J. C. Beatty.
[Xerox Corporation. Palo Alto Research Center. EDL-88-1. 1988.
Appendix by Eric H. Larson.]
110278 TOWARD "WYSIWYG": A SIMPLIFIED METHOD FOR IMPROVING THE PRINTED
APPEARANCE OF COMPUTER GENERATED IMAGES.
M. G. Lamming and W. L. Rhodes.
[Xerox Corporation. Palo Alto Research Center. EDL-88-2. 1988.]
110279 A NEW APPROACH TO IMAGING IC LAYOUT AND SCHEMATICS.
G. B. Beretta.
[Xerox Corporation. Palo Alto Research Center. EDL-88-3. 1988.]
VOL. 10, NO. 11 12/12/88
110280 THE EMERGENCE OF CONTRADICTIONS IN SOFT SYSTEMS PRACTICE: AN
ILLUSTRATION.
P. A. Nielsen.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Afdeling for Matematik og Datalogi. Report no. 88-22. 1988. "A
shorter version of this paper... published in the proceedings of the
U.K. Systems Society Conference, Hull, July 1988: R.L. Flood, M.C.
Jackson & P. Keys (editors), 'System Prospects,' Plenum Press, New
York, 1989."]
110281 OPERATIONAL AND DENOTATIONAL PROPERTIES OF A MODAL PROCESS LOGIC.
H. Huettel.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Afdeling for Matematik og Datalogi. Report no. 88-27. 1988.]
110282 BISIMULATION THROUGH PROBABILISTIC TESTING.
K. G. Larsen and A. Skou.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Afdeling for Matematik og Datalogi. Report no. 88-29. 1988.]
110283 THE HEXAGONAL RESISTIVE NETWORK AND THE CIRCULAR APPROXIMATION: A
MATHEMATICAL ANALYSIS OF THE FINITE-DIFFERENCE EQUATION WHICH THE
IDEALIZED NETWORK SATISFIES.
D. I. Feinstein.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-7. 1988.]
110284 A COMPARISON OF STRICT AND NON-STRICT SEMANTICS FOR LISTS.
J. R. Burch.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-12. 1988. Thesis (Master's).]
110285 A MESSAGE-PASSING MODEL FOR HIGHLY CONCURRENT COMPUTATION.
A. J. Martin.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-13. 1988.]
110286 SYNTAX-DIRECTED TRANSLATION OF CONCURRENT PROGRAMS INTO SELF-TIMED
CIRCUITS.
S. M. Burns and A. J. Martin.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-14. 1988.]
110287 APPLICATIONS OF SURFACE NETWORKS TO SAMPLING PROBLEMS IN COMPUTER
GRAPHICS.
B. Von Herzen.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-15. 1989. Thesis (Ph.D.). Thesis submitted July 20,
1988.]
110288 PROGRAMMING PARALLEL COMPUTERS.
K. M. Chandy.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-16. 1988.]
110289 CONSTRAINED DIFFERENTIAL OPTIMIZATION FOR NEURAL NETWORKS.
J. C. Platt and A. H. Barr.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-17. 1988.]
110290 3-D VISION TECHNIQUES FOR AUTONOMOUS VEHICLES.
M. Hebert, T. Kanade, and I. Kweon.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-12.
1988.]
110291 EXTRACTING SHAPE AND REFLECTANCE OF LAMBERTIAN, SPECULAR, AND HYBRID
SURFACES.
S. K. Nayar, K. Ikeuchi, and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-14.
1988.]
110292 REMOTE HIGH SPEED MEASUREMENT OF SMALL DIAMETERS BY OPTICAL
DIFFRACTOMETRY AND INTERFEROMETRY.
M. W. Siegel.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-15.
1988.]
110293 ACCELERATION PROPERTIES OF PLANAR MANIPULATORS FROM A DYNAMIC
STANDPOINT.
Y. Kim and S. Desa.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-16.
1988.]
110294 BASE REACTION OPTIMIZATION OF REDUNDANT MANIPULATORS FOR SPACE
APPLICATIONS.
C. L. Chung, S. Desa, and C. W. deSilva.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-17.
1988.]
110295 COMPUTATIONAL METATHEORY IN NUPRL.
D. J. Howe.
[Cornell University. Department of Computer Science. Technical report
88-899. 1988.]
110296 RESTRICTED TURING REDUCIBILITIES AND THE STRUCTURE OF THE POLYNOMIAL
TIME HIERARCHY.
J. A. Kadin.
[Cornell University. Department of Computer Science. Technical report
88-900. 1988. Thesis (Ph.D.).]
110297 A FORMAL ACCOUNT OF NOTATIONAL DEFINITION.
T. G. Griffin.
[Cornell University. Department of Computer Science. Technical report
88-901. 1988.]
110298 EXTENDED PLANAR GRAPH ALGORITHMS TO K SUBSCRIPT 3, 3-FREE GRAPHS.
S. Khuller.
[Cornell University. Department of Computer Science. Technical report
88-902. 1988.]
110299 PRESENTING AN ALGORITHM TO FIND THE MINIMUM EDIT DISTANCE.
D. Gries and B. Burkhardt.
[Cornell University. Department of Computer Science. Technical report
88-903. 1988.]
110300 COMPUTATIONAL FOUNDATIONS OF BASIC RECURSIVE FUNCTION THEORY.
R. L. Constable and S. F. Smith.
[Cornell University. Department of Computer Science. Technical report
88-904. 1988.]
110301 OPTIMAL LOOP PARALLELIZATION.
A. Aiken and A. Nicolau.
[Cornell University. Department of Computer Science. Technical report
88-905. n.d.]
110302 THE HOPCROFT-TARJAN PLANARITY ALGORITHM, PRESENTATIONS AND
IMPROVEMENTS.
D. Gries and J. Xue.
[Cornell University. Department of Computer Science. Technical report
88-906. 1988.]
110303 ON THE USE OF SPREADING ACTIVATION METHODS IN AUTOMATIC INFORMATION
RETRIEVAL.
G. Salton and C. Buckley.
[Cornell University. Department of Computer Science. Technical report
88-907. 1988.]
110304 NEW DEVELOPMENTS IN STRUCTURAL COMPLEXITY THEORY.
J. Hartmanis.
[Cornell University. Department of Computer Science. Technical report
88-908. 1988.]
110305 PARALLEL ALGORITHMS FOR K SUBSCRIPT 5-MINOR FREE GRAPHS.
S. Khuller.
[Cornell University. Department of Computer Science. Technical report
88-909. 1988.]
110306 AN INCREMENTAL PLANNING ALGORITHM FOR ORDERING EQUATIONS IN A
MULTILINEAR SYSTEM OF CONSTRAINTS.
B. T. Vander Zanden.
[Cornell University. Department of Computer Science. Technical report
88-910. 1988.]
110307 CHARACTERIZATION OF ASSOCIATIVE OPERATIONS WITH PREFIX CIRCUITS OF
CONSTANT DEPTH AND LINEAR SIZE.
G. Bilardi and F. P. Preparata.
[Cornell University. Department of Computer Science. Technical report
88-911. 1988.]
110308 STRUCTURAL COMPLEXITY COLUMN: SOME OBSERVATIONS ABOUT RELATIVIZATION
OF SPACE BOUNDED COMPUTATIONS.
J. Hartmanis et al.
[Cornell University. Department of Computer Science. Technical report
88-912. 1988. By Juris Hartmanis, in collaboration with R. Chang, J.
Kadin, and S. Mitchell.]
110309 MCCARTHY'S AMB CANNOT IMPLEMENT FAIR MERGE.
P. Panangaden and V. Shanbhogue.
[Cornell University. Department of Computer Science. Technical report
88-913. 1988.]
110310 CRITICAL (OF) ISSUES IN REAL-TIME SYSTEMS: A POSITION PAPER.
F. B. Schneider.
[Cornell University. Department of Computer Science. Technical report
88-914. 1988.]
110311 CONCURRENT COMMON KNOWLEDGE: A NEW DEFINITION OF AGREEMENT FOR
ASYNCHRONOUS SYSTEMS.
P. Panangaden and K. Taylor.
[Cornell University. Department of Computer Science. Technical report
88-915. 1988. Revision of [Department of Computer Science] technical
report 86-802.]
110312 A ROUND-ROBIN PARALLEL PARTITIONING ALGORITHM.
D. Moore.
[Cornell University. Department of Computer Science. Technical report
88-916. 1988.]
110313 EXPLOITING REPLICATION.
K. P. Birman and T. A. Joseph.
[Cornell University. Department of Computer Science. Technical report
88-917. 1988.]
110314 RELIABLE BROADCAST PROTOCOLS.
T. A. Joseph and K. P. Birman.
[Cornell University. Department of Computer Science. Technical report
88-918. 1988.]
110315 A TEMPORAL-LOGIC BASED COMPOSITIONAL PROOF SYSTEM FOR REAL-TIME
MESSAGE PASSING.
J. Hooman and J. Widom.
[Cornell University. Department of Computer Science. Technical report
88-919. 1988. "Preliminary report."]
110316 A PRACTICAL ATTRIBUTE GRAMMAR CIRCULARITY TEST.
M. Belmonte.
[Cornell University. Department of Computer Science. Technical report
88-920. 1988.]
110317 ON COMPUTING GRAPH CLOSURES.
S. Khuller.
[Cornell University. Department of Computer Science. Technical report
88-921. 1988.]
110318 COMPACTION-BASED PARALLELIZATION.
A. Aiken.
[Cornell University. Department of Computer Science. Technical report
88-922. 1988. Thesis (Ph.D.).]
110319 SOLUTION OF NONLINEAR LEAST-SQUARE PROBLEMS ON A MULTIPROCESSOR.
T. F. Coleman and P. E. Plassmann.
[Cornell University. Department of Computer Science. Technical report
88-923. 1988.]
110320 RECURSIVE DATA STRUCTURES AND PARALLELISM DETECTION.
L. Hendren.
[Cornell University. Department of Computer Science. Technical report
88-924. 1988.]
110321 AUTOMATING REASONING IN AN IMPLEMENTATION OF CONSTRUCTIVE TYPE THEORY.
D. J. Howe.
[Cornell University. Department of Computer Science. Technical report
88-925. 1988. Thesis (Ph.D.).]
110322 THE POWER OF TEMPORAL PROOFS.
M. Abadi.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 30. 1988. "A shorter version of this paper was published in the
proceedings of the IEEE 'Symposium on Logic in Computer Science,'
Ithaca, New York, June 1987."]
110323 BOUNDS ON THE COVER TIME.
A. Broder and A. Karlin.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 32. 1988.]
110324 G SUPERSCRIPT 1 INTERPOLATION OF GENERALLY UNRESTRICTED CUBIC BEZIER
CURVES.
R. F. Sarraga.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Technical report GMR-5424A. 1988.]
110325 COMPUTER MODELING OF SURFACES WITH ARBITRARY SHAPES.
R. F. Sarraga.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Technical report GMR-6388. 1988.]
110326 ACCURATE MULTIGRID SOLUTION OF THE EULER EQUATIONS ON UNSTRUCTURED
AND ADAPTIVE MESHES.
D. J. Mavriplis.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-40. 1988.]
110327 ADAPTIVE MESH GENERATION FOR VISCOUS FLOWS USING DELAUNEY
TRIANGULATION.
D. J. Mavriplis.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-47. 1988.]
110328 APPROXIMATION THEORY FOR LOG OPTIMAL CONTROL OF FLEXIBLE STRUCTURES.
J. S. Gibson and A. Adamian.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-48. 1988.]
110329 CONVERGENCE OF GALERKIN APPROXIMATIONS FOR OPERATOR RICCATI EQUATIONS
- A NONLINEAR EVOLUTION EQUATION APPROACH.
I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-49. 1988.]
110330 MULTIGRID METHOD FOR STABILITY PROBLEMS.
S. Ta'asan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-50. 1988.]
110331 NON-OSCILLATORY CENTRAL DIFFERENCING FOR HYPERBOLIC CONSERVATION LAWS.
H. Nessyahu and E. Tadmor.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-51. 1988.]
110332 IMPROVING THE ACCURACY OF CENTRAL DIFFERENCE SCHEMES.
E. Turkel.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-53. 1988.]
110333 PROGRAMMING THE NAVIER-STOKES COMPUTER: AN ABSTRACT MACHINE MODEL AND
A VISUAL EDITOR.
D. Middleton, T. Crockett, and S. Tomboulian.
[Institute for Computer Applications in Science and Engineering
(ICASE). Innterim report 5. 1988.]
110334 THE ASP TUTORIAL.
J. L. Potter.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-005. 1988.]
110335 THE HORIZON SUPERCOMPUTING SYSTEM: ARCHITECTURE AND SOFTWARE.
J. T. Kuehn and B. J. Smith.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-009. 1988.]
110336 A PROCESSOR ARCHITECTURE FOR HORIZON.
M. R. Thistle and B. J. Smith.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-010. 1988.]
110337 ANALYSIS OF A 3D TOROIDAL NETWORK FOR A SHARED MEMORY ARCHITECTURE.
F. M. Pittelli and D. L. Smitley.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-011. 1988.]
110338 PERFORMANCE PREDICTION FOR THE HORIZON SUPERCOMPUTER.
R. R. Glenn.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-012. 1988.]
110339 HORSE: A SIMUALTION OF THE HORIZON SUPERCOMPUTER.
D. J. Kopetzky.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-013. 1988.]
110340 THE DIMENSION OF A STRANGE ATTRACTOR.
C. S. Reed.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-014. 1988.]
110341 SIMULATED ANNEALING, REVERSIBLE COMPUTATION AND NEURAL NETS.
D. G. Jablonski.
[Institute for Defense Analyses (IDA). Supercomputing Research
Center. SRC-TR-88-015. 1988.]
110342 MEASUREMENTS AND EVALUATION FOR THE MULTI-PSI/V1 SYSTEM - A STUDY OF
INTER-PE COMMUNICATION VERSUS SYSTEM PERFORMANCE.
K. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-370.
1988.]
110343 PERFORMABILITY ANALYSIS USING SEMI-MARKOV REWARD PROCESS.
G. Ciardo et al.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 859. 1988.]
110344 RECTIFICATION OF IMAGES FOR BINOCULAR AND TRINOCULAR STEREOVISION.
N. Ayache and C. Hansen.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 860. 1988.]
110345 ALGORITHMES DISTRIBUES SYNCHRONES ET SYSTEMES REPARTOS ASYNCHRONES:
CONCEPTS, MISES EN OEUVRE ET EXPERIMENTATIONS.
M. Adam, P. Ingels, and M. Raynal.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 862. 1988. Also issued as Publication
interne 411, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110346 UNIFICATION-FREE EXECUTION OF TYPOL PROGRAMS BY SEMANTIC ATTRIBUTE
EVALUATION.
I. Attali and P. Franchi-Zannetacci.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 864. 1988.]
110347 COMPLEXITY ANALYSIS OF TERM REWRITING SYSTEMS.
C. Choppy, S. Kaplan, and M. Soria.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 867. 1988.]
110348 EFFICIENT AND CORRECT EXECUTION OF PARALLEL PROGRAMS THAT SHARE
MEMORY.
D. Shasha and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 12936. 1987.]
110349 POSITIONING FOR A DUAL DELIVERY PLACEMENT MACHINE.
S. Grotzinger.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13908. 1988.]
110350 VARIANCE REDUCTION IN MEAN TIME FAILURE SIMULATIONS.
P. Shahabuddin et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13910. 1988.]
110351 INPUT QUEUEING OF AN INTERNALLY NON-BLOCKING PACKET SWITCH WITH TWO
PRIORITY CLASSES.
J. S.-C. Chen and R. Guerin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13911. 1988.]
110352 ON COMPUTING THE SIZES OF DETECTED DELAY FAULTS.
V. S. Iyengar, B. K. Rosen, and J. A. Waicukauski.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13916. 1988.]
110353 GRAMMAR DEVELOPMENT FOR SPEECH RECOGNITION.
E. Black.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13918. 1988.]
110354 MINIMIZING THE ECOLOGICAL DISCONTINUITY IN INTERFACE DESIGN.
J. Thomas and W. A. Kellogg.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13922. 1988.]
110355 SMALLEST SCALE ESTIMATES FOR THE INCOMPRESSIBLE NAVIER-STOKES
EQUATIONS.
W. D. Henshaw, H. O. Kreiss, and L. G. Reyna.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13923. 1988.]
110356 ELEMENTS OF VISUAL LANGUAGE.
T. Selker and L. Koved.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13929. 1988.]
110357 DECIDABILITY AND UNDECIDABILITY IN DISTRIBUTED TRANSITION SYSTEMS.
R. Parikh.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13930. 1988.]
110358 COMPRESSIBLE NAVIER-STOKES COMPUTATIONS FOR SLIDER AIR-BEARINGS.
W. D. Henshaw, L. G. Reyna, and J. A. Zufiria.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13931. 1988.]
110359 WHY CMS?
P. R. Ryall.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13932. 1988.]
110360 TIME-DRIVEN PARALLEL SIMULATION OF MULTISTAGE INTERCONNECTION
NETWORKS.
Q. Yu, D. Towsley, and P. Heidelberger.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13937. 1988.]
110361 THE DESIGNER AS USER: BUILDING REQUIREMENTS FOR DESIGN TOOLS FROM
DESIGN PRACTICE.
M. B. Rosson, S. Maass, and W. A. Kellogg.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13939. 1988.]
110362 DESIGNING FOR USABILITY: THE NEXT ITERATION IS TO REDUCE
ORGANIZATIONAL BARRIERS.
J. D. Gould.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13940. 1988. "Draft of the 1988 Human
Factors Society Presidential address."]
110363 EVALUATING USER AND SYSTEM MODELS: APPLYING SCALING TECHNIQUES TO
PROBLEMS IN HUMAN-COMPUTER INTERACTION.
W. A. Kellogg and T. J. Breen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13942. 1988.]
110364 A HARDWARE ACCELERATOR FOR REAL-TIME SYSTEM DIAGNOSIS.
F.-H. W. Shih and K. Nakajima.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13944. 1988.]
110365 DEVELOPMENT TOOLS FOR UNIX-TCP/IP NETWORKS.
R. M. Nirenberg.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13946. 1988.]
110366 PROGRAM DERIVATION BY FIXED POINT COMPUTATION.
J. Cai and R. Paige.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13947. 1988.]
110367 A GENERAL OPTIMIZATION CRITERION FOR PARAMETER ESTIMATION AND DECODER
SELECTION.
P. S. Gopalakrishnan et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13950. 1988.]
110368 SYNOPSIS OF RECENT PROGRESS ON CAMERA CALIBRATION FOR 3D MACHINE
VISION.
R. Y. Tsai.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13954. 1988.]
110369 A FEYNMAN PATH INTEGRAL FORMALISM FOR GENERAL EVOLUTION EQUATIONS.
W. L. Miranker and A. Winkler.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13964. 1988.]
110370 A POLYNOMIAL TIME VERSION OF THE AFFINE SCALING ALGORITHM.
E. R. Barnes, S. Chopra, and D. L. Jensen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13965. 1988.]
110371 LOCAL DIMENSION OF PIECEWISE POLYNOMIAL SPACES, SYZYGIES, AND
SOLUTIONS OF SYSTEMS OF PARTIAL DIFFERENTIAL EQUATIONS.
W. Dahmen and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13967. 1988.]
110372 MONOSPLINES AND MOMENT PRESERVING SPLINE APPROXIMATION.
C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13968. 1988.]
110373 CONVEXITY AND BERNSTEIN POLYNOMIALS ON K-SIMPLOIDS.
W. Dahmen and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13969. 1988.]
110374 ASYMPTOTIC METHODS FOR MOSFET MODELING.
M. J. Ward, F. M. Odeh, and D. S. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13971. 1988.]
110375 PATH INTEGRAL NUMERICAL METHODS FOR EVOLUTION EQUATIONS.
W. L. Miranker and A. Winkler.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13974. 1988.]
110376 PERFORMANCE ANALYSIS OF OPTIMISTIC CONCURRENCY CONTROL SCHEMES FOR
SYSTEMS WITH LARGE MEMORY.
P. S. Yu and D. M. Dias.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13976. 1988.]
110377 TYPE-SHAPE INFERENCE IN AN APL COMPILER USING CONSTRAINT PROGRAMMING.
W.-M. Ching.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13979. 1988.]
110378 AN EMPIRICAL STUDY OF THE PERFORMANCE OF THE APL370 COMPILER.
W.-M. Ching, R. Nelson, and N. Shi.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13980. 1988.]
110379 COMPUTATIONAL TOOLS FOR LEXICOGRAPHERS.
M. S. Neff and L. Cantor.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13984. 1988.]
110380 HIGH-FREQUENCY PHASE-LOCKED LOOPS IN BIPOLAR TECHNOLOGY.
M. Soyuer and R. G. Meyer.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13987. 1988.]
110381 HIGH-LEVEL SYNTHESIS FROM VHDL.
R. Camposano, L. F. Saunders, and R. M. Tabet.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13990. 1988.]
110382 DECOMPOSING ALGEBRAIC SETS USING GROEBNER BASES.
C. A. Neff.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13993. 1988.]
110383 ADVANCES IN IMAGE COMPRESSION TECHNIQUES.
C. A. Gonzales Butron.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13994. 1988.]
110384 MEASUREMENT OF INTER-PROCEDURAL CONCURRENCY.
M. Kumar.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13996. 1988.]
110385 A LOGIC PROGRAMMING APPROACH TO CARTOGRAPHIC MAP OVERLAY.
P. Y. F. Wu and W. R. Frankiln.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13997. 1988.]
110386 THE EFFICIENT COMPUTATION OF UNCERTAINTY SPACES FOR SENSOR-BASED
ROBOT PLANNING.
R. H. Taylor and V. T. Rajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13998. 1988.]
110387 SIMULATING THE EVOLUTION OF BEHAVIOR: THE ITERATED PRISONER'S DILEMMA
PROBLEM.
D. M. Chess.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14003. 1988.]
110388 T-SYMMETRIC ERROR CORRECTING/D(D>T) UNIDIRECTIONAL ERROR DETECTING
CODES.
S. Kundu.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14006. 1988.]
110389 A STATISTICAL APPROACH TO DIAGNOSING INTERMITTENT PERFORMANCE
PROBLEMS USING MONOTONE RELATIONSHIPS.
J. Hellerstein.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14010. 1988.]
110390 CIRCLES WHICH KISS: A NOTE ON OSCULATORY PACKING.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14013. 1988.]
110391 OPTICAL FIBER INTERCONNECTIONS FOR THE COMPUTER CENTER.
K. P. Jackson.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14020. 1988.]
110392 QUALITATIVE ANALYSIS IN DIAGNOSTIC EXPERT SYSTEMS.
D. Epema.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14040. 1988.]
110393 A VM PERFORMANCE ANALYZER, INTERPRETER AND ADVISER.
D. Epema.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14041. 1988.]
110394 PUNS: A PROGRAM UNDERSTANDING SUPPORT ENVIRONMENT.
L. Cleveland.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14043. 1988.]
110395 EVOLVERS: CODE GENERATION FOR PERFORMANCE WITH GENERALITY.
C. F. Skutt.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14046. 1988.]
110396 ON A THEORY OF COMPUTATION OVER REAL NUMBERS: NP COMPLETENESS,
RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES.
L. Blum, M. Shub, and S. Smale.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14047. 1988.]
110397 FERMAT'S LAST THEOREM (CASE 1) AND THE WIEFERICH CRITERION.
D. Coppersmith.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14049. 1988.]
110398 RECO MACHINE INTERFACES.
A. S. Fox, J. Kim, and C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14053. 1988.]
110399 PROTOTYPE MANAGEMENT AND ERROR CORRECTION SCENARIOS.
A. S. Fox, J. Kim, and C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14054. 1988.]
110400 GENERATION OF PERFORMANCE CONSTRAINTS FOR LAYOUT.
R. Nair et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14057. 1988.]
110401 PARTIAL PREEMPTION IN A SYSTEM WITH TWO PROCESSORS.
H. R. Gail, S. L. Hantler, and B. A. Taylor.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14058. 1988.]
110402 AN APPROACH TO THE MECHANIZATION OF SET THEORY.
F. Corella.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14062. 1988. Thesis (Ph.D.). "The
research described in this report... will be part of the author's
doctoral dissertation."]
110403 SUPPORTING BROADCAST CONNECTIONS IN BENES NETWORKS.
M. Kumar.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14063. 1988.]
110404 HEURISTIC TUNING OF PARALLEL LOOP PERFORMANCE.
P. A. Suhler.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14075. 1988.]
110405 CODING AND COMPLEXITY.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6360. 1988.]
110406 DCF: DISTRIBUTED COMMUNICATION WITH FAULT TOLERANCE.
A. Griefer and R. Strong.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6361. 1988.]
110407 QUERY REWRITE OPTIMIZATION IN STARBURST.
W. Hasan and H. Pirahesh.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6367. 1988.]
110408 FEATURE SELECTION WITH STOCHASTIC COMPLEXITY.
B. Dom, W. Niblack, and J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6376. 1988.]
110409 ON COMBINATORIAL DECODING OF ERROR-CORRECTING CODES.
M. Blaum and J. Bruck.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6385. 1988.]
110410 ON ERROR-CORRECTING BALANCED CODES.
H. van Tilborg and M. Blaum.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6386. 1988.]
110411 REASONING ABOUT PROCEDURES AS PARAMETERS IN THE LANGUAGE L4.
S. M. German, E. M. Clarke, and J. Y. Halpern.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6387. 1988.]
110412 VECTOR PROCESSING IN SIMPLEX AND INTERIOR METHODS FOR LINEAR
PROGRAMMING.
J. J. H. Forrest and J. A. Tomlin.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6390. 1988.]
110413 A REVIEW OF INK-JET PRINTING.
F. C. Lee and W. Crooks.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6400. 1988.]
110414 COMBINED DECISION THEORETIC AND SYNTACTIC APPROACH TO IMAGE
SEGMENTATION.
B. J. Straub and W. E. Blanz.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6403. 1988.]
110415 INCORPORATING DATA TYPES IN AN EXTENSIBLE DATABASE ARCHITECTURE.
P. F. Wilms et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6405. 1988.]
110416 STOCHASTIC COMPLEXITY AND THE MAXIMUM ENTROPY PRINCIPLE.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6412. 1988.]
110417 DYNAMIC STATISTICS COLLECTION FOR COMPRESSING CODING WITH RANDOMIZING
FEATURE.
S. Todd et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6414. 1988.]
110418 ESTIMATION OF ERRORS-IN VARIABLES MODELS.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6424. 1988.]
110419 FURTHER DEVELOPMENTS IN LOSSLESS GRAY-SCALE IMAGE COMPRESSION.
G. G. Langdon Jr..
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6426. 1988.]
110420 ELEMENTS OF A CONGRUOUS THEORY OF INFINITE REAL NUMBERS.
H. H. Zappe.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6427. 1988.]
110421 LEARNING IN RECURSIVE NEURAL NETWORKS.
A. Onton.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6429. 1988.]
110422 CRYPTOGRAPHIC KEY DISTRIBUTION AND COMPUTATION IN CLASS GROUPS.
K. S. McCurley.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6433. 1988.]
110423 A NOTE ON THE COMPLEXITY OF P-MATRIX LCP AND COMPUTING AN EQUILIBRIUM.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6439. 1988.]
110424 POLYMORPHIC-TORUS ARCHITECTURE FOR COMPUTER VISION.
H. Li and M. Maresca.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6452. 1988.]
110425 ANALYSIS OF A DISCRETE TIME QUEUEING SYSTEM WITH BATCH ARRIVALS AND
ITS APPLICATIONS IN PACKET-SWITCHING SYSTEMS.
P. Tran-Gia and H. Ahmadi.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1730. 1988. "Revised and extended
version of a paper presented in the INFOCOM '88 Conference, New
Orleans, March 1988."]
110426 THROUGHPUT ANALYSIS OF A CLASS OF SELECTIVE REPEAT PROTOCOLS IN
HIGH-SPEED ENVIRONMENTS.
P. Tran-Gia, H. Ahmadi, and P. Kermani.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1739. 1988.]
041946 REIFICATION WITHOUT EVALUATION.
A. Bawden.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 946. 1988.]
041948 UNDERSTANDING BANDWIDTH LIMITATIONS IN ROBOT FORCE CONTROL.
S. D. Eppinger and W. P. Seering.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 948. 1987.]
041953 SCHEME86: AN ARCHITECTURE FOR MICROCODING A SCHEME INTERPRETER.
H. M. Wu.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 953. 1988. "Bachelor's thesis in Computer
Systems, 1986." Revised: August 1988.]
041977 A STANDARD ARCHITECTURE FOR CONTROLLING ROBOTS.
S. Narasimhan, D. M. Siegal, and J. M. Hollerbach.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 977. 1988.]
042025 A BEHAVIOR-BASED ARM CONTROLLER.
J. H. Connell.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1025. 1988.]
042028 SYMBOLIC CONSTRUCTION OF A 2D SCALE-SPACE IMAGE.
E. Saund.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1028. 1988.]
042032 REAL-TIME PART POSITION SENSING.
S. J. Gordon and W. P. Seering.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1032. 1988.]
042037 DYNAMICAL SYSTEMS AND MOTION VISION.
J. Heel.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1037. 1988.]
042038 THE COMPUTATIONAL STUDY OF VISION.
E. C. Hildreth and S. Ullman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1038. 1988. Also issued as C.B.I.P. memo 32,
Center for Biological Information Processing, Whitaker College.]
042039 NUMERICAL EVIDENCE THAT THE MOTION OF PLUTO IS CHAOTIC.
G. J. Sussman and J. Wisdom.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1039. 1988.]
042040 SCHEME86: A SYSTEM FOR INTERPRETING SCHEME.
A. A. Berlin and H. M. Wu.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1040. 1988.]
042041 EXPLOITING LEXICAL REGULARITIES IN DESIGNING NATURAL LANGUAGE SYSTEMS.
B. Katz and B. Levin.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1041. 1988. "A version of this paper appears in
the 'Proceedings of the 12th International Conference on
Computational Linguistics, Coling '88.'"]
042042 COMPUTATIONAL STRUCTURE OF THE N-BODY PROBLEM.
J. Katznelson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1042. 1988.]
042046 MODELING ROBOT FLEXIBILITY FOR ENDPOINT FORCE CONTROL.
S. D. Eppinger and W. P. Seering.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1046. 1988.]
042049 SYNTACTIC CLOSURES.
A. Bawden and J. Rees.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1049. 1988. "This is a revision of a paper that
will appear in the 'Proceedings of the 1988 ACM Conference on Lisp
and Functional Programming.'"]
042059 MODEL-BASED REASONING: TROUBLESHOOTING.
R. Davis and W. C. Hamscher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1059. 1988.]
042061 STRUCTURAL SALIENCY: THE DETECTION OF GLOBALLY SALIENT STRUCTURES
USING A LOCALLY CONSTRUCTED NETWORK.
S. Ullman and A. Sha'ashua.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1061. 1988.]
042068 ESTIMATING THE ILLUMINANT COLOR FROM THE SHADING OF A SMOOTH SURFACE.
H.-C. Lee.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1068. 1988.]
042069 MESSAGE-DRIVEN PROCESSOR ARCHITECTURE.
W. Dally et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1069. 1988. Also issued as Concurrent VLSI
Architecture memo 14, Concurrent VLSI Architecture Group, Artificial
Intelligence Laboratory, Massachusetts Institute of Technology.]
042035 THEORIES OF COMPARATIVE ANALYSIS.
D. S. Weld.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1035. 1988. Thesis (Ph.D.).]
042047 HYPOTHESIZING DEVICE MECHANISMS: OPENING UP THE BLACK BOX.
R. J. Doyle.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1047. 1988. Thesis (Ph.D.). "This report
is a revised version of a thesis submitted on May 5, 1988 to the
Department of Electrical Engineering and Computer Science at the
Massachusetts Institute of Technology in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
042054 THE EFFECT OF TRANSMISSION DESIGN ON FORCE-CONTROLLED MANIPULATOR
PERFORMANCE.
W. T. Townsend.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1054. 1988. Thesis (Ph.D.).]
042055 MULTISTEP METHODS FOR INTEGRATING THE SOLAR SYSTEM.
P. A. Skordis.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1055. 1988. Thesis (M.S.).]
042065 BOUNDARIES AND TOPOLOGICAL ALGORITHMS.
M. M. Fleck.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1065. 1988. Thesis (Ph.D.).]
042072 MODELING ROBOT DYNAMIC PERFORMANCE FOR ENDPOINT CONTROL.
S. D. Eppinger.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1072. 1988. Thesis (D.Sc.).]
042074 MODEL-BASED TROUBLESHOOTING OF DIGITAL SYSTEMS.
W. C. Hamscher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1074. 1988. Thesis (Ph.D.).]
110427 A SKETCH OF THE HISTORICAL DEVELOPMENT OF COMPUTER SCIENCE.
C. K. Yuen.
[National University of Singapore. Department of Information Systems
and Computer Science. Research report PPA6/88. 1988.]
110428 PRODUCT OF QUASI-GROUP GRAPHS AS INTERCONNECTION NETWORK TOPOLOGIES.
M. C. Lee, C. L. Tan, and H. H. Teh.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA6/88. 1988.]
110429 COMPLEXITY COMPARISON OF BENCHMARK SOFTWARE.
K. Ranai and B. Srinivasan.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB6/88. 1988.]
110430 AN ANALYSIS OF A DISTRIBUTED MULTIRESOLUTION VISION SYSTEM.
C. L. Tan and W. N. Martin.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA7/88. 1988.]
110431 APPLICATIONS OF ARTIFICIAL INTELLIGENCE IN RADIATION PROTECTION.
C. L. Tan et al.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB7/88. 1988.]
110432 ADAPTING EXISTING COMPUTER SYSTEMS TO ORIENTAL LANGUAGE SOFTWARE.
K. T. Lua.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA8/88. n.d.]
110433 ATTITUDES OF FEMALE COMPUTER PROFESSIONALS IN SINGAPORE TOWARD
TELECOMMUTING.
H. Tng.
[National University of Singapore. Department of Information Systems
and Computer Science. TRB8/88. 1988.]
110434 BINARY DIVISION AND SQUARE-ROOTING USING GRAY CODE.
C. K. Yuen.
[National University of Singapore. Department of Information Systems
and Computer Science. TRC8/88. 1988.]
110435 APPLYING THE ENTITY-RELATIONSHIP APPROACH TO THE PROBLEM OF CODE
MANAGEMENT.
J. L. Clark, T. W. Ling, and J. McClary.
[National University of Singapore. Department of Information Systems
and Computer Science. TRD8/88. 1988.]
110436 MODIFYING TWO-PHASE LOCKING TO IMPROVE PERFORMANCE.
T. Johnson.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 133. 1988.]
110437 THE POWER OF MULTIMEDIA: COMBINING POINT-TO-POINT AND MULTIACCESS
NETWORKS.
Y. Afek et al.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 134. 1988. Also
issued as Technical report 351, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
110438 MEMORY MANAGEMENT IN SYMUNIX II: A DESIGN FOR LARGE-SCALE SHARED
MEMORY MULTIPROCESSORS.
J. Edler, J. Lipkis, and E. Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 135. 1988.]
110439 PROCESS MANAGEMENT FOR HIGHLY PARALLEL UNIX SYSTEMS.
J. Edler, J. Lipkis, and E. Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 136. 1988.]
110440 PARFOR - A STRUCTURED ENVIRONMENT FOR PARALLEL FORTRAN.
W. Berke.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 137. 1988.]
110441 ELEMENTARY PROPERTIES OF CLOCK-REGULATED QUEUES.
O. E. Percus and J. K. Percus.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 138. 1988.]
110442 ADD-AND-LAMBDA II: ELIMINATING BUSY WAITS.
M. C. Harrison.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 139. 1988.
Revised: March 1988.]
110443 AUTOMATIC EXPLOITATION OF CONCURRENCY IN C: IS IT REALLY SO HARD?
L. S. Grob.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 140. 1988.
"Preliminary versions of this paper were presented at the
'Association Francaise des Utilisateurs d'Unix,' Paris, France, March
1988 and at the 'European Unix Systems User Group Workshop,' Dublin,
Ireland, Autumn 1987."]
110444 SIMULATION AND ANALYSIS OF DIFFERENT SWITCH ARCHITECTURES FOR
INTERCONNECTION NETWORKS IN MIMD SHARED MEMORY MACHINES.
Y.-S. Liu and S. Dickey.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 141. 1988.]
110445 THE SPATIAL COMPLEXITY OF OBLIVIOUS K-PROBE HASH FUNCTIONS.
J. P. Schmidt and A. Siegel.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 142. 1988.]
110446 PRECONDITIONING AND BOUNDARY CONDITIONS.
T. A. Manteuffel and S. V. Parter.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 143. 1988.]
110447 PORTING SCIENTIFIC APPLICATIONS TO THE NYU ULTRACOMPUTER.
J. Chiabaut, V. Fleyshgakker, and A. Greenbaum.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 144. 1988.]
110448 SOME DOMAIN DECOMPOSITION AND ITERATIVE REFINEMENT ALGORITHMS FOR
ELLIPTIC FINITE ELEMENT PROBLEMS.
O. Widlund.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 145. 1988. Also
issued as Technical report 386, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
052132 AN INFORMATION-BASED THEORY OF AGREEMENT.
C. Pollard and I. A. Sag.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-132. 1988.]
025192 THE UNIFIED MANAGEMENT OF MEMORY IN THE V DISTRIBUTED SYSTEM.
D. R. Cheriton.
[Stanford University. Department of Computer Science.
STAN-CS-88-1192. August 1988. Also issued as CSL-TR-88-359, Computer
Systems Laboratory, Stanford University.]
025214 MULTICAST ROUTING IN INTERNETWORKS AND EXTENDED LANS.
S. E. Deering.
[Stanford University. Department of Computer Science.
STAN-CS-88-1214. July 1988. Also issued as CSL-TR-88-361, Computer
Systems Laboratory, Stanford University.]
025215 PRIMITIVES FOR COMPUTATIONAL GEOMETRY.
J. Stolfi.
[Stanford University. Department of Computer Science.
STAN-CS-88-1215. June 1988.]
025216 ALGORITHMIC PROBLEMS ON INTERSECTION GRAPHS.
A. A. Schaeffer.
[Stanford University. Department of Computer Science.
STAN-CS-88-1216. July 1988. Thesis (Ph.D.).]
025217 A TWO-VIEW DOCUMENT EDITOR WITH USER-DEFINABLE DOCUMENT STRUCTURE.
K. P. Brooks.
[Stanford University. Department of Computer Science.
STAN-CS-88-1217. June 1988. Thesis (Ph.D.).]
025218 SQUARE MESHES ARE NOT ALWAYS OPTIMAL.
A. Bar-Noy and D. Peleg.
[Stanford University. Department of Computer Science.
STAN-CS-88-1218. August 1988.]
025219 THE FIRST CYCLES IN AN EVOLVING GRAPH.
P. Flajolet, D. E. Knuth, and B. Pittel.
[Stanford University. Department of Computer Science.
STAN-CS-88-1219. September 1988.]
025220 COMPUTER TEXTURE ANALYSIS AND SEGMENTATION.
R. L. Vistnes.
[Stanford University. Department of Computer Science.
STAN-CS-88-1220. June 1988. Thesis (Ph.D.).]
025221 QUERY-LIMITED REDUCIBILITIES.
R. Beigel.
[Stanford University. Department of Computer Science.
STAN-CS-88-1221. July 1988. Thesis (Ph.D.).]
025222 LOAD BALANCING FOR MASSIVELY-PARALLEL SOFT-REAL-TIME SYSTEMS.
M. Hailperin.
[Stanford University. Department of Computer Science.
STAN-CS-88-1222. September 1988. "To appear in condensed form in:
[the proceedings of] 'Frontiers '88: The Second Symposium on the
Frontiers of Massively Parallel Computation,'" Fairfax, Virginia,
October 10-12, 1988." Also issued as KSL-88-62, Knowledge Systems
Laboratory, Department of Computer Science, Stanford University.]
025223 THE ERRORS OF TEX.
D. E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-88-1223. September 1988.]
025224 DISTRIBUTING BACKWARD-CHAINING DEDUCTIONS TO MULTIPLE PROCESSORS.
V. Singh.
[Stanford University. Department of Computer Science.
STAN-CS-88-1224. April 1988. Thesis (Ph.D.).]
025225 PARALLEL APPROXIMATION ALGORITHMS.
E. W. Mayr.
[Stanford University. Department of Computer Science.
STAN-CS-88-1225. September 1988.]
025226 MAKING INTELLIGENT SYSTEMS ADAPTIVE.
B. Hayes-Roth.
[Stanford University. Department of Computer Science.
STAN-CS-88-1226. October 1988. April 1988. Revised: July 1988. Also
issued as KSL-88-64, Knowledge Systems Laboratory, Department of
Computer Science, Stanford University.]
025227 FINDING MINIMUM-COST FLOWS BY DOUBLE SCALING.
R. K. Ahuja et al.
[Stanford University. Department of Computer Science.
STAN-CS-88-1227. September 1988.]
048088 PROSE GENERATION FROM EXPERT SYSTEMS: AN APPLIED COMPUTATIONAL
LINGUISTIC APPROACH.
P. L. Miller and G. D. Rennels.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-73. November 1988.]
048088 AI IN MEDICINE.
B. Kane and D. W. Rucker.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-74. November 1988.]
110449 COMMUNICATION COST AND TIME COMMITMENT ALGORITHMS.
A. Segall and O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 458. 1987.]
110450 APPROXIMATION ALGORITHMS FOR COVERING GRAPH BY VERTEX-DISJOINT PATHS
OF MAXIMUM TOTAL WEIGHT.
S. Moran, I. Newman, and Y. Wolfstahl.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 486. 1988.]
110451 NONMONOTONIC DEFAULT MODAL LOGICS.
M. Tiomkin and M. Kaminski.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 487. 1988.]
110452 IMPOSSIBILITY RESULTS IN THE PRESENCE OF MULTIPLE FAULTY PROCESSES.
G. Taubenfeld, S. Katz, and S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 492. 1988.]
110453 ON THE EXISTENCE OF PSEUDORANDOM GENERATORS.
O. Goldreich, H. Krawczyk, and M. Luby.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 494. 1988.]
110454 ANALYSIS OF A DISTRIBUTED SCHEDULER FOR COMMUNICATION NETWORKS.
J. Malka, S. Moran, and S. Zaks.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 495. 1988.]
110455 PROBABILISTIC TERMINATION VERSUS FAIR TERMINATION.
M. Tiomkin.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 496. 1988.]
110456 THE DEADLOCK PROBLEM IN COMPUTING AND COMMUNICATION SYSTEMS - AN
ANNOTATED BIBLIOGRAPHY.
M. Hofri.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 500. 1988.]
110457 OPTIMAL COVERING OF CACTI BY VERTEX-DISJOINT PATHS.
S. Moran and Y. Wolfstahl.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 501. 1988.]
110458 MINIMUM-DIAMETER CYCLIC ARRANGEMENTS IN MAPPING DATA FLOW GRAPHS ONTO
VLSI ARRAYS.
P. Erdos et al.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 502. 1988. Revised version of [Department
of Computer Science] technical report no. 306.]
110459 INTERLEAVING SET TEMPORAL LOGIC.
S. Katz and D. Peled.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 505. 1988.]
110460 IMPOSSIBILITY RESULTS FOR DECISION PROTOCOLS.
G. Taubenfeld.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 506. 1988. Revised version of [Department
of Computer Science] technical report no. 445.]
110461 TOWARDS A THEORY OF AVERAGE CASE COMPLEXITY (A SURVEY).
O. Goldreich.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 507. 1988.]
110462 ON THE POSSIBILITIES OF DFS TREE CONSTRUCTIONS: SEQUENTIAL AND
PARALLEL ALGORITHMS.
E. Korach and Z. Ostfeld.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 508. 1988. "Extended abstract."]
110463 UNISON IN DISTRIBUTED SYSTEMS.
S. Even and S. Rajsbaum.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 512. 1988.]
110464 AN INFERENCE ENGINE FOR REPRESENTING MULTIPLE THEORIES.
W. Emde.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 64. 1988.]
110465 ZUM LEXIKONZUGRIFF BEI DER GENERIERUNG MIT GPSG.
S. Busemann.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 65. 1988.]
110466 TECHNIKEN ZUM ZUSAMMENSCHLUSS VON RECHNERNETZEN UND DEREN ANWENDUNG
AUF PROTOKOLLE DES TRANSPORTSYSTEMS.
E. Biersack.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8802. 1988.]
110467 INSECURITIES IN THE ADA PROGRAMMING LANGUAGE: AN INTERIM REPORT.
B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 122/88. 1988.]
110468 SYMBOLIC GENERATION OF ROBOT DYNAMIC EQUATIONS. PART II: CASE STUDIES
USING DYNAM/CLEAR SYSTEM.
R. W. Toogood.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 87-05. 1988.]
110469 THREE PAPERS ON PHONOLOGY & PHONETICS. 1. SOUND CHANGE IS DRAWN FROM
A POOL OF SYNCHRONIC VARIATION. 2. COMPARISON OF SPEECH SOUNDS:
DISTANCE VS. COST METRICS. 3. THE COGNITIVE COST OF PHONOLOGICAL
ANALYSIS.
J. J. Ohala.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Report no. 53. 1988.]
110470 ARCHITECTURAL ISSUES IN FAULT-TOLERANT, SECURE COMPUTING SYSTEMS.
M. K. Joseph.
[University of California, Los Angeles. Computer Science Department.
CSD-880047. 1988. Thesis (Ph.D.).]
110471 COMMENTS TO "A SYSTOLIC ARRAY FOR COMPUTING B A SUPERSCRIPT -1."
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880048. 1988.]
110472 RADIX-4 DIVISION WITH SCALING AND QUOTIENT PREDICTION.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880049. 1988.]
110473 A CONNECTIONIST MODEL OF SENTENCE GENERATION IN A FIRST AND SECOND
LANGUAGE.
M. E. Gasser.
[University of California, Los Angeles. Computer Science Department.
CSD-880050. 1988. Thesis (Ph.D.). "A dissertation submitted in
partial satisfaction of the requirements for the degree Doctor of
Philosophy in Applied Linguistics."]
110474 INFLUENCE DIAGRAMS AND D-SEPARATION.
T. Verma and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880052. 1988. Also issued as R-101, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110475 TOWARD THE FORMALIZATION OF INFORMATIONAL DEPENDENCIES.
D. Geiger.
[University of California, Los Angeles. Computer Science Department.
CSD-880053. 1988. Also issued as R-102, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110476 NON-BAYESIAN FORMALISMS FOR MANAGING UNCERTAINTY.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880054. 1988.]
110477 EVIDENTIAL REASONING UNDER UNCERTAINTY.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880055. 1988. Also issued as R-107-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
110478 BELIEF MAINTENANCE IN DYNAMIC CONSTRAINT NETWORKS.
R. Dechter and A. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-880056. 1988. Also issued as R-108-L, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
110479 A DISTRIBUTED ALGORITHM FOR ATMS.
R. Dechter.
[University of California, Los Angeles. Computer Science Department.
CSD-880057. 1988. Also issued as R-109 (S), Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
110480 ON THE LOGIC OF DEFAULTS.
H. Geffner.
[University of California, Los Angeles. Computer Science Department.
CSD-880058. 1988. Also issued as R-110, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110481 OPTIMIZATION IN CONSTRAINT NETWORKS.
R. Dechter, A. Dechter, and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880059. 1988. Also issued as R-111, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110482 ON THE LOGIC OF INFLUENCE DIAGRAMS.
D. Geiger and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880060. 1988. Also issued as R-112, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110483 THE LOGIC OF INFLUENCE DIAGRAMS.
J. Pearl, D. Geiger, and T. Verma.
[University of California, Los Angeles. Computer Science Department.
CSD-880061. 1988. Also issued as R-114, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
110484 A POTENTIAL-BASED PROOF FOR A CERTAIN PEBBLING GAME AND ITS
GENERALIZATION.
E. Gafni and G. Robins.
[University of California, Los Angeles. Computer Science Department.
CSD-880062. 1988.]
110485 ARRAYS FOR PARTITIONED MATRIX ALGORITHMS: TRADEOFFS BETWEEN CELL
STORAGE AND CELL BANDWIDTH.
J. H. Moreno and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880065. 1988.]
110486 REDUCED REGISTER SAVING/RESTORING FOR SMALL REGISTER FILES.
M. Huguet and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880066. 1988.]
110487 ALTERNATIVE IMPLEMENTATIONS OF A RADIX-4 DIVIDER WITH SCALING.
R. Modiri and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880069. 1988.]
110488 ON-THE-FLY ROUNDING FOR DIVISION AND SQUARE ROOT.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880071. 1988.]
110489 FAST RADIX-2 DIVISION WITH QUOTIENT-DIGIT PREDICTION.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880072. 1988.]
110490 PERFORMANCE MODELING AND ANALYSIS FOR A LARGE HETEROGENEOUS
DISTRIBUTED SYSTEM: UCLA-SEASNET.
J. Betser et al.
[University of California, Los Angeles. Computer Science Department.
CSD-880073. 1988.]
110491 SYMBOLIC NEUROENGINEERING FOR NATURAL LANGUAGE PROCESSING: A
MULTILEVEL RESEARCH APPROACH.
M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-880075. 1988. "An initial version of this paper was presented at
the AAAI & ONR sponsored Workshop on High-Level Connectionism, held
at New Mexico State University, April 9-11, 1988." Also issued as
UCLA-AI-88-14, Artificial Intelligence Laboratory, University of
California, Los Angeles.]
110492 EXECUTING BEHAVIORAL DEFINITIONS IN HIGHER ORDER LOGIC.
A. J. Camilleri.
[University of Cambridge. Computer Laboratory. Technical report 140.
1988. Thesis (Ph.D.).]
110493 RELIABLE MANAGEMENT OF VOICE IN A DISTRIBUTED SYSTEM.
R. Want.
[University of Cambridge. Computer Laboratory. Technical report 141.
1988. Thesis (Ph.D.).]
110494 A FAST PACKET SWITCH FOR THE INTEGRATED SERVICES BACKBONE NETWORK.
P. Newman.
[University of Cambridge. Computer Laboratory. Technical report 142.
1988. Version 2.2.]
110495 EXPERIENCE WITH ISABELLE: A GENERIC THEOREM PROVER.
L. C. Paulson.
[University of Cambridge. Computer Laboratory. Technical report 143.
1988. Preliminary version: August 1988.]
110496 AN OPERATIONAL SEMANTICS FOR OCCAM.
J. Camilleri.
[University of Cambridge. Computer Laboratory. Technical report 144.
1988. "This is an extended version of technical report no. 125 from
the Computer Laboratory."]
110497 MECHANIZING PROGRAMMING LOGICS IN HIGHER ORDER LOGIC.
M. J. C. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 145.
1988.]
110498 AUTOMATING RECURSIVE TYPE DEFINITIONS IN HIGHER ORDER LOGIC.
T. F. Melham.
[University of Cambridge. Computer Laboratory. Technical report 146.
1988.]
110499 FORMAL SPECIFICATION AND VERIFICATION OF MICROPROCESSOR SYSTEMS.
J. J. Joyce.
[University of Cambridge. Computer Laboratory. Technical report 147.
1988. "An earlier version of this paper will appear in: 'EUROMICRO
88, Proceedings of the 14th Symposium on Microprocessing and
Microprogramming, Zurich, Switzerland, 29 August - 1 September,
1988,' S. Winter and H. Schumny, eds., North-Holland, 1988."]
110500 TAPESTRY: UNIFYING SHARED AND DISTRIBUTED MEMORY PARALLEL SYSTEMS.
R. H. Campbell and D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1449. 1988.]
110501 A STUDY OF SCALING AND GENERALIZATION IN NEURAL NETWORKS.
S. Ahmad.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1454. 1988. Thesis (M.S.).]
110502 FIRST AND SECOND GENERATION HYPERCUBE PERFORMANCE.
D. K. Bradley.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1455. 1988. Also issued as TTR88-2, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
110503 BUFFER MANAGEMENT FOR NETWORK DATABASES.
S. M. Kuck and Y. Pang.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1456. 1988.]
110504 TYPED SMALLTALK WORKING PAPERS: 1988.
P. D. Gilbert et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1457. 1988. "This is a collection of working
papers for thge Typed Smalltakk project at the University of Illinois
at Urbana-Champaign."]
110505 THE DESIGN OF THE CLEMMA CONFIGURATION LIBRARIAN SYSTEM.
H. S. Render and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1458. 1988.]
110506 A C++ INTERPRETER FOR SCHEME.
V. F. Russo and S. M. Kaplan.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1461. 1988. Also issued as TTR88-6, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
110507 FAULT-TOLERANT REFERENCE COUNTING FOR GARBAGE COLLECTION IN
DISTRIBUTED SYSTEMS.
L. V. Mancini and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 260. 1988.]
110508 MODELLING DYNAMIC RECONFIGURATION IN TMR SYSTEMS.
M. Pietkiewicz-Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 261. 1988.]
110509 A TECHNICAL OVERVIEW OF ARJUNA: A SYSTEM FOR RELIABLE DISTRIBUTED
COMPUTING.
S. K. Shrivastava et al.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 262. 1988.]
110510 A FORMAL TREATMENT OF INTERFERENCE IN REMOTE PROCEDURE CALLS.
G. Pappalardo and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 263. 1988.]
110511 CPD: A USEFUL TOOL FOR DESIGNING EXPERT SYSTEMS.
Y. Zhang.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 265. 1988.]
110512 A RIEMANN SOLVER FOR A TWO-PHASE MULTICOMPONENT PROCESS.
T. Johansen, A. Tveito, and R. Winther.
[University of Oslo. Institute for Informatics. Research report 114.
1988. Part I of Aslak Tveito's Dr. Scient. thesis.]
110513 CONVERGENCE AND STABILITY OF THE LAX-FRIEDRICHS SCHEME FOR A
NONLINEAR PARABOLIC POLYMER FLOODING PROBLEM.
A. Tveito.
[University of Oslo. Institute for Informatics. Research report 115.
1988. Part II of the author's Dr. Scient. thesis.]
110514 CONVERGENCE OF A NON-CONSERVATIVE FINITE DIFFERENCE SCHEME FOR A
SYSTEM OF HYPERBOLIC CONSERVATION LAWS.
A. Tveito and R. Winther.
[University of Oslo. Institute for Informatics. Research report 117.
1988. Part III of Aslak Tveito's Dr. Scient. thesis.]
110515 SYSTEMS OF NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS MODELING POLYMER
FLOODING.
A. Tveito.
[University of Oslo. Institute for Informatics. Research report 118.
1988. Thesis (D.Sci.).]
110516 CONSTRUCTING A BINARY TREE FROM ITS UNIVERSALS.
E. Maekinen.
[University of Tampere. Department of Computer Science. A-1988-8.
1988.]
110517 A NOTE ON SEQUENTIAL ACCESS IN SPLAY TREES.
E. Maekinen.
[University of Tampere. Department of Computer Science. A-1988-9.
1988.]
110518 VINCENT AND THE SPLIT CELL.
B. J. Geraci.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-17. 1988.]
110519 A MEASUREMENT STUDY OF TWO LOCAL AREA NETWORK DATA LINK LEVEL
PROTOCOLS.
B. L. Barnett III and M. K. Molloy.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-18. 1988.]
110520 OBJECT ORIENTED IDENTITY IN OMEGA: AN OBJECT-ORIENTED DATABASE SYSTEM
FOR MANAGING MULTIMEDIA DATA.
Y. Masunaga.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-19. 1988.]
110521 ISSUES IN OBJECT-ORIENTED DATABASE SCHEMAS.
H. J. Kim.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-20. 1988. Thesis (Ph.D.).]
110522 A RELATIONAL NOTION FOR STATE TRANSITION SYSTEMS.
S. S. Lam and A. U. Shankar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-21. 1988. May 1988. Revised: August 1988.]
110523 A FACILITY FOR THE DISPLAY AND MANIPULATION OF DEPENDENCY GRAPHS.
R. Sriram.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-22. 1988. Thesis (M.S.).]
110524 A NEW EXPLANATION OF THE GLITCH PHENOMENON.
J. H. Anderson and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-23. 1988.]
110525 TOKEN SYSTEMS THAT SELF-STABILIZE.
G. M. Brown, M. G. Gouda, and C. Wu.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-24. 1988.]
110526 FORMAL SPECIFICATION OF REAL-TIME SYSTEMS.
F. Jahanian, A. K. Mok, and D. A. Stuart.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-25. 1988.]
110527 A NOVEL STORAGE SCHEME FOR PARALLEL JACOBI METHODS.
R. A. van de Geijn.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-26. 1988.]
110528 THE KYKLOS (N MOD R=0) ROUTING ALGORITHM.
F. F. Haddix et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-27. 1988.]
110529 PARALLEL DEPTH FIRST SEARCH, PART I: IMPLEMENTATION.
V. Nageshwara Rao and V. Kumar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-28. 1988.]
110530 PARALLEL DEPTH FIRST SEARCH, PART II: ANALYSIS.
V. Kumar and V. Nageshwara Rao.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-29. 1988.]
110531 SPECIFYING TWO IMPLEMENTATIONS TO SATISFY A SERIALIZABLE DATABASE
INTERFACE.
S. S. Lam and A. U. Shankar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-30. 1988.]
110532 INTRODUCTION TO LOGIC PROGRAMMING.
K. R. Apt.
[University of Texas, Austin. Department of Computer Sciences.
TR-87-35. 1988. "Revised and extended version."]
110533 ERNY - AN EXPLICIT RUNGE-KUTTA NYSTROM INTEGRATOR FOR SECOND ORDER
INITIAL VALUE PROBLEMS.
P. W. Sharp and J. M. Fine.
[University of Toronto. Department of Computer Science. Technical
report 199/87. 1987.]
110534 COMPLEXITY RESULTS ON THE FUNCTIONAL DECOMPOSITION OF POLYNOMIALS.
M. W. Giesbrecht.
[University of Toronto. Department of Computer Science. Technical
report 209/88 1988. Thesis (M.S.).]
110535 FUNCTIONAL INTERPRETATIONS OF FEASIBILITY ARITHMETIC.
S. Cook and A. Urquhart.
[University of Toronto. Department of Computer Science. Technical
report 210/88. 1988.]
110536 R-STABLE (3,4) SINGLY DIAGONALLY IMPLICIT RUNGE-KUTTA NYSTROM PAIRS
OF DISPERSIVE ORDERS FOUR AND SIX.
P. W. Sharp and J. M. Fine.
[University of Toronto. Department of Computer Science. Technical
report 211/88. 1988.]
110537 TECHNIQUES FOR DEBUGGING PARALLEL PROGRAMS WITH FLOWBACK ANALYSIS.
J.-D. Choi, B. P. Miller, and R. Netzer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 786. 1988.]
110538 ERROR BOUNDS FOR NONDEGENERATE MONOTONE LINEAR COMPLEMENTARITY
PROBLEMS.
O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 787. 1988.]
110539 STABILITY NUMBER AND CHROMATIC NUMBER OF TOLERANCE GRAPHS.
G. Narasimhan and R. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 788. 1988.]
110540 EVALUATION OF RETRANSMISSION STRATEGIES IN A LOCAL AREA NETWORK
ENVIRONMENT.
A. Mukherjee, L. H. Landweber, and J. C. Strikwerda.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 789. 1988.]
110541 HIGH-BANDWIDTH INTERLEAVED MEMORIES FOR VECTOR PROCESSORS - A
SIMULATION STUDY.
G. S. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 790. 1988.]
110542 PERSISTENCE IN THE E LANGUAGE: ISSUES AND IMPLEMENTATION.
J. E. Richardson and M. J. Carey.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 791. 1988.]
110543 ON APPROXIMATE CONVEX HULL ALGORITHMS.
I. Stojmenovic and C. E. Kim.
[Washington State University. Computer Science Department. CS-87-175.
1987.]
110544 PARALLEL COMPUTATIONAL GEOMETRY.
I. Stojmenovic.
[Washington State University. Computer Science Department. CS-87-176.
1987.]
110545 AN IMPROVED ALGORITHM TO FIND THE LENGTH OF THE LONGEST COMMON
SUBSEQUENCE OF TWO STRINGS.
G. R. Cross and S. Kuo.
[Washington State University. Computer Science Department. CS-87-178.
1987.]
110546 PARALLEL ALGORITHMS FOR DIGITAL GEOMETRY.
C. E. Kim and I. Stojmenovic.
[Washington State University. Computer Science Department. CS-87-179.
1987.]
110547 COMPUTATIONAL GEOMETRY ON A HYPERCUBE.
I. Stojmenovic.
[Washington State University. Computer Science Department. CS-87-180.
1987.]
110548 ON ACHIEVING CONSENSUS USING A SHARED MEMORY.
K. Abrahamson.
[Washington State University. Computer Science Department. CS-88-184.
1988.]
110549 BIALGEBRAS: SOME FOUNDATIONS FOR DISTRIBUTED AND CONCURRENT
COMPUTATION.
D. B. Benson.
[Washington State University. Computer Science Department. CS-88-186.
1988. Revised: April 1988.]
110550 ON A PROPOSED DIVIDE-AND-CONQUER MINIMAL SPANNING TREE ALGORITHM.
M. A. Langston and I. Stojmenovic.
[Washington State University. Computer Science Department. CS-88-187.
1988. Revised: May 1988.]
110551 ON WELL-PARTIAL-ORDER THEORY AND ITS APPLICATION TO COMBINATORIAL
PROBLEMS OF VLSI DESIGN.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-88-188.
1988.]
110552 FAST SEARCH ALGORITHMS FOR GRAPH LAYOUT PERMUTATION PROBLEMS.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-88-189.
1988.]
110553 CONSTRUCTIVE COMPLEXITY.
K. Abrahamson et al.
[Washington State University. Computer Science Department. CS-88-191.
1988. Preliminary version: August 1988.]
110554 DENSE SYMMETRIC NETWORKS FROM LINEAR GROUPS AND CODES.
G. E. Carlsson et al.
[Washington State University. Computer Science Department. CS-88-192.
1988. "Extended abstract."]
110555 SOME LINGUISTIC "ERRORS" IN SCIENTIFIC AND OTHER WRITING.
I. J. Good.
[1988. "This is the longer version of an article that appeared in Va
Tech 'Spectrum,' 1987, December 3." NO ISSUING AGENCY INDICATED
(author's address: Virginia Polytechnic Institute and State
University, Blacksburg, VA 24061).]
VOL. 11, NO. 1 01/15/88
110556 THE USE OF STATIC CONSTRUCTS IN A MODAL PROCESS LOGIC.
H. Huettel and K. G. Larsen.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Afdeling for Matematik og Datalogi. Report no. 88-36. 1988.]
110557 OBJECT-ORIENTED CONCEPT HIERARCHIES.
P. Wegner.
[Brown University. Computer Science Department. Technical report
CS-88-06. 1988.]
110558 A PARALLEL ALGORITHM FOR CHANNEL ROUTING.
J. E. Savage and M. G. Wloka.
[Brown University. Computer Science Department. Technical report
CS-88-11. 1988.]
110559 HYBRID: IMPLEMENTING CLASSES WITH PROTOTYPES.
A. Mercado Jr.
[Brown University. Computer Science Department. Technical report
CS-88-12. 1988. Masters Project.]
110560 KEEPING PRIORITIES STRAIGHT: AN INVESTIGATION OF INCREMENTAL
ALGORITHMS.
B. Alpern et al.
[Brown University. Computer Science Department. Technical report
CS-88-13. 1988. "Summary with appendix."]
110561 SUPERCOMPUTING WITH VLSI.
S. Manohar.
[Brown University. Computer Science Department. Technical report
CS-88-14. 1988. Thesis (Ph.D.).]
110562 A SHARED VIEW OF SHARING: THE TREATY OF ORLANDO.
L. A. Stein, H. Lieberman, and D. Ungar.
[Brown University. Computer Science Department. Technical report
CS-88-15. 1988.]
110563 AN EFFICIENT METHOD OF COMPUTING STATIC SINGLE ASSIGNMENT FORM.
R. Cytron et al.
[Brown University. Computer Science Department. Technical report
CS-88-16. 1988.]
110564 LEARNING IN PARALLEL.
J. S. Vitter and J.-H. Lin.
[Brown University. Computer Science Department. Technical report
CS-88-17. 1988.]
110565 INTEGRATION MECHANISMS IN THE FIELD ENVIRONMENT.
S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-88-18. 1988.]
110566 ARCHITECTURE-INDEPENDENT VIRTUAL MEMORY MANAGEMENT FOR PARALLEL AND
DISTRIBUTED ENVIRONMENTS: THE MACH APPROACH.
A. Tevanian Jr.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-106. 1987. Thesis (Ph.D.).]
110567 FINAL REPORT ON INFORMATION PROCESSING RESEARCH: JANUARY 1985 TO
SEPTEMBER 1987.
R. T. Levine.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-110. 1988. Edited by Rachel T. Levine and the Research
Documents Group.]
110568 TWO ALGORITHMS FOR MAINTAINING ORDER IN A LIST.
D. D. Sleator and P. F. Dietz.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-113. 1988. "A preliminary version of this paper was
presented at the 19th Annual ACM Symposium on Theory of Computing,
New York, May 25-27, 1987."]
110569 THE STATE OF THE ART IN VISUAL PROGRAMMING AND PROGRAM VISUALIZATION.
B. A. Myers.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-114. 1988.]
110570 OPERATING SYSTEM/APPLICATION CONCURRENCY IN TIGHTLY-COUPLED
MULTIPLE-PROCESSOR SYSTEMS.
J. W. Wendorf.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-117. 1987. Thesis (Ph.D.).]
110571 ON FUNCTORS EXPRESSIBLE IN THE POLYMORPHIC TYPED LAMBDA CALCULUS.
J. C. Reynolds and G. D. Plotkin.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-125. 1988.]
110572 AN INTEGRATED SPEECH AND NATURAL LANGUAGE DIALOG SYSTEM: USING DIALOG
KNOWLEDGE IN SPEECH RECOGNITION.
S. R. Young, A. G. Hauptmann, and W. H. Ward.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-128. 1988.]
110573 PARTHENON: A PARALLEL THEOREM PROVER FOR NON-HORN CLAUSES.
S. Bose et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-137. 1988.]
110574 AUTOMATION AND CALIBRATION FOR ROBOT VISION SYSTEMS.
S. A. Shafer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-147. 1988.]
110575 COMPUTER PERCEPTION OF REPETITIVE TEXTURES.
L. G. C. Hamey.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-149. 1988. Thesis (Ph.D.).]
110576 THE GARNET USER INTERFACE DEVELOPMENT ENVIRONMENT: A PROPOSAL.
B. A. Myers.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-153. 1988.]
110577 THE INTERNAL MODEL OF POLYMORPHIC LAMBDA CALCULUS.
A. Asperti.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-155. 1988.]
110578 A DISCRETE SCALE-SPACE REPRESENTATION.
Z. Aviad.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-156. 1988.]
110579 ROAD FINDING FOR ROAD NETWORK EXTRACTION.
Z. Aviad and P. D. Carnine Jr.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-157. 1988. "This is an extended version of a paper
presented in the Conference on Computer Vision and Pattern
Recognition, held in Ann Arbor, MI, June 1988."]
110580 PRELIMINARY DESIGN OF THE PROGRAMMING LANGUAGE FORSYTHE.
J. C. Reynolds.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-159. 1988.]
110581 USING A NEURAL NETWORK TO LEARN THE DYNAMICS OF THE CMU DIRECT-DRIVE
ARM II.
K. Goldberg and B. Pearlmutter.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-160. 1988.]
110582 A PHYSICAL APPROACH TO COLOR IMAGE UNDERSTANDING.
G. J. Klinker.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-161. 1988. Thesis (Ph.D.).]
110583 VERIFIABLE IMPLEMENTATIONS OF GEOMETRIC ALGORITHMS USING FINITE
PRECISION ARITHMETIC.
V. J. Milenkovic.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-168. 1988. Thesis (Ph.D.).]
110584 BAYESIAN MODELING OF UNCERTAINTY IN LOW-LEVEL VISION.
R. S. Szeliski.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-169. 1988. Thesis (Ph.D.).]
110585 SPECIFYING RECOVERABLE OBJECTS.
J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-170. 1988.]
110586 ADDING INPUT AND OUTPUT TO THE TRANSACTIONAL MODEL.
R. Pausch.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-171. 1988. Thesis (Ph.D.).]
110587 MODEL BASED REASONING OF DEVICE BEHAVIOR WITH CAUSAL ORDERING.
Y. Iwasaki.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-172. 1988. Thesis (Ph.D.).]
110588 MIRO SEMANTICS FOR SECURITY.
M. W. Maimone, J. D. Tygar, and J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-173. 1988.]
110589 A RANDOM POLYNOMIAL TIME ALGORITHM FOR ESTIMATING VOLUMES OF CONVEX
BODIES.
M. Dyer, A. Frieze, and R. Kannan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-174. 1988. Preliminary version: August 25, 1988.]
110590 IPWATCH: A TOOL FOR MONITORING NETWORK LOCALITY.
M. J. Lorence and M. Satyanarayanan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-176. 1988.]
110591 RELIABLE SERVERS: DESIGN AND IMPLEMENTATION IN AVALON/C++.
R. A. Lerner.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-177. 1988.]
110592 REASONING ABOUT PROCEDURES AS PARAMETERS IN THE LANGUAGE L4.
S. M. German, E. M. Clarke, and J. Y. Halpern.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-181. 1988.]
110593 MUNDANE REASONING BY PARALLEL CONSTRAINT SATISFACTION.
M. Derthick.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-182. 1988. Thesis (Ph.D.).]
110594 A TWO-VIEW DOCUMENT EDITOR WITH USER-DEFINABLE DOCUMENT STRUCTURE.
K. P. Brooks.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 33. 1988. Thesis (Ph.D.). "This report reproduces, with minor
changes, a dissertation submitted in May 1988 to the Department of
Computer Science at Stanford University in partial fulfillment of the
requirements for the degree of Doctor of Philosophy."]
110595 EXPERIMENT WITH AUTO AND AUTOGRAPH ON A SIMPLE CASE OF SLIDING WINDOW
PROTOCOL.
G. Boudol, R. de Simone, and D. Vergamini.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 870. 1988.]
110596 A TYPE SYSTEM FOR A DECLARATIVE LANGUAGE.
R. B. Kieburtz.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 874. 1988.]
110597 DISTRIBUTED BISIMULATIONS.
I. Castellani and M. Hennessy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 875. 1988.]
110598 LAMBDA-UPSILON-OMEGA: AN ASSISTANT ALGORITHMS ANALYSER.
P. Flajolet, B. Salvy, and P. Zimmermann.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 876. 1988.]
110599 DETERMINATION SPATIO-TEMPORELLE DE TRACEURS DANS UNE SEQUENCE
D'IMAGES SOUS-MARINES A DES FINS DE TRAJECTOGRAPHIE.
P. Lalande and P. Bouthemy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 877. 1988. Also issued as Publication
interne 415, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110600 COMPARISON OF PRIORITY RULES IN PATTERN MATCHING AND TERM REWRITING.
A. Laville.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 878. 1988.]
110601 ON THE STABILITY CONDITION OF A PRECEDENCE-BASED QUEUEING DISCIPLINE.
F. Baccelli and Z. Liu.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 880. 1988.]
110602 COMPILING TEMPORAL LOGIC SPECIFICATIONS INTO OBSERVERS.
O. Drissi-Kaitouni and C. Jard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 881. n.d. Also issued as Publication
interne 421, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110603 A GRAMMATICAL VIEW OF LOGIC PROGRAMMING.
P. Deransart and J. Maluszynski.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 883. 1988.]
110604 MLE FOR PARTIALLY OBSERVED DIFFUSIONS: DIRECT MAXIMIZATION VS. THE EM
ALGORITHMS.
F. Campillo and F. Le Gland.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 884. 1988.]
110605 TOWARD A LAMBDA-CALCULUS FOR CONCURRENT AND COMMUNICATING SYSTEMS.
G. Boudol.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 885. 1988.]
110606 AN EMPIRICALLY-DERIVED CONTROL STRUCTURE FOR THE PROCESS OF PROGRAM
UNDERSTANDING.
F. Detienne and E. Soloway.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 886. 1988.]
110607 THEO: AN INTERACTIVE PROOF DEVELOPMENT SYSTEM.
J. Despeyroux.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 887. 1988.]
110608 JPDRAW: UN EDITEUR DE DESSINS SUR SUN POUR LATEX.
J.-P. Merlet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport technique 97. 1988.]
110609 SEMI-DISCRETE APPROXIMATIONS TO NONLINEAR SYSTEMS OF CONSERVATION
LAWS: CONSISTENCY AND L SUPERSCRIPT INFINITY-STABILITY IMPLY
CONVERGENCE.
E. Tadmor.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-41. 1988.]
110610 DOMAIN DECOMPOSITION METHODS FOR THE PARALLEL COMPUTATION OF REACTING
FLOWS.
D. E. Keyes.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-52. n.d.]
110611 AN ADAPTIVE PSUEDOSPECTRAL METHOD FOR DISCONTINUOUS PROBLEMS.
J. M. Augenbaum.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-54. 1988.]
110612 AN ASYMPTOTIC INDUCED NUMERICAL METHOD FOR THE
CONVECTION-DIFFUSION-REACTION EQUATION.
J. S. Scroggs and D. C. Sorenson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-60. 1988.]
110613 ENERGY CONSUMPTION IN VLSI CIRCUITS.
A. Aggarwal, A. K. Chandra, and P. Raghavan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13542. 1988.]
110614 THE PLACEMENT OPTIMIZATION PROGRAM: A PRACTICAL SOLUTION TO THE DASD
FILE ASSIGNMENT PROBLEM.
J. Wolf.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14009. 1988.]
110615 THE FRACTAL SIMULATION OF BIOLOGICAL SHAPES.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14014. 1988.]
110616 EXTENDING OBJECTS TO PROVIDE MULTIPLE INTERFACES.
B. Hailpern and H. Ossher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14016. 1988.]
110617 QUALITATIVE PHYSICS USING DIMENSIONAL ANALYSIS.
R. Bhaskar and A. Nigam.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14017. 1988.]
110618 PROGRAM CORRECTNESS: CAN ONE TEST FOR IT?
M. Blum and P. Raghavan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14038. 1988.]
110619 THE PARALLEGO SYSTEM: SMALL TO LARGE PARALLEL SYSTEMS USING COMMON
ELEMENTS.
J. J. Ruedinger.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14039. 1988.]
110620 ON-LINE HANDWRITING RECOGNITION - A SURVEY.
C. C. Tappert, C. Y. Suen, and T. Wakahara.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14045. 1988.]
110621 PROCEDURAL MODELS FOR DESIGN AND FABRICATION.
J. R. Rossignac, P. Borrel, and L. R. Nackman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14056. 1988.]
110622 OPTIMAL NON-LINEAR APPROXIMATION.
R. A. DeVore, R. Howard, and C. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14068. 1988.]
110623 PFPREF - TRANSLATING IBM PARALLEL FORTRAN INTO PREFACE.
D. Bernstein.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14069. 1988.]
110624 A DIVIDE-AND-CONQUER CURSIVE SCRIPT RECOGNIZER.
C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14070. 1988.]
110625 APPLICATIONS OF ON-LINE HANDWRITING RECOGNITION.
C. C. Tappert.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14071. 1988.]
110626 RECENT PROGRESS IN JUGGLING ROBOT RESEARCH.
M. D. Donner and J. Kalvan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14080. 1988.]
110627 BOUNDS ON THE ENTROPY SERIES.
R. M. Capocelli, A. De Santis, and I. J. Taneja.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14081. 1988.]
110628 A NOTE ON D-ARY HUFFMAN CODES.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14082. 1988.]
110629 NON-INTERACTIVE ZERO-KNOWLEDGE WITH PREPROCESSING.
A. De Santis, S. Micali, and G. Persiano.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14083. 1988.]
110630 TIGHT UPPER BOUNDS ON THE ENTROPY SERIES.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14084. 1988.]
110631 CONCURRENCY AND CONSISTENCY IN HIGH ACTIVITY B-TREES.
G. Bozman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14086. 1988.]
110632 PARALLEL GRAPH-REDUCTION WITH A SHARED MEMORY MULTIPROCESSOR SYSTEM.
G. Revesz.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14087. 1988.]
110633 PREVENTING CONGESTION IN MULTISTAGE NETWORKS IN THE PRESENCE OF
HOTSPOTS.
D. M. Dias and M. Kumar.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14088. 1988.]
110634 FOUR SHORT COMPUTER GRAPHICS VISUALIZATION EXPERIMENTS.
C. A. Pickover and A. Lakhtakia.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14089. 1988.]
110635 A CACHE DIAGNOSTIC METHOD.
R. P. Kunda et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14094. 1988.]
110636 TESTING MEMORY MANAGEMENT UNITS.
J. Hamilton, R. P. Kunda, and B. D. Rathi.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14095. 1988.]
110637 COMPUTING WITH RECURSIVE TYPES.
S. S. Cosmadakis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14096. 1988. "Extended abstract."]
110638 A SIMULATOR FOR A MULTIPLE AGENT ELECTRONIC ASSEMBLY SYSTEM.
F. C. Park, J. U. Korein, and S. J. Buckley.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14098. 1988.]
110639 FAST MOTION PLANNING FOR MULTIPLE MOVING ROBOTS.
S. J. Buckley.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14099. 1988.]
110640 TRAFFIC STUDIES OF UNBUFFERED DELTA NETWORKS.
P. Heidelberger and P. A. Franaszek.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14103. 1988.]
110641 FORMAL SPECIFICATION AND VERIFICATION OF ADA PACKAGES.
N. H. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14105. 1988.]
110642 REVIEW OF "MH-1, A COMPUTER-OPERATED MECHANICAL HAND," A PH.D.
DISSERTATION BY H. A. ERNST.
R. H. Taylor.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14106. 1988. Review of Heinrich A.
Ernst's Ph.D. thesis, Massachusetts Institute of Technology, December
1961.]
110643 ON THE FIRST-ORDER EXPRESSIBILITY OF RECURSIVE QUERIES.
S. S. Cosmadakis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14109. 1988. "Extended abstract."]
110644 PROBABILISTIC CLOCK SYNCHRONIZATION.
F. Cristian.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6432. 1988.]
110645 THE INFLUENCES OF ALGORITHMIC AND HARDWARE DEVELOPMENT ON
COMPUTATIONAL MATHEMATICAL PROGRAMMING.
J. A. Tomlin.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6459. 1988. "Presented as the Martin
Beale Memorial Lecture."]
110646 A MODEL-THEORETIC ANALYSIS OF KNOWLEDGE.
R. Fagin, J. Y. Halpern, and M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6461. 1988. "A preliminary version of
this paper appeared in 'Proc. [of the] 25th IEEE Symp. on Foundations
of Computer Science, 1984,' pp. 268-278."]
110647 PARITY AND THE PIGEONHOLE PRINCIPLE.
M. Ajtai.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6465. 1988.]
110648 B2- AND B3-SPLINES FOR INTERACTIVE CURVE FITTING.
K. Chu.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6469. 1988.]
110649 ON OPTIMAL NUMBER OF FEATURES IN CLASSIFICATION.
J. Rissanen.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6471. 1988.]
110650 TOKEN-RING LOCAL-AREA NETWORKS AND THEIR PERFORMANCE.
W. Bux.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1748. 1988.]
110651 THE CHRIS CONSULTANT - A TOOL FOR DATABASE DESIGN AND RAPID
PROTOTYPING.
A. L. Furtado, M. A. Casanova, and L. Tucherman.
[International Business Machines Corporation (IBM). Rio Scientific
Center. Technical report CCR061. 1988.]
110652 TOWARDS A MANY-VALUED LOGIC OF QUANTIFIED BELIEF.
D. Driankov.
[Linkoeping University. Department of Computer and Information
Science. Linkoeping studies in science and technology. Thesis 192.
1988.]
110653 LOGIC PROGRAMMING WITH EXTERNAL PROCEDURES: INTRODUCING S-UNIFICATION.
J. Leszczylowski, S. Bonnier, and J. Maluszynski.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-01. 1988.]
110654 INFERRING RESTRICTED AND-PARALLELISM IN LOGIC PROGRAMS USING ABSTRACT
INTERPRETATION.
U. Nilsson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-02. 1988.]
110655 TOWARDS CLEAN AMALGAMATION OF LOGIC PROGRAMS WITH EXTERNAL PROCEDURES.
S. Bonnier and J. Maluszynski.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-03. 1988.]
110656 A REPRESENTATION OF COORDINATED ACTIONS CHARACTERIZED BY INTERVAL
VALUED CONDITIONS.
C. Baeckstroem.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-06. 1988.]
110657 A CONTROL-STRATEGY-INDEPENDENT PARSER FOR PATR.
M. Wiren.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-10. 1988.]
110658 AN INCREMENTAL CHART PARSER FOR PATR.
M. Wiren.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-11. 1988.]
110659 SOFTWARE ARCHITECTURE AND PROGRAMMING PARADIGMS FOR ROBOTICS
APPLICATIONS.
E. Sandewall, J. Hultman, and E. Tengvald.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-12. 1988.]
110660 TYPES IN SPACE: TOWARDS FLEXIBLE HIGH-SPEED OBJECT ORIENTED DATA
MANAGEMENT TOOLS OF THE FUTURE.
G. Rydqvist, M. R. K. Patel, and L. Larsson.
[Linkoeping University. Department of Computer and Information
Science. Research report LITH-IDA-R-88-43. 1988.]
110661 HYPERMEDIA AND HUMAN-COMPUTER INTERACTION.
A. Vainio-Larsson.
[Linkoeping University. Department of Computer and Information
Science. LIBLAB (Laboratory for Library and Information Science).
Research report LiU-LIBLAB-R-1988:1. 1988.]
110662 SEMANTICS AND CONSISTENCY OF RULE-BASED EXPERT SYSTEMS.
M. Bezem.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8824. 1988.]
110663 EXPERT SYSTEMS AS DEDUCTIVE SYSTEMS.
A. Elieens.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8825. 1988.]
110664 INTRODUCTION TO LOGIC PROGRAMMING.
K. R. Apt.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8826. 1988. Revised and extended version.]
110665 ON THE AMOEBA PROTOCOL.
J. C. Mulder.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8827. 1988.]
110666 A DISTRIBUTED DEBUGGER FOR AMOEBA.
I. J. P. Elshoff.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8828. 1988.]
110667 EFFICIENT COMPUTING OF LEAST FIXPOINTS.
K. R. Apt.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8830. 1988.]
110668 CORRECTNESS AND FULL ABSTRACTION OF METRIC SEMANTICS FOR CONCURRENCY.
J. J. M. M. Rutten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8831. 1988.]
110669 SYNCHRONY WITH EMPTY PROCESS.
W. P. Weijland.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8832. 1988.]
110670 A FIXPOINT SEMANTICS FOR GUARDED HORN CLAUSES.
C. Palamidessi.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8833. 1988.]
110671 OPTIMIZATION OF THE MPQS-FACTORING ALGORITHM ON THE CYBER 205.
W. M. Lioen, H. J. J. te Riele, and D. T. Winter.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8807. 1988.]
110672 SMOOTHED PREDICTOR-CORRECTOR METHODS FOR SOLVING PARTIAL DIFFERENTIAL
EQUATIONS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8808. 1988.]
110673 ITERATED THETA-METHOD FOR HYPERBOLIC EQUATIONS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8809. 1988.]
110674 UPWIND DISCRETIZATION OF THE STEADY NAVIER-STOKES EQUATIONS.
B. Koren.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8810. 1988.]
110687 EFFICIENT MUTUAL EXCLUSION SYNCHRONIZATION ALGORITHMS.
A. Dinning and O. Zajicek.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 350. 1988. "This is a
revision of report 350 titled 'Synchronization in the Absence of
Concurrent Write.'"]
110688 SYNTHESIZING LINEAR-ARRAY ALGORITHMS FROM NESTED FOR LOOP ALGORITHMS.
P. Lee and Z. M. Kedem.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 355. 1988.]
110689 RED-BLUE INTERSECTION DETECTION ALGORITHMS, WITH APPLICATIONS TO
MOTION PLANNING AND COLLISION DETECTION.
P. Agarwal and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 357. 1988. Also issued
as Robotics research 145, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110690 THE COMPLEXITY OF MANY FACES IN ARRANGEMENTS OF LINES AND OF SEGMENTS.
H. Edelsbrunner, L. J. Guibas, and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 358. 1988. Also issued
as Robotics research 146, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110691 ON THE GENERAL MOTION PLANNING PROBLEM WITH TWO DEGREES OF FREEDOM.
L. J. Guibas, M. Sharir, and S. Sifrony.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 359. 1988. Also issued
as Robotics research 147, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110692 COORDINATED MOTION PLANNING FOR TWO INDEPENDENT ROBOTS.
M. Sharir and S. Sifrony.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 360. 1988. Also issued
as Robotics research 148, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110693 ON HIGH-SPEED COMPUTING WITH A PROGRAMMABLE LINEAR ARRAY.
P. Lee and Z. M. Kedem.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 361. 1988.]
110694 ON ARRANGEMENTS OF JORDAN ARCS WITH THREE INTERSECTIONS PER PAIR.
H. Edelsbrunner et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 364. 1988. Also issued
as Robotics research 149, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110695 AN ALGORITHM FOR GENERALIZED POINT LOCATION AND ITS APPLICATIONS.
B. Chazelle and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 369. 1988. Also issued
as Robotics research 153, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110696 SOME COMMENTS ON HIGHLY DYNAMIC NETWORK ROUTING.
H. J. Bernstein.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 371. 1988.]
110697 INDUCTIVE INFERENCE AND ENCODING.
P. Caianiello.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 372. 1988.]
110698 THE EVOLUTION OF PARALLEL LOGIC PROGRAMMING LANGUAGES.
N. Markantonatos.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 377. 1988.]
110699 IMPLICITLY REPRESENTING ARRANGEMENTS OF LINES OR SEGMENTS.
H. Edelsbrunner et al.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 380. 1988. Also issued
as Robotics research 157, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110700 OPTIMAL PARALLEL ALGORITHMS FOR FOREST AND TERM MATCHING.
Z. M. Kedem and K. V. Palem.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 382. 1988.]
110701 CONFORMAL IMAGE WARPING.
C. Frederick and E. L. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 408. 1988. Also issued
as Robotics research 174, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110702 CASCADING DIVIDE-AND-CONQUER: A TECHNIQUE FOR DESIGNING PARALLEL
ALGORITHMS.
M. J. Atallah, R. Cole, and M. T. Goodrich.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 127. 1987. Also
issued as Technical report 317, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
110703 ON OPTIMAL PARALLEL ALGORITHM FOR BUILDING A DATA STRUCTURE FOR
PLANAR POINT LOCATION.
R. Cole and O. Zajicek.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 128. 1987. Also
issued as Technical report 316, Computer Science Department, Courant
Institute of Mathematical Sciences, New York University.]
110704 STUDIES IN FUZZY SETS AND GEOMETRIES.
H. Guggenheimer.
[Polytechnic University (New York). Division of Computer Science.
Polytechnic notes on artificial intelligence 5. 1988.]
110705 THE R SUPERSCRIPT N PROGRAMMING ENVIRONMENT: A CAPSULE DESCRIPTION.
K. D. Cooper et al.
[Rice University. Department of Computer Science. TR87-46. 1987.]
110706 A GLOBAL APPROACH TO DETECTION OF PARALLELISM.
D. Callahan.
[Rice University. Department of Computer Science. TR87-50. 1987.
Thesis (Ph.D.).]
110707 ESTIMATING INTERLOCK AND IMPROVING BALANCE FOR PIPELINED
ARCHITECTURES.
D. Callahan, J. Cocke, and K. Kennedy.
[Rice University. Department of Computer Science. TR87-51. 1987.]
110708 SENDER-BASED MESSAGE LOGGING.
D. B. Johnson and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR87-52. 1987.]
110709 INCREMENTAL OPTIMIZATION IN A PROGRAMMING ENVIRONMENT.
L. L. Pollock.
[Rice University. Department of Computer Science. TR87-53. 1987.]
110710 PARALLEL ATTRIBUTE GRAMMAR EVALUATION.
H.-J. Boehm and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR87-55. 1987.]
110711 ANALYSIS OF INTERPROCEDURAL SIDE EFFECTS IN A PARALLEL PROGRAMMING
ENVIRONMENT.
D. Callahan and K. Kennedy.
[Rice University. Department of Computer Science. TR87-56. 1987.]
110712 HIGH-LEVEL DEBUGGING WITH THE AID OF AN INCREMENTAL OPTIMIZER.
L. L. Pollock and M. L. Soffa.
[Rice University. Department of Computer Science. TR87-57. 1987.]
110713 AN INCREMENTAL VERSION OF ITERATIVE DATA FLOW ANALYSIS.
L. L. Pollock and M. L. Soffa.
[Rice University. Department of Computer Science. TR87-58. 1987.]
110714 PARALLEL PROGRAMMING SUPPORT IN PARASCOPE.
D. Callahan et al.
[Rice University. Department of Computer Science. TR87-59. 1987.]
110715 EFFICIENT COMPUTATION OF FLOW-INSENSITIVE INTERPROCEDURAL SUMMARY
INFORMATION - A CORRECTION.
K. Cooper and K. Kennedy.
[Rice University. Department of Computer Science. TR87-60. 1987.]
110716 COMPLEXITY OF INTERPROCEDURAL SIDE-EFFECT ANALYSIS.
K. Cooper and K. Kennedy.
[Rice University. Department of Computer Science. TR87-61. 1987.]
110717 INTERPROCEDURAL SIDE EFFECT ANALYSIS IN LINEAR TIME.
K. Cooper and K. Kennedy.
[Rice University. Department of Computer Science. TR87-62. 1987.]
110718 COMPILER MANAGEMENT OF PROGRAM LOCALITY.
A. Porterfield.
[Rice University. Department of Computer Science. TR88-63. 1988.]
110719 A THEORETICAL FRAMEWORK FOR OPTIMISTIC RECOVERY IN DISTRIBUTED
SYSTEMS.
W. Zwaenepoel.
[Rice University. Department of Computer Science. TR88-64. 1988.]
110720 PARALLELISM IN LANGUAGE TRANSLATION.
H.-J. Boehm, L. L. Pollock, and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR88-65. 1988.]
110721 EXACT REAL ARITHMETIC: FORMULATING REAL NUMBERS AS FUNCTIONS.
H.-J. Boehm and R. Cartwright.
[Rice University. Department of Computer Science. TR88-66. 1988.]
110722 OPTIMISTIC BULK DATA TRANSFER PROTOCOLS.
J. B. Carter and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR88-67. 1988.]
110723 RECOVERY IN DISTRIBUTED SYSTEMS USING OPTIMISTIC MESSAGE LOGGING AND
CHECKPOINTING.
D. B. Johnson and W. Zwaenepoel.
[Rice University. Department of Computer Science. TR88-68. 1988.]
110724 THE PROGRAM SUMMARY GRAPH AND FLOW-SENSITIVE INTERPROCEDURAL DATA
FLOW ANALYSIS.
D. Callahan.
[Rice University. Department of Computer Science. TR88-69. 1988.]
110725 STATIC ANALYSIS OF LOW-LEVEL SYNCHRONIZATION.
D. Callahan and J. Subhlok.
[Rice University. Department of Computer Science. TR88-70. 1988.]
110726 PTOOL: A SYSTEM FOR STATIC ANALYSIS OF PARALLELISM IN PROGRAMS.
V. Balasundaram et al.
[Rice University. Department of Computer Science. TR88-71. 1988.]
110727 ON FINDING LOCALLY OPTIMAL SOLUTIONS.
M. W. Krentel.
[Rice University. Department of Computer Science. TR88-72. 1988.]
110728 INTERACTIVE PARALLELIZATION OF NUMERICAL SCIENTIFIC PROGRAMS.
V. Balasundaram.
[Rice University. Department of Computer Science. TR88-73. 1988.
Thesis proposal.]
110729 POSTORDER DISJOINT SET UNION IS LINEAR.
J. M. Lucas.
[Rutgers. Department of Computer Science. DCS-TR-240. 1988.]
110730 ASPECTS OF A GRAPH-BASED PROOF PROCEDURE FOR HORN CLAUSES.
S. Raatz.
[Rutgers. Department of Computer Science. DCS-TR-241. 1988. "A
dissertation in Computer and Information Science presented to the
faculties of the University of Pennsylvania in partial fulfillment of
the requirements for the Degree of Doctor of Philosophy, 1987."]
110731 SMALLEST TRANSVERSALS OF SMALL 3-GRAPHS.
R. B. Hayward.
[Rutgers. Department of Computer Science. DCS-TR-242. 1988.]
110732 THEOREM PROVING USING EQUATIONAL MATINGS AND RIGID E-UNIFICATION.
J. Gallier et al.
[Rutgers. Department of Computer Science. DCS-TR-243. 1988.]
110733 AN ANALOGY BETWEEN DISPERSIVE WAVE PROPAGATION AND SPECIAL RELATIVITY.
R. Vichnevetsky.
[Rutgers. Department of Computer Science. DCS-TR-244. 1988.]
110734 ON THE SIBLING-STRUCTURE OF PERFECT GRAPHS.
C. T. Hoang.
[Rutgers. Department of Computer Science. DCS-TR-245. 1988.]
110735 PARSING TO LEARN FINE GRAINED RULES.
S. Roy and J. Mostow.
[Rutgers. Department of Computer Science. ML-TR-25. 1988.]
110736 A PRELIMINARY REPORT ON DIOGENES: PROGRESS TOWARDS SEMI-AUTOMATIC
DESIGN OF SPECIALIZED HEURISTIC SEARCH ALGORITHMS.
J. Mostow.
[Rutgers. Department of Computer Science. ML-TR-27. 1988.]
110737 ARTIFICIAL INTELLIGENCE AND DESIGN: OPPORTUNITIES, CHALLENGES,
RESEARCH PROBLEMS AND DIRECTIONS.
S. Amarel.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-113.
1988. "Extended version of paper presented at the Artficial
Intelligence Workshop, which was held at the Weizmann Institute of
Science, Rehovot, Israel, on April 25-29, 1988."]
110738 INCORPORATING GLOBAL CONSTRAINTS.
K. Voigt.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-114.
1988. Thesis proposal.]
110739 A PROBLEM REDUCTION APPROACH TO AUTOMATED MUSIC COMPOSITION.
S. C. Marsella and C. F. Schmidt.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-115.
1988. "This is an expanded version of a paper that appeared in the
'Proceedings of the AAAI-88 Workshop on AI and Music.'"]
052129 SET VALUES FOR UNIFICATION-BASED GRAMMAR FORMALISMS AND LOGIC
PROGRAMMING.
W. C. Rounds.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-129. June 1988.]
052133 RELATING MODELS OF POLYMORPHISM.
J. Meseguer.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-133. October 1988.]
052134 FREGEAN THOUGHTS AND INDEXICALS.
P. Blanchette.
[Stanford University. Center for the Study of Language and
Information. CSLI-88-134. November 1988.]
048088 THE ELINT APPLICATION ON POLIGON: THE ARCHITECTURE AND PERFOMANCE OF
-69 A CONCURRENT BLACKBOARD SYSTEM.
J. Rice.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-69. December 1988.]
048088 A REPRESENTATION FOR GAINING INSIGHT INTO CLINICAL DECISION MODELS.
-75 H. B. Jimison.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-75. November 1988.]
048088 IMPROVING DRUG DOSING IN HOSPITALIZED PATIENTS: AUTOMATED MODELING OF
-76 PHARMACOKINETICS FOR INDIVIDUALIZATION OF DRUG DOSAGE REGIMENS.
L. Lenert, L. Sheiner, and T. Blaschke.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-76. November 1988.]
048088 CASE-BASED TUTORING FROM A MEDICAL KNOWLEDGE BASE.
-77 H. L. Chin.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-77. November 1988.]
048088 TESTING REALITY: THE INTRODUCTION OF DECISION-SUPPORT TECHNOLOGIES
-82 FOR PHYSICIANS.
E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-82. December 1988.]
110740 A COMPARISON OF FOUR FINITE AND INFINITE ELEMENT TECHNIQUES.
S. A. Hannaby.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 123/88. 1988.]
110741 A TEXT EDITOR DRIVEN BY HAND-DRAWN SYMBOLS.
M. J. Stevens.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 124/88. 1988.]
110742 A CONTRIBUTION TO THE DEBATE ON SAFETY-CRITICAL SOFTWARE.
G. O'Neill and B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 126/88. 1988. Comments and discussion in
response to the U. K. Ministry of Defence Policy Statement on
procurement of safety-critical software. Edited by G. O'Neill and B.
A. Wichmann.]
110743 EVALUATION OF THE RTP PASCAL-MALPAS IL TRANSLATOR.
G. O'Neill.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 128/88. 1988.]
110744 WHAT DOES THE TINY VAJRA REFUTE? CAUSALITY AND EVENT STRUCTURE IN
BUDDHIST LOGIC AND FOLK PSYCHOLOGY.
E. Rosch.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 54.
1988.]
110745 EXTENDING COLOURED PETRI NETS.
J. Billington.
[University of Cambridge. Computer Laboratory. Technical report 148.
1988.]
110746 IMPROVING SECURITY AND PERFORMANCE FOR CAPABILITY SYSTEMS.
P. A. Karger.
[University of Cambridge. Computer Laboratory. Technical report 149.
1988. Thesis (Ph.D.).]
110747 SIMULATION AS AN AID TO VERIFICATION USING THE HOL THEOREM PROVER.
A. J. Camilleri.
[University of Cambridge. Computer Laboratory. Technical report 150.
1988.]
110748 PROCESS MANAGEMENT AND EXCEPTION HANDLING IN MULTIPROCESSOR OPERATING
SYSTEMS USING OBJECT-ORIENTED DESIGN TECHNIQUES.
V. F. Russo, G. M. Johnston, and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1415. 1988. Revised: September 26, 1988. Also
issued as TTR88-4, TAPESTRY Project, Department of Computer Science,
University of Illinois, Urbana-Champaign.]
110749 30 YEARS OF I.E.L. [Information Engineering Laboratory].
J. Koszczuk and B. Scheid.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1453. 1988.]
110750 A CLASS HIERARCHICAL, OBJECT-ORIENTED APPROACH TO VIRTUAL MEMORY
MANAGEMENT IN MULTIPROCESSOR OPERATING SYSTEMS.
R. H. Campbell, V. F. Russo, and G. M. Johnston.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1459. 1988. Also issued as TTR88-3, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
110751 A MULTIPROCESSOR OPERATING SYSTEM SIMULATOR.
G. M. Johnston and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1460. 1988. Also issued as TTR88-5, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
110752 A C++ CLASS HIERARCHY FOR BUILDING UNIX-LIKE FILE SYSTEMS.
P. W. Madany et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1462. 1988.]
110753 ENHANCED ER-EASY: A DATABASE SCHEME DESIGNER.
M. A. Najork.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1464. 1988.]
110754 VISUALIZING PARALLEL COMPUTER SYSTEM PERFORMANCE.
A. D. Malony and D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1465. 1988.]
110755 ACCURACY INCREASE IN WAVEFORM RELAXATION.
F. Juang.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1466. 1988.]
110756 ON THE ONE DIMENSIONAL CURRENT DRIVEN SEMICONDUCTOR EQUATIONS.
T. Kerkhoven.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1467. 1988.]
110757 MORE NEARLY OPTIMAL ALGORITHMS FOR UNBOUNDED SEARCHING.
E. M. Reingold and X.-J. Shen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1471. 1988.]
110758 THE COMPLEXITY OF MANY CELLS IN ARRANGEMENTS OF PLANES AND RELATED
PROBLEMS.
H. Edelsbrunner, L. J. Guibas, and M. Sharir.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1476. 1988.]
110759 REDUCTION, SUPERPOSITION AND INDUCTION: AUTOMATED REASONING IN AN
EQUATIONAL LOGIC.
H. Zhang.
[University of Iowa. Department of Computer Science. Technical report
88-06. 1988. Thesis (Ph.D.). "This report is essentially the same as
[the author's] Ph.D. thesis, which was submitted to the Graduate
School of Rensselaer Polytechnic Institute (RPI) in August, 1988,
with some minor corrections."]
110760 THE STRUCTURE OF SINGLY-PERIODIC MINIMAL SURFACES.
M. Callahan, D. Hoffman, and W. H. Meeks.
[University of Massachusetts, Amherst. Geometry, Analysis, Numerics
and Graphics (G.A.N.G.). n.d.]
110761 FAST WORKSTATION PROJECT OVERVIEW.
R. Neches.
[University of Southern California. Information Sciences Institute.
ISI/RR-88-203. 1988.]
110762 NNSTAT: INTERNET STATISTICS COLLECTION PACKAGE: INTRODUCTION AND USER
GUIDE.
R. T. Braden and A. L. DeSchon.
[University of Southern California. Information Sciences Institute.
ISI/RR-88-206. 1988.]
110763 AN INTERCONNECTION NETWORK THAT EXPLOITS LOCALITY OF COMMUNICATION.
K. C. Sevcik and X.-N. Tan.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-207. 1988.]
110764 A PROCESSING MODEL FOR WARLPIRI SYNTAX AND IMPLICATIONS FOR
LINGUISTIC THEORY.
B. A. Brunson.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-208. 1988. Thesis (M.A.). Revised version of a
paper "submitted to the Department of Linguistics, Linguistics Forum,
1986, in partial fulfillment of the requirements of the degree of
Master of Arts at the University of Toronto, Sept. 1986."]
110765 THE INFLUENCE OF TIME AND MEMORY CONSTRAINTS ON THE RESOLUTION OF
STRUCTURAL AMBIGUITY.
S. W. McRoy.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-209. 1988. Thesis (M.S.). "Revised from a
thesis submitted in conformity with the requirements for the degree
of Master of Science, September 1987."]
110766 AN INFORMATION SYSTEMS DESIGN ENVIRONMENT BASED ON A SEMANTIC DATA
MODEL.
J. Kambanis.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-210. 1988.]
110767 THE MEANING TRIANGLE AS A TOOL FOR THE ACQUISITION OF ABSTRACT,
CONCEPTUAL KNOWLEDGE.
S. Regoczei and G. Hirst.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-211. 1988.]
110768 OFFICE AND DATA BASE SYSTEMS RESEARCH '88.
F. H. Lochovsky.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-212. 1988. "This report contains a collection
of [14] papers that represent the research directions of the Office
and Data Base Systems Group in the Computer Systems Research
Institute at the University of Toronto over the past year (August
1987 to July 1988)." Edited by F. H. Lochovsky.]
110769 PROTEM AS A PROGRAMMING LANGUAGE.
E. C. R. Hehner and T. S. Norvell.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-213. 1988.]
110770 APPLICATION OF DECISION MODELS TO SOME PROBLEMS IN IMAGE ANALYSIS.
B. Dahlqvist.
[University of Uppsala. Acta Universitatis Upsaliensis: Comprehensive
Summaries of Uppsala Dissertations from the Faculty of Science 169.
1988.]
110771 A NUMERICAL ALGORITHM FOR STABILITY ANALYSIS OF DIFFERENCE METHODS
FOR HYPERBOLIC SYSTEMS.
M. Thune.
[University of Uppsala. Department of Computer Science. Report no.
113. 1988.]
110772 SOLVING THE EULER EQUATIONS FOR HIGH MACH NUMBERS ON OVERLAPPING
GRIDS.
E. Paert and B. Sjoegreen.
[University of Uppsala. Department of Computer Science. Report no.
114. 1988.]
110773 BOUNDARY CONDITIONS FOR THE K-EPSILON MODEL FOR TURBULENT FLOW.
C. Johansson.
[University of Uppsala. Department of Computer Science. Report no.
115. 1988.]
110774 A SOFTWARE TOOL FOR ANALYSIS OF RUNGE-KUTTA METHODS.
K. Otto.
[University of Uppsala. Department of Computer Science. Report no.
116. 1988.]
110775 CLUSTER PROGRAMMING LANGUAGE: DEFINITION AND USER MANUAL.
R. M. Howarth and N. D. Francis.
[University of Warwick. Department of Computer Science. RR125. 1988.]
110776 PARALLEL COMPUTATION IN DEFINITIVE MODELS.
M. Beynon, M. Slade, and Y. W. Yung.
[University of Warwick. Department of Computer Science. RR127. n.d.]
110777 THE SET OF MINIMAL BRAIDS IS CO-NP-COMPLETE.
M. S. Paterson and A. A. Razborov.
[University of Warwick. Department of Computer Science. RR130. 1988.]
110778 DYNAMIC EXPRESSION EVALUATION IS ONE OF A CLASS OF PROBLEMS WHICH ARE
EFFICIENTLY SOLVABLE ON MESH-CONNECTED COMPUTERS.
A. M. Gibbons.
[University of Warwick. Department of Computer Science. RR131. 1988.]
110779 A CONTROL VOLUME FINITE ELEMENT METHOD FOR LOCAL MESH REFINEMENT IN
THERMAL RESERVOIR SIMULATION.
P. A. Forsyth.
[University of Waterloo. Department of Computer Science. Research
report CS-88-15. 1988.]
110780 A FUNCTIONAL MODEL OF REGISTER-TRANSFER DESIGNS.
F. Mavaddat.
[University of Waterloo. Department of Computer Science. Research
report CS-88-16. 1988.]
110781 MODELS AND ALGORITHMS FOR RACE ANALYSIS ASYNCHRONOUS CIRCUITS.
C.-J. H. Seger.
[University of Waterloo. Department of Computer Science. Research
report CS-88-22. 1988. Thesis (Ph.D.).]
110782 PATTERN MATCHING IN TREES.
P. Li.
[University of Waterloo. Department of Computer Science. Research
report CS-88-23. 1988. Thesis (Master of Mathematics in Computer
Science).]
110783 CONSISTENCY AND SATISFIABILITY OF WAVEFORM TIMING SPECIFICATIONS.
J. A. Brzozowski, T. Gahlinger, and F. Mavaddat.
[University of Waterloo. Department of Computer Science. Research
report CS-88-24. 1988.]
110784 THE THUMS PROJECT: IMPLEMENTING USER SPECIFIC RESPONSES TO AN
EDUCATIONAL DIAGNOSIS SYSTEM.
A. Sanmugasunderam, B. Spencer, and R. Cohen.
[University of Waterloo. Department of Computer Science. Research
report CS-88-25. 1988.]
110785 SPACE BOUNDS FOR SELECTION.
T. W. Lai.
[University of Waterloo. Department of Computer Science. Research
report CS-88-26. 1988. Thesis (Master of Mathematics in Computer
Science).]
110786 DIVERSITY, ACCESSIBILITY AND ADAPTABILITY: DATA COMMUNICATION NEEDS
FOR HIGHER EDUCATION, THE UNIVERSITY OF WATERLOO EXPERIENCE.
D. D. Cowan et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-27. 1988. Revised.]
110787 NETWORKS FOR EDUCATION AT THE UNIVERSITY OF WATERLOO.
D. D. Cowan et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-28. 1988. Revised.]
110788 PORTABLE COMPUTERS AND DISTANCE EDUCATION.
J. P. Black et al.
[University of Waterloo. Department of Computer Science. Research
report CS-88-29. 1988.]
110789 CONCURRENCY IN C++.
P. A. Buhr, G. J. Ditchfield, and C. R. Zarnke.
[University of Waterloo. Department of Computer Science. Research
report CS-88-30. 1988.]
110790 LOGIC PROGRAMMING AND ARTIFICIAL INTELLIGENCE.
F. Bacchus.
[University of Waterloo. Department of Computer Science. Research
report CS-88-31. 1988. Thesis (Ph.D.). "A thesis submitted to the
Faculty of Graduate Studies and Research in partial fulfillment of
the requirements for the degree of Doctor of Philosophy, Department
of Computer Science [the University of Alberta], Edmonton, Alberta,
Fall 1988."]
110791 IMPLICIT SELECTION.
T. W. Lai and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-88-32. 1988.]
110792 ON EFFICIENT ENTREEINGS.
P. S. Amerins, R. A. Baeza-Yates, and D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-88-33. 1988.]
110793 THE SUBSEQUENCE GRAPH OF A TEXT.
R. A. Baeza-Yates.
[University of Waterloo. Department of Computer Science. Research
report CS-88-34. 1988.]
110794 ERRATA: THEORY OF COMPUTATION.
D. Wood.
[University of Waterloo. Department of Computer Science. Research
report CS-88-35. 1988. "This report provides two lists of corrections
for [the author's] textbook 'Theory of Computation.'"]
110795 FAST STRING MATCHING WITH K MISMATCHES.
R. A. Baeza-Yates and G. H. Gonnet.
[University of Waterloo. Department of Computer Science. Research
report CS-88-36. 1988.]
110796 NEW ALGORITHM FOR PATTERN MATCHING WITH OR WITHOUT MISMATCHES.
R. A. Baeza-Yates and G. H. Gonnet.
[University of Waterloo. Department of Computer Science. Research
report CS-88-37. 1988.]
110797 A GLOBALLY CONVERGENT AUGMENTED LAGRANGIAN ALGORITHM FOR OPTIMIZATION
WITH GENERAL CONSTRAINTS AND SIMPLE BOUNDS.
A. R. Conn, N. I. M. Gould, and Ph. L. Toint.
[University of Waterloo. Department of Computer Science. Research
report CS-88-38. 1988.]
110798 FAIRNESS ANALYSIS OF MULTIPROCESSOR BUS ARBITRATION PROTOCOLS.
M. K. Vernon and S. T. Leutenegger.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 744. 1988.]
110799 MULTI-SWEEP ASYNCHRONOUS PARALLEL SUCCESSIVE OVERRELAXATION FOR THE
NONSYMMETRIC LINEAR COMPLEMENTARITY PROBLEM.
R. De Leone, O. L. Mangasarian, and T.-H. Shiau.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 792. 1988.]
110800 A NETWORK OF NEURON-LIKE UNITS THAT LEARNS TO PERCEIVE BY GENERATION
AS WELL AS REWEIGHTING OF ITS LINKS.
V. Honavar and L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 793. 1988.]
110801 ITERATIVE LINEAR PROGRAMMING SOLUTION OF CONVEX PROGRAMS.
M. C. Ferris.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 794. 1988.]
110802 A NOTE ON SQUARE ROOTS IN FINITE FIELDS.
E. Bach.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 795. 1988.]
110803 ON TRANSACTION BOUNDARIES IN ACTIVE DATABASES: A PERFORMANCE
PERSPECTIVE.
M. J. Carey, R. Jauhari, and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 796. 1988.]
110804 NEAR-TESTABLE SETS.
J. Goldsmith et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 797. 1988.]
110805 SELF-REDUCIBILITY: THE EFFECT OF STRUCTURE ON COMPLEXITY.
D. Joseph and P. Young.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 798. 1988.]
110806 DETERMINISTIC FACTORIZATION OF POLYNOMIALS OVER SPECIAL FINITE FIELDS.
E. Bach and J. von zur Gathen.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 799. 1988.]
110807 A GENERALIZATION OF LOVASZ'S SANDWICH THEOREM.
G. Narasimhan and R. Manber.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 800. 1988.]
110808 TOWARDS AN ALGEBRAIC THEORY OF RECURSION.
Y. E. Ioannidis and E. Wong.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 801. 1988.]
110809 FINITE PERTURBATION OF CONVEX PROGRAMS.
M. C. Ferris and O. L. Mangasarian.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 802. 1988.]
110810 INEXPENSIVE IMPLEMENTATIONS OF SET-ASSOCIATIVITY.
R. E. Kessler et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 803. 1988.]
110811 COMMUTATIVITY AND ITS ROLE IN THE PROCESSING OF LINEAR RECURSION.
Y. E. Ioannidis.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 804. 1988.]
110812 EXPERIMENTAL RESULTS INDICATE THAT GENERATION, LOCAL RECEPTIVE FIELDS
AND GLOBAL CONVERGENCE IMPROVE PERCEPTUAL LEARNING IN CONNECTIONIST
NETWORKS.
V. Honavar and L. Uhr.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 805. 1988.]
110813 REAL-TIME, MODEL-BASED TRACKING OF THREE-DIMENSIONAL OBJECTS.
G. Verghese and C. R. Dyer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 806. 1988.]
110814 ON SEARCH, DECISION AND THE EFFICIENCY OF POLYNOMIAL-TIME ALGORITHMS.
M. R. Fellows and M. A. Langston.
[Washington State University. Computer Science Department. CS-88-190.
n.d.]
110815 SPECIALISATION OF PROLOG AND FCP PROGRAMS USING ABSTRACT
INTERPRETATION.
J. Gallagher, M. Codish, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-01. 1988.]
110816 A DELETION GAME ON HYPERGRAPHS.
A. S. Fraenkel and E. R. Scheinerman.
[Weizmann Institute of Science. Department of Computer Science.
CS88-02. 1988.]
110817 FULLY ABSTRACT DENOTATIONAL SEMANTICS FOR FLAT CONCURRENT PROLOG.
R. Gerth et al.
[Weizmann Institute of Science. Department of Computer Science.
CS88-03. 1988.]
110818 EPIDEMIOGRAPHY WITH VARIOUS GROWTH FUNCTIONS.
A. S. Fraenkel and M. Lorberbom.
[Weizmann Institute of Science. Department of Computer Science.
CS88-04. 1988.]
110819 SPATIAL MACHINES: TOWARDS A MORE REALISTIC APPROACH TO PARALLEL
COMPUTATION.
Y. Feldman and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-05. 1988.]
110820 USING SAFE APPROXIMATIONS OF FIXED POINTS FOR ANALYSIS OF LOGIC
PROGRAMS.
J. Gallagher and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-06. 1988.]
110821 A HIERARCHY OF TEMPORAL PROPERTIES.
Z. Manna and A. Pnueli.
[Weizmann Institute of Science. Department of Computer Science.
CS88-08. 1988.]
110822 AN IMPROVED PARALLEL EXECUTION ALGORITHM FOR FLAT CONCURRENT PROLOG.
S. Taylor and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-09. 1988.]
110823 ON THE POWER OF COOPERATIVE CONCURRENCY.
D. Drusinsky and D. Harel.
[Weizmann Institute of Science. Department of Computer Science.
CS88-10. 1988.]
110824 PARALLEL ACCESS TO A DISTRIBUTED DATABASE AND ITS IMPLEMENTATION IN
FLAT CONCURRENT PROLOG.
E. Reches, E. Gudes, and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-11. 1988.]
110825 LEARNING OMEGA-REGULAR LANGUAGES FROM ULTIMATELY-PERIODIC EXAMPLES.
O. Maler and A. Pnueli.
[Weizmann Institute of Science. Department of Computer Science.
CS88-12. 1988.]
110826 A DECISION TREE COMPILATION ALGORITHM FOR FCP(|,:,?).
S. Kliger and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-13. 1988.]
110827 AN ARCHITECTURAL MODEL FOR A FLAT CONCURRENT PROLOG PROCESSOR.
L. Alkalaj and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-14. 1988.]
110828 FULLY ABSTRACT COMPOSITIONAL SEMANTICS FOR LOGIC PROGRAMS.
H. Gaifman and E. Shapiro.
[Weizmann Institute of Science. Department of Computer Science.
CS88-15. 1988.]
110829 VISION OUTSIDE THE SPOTLIGHT OF ATTENTION.
J. Braun and D. Sagi.
[Weizmann Institute of Science. Department of Computer Science.
CS88-16. 1988.]
110830 THE NOISY ORACLE PROBLEM.
U. Feige, A. Shamir, and M. Tennenholtz.
[Weizmann Institute of Science. Department of Computer Science.
CS88-17. 1988.]
110831 ON GAUSS AND COMPOSITION I. ON GAUSS AND COMPOSITION II.
D. Shanks.
[1988. Lectures given in Banff, Autumn 1988. NO ISSUING AGENCY
INDICATED (author's address: Mathematics Department/University of
Maryland/College Park, Maryland 20742).]
VOL. 11, NO. 2 03/01/89
110832 A THREADS TUTORIAL - FORTRAN VERSION.
T. W. Doeppner Jr.
[Brown University. Computer Science Department. Technical report
CS-88-19. 1988.]
110833 THE TANGO ALGORITHM ANIMATION SYSTEM.
J. Stasko.
[Brown University. Computer Science Department. Technical report
CS-88-20. 1988.]
110834 PARALLEL CONSTRAINT GRAPH GENERATION.
J. E. Savage and M. G. Wloka.
[Brown University. Computer Science Department. Technical report
CS-88-21. 1989.]
110835 BAGS: THE BROWN ANIMATION GENERATION SYSTEM.
P. S. Strauss.
[Brown University. Computer Science Department. Technical report
CS-88-22. 1988. Thesis (Ph.D.).]
110836 ANNOTATING SOFTWARE WITH ARBITRARY PERFORMANCE CHARACTERISTICS.
S. Meyers.
[Brown University. Computer Science Department. Technical report
CS-89-01. 1989.]
110837 CREATING GRAPHICAL LANGUAGES IN GARDEN.
S. P. Reiss and S. Meyers.
[Brown University. Computer Science Department. Technical report
CS-89-02. 1989.]
110838 A PRACTICAL APPLICATION OF THE CEILING PROTOCOL IN A REAL-TIME SYSTEM.
C. D. Locke and J. B. Goodenough.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-SR-3. n.d.]
110846 PHASE I TESTBED DESCRIPTION: REQUIREMENTS AND SELECTION GUIDELINES.
R. Holibaugh.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-13. 1988.]
110847 EVALUATION OF THE RATIONAL ENVIRONMENT.
P. H. Feiler, S. A. Dart, and G. Downey.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-15. 1988.]
110848 DISTRIBUTED ADA REAL-TIME KERNEL.
J. Bamberger et al.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-17. 1988.]
110849 THE DURRA RUNTIME ENVIRONMENT.
M. R. Barbacci, D. L. Doubleday, and C. B. Weinstock.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-18. 1988.]
110850 GENERALIZED IMAGE LIBRARY: A DURRA APPLICATION EXAMPLE.
M. R. Barbacci and D. L. Doubleday.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-19. 1988.]
110851 MASTERTASK: THE DURRA TASK EMULATOR.
M. R. Barbacci.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-20. 1988.]
110852 PERSPECTIVE ON SOFTWARE REUSE.
J. M. Perry.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-22. 1988.]
110853 USING THE VIENNA DEVELOPMENT METHOD (VDM) TO FORMALIZE A
COMMUNICATION PROTOCOL.
J. S. Pedersen and M. H. Klein.
[Carnegie-Mellon University. Software Engineering Institute.
CMU/SEI-88-TR-26. 1988.]
110854 DIVIDE-AND-CONQUER ALGORITHMS FOR THE COMPUTATION OF THE SVD OF
BIDIAGONAL MATRICES.
P. Arbenz.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 89. 1988.]
110855 A PROGRAM FOR DEVICE SIMULATION. PART I.
E. Anderheggen et al.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 90. 1988.]
110856 A CONCURRENCY CONTROL SCHEME FOR DISTRIBUTED DIRECTORY SYSTEMS.
B. Plattner and A. Zogg.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 91. 1988.]
110857 A CONSTRAINED EIGENVALUE PROBLEM.
W. Gander, G. H. Golub, and U. von Matt.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 92. 1988.]
110858 AUTOMATED PARALLELIZATION OF SERIAL SIMULATION FOR HYPERCUBE PARALLEL
PROCESSORS.
A. M. Baum and D. J. McMillan.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6522. 1989.]
110859 THE FIRST CYCLES IN AN EVOLVING GRAPH.
P. Flajolet, D. E. Knuth, and B. Pittel.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 888. 1988.]
110860 POLYGON PLACEMENT UNDER TRANSLATION AND ROTATION.
F. Avnaim and J. D. Boissonnat.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 889. 1988.]
110861 A PRACTICAL EXACT MOTION PLANNING ALGORITHM FOR POLYGONAL OBJECTS
AMIDST POLYGONAL OBSTACLES.
F. Avnaim, J. D. Boissonnat, and B. Faverjon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 890. 1988.]
110862 AN OFFICE REPRESENTATION FRAMEWORK FOR PLANNING AND MONITORING OFFICE
ACTIVITIES.
A. Michard.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 891. 1988.]
110863 AVERAGE COST OF ORTHOGONAL RANGE QUERIES IN MULTIATTRIBUTE TREES.
D. Gardy, P. Flajolet, and C. Puech.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 892. 1988.]
110864 VERS DES OUTILS FORMELS DE DESCRIPTION DES TACHES ORIENTES CONCEPTION
D'INTERFACES.
D. L. Scapin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 893. 1988.]
110865 A CRITERION OF GLOBAL CONVERGENCE TO EQUILIBRIUM FOR DIFFERENTIAL
SYSTEMS: APPLICATION TO LOTKA-VOLTERRA SYSTEMS.
J.-L. Gouze.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 894. 1988.]
110866 OPTIMISATION DE FORME D'UNE COQUE MINCE ELASTIQUE SOUS DIFFERENTS
CRITERES. 1ERE PARTIE : FORMULATION CONTINUE DES PROBLEMES.
M. Bernadou, F. Palma, and B. Rousselet.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 895. 1988.]
110867 ON THE BOUNDARY OF A UNION OF RAYS.
P. Alevizos, J. D. Boissonnat, and F. P. Preparata.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 896. 1988.]
110868 GENERATION OF KNOWLEDGE ABOUT THE CONTROL OF A FLOW SHOP USING
DATA-ANALYSIS ORIENTED LEARNING TECHNIQUES AND SIMULATION.
H. Pierreval and H. Ralambondrainy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 897. 1988.]
110869 MODELING OPPORTUNISTIC REASONINGS: THE COGNITIVE ACTIVITY OF TRAFFIC
SIGNAL SETTING TECHNICIANS.
A. Bisseret, C. Figeac-Letang, and P. Falzon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 898. 1988.]
110870 DISTANCE MEASURES FOR SIGNAL PROCESSING AND PATTERN RECOGNITION.
M. Basseville.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 899. 1988. Also issued as Publication
interne 422, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110871 DATALOG EXTENSIONS FOR DATABASE QUERIES AND UPDATES.
S. Abiteboul and V. Vianu.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 900. 1988.]
110872 A RANDOM IMPUTATION PRINCIPLE: THE STOCHASTIC EM ALGORITHM.
G. Celeux and J. Diebolt.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 901. 1988.]
110873 MULTIPLE CORRESPONDING ANALYSIS WITH MISSING DATA.
P. G. M. van der Heijden and B. Escofier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 902. 1988. Also issued as Publication
interne 423, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110874 CLOSED FORM SOLUTION FOR THE DISTRIBUTION OF THE TOTAL TIME SPENT IN
A SUBSET OF STATES OF A HOMOGENEOUS MARKOV PROCESS DURING A FINITE
OBSERVATION PERIOD.
B. Sericola.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 903. 1988. Also issued as Publication
interne 424, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110875 EQUATIONAL PROBLEMS AND DISUNIFICATION.
H. Comon and P. Lescanne.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 904. 1988.]
110876 A 3-D MULTIGRID FINITE ELEMENT METHOD FOR THE EULER EQUATIONS.
H. Steve and A. Dervieux.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 905. 1988.]
110877 ELICITING EXPERT KNOWLEDGE IN A DESIGN ACTIVITY: SOME METHODOLOGICAL
ISSUES.
W. Visser and P. Falzon.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 906. 1988.]
110878 CALCUL DE GEODESIQUES PAR UNE METHODE DE PROJECTION.
C. Duflos, P. Meheut, and J.-C. Weill.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 907. 1988.]
110879 IDENTIFICATION DES POLGONES 3D A PARTIR DES SEGMENTS 3D.
M. Xie and P. Rives.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 908. 1988. Also issued as Publication
interne 427, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110880 ESTIMATION DES SEGMENTS 2D : UN ALGORITHME ROBUSTE.
M. Xie and P. Rives.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 909. 1988. Also issued as Publication
interne 429, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
110881 THE ALGORITHM GENREG FOR GENERATING RULES FROM SYMBOLIC OR NUMERICAL
DATA.
H. Ralambondrainy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 910. 1988.]
110882 IMPLEMENTATION OF THE ATKIN-GOLDWASSER-KILIAN PRIMALITY TESTING
ALGORITHM.
F. Morain.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 911. 1988.]
110883 LANGAGE DE PRODUCTION: DESCRIPTION COHERENTE DU COURT TERME (PREMIERE
PARTIE).
J. Hilger.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 912. 1988.]
110884 COMPLETE EVALUATION OF HORN CLAUSES: AN AUTOMATA THEORETIC APPROACH.
B. Lang.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 913. 1988.]
110885 ON THE STABILITY AND CONVERGENCE OF HIGHER ORDER MIXED FINITE ELEMENT
METHODS FOR SECOND ORDER ELLIPTIC PROBLEMS.
M. Suri.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 915. 1988.]
110886 ON THE MULTIPLICITY OF OPERATIONAL SEMANTICS FOR LOGIC PROGRAMMING
AND THEIR MODELIZATION BY ATTRIBUTE GRAMMARS.
P. Deransart.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 916. n.d.]
110887 COMPATIBILITY AND CONSENSUS IN NUMERICAL TAXONOMY.
E. Diday.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 917. 1988.]
110888 A SIMPLIFIED ANALYSIS OF THE MULTIGRID V-CYCLE AS A FAST ELLIPTIC
SOLVER.
N. H. Decker and S. Ta'asan.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-56. 1988.]
110889 A MULTISTAGE LINEAR ARRAY ASSIGNMENT PROBLEM.
D. M. Nicol et al.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-57. 1988.]
110890 ACCURATE MODELING OF PARALLEL SCIENTIFIC COMPUTATIONS.
D. M. Nicol and J. C. Townsend.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-58. 1988.]
110891 NONCONFORMING MORTAR ELEMENT METHODS: APPLICATION TO SPECTRAL
DISCRETIZATIONS.
Y. Maday, C. Mavriplis, and A. Patera.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-59. 1988.]
110892 MULTIPLE POINT LEAST SQUARES EQUALISATION IN A ROOM.
S. J. Elliott and P. A. Nelson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-61. 1988.]
110893 A PHYSICALLY MOTIVATED DOMAIN DECOMPOSITION FOR SINGULARLY PERTURBED
EQUATIONS.
J. S. Scroggs.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-62. 1988.]
110894 ALGEBRAIC TURBULENCE MODELS FOR THE COMPUTATION OF TWO-DIMENSIONAL
HIGH SPEED FLOWS USING UNSTRUCTURED GRIDS.
P. Rostand.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-63. 1988.]
110895 AERODYNAMIC DESIGN VIA CONTROL THEORY.
A. Jameson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-64. 1988.]
110896 INVESTIGATING A HYBRID PERTURBATION-GALERKIN TECHNIQUE USING COMPUTER
ALGEBRA.
C. M. Andersen and J. F. Geer.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-65. 1988.]
110897 SOME OBSERVATIONS ON BOUNDARY CONDITIONS FOR NUMERICAL CONSERVATION
LAWS.
D. Kamowitz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-67. 1988.]
110898 ON THE ACCURACY OF SOLVING TRIANGULAR SYSTEMS IN PARALLEL.
N. Tsao.
[National Aeronautics and Space Administration. Technical memorandum
101384. 1988. Also issued as ICOMP-88-19, Institute for Computational
Mechanics in Propulsion, Lewis Research Center, National Aeronautics
and Space Administration.]
110899 INTEGRATING ARTIFICIAL INTELLIGENCE AND DECISION THEORY TO FORECAST
NEW MARKETS.
D. A. Klein.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13915. 1988.]
110900 AN EFFICIENT PARALLEL ALGORITHM FOR ANTI-UNIFICATION.
G. M. Kuper et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14065. 1988.]
110901 ON THE SMALLEST SCALE FOR THE INCOMPRESSIBLE NAVIER-STOKES EQUATIONS.
W. D. Henshaw, H. O. Kreiss, and L. G. Reyna.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14092. 1988.]
110902 TRADEOFFS BETWEEN COMMUNICATION AND SPACE.
T. Lam.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14110. 1988.]
110903 EXACT SOLUTIONS FOR TWO-CLASS TWO-SERVER QUEUEING WITH PREEMPTIVE
PRIORITY.
G. B. Leeman Jr.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14112. 1988.]
110904 ANALYSIS OF REPLICATION IN DISTRIBUTED DATABASE SYSTEMS.
B. Ciciani, D. M. Dias, and P. S. Yu.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14113. 1988.]
110905 ADAPTIVE TRANSACTION ROUTING IN A HETEROGENEOUS DATABASE ENVIRONMENT.
A. Leff, P. S. Yu, and Y.-H. Lee.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14114. 1988.]
110906 USE OF CORRELATED INFORMATION FOR FEATURE RECOGNITION.
A. Califano.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14116. 1988.]
110907 DESIGN OF MULTI-OUTPUT CMOS COMBINATIONAL LOGIC CIRCUITS FOR ROBUST
TESTABILITY.
S. Kundu.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14124. 1988.]
110908 SVIST: A TOOL TO IDENTIFY SHARED VARIABLES AND TRANSLATE SYNTAX.
A. Tiwari.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14125. 1988.]
110909 AN ALGORITHM TO DRAW NETWORKS AND GRAPHS.
R. S. Cahn.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14126. 1988.]
110910 GENERALIZATION OF MIN-CUT PARTITIONING TO TREE STRUCTURES AND ITS
APPLICATIONS.
G. Vijayan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14127. 1988.]
110911 SOME DOUBLY LOGARITHMIC OPTIMAL PARALLEL ALGORITHMS BASED ON FINDING
NEAREST SMALLERS.
O. Berkman, B. Schieber, and U. Vishkin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14128. 1988.]
110912 CIRCUIT WIDTH, REGISTER ALLOCATION, AND REDUCED FUNCTION GRAPHS.
C. L. Berman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14129. 1988.]
110913 THE COGNITIVE ADAPTIVE COMPUTER HELP (COACH) INTERFACE.
T. Selker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14130. 1988.]
110914 BISECTORS OF LINEARLY SEPARABLE SETS.
L. R. Nackman and V. Srinivasan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14140. 1988.]
110915 ON FOURIER'S ALGORITHM FOR LINEAR ARITHMETIC CONSTRAINTS.
J.-L. Lassez and M. J. Maher.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14144. 1988.]
110916 '1'-ENDED BINARY PREFIX CODES.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14150. 1988.]
110917 IMPROVED BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14151. 1988.]
110918 ON THE REDUNDANCY OF OPTIMAL CODES WITH LIMITED WORD LENGTH.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14152. 1988.]
110919 REMOVING INTERACTION FROM ZERO-KNOWLEDGE PROOFS.
A. De Santis, S. Micali, and G. Persiano.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14153. 1988.]
110920 TIGHT BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES.
R. M. Capocelli and A. De Santis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14154. 1988.]
110921 SOME REMARKS ON NONNEGATIVE POLYNOMIALS ON POLYHEDRA.
C. A. Micchelli and A. Pinkus.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14155. 1988.]
110922 THE VOLUME OF RESTRICTED MOMENT SPACE.
A. S. Cavaretta Jr., W. Dahmen, and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14156. 1988.]
110923 NEW TECHNIQUES FOR FAST HYBRID SOLUTIONS OF SYSTEMS OF EQUATIONS.
J. Mandel and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14157. 1988.]
110924 PREFACE-2 - SUPPORTING NESTED PARALLELISM IN FORTRAN.
D. Bernstein.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14160. 1988.]
110925 BREAKING CYCLES AND VERTICAL CONSTRAINTS IN DEUTSCH'S NEW AND MORE
DIFFICULT CHANNEL-ROUTING PROBLEMS.
H. H. Chen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14161. 1988.]
110926 A PARALLEL ALGORITHM FOR THE GENERALIZED SYMMETRIC EIGENVALUE PROBLEM
USING FETCH-AND-ADD SYNCHRONIZATION.
R. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14163. 1988.]
110927 BEAUTY IN STRANGE PROPORTIONS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14173. 1988.]
110928 A QUASI-DIRECT FAST POISSON SOLVER FOR GENERAL REGIONS.
W. Liniger.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14175. 1988.]
110929 CARTESIAN CLOSED CATEGORIES OF MANY-SORTED ALGEBRAS.
F. J. Oles.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14181. 1988.]
110930 A TOOL FOR CREATING DELAY COST CURVES FOR A DCR SCHEDULER.
P. A. Franaszek and R. D. Nelson.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14184. 1988.]
110931 OPTIMAL ROUTING TO PARALLEL HETEROGENEOUS SERVERS - SMALL ARRIVAL
RATES.
Z. Rosberg and A. Makowski.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14185. 1988.]
110932 SOME NEW OPTIMUM GOLUMB RULERS.
J. B. Shearer.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14186. 1988.]
110933 ASCII PROTOCOL CONVERSION REVISITED.
R. S. Cahn.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14201. 1988.]
110934 CODING FOR CONSTRAINED CHANNELS: A COMPARISON OF TWO APPROACHES.
P. A. Franaszek.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14202. 1988.]
110935 INTERPOLATION BY SUMS OF RADIAL FUNCTIONS.
N. Dyn and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14209. 1988.]
110936 EXPRESSIVENESS OF RESTRICTED RECURSIVE QUERIES.
F. Afrati.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14210. 1988.]
110937 AN EASY-TO-USE SOLID MODELLING INTERFACE FOR CAPACITANCE COMPUTATION.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14212. 1988.]
110938 TYPE-EXTENSION TYPE TESTS CAN BE PERFORMED IN CONSTANT TIME.
N. H. Cohen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14231. 1988.]
110939 UNDERSTANDING LARGE SYSTEM FAILURE - A FAULT INJECTION EXPERIMENT.
R. Chillarege and N. S. Bowen.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14233. 1988.]
110940 ON SOLVING THE LINEAR PROGRAMMING PROBLEM APPROXIMATELY.
N. Megiddo.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6485. 1988.]
110941 AN INTERIOR POINT POTENTIAL REDUCTION ALGORITHM FOR THE LINEAR
COMPLEMENTARITY PROBLEM.
M. Kojima, N. Megiddo, and Y. Ye.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6486. 1988.]
110942 LINEAR PROGRAMMING WITH TWO VARIABLES PER INEQUALITY IN POLY-LOG TIME.
G. S. Lueker, N. Megiddo, and V. Ramachandran.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6491. 1988. "An earlier version of this
paper appeared in the 'Proceedings of the 18th Annual Symposium on
Theory of Computing,' May 1986, pp.196-205."]
110943 THE HARDNESS OF DECODING LINEAR CODES WITH PREPROCESSING.
J. Bruck and M. Naor.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6504. 1988.]
110944 AN O(LOG N) DETERMINISTIC ROUTING SCHEME.
E. Upfal.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6507. 1988.]
110945 VERIFYING THE ACCURACY OF MACHINE VISION ALGORITHMS AND SYSTEMS.
D. Petkovic and J. Mandeville.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6523. 1988.]
110946 REAL-TIME DECISION ANALYSIS - ALGORITHMS, ARCHITECTURES AND
IMPLEMENTATION.
C. B. Shung, W. E. Blanz, and D. Petkovic.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6526. 1988.]
110947 MAJORITY VOTING IN THE PRESENCE OF RANDOM VOTERS.
D. Dolev, D. G. Feitelson, and H. Sompolinsky.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6538. 1988.]
110948 CHOICE COORDINATION WITH LIMITED FAILURE.
A. Bar-Noy, M. Ben-Or, and D. Dolev.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6539. 1988.]
110949 STATISTICAL RELATIONAL DATABASES: NORMAL FORMS.
S. P. Ghosh.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6555. 1988.]
110950 TRADEOFFS BETWEEN STATIC AND DYNAMIC LOCK NAME SPACE PARTITIONING.
B. R. Iyer and C. M. Krishna.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6566. 1988.]
110951 PROGRAM CORRECTNESS CHECKING...AND THE DESIGN OF PROGRAMS THAT CHECK
THEIR WORK.
M. Blum and S. Kannan.
[International Computer Science Institute. TR-88-013. 1988.]
099091 FINE-GRAIN MESSAGE-PASSING CONCURRENT COMPUTERS.
-454 W. J. Dally.
[1988.]
099091 LOGIC SIMULATION ALGORITHMS FOR PIPELINED HARDWARE ARCHITECTURES.
-457 P. Agrawal, W. J. Dally, and R. Tutundjian.
[1988.]
099091 DESIGN OF A NETWORK FOR CONCURRENT MESSAGE PASSING SYSTEMS.
-458 P. Y. Song.
[1988. Thesis (M.S.).]
099091 A COMPARATIVE STUDY OF ROUTING AND FLOW CONTROL STRATEGIES IN K-ARY
-461 N-CUBE NETWORKS.
J. N. Mailhot.
[1988. Thesis (B.S.).]
099091 A MEMORY DESIGN FOR THE MESSAGE-DRIVEN PROCESSOR.
-465 S. M. N. Hassoun.
[1988. Thesis (M.S.).]
099091 MESSAGE-DRIVEN PROCESSOR ARCHITECTURE. VERSION 11.
-468 W. Dally et al.
[1988.]
099091 OPTIMAL SIMULATIONS BY BUTTERFLY NETWORKS.
-469 S. N. Bhatt et al.
[1988. "A preliminary version of this paper was presented at the 20th
ACM Symposium on Theory of Computing, Chicago, IL, May 2-4, 1988."]
099091 MICRO-OPTIMIZATION OF FLOATING-POINT OPERATIONS.
-470 W. J. Dally.
[1988.]
099091 AN INTELLIGENT PROCESS FLOW LANGUAGE EDITOR.
-475 R. Jayavant.
[1988. Thesis (M.S.).]
099091 CIRCUIT DESIGN CRITERIA FOR STABILITY IN A CLASS OF LATERAL
-477 INHIBITION NEURAL NETWORKS.
D. Standley and J. L. Wyatt Jr.
[1988.]
099091 EVALUATING THE PERFORMANCE OF SOFTWARE CACHE COHERENCE.
-478 S. Owicki and A. Agarwal.
[1988.]
099091 APPLYING THE CLASSIFICATION THEOREM FOR FINITE SIMPLE GROUPS TO
-483 MINIMIZE PIN COUNT IN UNIFORM PERMUTATION ARCHITECTURES.
L. Finkelstein, D. Kleitman, and F. T. Leighton.
[1988.]
110952 FAST PARALLEL GCD ALGORITHMS FOR SEVERAL POLYNOMIALS OVER INTEGRAL
DOMAIN.
C. Ho.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 352. 1988. Also issued
as Robotics research 142, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110953 FINDING EFFECTIVE 'FORCE-TARGETS' FOR TWO-DIMENSIONAL MULTIFINGER
FRICTIONAL GRIPS.
J. T. Schwartz and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 379. 1988. Also issued
as Robotics research 156, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110954 AUTOMATIC CONSTRUCTION OF POLYHEDRAL SURFACES FROM VOXEL
REPRESENTATIONS.
A. Shaw and E. L. Schwartz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 381. 1988. Also issued
as Robotics research 158, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110955 ALGORITHMIC MOTION PLANNING IN ROBOTICS.
M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 392. 1988. Also issued
as Robotics research 165, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
110956 REASONING ABOUT SHAPE AND KINEMATIC FUNCTION IN MECHANICAL DEVICES.
L. Joskowicz.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 402. 1988. Thesis
(Ph.D). Also issued as Robotics research 173, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
044069 LECTURES ON CONSTRUCTIVE FUNCTIONAL PROGRAMMING.
R. S. Bird.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-69. 1988.]
044070 ON THE REFINEMENT CALCULUS.
C. Morgan, K. Robinson, and P. Gardiner.
[Oxford University. Computing Laboratory. Programming Research Group.
Technical monograph PRG-70. 1988.]
110957 A DESCRIPTIVE AND PRESCRIPTIVE MODEL FOR DATAFLOW SEMANTICS.
R. Jagannathan.
[SRI International. Computer Science Laboratory. SRI-CSL-88-5. 1988.
Thesis (Ph.D). "A thesis presented to the University of Waterloo in
fulfillment of the thesis requirement for the degree of Doctor of
Philosophy in Computer Science, Waterloo, Ontario, Canada, 1988."]
110958 ACCESS CONTROL POLICIES: SOME UNASWERED QUESTIONS.
T. F. Lunt.
[SRI International. Computer Science Laboratory. SRI-CSL-88-6. 1988.]
110959 QUALITY MEASURES AND ASSURANCE FOR AI SOFTWARE.
J. Rushby.
[SRI International. Computer Science Laboratory. SRI-CSL-88-7R. 1988.]
110960 SECURITY DISTRIBUTED DATA VIEWS. VOL. 1: SECURITY POLICY AND POLICY
INTERPRETATION FOR A CLASS A1 MULTILEVEL SECURE RELATIONAL DATABASE
SYSTEM.
T. F. Lunt et al.
[SRI International. Computer Science Laboratory. SRI-CSL-88-8. 1988.]
110961 INTRODUCING OBJ3.
J. A. Goguen and T. Winkler.
[SRI International. Computer Science Laboratory. SRI-CSL-88-9. 1988.]
110962 CELL AND ENSEMBLE ARCHITECTURE FOR THE REWRITE RULE MACHINE.
S. Leinwand, J. A. Goguen, and T. Winkler.
[SRI International. Computer Science Laboratory. SRI-CSL-88-10. 1988.]
110963 SOFTWARE FOR THE REWRITE RULE MACHINE.
J. A. Goguen and J. Meseguer.
[SRI International. Computer Science Laboratory. SRI-CSL-88-11. 1988.]
110964 IDES: THE ENHANCED PROTOTYPE, A REAL-TIME INTRUSION-DETECTION EXPERT
SYSTEM.
T. F. Lunt et al.
[SRI International. Computer Science Laboratory. SRI-CSL-88-12. 1988.]
110965 RELATING MODELS OF POLYMORPHISM.
J. Meseguer.
[SRI International. Computer Science Laboratory. SRI-CSL-88-13. 1988.]
110966 REASONING ABOUT DESIGN CHANGES.
M. Moriconi and G. A. Harrison.
[SRI International. Computer Science Laboratory. SRI-CSL-88-14. 1988.]
035357 DESIGN AND VERIFICATION OF DISTRIBUTED TASKING SUPERVISORS FOR
CONCURRENT PROGRAMMING LANGUAGES.
D. S. Rosenblum.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-357.
March 1988. Thesis (Ph.D.). Also issued as Report no. 38, Program
Analysis and Verification Group, Computer Systems Laboratory,
Stanford University.]
035358 INTERVIEWS: A C++ GRAPHICAL INTERFACE TOOLKIT.
M. A. Linton, P. R. Calder, and J. M. Vlissides.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-358.
July 1988.]
035362 HARDWARE C - A LANGAUGE FOR HARDWARE DESIGN.
D. C. Ku and G. De Micheli.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-362.
August 1988.]
035363 COMPUTER-AIDED SYNTHESIS OF A BIDIMENSIONAL DISCRETE COSINE TRANSFORM
CHIP.
V. Rampa and G. De Micheli.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-363.
August 1988.]
035364 APPLYING OBJECT-ORIENTED DESIGN TO STRUCTURED GRAPHICS.
J. M. Vlissides and M. A. Linton.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-364.
August 1988.]
035365 DERIVING ACCURATE FAULT MODELS.
J. M. Acken.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-365.
October 1988. Thesis (Ph.D).]
035366 PERFORMANCE-DIRECTED MEMORY HIERARCHY DESIGN.
S. A. Przybylski.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-366.
September 1988. Thesis (Ph.D.).]
035367 AN OVERVIEW OF VAL.
L. M. Augustin et al.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-367.
October 1988. Also issued as Report no. 39, Program Analysis and
Verification Group, Computer Systems Laboratory, Stanford
University.]
035368 IMPROVED MODELS FOR SWITCH-LEVEL SIMULATION.
C.-Y. Chu.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-368.
November 1988. Thesis (Ph.D.).]
035369 COMPOSING USER INTERFACES WITH INTERVIEWS.
M. A. Linton, J. M. Vlissides, and P. R. Calder.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-369.
November 1988.]
035370 COPY ELIMINATION IN FUNCTIONAL LANGUAGES.
K. Gopinath and J. L. Hennessy.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-370.
November 1988.]
035371 GENERALIZED ACCESS CONTROL STRATEGIES FOR TOKEN PASSING SYSTEMS.
J. W. M. Pang, F. A. Tobagi, and S. Boyd.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-371.
November 1988.]
035372 INCREMENTAL VLSI COMPACTION.
C. W. Carpenter.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-372.
December 1988. Thesis (Ph.D.).]
035373 SPARSE DISTRIBUTED MEMORY PROTOTYPE: ADDRESS MODULE HARDWARE GUIDE.
M. J. Flynn, R. Zeidman, and E. Lochner.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-373.
December 1988.]
035374 POST-GAME ANALYSIS - A HEURISTIC RESOURCE MANAGEMENT FRAMEWORK FOR
CONCURRENT SYSTEMS.
J. C. Yan.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-374.
December 1988. Thesis (Ph.D.).]
035375 THROUGHPUT APPROXIMATION FOR THE GENERALIZED TIMER BASED PROTOCOL FOR
TOKEN PASSING SYSTEMS.
J. W. M. Pang and F. A. Tobagi.
[Stanford University. Computer Systems Laboratory. CSL-TR-88-375.
January 1989.]
038347 PARTIAL HARDWARE PARTITIONING: A NEW PSUEDO-EXHAUSTIVE TEST
IMPLEMENTATION.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-7.
September 1988. Also issued as CSL-TN-88-347, Computer Systems
Laboratory, Stanford University.]
038348 SAFE AND UNSAFE FAULTS IN CMOS EXCLUSIVE-OR GATES WITH GATE OXIDE
SHORTS.
H. H. Amer and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-8.
September 1988. Also issued as CSL-TN-88-348, Computer Systems
Laboratory, Stanford University.]
038349 ANALYSIS OF CHECKSUMS, EXTENDED PRECISION CHECKSUMS AND CYCLIC
REDUNDANCY CHECKS.
N. R. Saxena and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no. 88-9.
September 1988. Also issued as CSL-TN-88-349, Computer Systems
Laboratory, Stanford University.]
038350 CIRCUIT REDUCTION FOR EFFICIENT SEGMENTATION.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
88-10. December 1988. Also issued as CSL-TN-88-350, Computer Systems
Laboratory, Stanford University.]
038351 AN EFFICIENT SEGMENTATION PROGRAM FOR PSEUDO-EXHAUSTIVE CODE.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
88-11. December 1988. Also issued as CSL-TN-88-351, Computer Systems
Laboratory, Stanford University.]
038352 PSEUDO-EXHAUSTIVE TEST AND SEGMENTATION: FORMAL DEFINITIONS AND
EXTENDED FAULT COVERAGE RESULTS.
J. G. Udell Jr. and E. J. McCluskey.
[Stanford University. Center for Reliable Computing. Report no.
88-12. December 1988. Also issued as CSL-TN-88-352, Computer Systems
Laboratory, Stanford University.]
048088 A METHOD FOR USING BELIEF-NETWORK ALGORITHMS TO SOLVE
-28 DECISION-NETWORK PROBLEMS.
G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-28. August 1988.]
048088 FIRST: A CASE-BASED REDESIGN SYSTEM IN THE BB1 BLACKBOARD
-32 ARCHITECTURE.
F. Daube and B. Hayes-Roth.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-32. August 1988.]
048088 ELINT IN LAMINA: APPLICATION OF A CONCURRENT OBJECT LANGUAGE.
-33 B. A. Delagi and N. P. Saraiya.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-33. July 1988. "Extended abstract."]
048088 IDEFIX: INTELLIGENT SUMMARIZATION OF A TIME-ORIENTED MEDICAL DATABASE.
-34 I. de Zegher-Geets.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-34. June 1987. Thesis (M.S.). "Project
report submitted to the Medical Information Sciences Program at
Stanford University in partial fulfillment of the requirements for
the degree of Master of Science in Medical Information Sciences."]
048088 KNOWLEDGE ACQUISITION FOR PROBABILISTIC EXPERT SYSTEMS.
-40 H. P. Lehmann.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-40. November 1988.]
048088 REPRESENTING AND EDITING CONSTRAINTS: A CASE STUDY IN FINANCIAL
-45 RESOURCE MANAGEMENT.
S. M. Altman.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-45. June 1988.]
048088 LEARNING APPROXIMATE CONCEPT DESCRIPTIONS.
-57 R. M. Keller.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-57. July 1988.]
048088 FROM EXPERT MODELS TO EXPERT SYSTEMS: TRANSLATION OF AN INTERMEDIATE
-58 KNOWLEDGE REPRESENTATION.
D. M. Combs et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-58. August 1988.]
048088 OF BRITTLENESS AND BOTTLENECKS: CHALLENGES IN THE CREATION OF PATTERN
-59 RECOGNITION AND EXPERT-SYSTEM MODELS.
M. A. Musen and J. van der Lei.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-59. August 1988.]
048088 AN OBJECT-BASED ARCHITECTURE FOR BIOMEDICAL EXPERT DATABASE SYSTEMS.
-60 T. Barsalou.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-60. August 1988.]
048088 AN ANALYSIS OF CATEGORICAL AND QUANTITATIVE METHODS FOR PLANNING
-63 UNDER UNCERTAINTY.
C. P. Langlotz and E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-63. September 1988.]
048088 CAGE: THE PERFORMANCE OF A CONCURRENT BLACKBOARD ENVIRONMENT.
-80 N. Aiello.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-80. December 1988.]
048088 MULTICAST COMMUNICATION IN MULTIPROCESSOR SYSTEMS.
-81 G. T. Byrd and N. P. Saraiya.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-81. December 1988.]
048088 THE ALARM MONITORING SYSTEM: A CASE STUDY WITH TWO PROBABILISTIC
-84 INFERENCE TECHNIQUES FOR BELIEF NETWORKS.
I. A. Beinlich et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-84. January 1989.]
048089 REFLECTION AND ACTION UNDER SCARCE RESOURCES.
-01 E. J. Horvitz, D. E. Heckerman, and G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-01. January 1989.]
048089 HYPERTEXT INTERFACES FOR DECISION-SUPPORT SYSTEMS: A CASE STUDY.
-03 T. Barsalou, R. M. Chavez, and G. Wiederhold.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-03. January 1989.]
048089 LANGUAGES FOR KNOWLEDGE ACQUISITION: BUILDING AND EXTENDING MODELS.
-07 M. A. Musen.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-07. January 1989.]
110967 EXECUTIONS OF PETRI NETS.
W. Vogler.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8806. 1988.]
110968 KONSTRUKTION UND UNTERSUCHUNG VON DIFFERENZENOPERATOREN MIT DEM
REDUCE-SYSTEM.
V. G. Ganzha and R. Foessmeier.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8808. 1988.]
110969 SEMANTICS AND EFFICIENT COMPILATION FOR QUANTITATIVE DEDUCTION DATA
BASES.
N. Steger et al.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8809. 1988.]
110970 ZUR NUMERISCHEN BEHANDLUNG VON SINGULARITAETEN IN ELLIPTISCHEN
PARTIELLEN DIFFERENTIALGLEICHUNGEN.
U. Ruede.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8810. 1988.]
110971 AKTIVE WISSENSBASEN UND DAEMONENKONZEPTE.
S. Bocionek and R. Meyfarth.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8811. 1988.]
110972 A TOOLKIT BASED APPROACH FOR CONSTRUCTING GATEWAYS.
E. Biersack.
[Technische Universitaet Muenchen (TUM). Institut fuer Informatik.
TUM-I8812. 1988.]
110973 SOFTWARE MODULES FOR ELECTRONIC PAPER.
E. R. Brocklehurst and M. J. Stevens.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 127/88. 1988.]
110974 THE STABLE EVALUATION OF A SIMPLE RATIONAL FUNCTION AND ITS
APPLICATION TO SPLINE APPROXIMATION.
M. G. Cox and P. M. Harris.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 135/88. 1988.]
110975 ATTRIBUTE GRAMMARS FOR ONE-PASS COMPILATION.
J. Tarhio.
[University of Helsinki. Department of Computer Science. A-1988-11.
1988.]
110976 EXPERIENCE WITH CLASS-BASED IMPLEMENTATION OF PROGRAMMING LANGUAGES.
K. Koskimies and M. Meriste.
[University of Helsinki. Department of Computer Science. A-1988-12.
1988.]
110977 SPECIFICATION AND DESIGN OF DISTRBUTED PROGRAMS THAT USE BROADCASTING.
E. Hartikainen.
[University of Helsinki. Department of Computer Science. A-1988-13.
1988.]
110978 THE INTERDEPENDENCIES OF THEORY FORMATION, REVISION, AND
EXPERIMENTATION.
B. Falkenhainer and S. Rajamoney.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1439. 1988.]
110979 ROLES AND THEIR ROLE IN POSING RECURSIVE QUERIES OVER THE UNIVERSAL
RELATION.
R. John et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1463. 1988.]
110980 EFFICIENT SPACE-SUBDIVISION METHODS IN RAY-TRACING ALGORITHMS.
L.-H. Quek and D. D. Hearn.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1468. 1988.]
110981 A QUALITATIVE APPROACH TO RIGID BODY MECHANICS.
P. E. Nielsen.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1469. 1988. Thesis (Ph.D.).]
110982 COMBINATORIAL COMPLEXITY BOUNDS AND ARRANGEMENTS OF CURVES AND
SURFACES.
K. L. Clarkson et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1470. 1988.]
110983 CIRCUMSCRIBING EQUALITY.
P. K. Rathmann and M. Winslett.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1473. 1988.]
110984 AN ADAPTIVE ALGORITHM FOR RICHARDSON'S METHOD.
P. E. Saylor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1474. 1988.]
110985 A PROBABILISTIC REASONING-BASED APPROACH TO MACHINE LEARNING.
K. S. Purswani.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1475. 1988. Thesis (Ph.D.).]
110986 ARRANGEMENTS OF CURVES IN THE PLANE - TOPOLOGY, COMBINATORICS, AND
ALGORITHMS.
H. Edelsbrunner et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1477. 1988.]
110987 STORAGE CAPACITY OF THE LINEAR ASSOCIATOR: BEGINNINGS OF A THEORY OF
COMPUTATIONAL MEMORY.
D. C. Mumme.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1485. 1988. Thesis (Ph.D.).]
110988 PICTURE PROCESSING: 1986.
A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1751.
1987. Also issued as CAR-TR-247, Center for Automation Research,
University of Maryland.]
110989 HIERARCHICAL DATA STRUCTURES AND ALGORITHMS FOR COMPUTER GRAPHICS.
H. Samet.
[University of Maryland. Department of Computer Science. CS-TR-1752.
1987. Also issued as CAR-TR-248, Center for Automation Research,
University of Maryland.]
110990 A KNOWLEDGE BASED VISION SYSTEM FOR AERIAL IMAGE UNDERSTANDING.
R. Prasannappa, L. S. Davis, and V. S. S. Hwang.
[University of Maryland. Department of Computer Science. CS-TR-1758.
1987. Also issued as CAR-TR-253, Center for Automation Research,
University of Maryland.]
110991 MASK MATCHING FOR LINEAR FEATURE DETECTION.
N. S. Netanyahu and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1759.
1987. Also issued as CAR-TR-254, Center for Automation Research,
University of Maryland.]
110992 TWO DIMENSIONAL PATH PLANNING WITH OBSTACLES AND SHADOWS.
S. Puri and L. S. Davis.
[University of Maryland. Department of Computer Science. CS-TR-1760.
1987. Also issued as CAR-TR-255, Center for Automation Research,
University of Maryland.]
110993 COMPUTING GEOMETRIC BOOLEAN OPERATIONS BY INPUT DIRECTED
DECOMPOSITION.
G. Vanecek Jr. and D. S. Nau.
[University of Maryland. Department of Computer Science. TR-1762.
1987.]
110994 REPRESENTATION OF ORTHOGONAL REGIONS BY VERTICES.
C.-N. Lee and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1766.
1987. Also issued as CAR-TR-257, Center for Automation Research,
University of Maryland.]
110995 EFFICIENT TWO DIMENSIONAL PATTERN MATCHING IN THE PRESENCE OF ERRORS.
K. Krithivasan and R. Sitalakshmi.
[University of Maryland. Department of Computer Science. CS-TR-1768.
1987. Also issued as CAR-TR-259, Center for Automation Research,
University of Maryland.]
110996 ON THE KINETIC DEPTH EFFECT: LOWER BOUNDS, REGULARIZATION AND
LEARNING.
J. Aloimonos and A. Papageorgiou.
[University of Maryland. Department of Computer Science. CS-TR-1770.
1987. Also issued as CAR-TR-261, Center for Automation Research,
University of Maryland.]
110997 COMBINING SHADING AND MOTION TO COMPUTE SHAPE AND LIGHT SOURCE
DIRECTION.
J. Aloimonos.
[University of Maryland. Department of Computer Science. CS-TR-1771.
1986. Also issued as CAR-TR-262, Center for Automation Research,
University of Maryland.]
110998 SHAPE FROM PROJECTING A STRIPE PATTERN.
M. Asada and S. Tsuji.
[University of Maryland. Department of Computer Science. CS-TR-1773.
1987. Also issued as CAR-TR-263, Center for Automation Research,
University of Maryland.]
110999 DESIGN AND STUDY OF PARALLEL SET COVERING ALGORITHMS.
S. Sekar.
[University of Maryland. Department of Computer Science. TR-1774.
1987. Thesis (M.S.).]
111000 DESIGN GUIDEBOOK FOR INTERACTION STYLES: A TAXONOMY, RULE-BASE, AND
SOME OPINIONS.
B. Shneiderman.
[University of Maryland. Department of Computer Science. CS-TR-1776.
1987. Also issued as CAR-TR-265, Center for Automation Research,
University of Maryland.]
111001 PEPS - A PACKAGE FOR THE PERFORMANCE EVALUATION OF PARALLEL
ALGORITHMS UNDER MARKOV ASSUMPTIONS.
K. Lee and B. D. Plateau.
[University of Maryland. Department of Computer Science. TR-1777.
1986.]
111002 A METHOD FOR HANDLING COMPLEX MARKOV MODELS OF DISTRIBUTED
ALGORITHMS: THE DISCRETE CASE.
B. D. Plateau.
[University of Maryland. Department of Computer Science. TR-1778.
1986.]
111003 COMPARISON OF THE MINIMAX AND PRODUCT BACK-UP RULES IN A VARIETY OF
GAMES.
P.-C. Chi and D. S. Nau.
[University of Maryland. Department of Computer Science. TR-1779.
1987. "A condensed version of this paper, entitled 'Comparing Minimax
and Product in a Variety of Games,' appears in Proc. AAAI-87."]
111004 AUTOMATED PROCESS PLANNING USING HIERARCHICAL ABSTRACTION.
D. S. Nau.
[University of Maryland. Department of Computer Science. TR-1780.
1987.]
111005 ANALYSIS OF OBJECT ORIENTED SPATIAL ACCESS METHODS.
C. Faloutsos, T. Sellis, and N. Roussopoulos.
[University of Maryland. Department of Computer Science. CS-TR-1781.
1986. Also issued as UMIACS-TR-86-27, Institute for Advanced Computer
Studies, University of Maryland.]
111006 POLYNOMIAL TERSE SETS.
A. Amir.
[University of Maryland. Department of Computer Science. CS-TR-1782.
1987. Also issued as UMIACS-TR-87-1, Institute for Advanced Computer
Studies, University of Maryland.]
111007 ON OPTIMAL FILE ALLOCATION WITH SHARING.
S. K. Tripathi and Y. Huang.
[University of Maryland. Department of Computer Science. CS-TR-1783.
1987. Also issued as UMIACS-TR-87-2, Institute for Advanced Computer
Studies, University of Maryland.]
111008 MARKER-PASSING: SOME RECENT WORK.
J. A. Hendler.
[University of Maryland. Department of Computer Science. TR-1784.
1987.]
111009 DESIGNING INTERFACES FOR EXPERT SYSTEMS.
J. A. Hendler and C. Lewis.
[University of Maryland. Department of Computer Science. TR-1785.
1987.]
111010 EFFICIENT TWO DIMENSIONAL PARALLEL AND SERIAL APPROXIMATE MATCHING.
K. Krithivasan.
[University of Maryland. Department of Computer Science. CS-TR-1786.
1987. Also issued as CAR-TR-266, Center for Automation Research,
University of Maryland.]
111011 DETECTING CLOUDS AND CLOUD SHADOWS ON AERIAL PHOTOGRAPHS.
C. Wang, L. Huang, and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1788.
1987. Also issued as CAR-TR-268, Center for Automation Research,
University of Maryland.]
111012 DETECTING AND EXTRACTING COMPACT TEXTURED OBJECTS USING PYRAMIDS.
A. C. Sher.
[University of Maryland. Department of Computer Science. CS-TR-1789.
1987. Also issued as CAR-TR-269, Center for Automation Research,
University of Maryland.]
111013 A PYRAMID ALGORITHM FOR FAST CURVE EXTRACTION.
S. Connelly and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1790.
1987. Also issued as CAR-TR-270, Center for Automation Research,
University of Maryland.]
111014 ON COMPUTING HISTOGRAMS OF IMAGES IN LOG N TIME USING FAT PYRAMIDS.
T. Bestul and L. S. Davis.
[University of Maryland. Department of Computer Science. CS-TR-1791.
1986. Also issued as CAR-TR-271, Center for Automation Research,
University of Maryland.]
111015 FEATURE DETECTION BASED ON PAIRWISE CONSISTENT LABELING.
J. J. Kim and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1792.
1987. Also issued as CAR-TR-272, Center for Automation Research,
University of Maryland.]
111016 ON COST-EFFECTIVENESS OF A SEMIJOIN ON DISTRIBUTED QUERY PROCESSING.
H. Kang and N. Roussopoulos.
[University of Maryland. Department of Computer Science. CS-TR-1793.
1987. Also issued as UMIACS-TR-87-5, Institute for Advanced Computer
Studies, University of Maryland.]
111017 COMBINING JOINS AND SEMIJOINS IN DISTRIBUTED QUERY PROCESSING.
H. Kang and N. Roussopoulos.
[University of Maryland. Department of Computer Science. CS-TR-1794.
1987. Also issued as UMIACS-TR-87-6, Institute for Advanced Computer
Studies, University of Maryland.]
111018 THE R+-TREE: A DYNAMIC INDEX FOR MULTI-DIMENSIONAL OBJECTS.
T. Sellis, N. Roussopoulos, and C. Faloutsos.
[University of Maryland. Department of Computer Science. CS-TR-1795.
1987. Also issued as UMIACS-TR-87-3, Institute for Advanced Computer
Studies, University of Maryland.]
111019 GRAY CODES FOR PARTIAL MATCH AND RANGE QUERIES.
C. Faloutsos.
[University of Maryland. Department of Computer Science. CS-TR-1796.
1987. Also issued as UMIACS-TR-87-4, Institute for Advanced Computer
Studies, University of Maryland.]
111020 A FEW APPLICATIONS OF THE SET-VISIBILITY ALGORITHM.
S. K. Ghosh.
[University of Maryland. Department of Computer Science. CS-TR-1797.
1987. Also issued as CAR-TR-273, Center for Automation Research,
University of Maryland.]
111021 STRUCTURE FROM MOTION FROM LINE CORRESPONDENCIES: NEW RESULTS.
M. E. Spetsakis and J. Aloimonos.
[University of Maryland. Department of Computer Science.
CS-TR-1798.1. 1987. Also issued as CAR-TR-274R, Center for Automation
Research, University of Maryland.]
111022 PERSPECTIVES IN DEDUCTIVE DATABASES.
J. Minker.
[University of Maryland. Department of Computer Science. CS-TR-1799.
1987. "This paper is an expansion of an invited talk presented at the
[ACM SIGACT/SIGMOD/SIGACT] Principles of Database Systems Conference,
San Diego, California, March 23-25, 1987." Also issued as
UMIACS-TR-87-7, Institute for Advanced Computer Studies, University
of Maryland.]
111023 CORRESPONDENCELESS MODEL BASED AND ACTIVE PERCEPTION OF SHAPE FROM
CONTOUR.
T.-C. Chou, J. Aloimonos, and A. Rosenfeld.
[University of Maryland. Department of Computer Science. CS-TR-1800.
1987. Also issued as CAR-TR-275, Center for Automation Research,
University of Maryland.]
111024 HIERARCHICAL MODELING AND TEST GENERATION FOR DIGITAL CIRCUITS.
D. Bhattacharya.
[University of Michigan. Computing Research Laboratory. CRL-TR-8-88.
1988. Thesis (Ph.D.).]
111025 CONSTRUCTION AND SOLUTION OF PERFORMABILITY MODELS BASED ON
STOCHASTIC ACTIVITY NETWORKS.
W. H. Sanders.
[University of Michigan. Computing Research Laboratory. CRL-TR-9-88.
1988. Thesis (Ph.D).]
111026 ON THE STABILITY OF RELAXED INCOMPLETE LU FACTORIZATIONS.
A. M. Bruaset, A. Tveito, and R. Winther.
[University of Oslo. Institute for Informatics. Research report 119.
1988.]
111027 ON MULTIVARIATE SIMPLEX B-SPLINES.
K. V. Ha.
[University of Oslo. Institute for Informatics. Research report 120.
1988. Thesis (D.Sci).]
111028 HIERARCHICAL INTERCONNECTION NETWORKS FOR MULTICOMPUTER SYSTEMS.
S. Dandamudi.
[University of Saskatchewan. Department of Computational Science.
Research report 88-18. 1988. Thesis (Ph.D).]
111029 LOG-TRACKER: AN ATTRIBUTE-BASED APPROACH TO TRACKING HUMAN BODY
MOTION.
W. Long and Y.-H. Yang.
[University of Saskatchewan. Department of Computational Science.
Research report 88-19. 1988.]
111030 COMIC - A SYSTEM FOR CONCEPTUAL MODELLING FOR INFORMATION
CONSTRUCTION.
H. Kangassalo.
[University of Tampere. Department of Computer Science. A-1988-10.
1988.]
111031 INCORPORATING AGENT'S BELIEFS IN A MODEL OF PRESUPPOSITION.
D. L. Horton.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-201. 1987. Thesis (M.S.). "Revised version of a
thesis submitted in conformity with the requirements for the degree
of Master of Science."]
111032 PERFORMANCE PROPERTIES OF THE FDDI TOKEN RING.
G. Clark.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-203. 1987. Thesis (M.S.).]
111033 PROCESS MANAGEMENT AND ASSERTION ENFORCEMENT FOR A SEMANTIC DATA
MODEL.
K. L. Chung et al.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-204. 1988.]
111034 KNOWLEDGE ACQUISITION AS KNOWLEDGE EXPLICATION BY CONCEPTUAL ANALYSIS.
S. Regoczei and G. Hirst.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-205. 1988.]
111035 A REAL-TIME LANGUAGE WITH A SCHEDULABILITY ANALYZER.
A. D. Stoyenko.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-206. 1987. Thesis (Ph.D.).]
111036 AN EMPIRICAL STUDY OF ON-CHIP PARALLELISM.
M. L. Bailey and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 88-07-02. n.d.]
111037 A NOTATION FOR DESCRIBING MULTIPLE VIEWS OF VLSI CIRCUITS.
J.-L. Baer et al.
[University of Washington. Department of Computer Science. Technical
report 88-07-03. 1988.]
111038 PROGRAMMING PARALLEL VISION ALGORITHMS: A DATAFLOW LANGUAGE APPROACH.
L. G. Shapiro.
[University of Washington. Department of Computer Science. Technical
report 88-07-04. 1988.]
111039 PARALLEL COMPLEXITY RESULTS ABOUT GREEDY BREADTH AND DEPTH FIRST
SEARCH.
R. Greenlaw.
[University of Washington. Department of Computer Science. Technical
report 88-07-05. 1988.]
111040 PARALLEL COMPUTATIONAL GEOMETRY OF RECTANGLES.
S. K. Kim.
[University of Washington. Department of Computer Science. Technical
report 88-07-07. 1988.]
111041 THE HEURISTIC DISCOVERY OF CONCEPT DESCRIPTORS.
T. Farrah.
[University of Washington. Department of Computer Science. Technical
report 88-09-02. 1988.]
111042 THE PERFORMANCE IMPLICATION OF THREAD ALTERNATIVES FOR SHARED-MEMORY
MULTIPROCESSORS.
T. E. Anderson, E. D. Lazowska, and H. M. Levy.
[University of Washington. Department of Computer Science. Technical
report 88-09-04. 1988.]
111043 PARALLEL SIMULATION OF QUEUEING NETWORKS: LIMITATIONS AND POTENTIALS.
D. B. Wagner and E. D. Lazowska.
[University of Washington. Department of Computer Science. Technical
report 88-09-05. 1988.]
111044 A GENERAL SEQUENTIAL TIME-SPACE TRADEOFF FOR FINDING UNIQUE ELEMENTS.
P. Beame.
[University of Washington. Department of Computer Science. Technical
report 88-10-04. 1988.]
111045 POKER (4.2) PROGRAMMER'S REFERENCE GUIDE.
L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 88-10-05. 1988.]
111046 ORGANIZATION AND PERFORMANCE OF A TWO-LEVEL VIRTUAL-REAL CACHE
HIERARCHY.
W.-H. Wang, J.-L. Baer, and H. M. Levy.
[University of Washington. Department of Computer Science. Technical
report 88-11-02. 1988.]
111047 EXTENDING MEMORY HIERARCHY INTO MULTIPROCESSOR INTERCONNECTION
NETWORKS.
H. E. Mizrahi.
[University of Washington. Department of Computer Science. Technical
report 88-11-03. 1988. Thesis (Ph.D.).]
111048 INTRODUCING MEMORY INTO THE SWITCH ELEMENTS OF MULTIPROCESSOR
INTERCONNECTION NETWORKS.
H. E. Mizrahi et al.
[University of Washington. Department of Computer Science. Technical
report 88-11-05. 1988.]
111049 REPRESENTING GOEMETRIC STRUCTURE IN D DIMENSIONS: TOPOLOGY AND ORDER.
E. Brisson.
[University of Washington. Department of Computer Science. Technical
report 88-11-07. 1988.]
111050 USING FEEDBACK TO CONTROL TREE SATURATION IN MULTISTAGE
INTERCONNECTION NETWORKS.
S. Scott and G. Sohi.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 807. 1988.]
111051 THE EXODUS EXTENSIBLE DBMS PROJECT: AN OVERVIEW.
M. J. Carey et al.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 808. 1988.]
111052 TRADEOFFS IN INSTRUCTION FORMAT DESIGN FOR HORIZONTAL ARCHITECTURES.
G. S. Sohi and S. Vajapeyam.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 810. 1988.]
111053 CONSTRUCTION OF PROGRAM ANALYSIS TECHNIQUES FOR USE IN PROGRAM
DEVELOPMENT ENVIRONMENTS.
G. A. Venkatesh and C. N. Fischer.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 811. 1989.]
111054 ON THE CONVOLUTION OF A BOX SPLINE WITH A COMPACTLY SUPPORTED
DISTRIBUTION: LINEAR INDEPENDENCE FOR THE INTEGER TRANSLATES.
C. K. Chui and A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 812. 1989.]
111055 ON THE CONVOLUTION OF A BOX SPLINE WITH A COMPACTLY SUPPORTED
DISTRIBUTION: THE EXPONENTIAL-POLYNOMIALS IN THE LINEAR SPAN.
A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 813. 1989.]
111056 EFFICIENT SYNCHRONIZATION PRIMITIVES FOR LARGE-SCALE CACHE-COHERENT
MULTIPROCESSORS.
J. R. Goodman, M. K. Vernon, and P. J. Woest.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 814. 1989.]
095277 A DEDUCTIVE DATABASE BASED ON ARISTOTELIAN LOGIC.
E. Mozes.
[Weizmann Institute of Science. Department of Computer Science.
CS87-18. 1987.]
VOL. 11, NO. 3 04/03/89
111058 PS: POLYGON STREAMS, A DISTRIBUTED ARCHITECTURE FOR INCREMENTAL
COMPUTATION APPLIED TO GRAPHICS.
R. Gupta.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-03. 1988.]
111059 A STUDY OF FINE-GRAIN PROGRAMMING USING CANTOR.
N. J. Boden.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-11. 1988. Thesis (M.S.).]
111060 SUBMICRON SYSTEMS ARCHITECTURE: SEMIANNUAL TECHNICAL REPORT.
REPORTING PERIOD: 1 APRIL 1988 - 31 OCTOBER 1988.
C. L. Seitz et al.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-18. 1988. Principal investigator: Charles L. Seitz.
Faculty investigators: William C. Athas, K. Mani Chandy, Alain J.
Martin, Martin Rem, Charles L. Seitz, Stephen Taylor.]
111061 CONTROLLING RIGID BODIES WITH DYNAMIC CONSTRAINTS.
R. Barzel.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-19. 1988.]
111062 WINNER-TAKE-ALL NETWORKS OF O(N) COMPLEXITY.
J. Lazzaro et al.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-21. 1988.]
111063 VARIANTS OF THE CHANDY-MISRA-BRYANT DISTRIBUTED DISCRETE-EVENT
SIMULATION ALGORITHM.
W.-K. Su and C. L. Seitz.
[California Institute of Technology. Computer Science Department.
Caltech-CS-TR-88-22. 1988.]
111309 CMU RAYTRACER, VERSION 6.0: BRIEF INSTRUCTION MANUAL.
R. Thibadeau et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-18.
1988. Designer: Robert Thibadeau. Programmers: Tim Chow, Steve
Handerson, and David Tin-Nyo.]
111310 AUTOMATIC GENERATION OF MECHANICAL ASSEMBLY SEQUENCES.
L. S. Homem de Mello and A. C. Sanderson.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-88-19.
1988.]
111311 A CASE STUDY IN ROBOT EXPLORATION.
L.-J. Lin et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-1.
1989.]
111312 PREFERENCE PROPAGATION IN TEMPORAL/CAPACITY CONSTRAINT GRAPHS.
N. Sadeh and M. S. Fox.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-2.
1989. "Also appears as [Carnegie-Mellon University Department of]
Computer Science technical report CMU-CS-88-193."]
111313 1988 YEAR END REPORT: AUTONOMOUS PLANETARY ROVER AT CARNEGIE MELLON.
T. Kanade, T. Mitchell, and W. Whittaker.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-3.
1989. "This report describes progress in research on an autonomous
robot for planetary exploration performed during 1988 at the Robotics
Institute, Carnegie Mellon University." Principal investigators:
Takeo Kanade, Tom Mitchell, William Whittaker.]
111314 ON LEARNING FROM EXERCISES.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-4.
1989.]
111315 SOME RESULTS ON LEARNING.
B. K. Natarajan.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-6.
1989.]
111066 KNOWLEDGE-BASED SYNTHESIS OF CUSTOM VLSI PHYSICAL DESIGN TOOLS: FIRST
STEPS.
D. E. Setliff and R. A. Rutenbar.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-1. 1988.]
111067 SYSTOLIC ROUTING HARDWARE: PERFORMANCE EVALUATION AND OPTIMIZATION.
R. A. Rutenbar and D. E. Atkins.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-6. 1988.]
111068 THE SYSTEM ARCHITECT'S WORKBENCH.
D. E. Thomas et al.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-10. 1988.]
111069 MASK VERIFICATION ON THE CONNECTION MACHINE.
E. C. Carlson and R. A. Rutenbar.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-11. 1988.]
111070 FAST INCREMENTAL CIRCUIT ANALYSIS USING EXTRACTED HIERARCHY.
D. L. Beatty and R. E. Bryant.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-14. 1988.]
111071 THE MIN-CUT SHUFFLE: TOWARD A SOLUTION FOR THE GLOBAL EFFECT PROBLEM
OF MIN-CUT PLACEMENT.
I. Bhandari, M. Hirsch, and D. Siewiorek.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-15. 1988. "A short
version of this paper [was] presented at the Design Automation
Conference, June, 1988."]
111072 THE SYSTEM ARCHITECT'S WORKBENCH USER'S GUIDE.
D. E. Thomas.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-17. 1988. Second
edition. D. E. Thomas, editor.]
111073 LINKING THE BEHAVIORAL AND STRCUTURAL DOMAINS OF REPRESENTATION FOR
DIGITAL SYSTEM DESIGN.
D. E. Thomas, R. L. Blackburn, and J. V. Rajan.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-26. 1988.]
111074 DATA PARALLEL SWITCH-LEVEL SIMULATION.
R. E. Bryant.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-31. 1988.]
111075 AUTOMATICALLY EXTRACTING STRUCTURE FROM A LOGICAL DESIGN.
M. Hirsch and D. Siewiorek.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-34. 1988.]
111076 ERROR TOLERANCE IN PARALLEL SIMULATED ANNEALING TECHNIQUES.
R. Jayaraman and F. Darema.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-38. 1988.]
111077 ORGANIZATION OF ARRAY DATA FOR CONCURRENT MEMORY ACCESS.
M. Breternitz Jr. and J. P. Shen.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-39. 1988.]
111078 FLEXIBLE PROCESSORS: A PROMISING APPLICATION-SPECIFIC PROCESSOR
DESIGN APPROACH.
A. Wolfe and J. P. Shen.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-43. 1988.]
111079 AWE: ASYMPTOTIC WAVEFORM ESTIMATION.
L. T. Pillage and R. A. Rohrer.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-44. 1988.]
111080 YIELD ANALYSIS FOR FAULT-TOLERANT ARRAYS.
D. M. H. Walker.
[Carnegie-Mellon University. SRC-CMU Research Center for
Computer-Aided Design. Research report CMUCAD-88-46. 1988.]
111081 BLOSSOMS ARE POLAR FORMS.
L. Ramshaw.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 34. 1989.]
111082 AN INTRODUCTION TO PROGRAMMING WITH THREADS.
A. D. Birrell.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 35. 1989.]
111083 PRIMITIVES FOR COMPUTATIONAL GEOMETRY.
J. Stolfi.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 36. 1989. Thesis (Ph.D.). "This report reproduces a dissertation
submitted in May 1988 to the Department of Computer Science of
Stanford University in partial fulfilment of the requirements for the
degree of Doctor of Philosophy."]
111084 DESIGN OF THE PROCESSOR-BOARD FOR THE CERES-2 WORKSTATION.
B. Heeb.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 93. 1988.]
111085 ZWANZIG JAHRE, INSTITUT FUER INFORMATIK.
F. L. Bauer and E. W. Dijkstra.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 95. 1988. This report contains two papers
delivered on the occasion of the 20th anniversary celebration of the
Institut fuer Informatik at ETH Zuerich, October 19, 1988.]
111086 ARTIFICIAL INTELLIGENCE FOR FLEXIBLE MANUFACTURING: AN ASSESSMENT.
G. G. Dodd.
[General Motors Corporation. Research Laboratories. Computer Science
Department. Research publication GMR-6270. 1988.]
111087 A NON-INTERLEAVING SEMANTICS FOR CCS BASED ON PROVED TRANSITIONS.
G. Boudol and I. Castellani.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 919. 1988.]
111088 REACHABILITY, OBSERVABILITY, MINIMALITY, AND EXTENDIBILITY FOR
TWO-POINT BOUNDARY-VALUE DESCRIPTOR SYSTEMS.
R. Nikoukhah, A. S. Willsky, and B. C. Levy.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 920. n.d.]
111089 NORMALIZATION AND LINEARITY IN UNIFICATION LOGIC.
P. Le Chenadec.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 922. 1988.]
111090 A FINITE ELEMENT METHOD TO SOLVE THE COMPRESSIBLE NAVIER-STOKES
EQUATIONS WITH TURBULENCE MODELLING.
S. Boivin.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 923. 1988.]
111091 INTEGRATION D'OUTILS POUR L'EXPRESSION ET LA SATISFACTION DE
CONTRAINTES DANS UN GENERATEUR DE SYSTEMES EXPERTS [INTEGRATING TOOLS
FOR CONSTRAINTS EXPRESSION AND SATISFACTION IN AN EXPERT SYSTEM
SHELL].
P. Berlandier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 924. 1988.]
111092 THE CENTAURS RACE: PERFORMANCE EVALUATION OF AN ELECTION ALGORITHM ON
A RING.
A. Jean-Marie and F. Baccelli.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 926. 1988.]
111093 ON RANDOM WALKS ARISING IN QUEUEING SYSTEMS: ERGODICITY AND
TRANSIENCE VIA QUADRATIC FORMS AS LYAPOUNOV FUNCTIONS - PART 1.
G. Fayolle.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 928. 1988.]
111094 3D EDGE DETECTION USING RECURSIVE FILTERING: APPLICATION TO SCANNER
IMAGES.
O. Monga and R. Deriche.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 930. 1988.]
111095 GEOMETRIC REASONING IN MOTION PLANNING.
C. Laugier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 932. 1988.]
111096 TRAITEMENT DES INCERTITUDES EN PROGRAMMATION AUTOMATIQUE DES ROBOTS
[DEALING WITH UNCERTAINTY IN AUTOMATIC ROBOT PROGRAMMING].
C. Laugier.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 933. 1988.]
111097 VERIFICATION OF DISTRIBUTED SYSTEMS: AN EXPERIMENT.
D. Vergamini.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 934. 1988.]
111098 UN ALGORITHME DISTRIBUE POUR L'EXECUTION PARALLELE DE PROLOG [A
DISTRIBUTED SYSTEM ALGORITHM FOR PARALLEL EXECUTION OF PROLOG].
F. Schwaab and D. Tusera.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 935. 1988.]
111099 SELF-ORGANIZATION IN A PERPETUAL NETWORK.
R. Linsker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 13106. 1987.]
111100 FUNCTIONAL COMPARISON OF LOGIC DESIGNS FOR VLSI CHIPS.
C. L. Berman and L. Trevillyan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14137. 1988.]
111101 THE COGNITIVE CONSEQUENCES OF OBJECT-ORIENTED DESIGN.
M. B. Rosson and S. R. Alpert.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14191. 1988.]
111102 IS THERE A PRACTICAL USE FOR MOIRE PATTERNS IN COMPUTER GRAPHICS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14227. 1988.]
111103 AN ANALYTICAL MODEL FOR FULLY ASSOCIATIVE CACHE MEMORIES.
J. P. Singh, H. S. Stone, and D. F. Thiebaut.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14232. 1988.]
111104 FAULT-TOLERANT ANALYSIS OF ONE-SIDED CROSSPOINT SWITCHING NETWORKS.
A. Varma and S. Chalasani.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14240. 1988.]
111105 AN OBJECT-ORIENTED LANGUAGE FOR IMAGE AND VISION EXECUTION (OLIVE).
M. Lavin and M. Flickner.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14242. 1988.]
111106 DETECTING AND ELIMINATING REDUNDANT DERIVATIONS IN LOGIC PROGRAMMING
SYSTEMS.
A. R. Helm.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14243 1988.]
111107 DETECTING AND ELIMINATING REDUNDANT DERIVATIONS IN DEDUCTIVE DATABASE
SYSTEMS.
A. R. Helm.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14244. 1988.]
111108 AN ENHANCEMENT TO IEEE 802.5 STANDARD FOR HIGH SPEED TOKEN RING
NETWORKS.
D. M. Dias and A. Goyal.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14247. 1988.]
111109 VISUAL RECOGNITION USING CONCURRENT AND LAYERED PARAMETER NETWROKS.
R. M. Bolle et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14249. 1988.]
111110 SYSTOLIC SUPER SUMMATION WITH REDUCED HARDWARE.
P. R. Cappello and W. L. Miranker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14259. 1988.]
111111 SYNTHETIC TRACES FOR TRACE-DRIVEN SIMULATION OF CACHE MEMORY.
D. F. Thiebaut and H. S. Stone.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14268. 1988.]
111112 A LOWER BOUND FOR INTEGER GREATEST COMMON DIVISOR COMPUTATIONS.
Y. Mansour, B. Schieber, and P. Tiwari.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14271. 1988. "A preliminary version of
this paper is to appear in the 'Proceedings of the 29th Annual
Symposium on Foundations of Computer Science, White Plains, New York,
1988.'"]
111113 LOWER BOUNDS FOR COMPUTATIONS WITH THE FLOOR OPERATION.
Y. Mansour, B. Schieber, and P. Tiwari.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14272. 1988.]
111114 SCHEDULING ON PARALLEL UNRELATED MACHINES WITH SET-UPS.
B. L. Dietrich.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14279. 1988.]
111115 OPTIMIZATION OF NESTED QUERIES IN HERMES.
D. Yellin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14283. 1988. "Preliminary version."]
111116 A PROTOCOL CONVERSION TOOLKIT.
J. Auerbach.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14286. 1988.]
111117 MANAGEMENT OF A REMOTE BACKUP COPY FOR DISASTER RECOVERY.
R. P. King et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14291. 1988.]
111118 REPRESENTING AND COMPARING SHAPES USING POLYNOMIALS.
G. Taubin, R. M. Bolle, and D. B. Cooper.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14292. 1988.]
111119 FUNCTION REQUEST SHIPPING IN A DATABASE MACHINE ENVIRONMENT.
G. Hallmark.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6571. 1988.]
111120 ON IMPROVING THE ACCURACY OF THE HOUGH TRANSFORM.
W. Niblack and D. Petkovic.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6577. 1988.]
111121 LIMITS IN TRANSACTION THROUGHPUT - WHY BIG IS BETTER.
B. R. Iyer.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6584. 1988.]
111122 SYSTEM ISSUES IN PARALLEL SORTING FOR DATABASE SYSTEMS.
B. R. Iyer and D. M. Dias.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6585. 1988.]
111123 SOME DESIGN ISSUES OF DISK ARRAYS.
S. Ng.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6590. 1988.]
111124 NON-PARAMETRIC FEATURE SELECTION FOR MULTIPLE CLASS PROCESSES.
W. E. Blanz and B. Dom.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6604. 1988.]
111125 EXTENSIBLE QUERY PROCESSING IN STARBURST.
L. M. Haas et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6610. 1988.]
111126 CONSTRUCTION OF A THIN SET WITH SMALL FOURIER COEFFICIENTS.
M. Ajtai et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6615. 1988.]
111127 SORTING IN O(LOG N) TIME.
M. Ajtai et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6616. 1988.]
111128 HETEROGENEITY AND OSI.
L. Svobodova, P. Janson, and E. Mumprecht.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1783. 1989.]
111129 THE MANY FACES OF HEBREW.
N. Nahshon and R. Rosenschein.
[Kivun Ltd. (Jerusalem, Israel). 1989.]
111130 SEMANTICAL PARADIGMS: NOTES FOR AN INVITED LECTURE.
A. R. Meyer and S. S. Cosmadakis.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-353. 1988. With two appendices by Stavros S.
Cosmadakis. "This technical memorandum is a slightly revised version
of a paper in the 'Proceedings [of the] 3rd IEEE Symposium on Logic
in Computer Science, Edinburgh, Scotland, July, 1988.'"]
111131 THE DATA LINK LAYER: TWO IMPOSSIBILITY RESULTS.
N. A. Lynch, Y. Mansour, and A. Fekete.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-355. 1988.]
111132 PARALLEL SYMMETRY-BREAKING IN SPARSE GRAPHS.
A. V. Goldberg, S. A. Plotkin, and G. E. Shannon.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-356. 1988.]
111133 SUBLINEAR-TIME PARALLEL ALGORITHMS FOR MATCHING AND RELATED PROBLEMS.
A. V. Goldberg, S. A. Plotkin, and P. Vaidya.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-357. 1988.]
111134 COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEM.
A. V. Goldberg, S. A. Plotkin, and E. Tardos.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-358. 1988.]
111135 SIMULATING SYNCHRONOUS PROCESSORS.
J. L. Welch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-359. 1988.]
111136 TRANSACTION COMMIT IN A REALISTIC TIMING MODEL.
B. A. Coan and J. L. Welch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-360. 1988.]
111137 A LATTICE-STRUCTURED PROOF TECHNIQUE APPLIED TO A MINIMUM SPANNING
TREE ALGORITHM.
J. L. Welch, L. Lamport, and N. A. Lynch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-361. 1988.]
111138 A THEORY OF ATOMIC TRANSACTIONS.
N. A. Lynch et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-362. 1988.]
111139 ASSISTING DESIGN GIVEN MULTIPLE PERFORMANCE CRITERIA.
D. C. Fogg.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-363. 1988.]
111140 ON THE CORRECTNESS OF ATOMIC MULTI-WRITER REGISTERS.
R. Schaffer.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-364. 1988. Thesis (B.S.). Edited by Bard Bloom.]
111141 A TRADEOFF BETWEEN INFORMATION AND COMMUNICATION IN BROADCAST
PROTOCOLS.
B. Awerbuch et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-365. 1988.]
111142 A SPACE EFFICIENT GREEDY TRIANGULATION ALGORITHM.
S. A. Goldman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-366. 1988.]
111143 COMMUTATIVITY-BASED CONCURRENCY CONTROL FOR ABSTRACT DATA TYPES.
W. E. Weihl.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-367. 1988.]
111144 HYBRID CONCURRENCY CONTROL FOR ABSTRACT DATA TYPES.
M. P. Herlihy and W. E. Weihl.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-368. 1988.]
111145 MEMORY-BALANCED ROUTING STRATEGIES.
B. Awerbuch et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-369. 1988.]
111146 COMMUTATIVITY-BASED LOCKING FOR NESTED TRANSACTIONS.
A. Fekete et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-370. 1988.]
111147 RETIMING SYNCHRONOUS CIRCUITRY.
C. E. Leiserson and J. B. Saxe.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-372. n.d.]
111148 AN INTRODUCTION TO INPUT/OUTPUT AUTOMATA.
N. A. Lynch and M. R. Tuttle.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-373. 1988. A revision of Laboratory for Computer
Science technical memorandum MIT/LCS/TM-351.]
111149 TIGHT BOUNDS ON MINIMUM BROADCAST NETWORKS.
M. Grigni and D. Peleg.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-374. 1988.]
111150 ON THE EFFECTS OF FEEDBACK IN DYNAMIC NETWORK PROTOCOLS.
B. Awerbuch.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-375. 1988.]
111151 IMPROVED ROUTING STRATEGIES WITH SUCCINCT TABLES.
B. Awerbuch et al.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-376. 1988.]
111152 REASONING ABOUT CONTINUATIONS WITH CONTROL EFFECTS.
P. Jouvelot and D. K. Gifford.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-378. 1988.]
111153 THE ORGANIZATION OF PERMUTATION ARCHITECTURES WITH BUSSED
INTERCONNECTIONS.
J. Kilian, S. Kipnis, and C. E. Leiserson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TM-379. 1989.]
020396 KOLA: KNOWLEDGE ORGANIZATION LANGUAGE.
Y. Jang.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-396. 1988.]
020413 DIVERSITY-BASED INFERENCE OF FINITE AUTOMATA.
R. E. Schapire.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-413. 1988. Thesis (M.S.).]
020417 SEQUENTIAL IMPLEMENTATION OF LENIENT PROGRAMMING LANGUAGES.
K. R. Traub.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-417. 1988. Thesis (Ph.D.). "This report was
originally published as the author's doctoral dissertation. In
addition to typographical corrections throughout, Chapter 8 has been
completely revised. In case of discrepancy between the thesis and
this report, the text of this report should be preferred."]
020418 A DATAFLOW/VON NEUMANN HYBRID ARCHITECTURE.
R. A. Iannucci.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-418. 1988. Thesis (Ph.D.).]
020419 COMPOSING DATA AND PROCESS DESCRIPTIONS IN THE DESIGN OF SOFTWARE
SYSTEMS.
D. Jackson.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-419. 1988. Thesis (M.S.). "This report is a minor
revision of a thesis of the same title submitted to the Department of
Electrical Engineering and Computer Science on May 6th, 1988 in
partial fulfillment of the requirements for the degree of Master of
Science."]
020420 POLYCHANNEL SYSTEMS FOR MASS DIGITAL COMMUNICATION.
D. K. Gifford.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-420. 1988.]
020421 FX-87 PERFORMANCE MEASUREMENTS: DATAFLOW IMPLEMENTATION.
R. T. Hammel and D. K. Gifford.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-421. 1988.]
020423 VIEWSTAMPED REPLICATION FOR HIGHLY AVAILABLE DISTRIBUTED SYSTEMS.
B. M. Oki.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-423. 1988. Thesis (Ph.D.).]
020424 A FAULT-TOLERANT NETWORK KERNEL FOR LINDA.
A. S. Xu.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-424. 1988. Thesis (M.S.). "This report is a minor
revision of a thesis of the same title submitted to the Department of
Electrical Engineering and Computer Science on July 20, 1988 in
partial fulfillment of the requirements for the degree of Master of
Science in Computer Science."]
020425 CODE-MAPPING POLICIES FOR THE TAGGED-TOKEN DATAFLOW ARCHITECTURE.
G. K. Maa.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-425. 1988. Thesis (M.S.).]
020426 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR, CHORDAL, AND INTERVAL
GRAPHS.
P. N. Klein.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-426. 1988. Thesis (Ph.D.).]
020427 FORMULATION OF TRADEOFFS IN PLANNING UNDER UNCERTAINTY.
M. P. Wellman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-427. 1988. Thesis (Ph.D.). "This report is a
modified version of a dissertation submitted to the Department of
Electrical Engineering and Computer Science on July 29, 1988 in
partial fulfillment of the requirements for the degree of Doctor of
Philosophy."]
020428 PARALLEL DNA SEQUENCE ANALYSIS.
A. K. Iyengar.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-428. 1988. Thesis (M.S.). "This report is a
revised version of the author's Master's thesis."]
020429 NETWORK LAYER PROTOCOLS WITH BYZANTINE ROBUSTNESS.
R. Perlman.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-429. 1988. Thesis (Ph.D.).]
020430 GRAPH-THEORETIC TECHNIQUES FOR PARALLEL, DISTRIBUTED, AND SEQUENTIAL
COMPUTATION.
S. A. Plotkin.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-430. 1988. Thesis (Ph.D.).]
020431 DISTRIBUTED COMMIT PROTOCOLS FOR NESTED ATOMIC ACTIONS.
S. E. Perl.
[Massachusetts Institute of Technology. Laboratory for Computer
Science. MIT/LCS/TR-431. 1988. Thesis (M.S.). "This report is a
modified and extended version of a Master's thesis of the same title,
submitted to the Department of Electrical Engineering and Computer
Science on 30 October 1987."]
111154 OPTIMIZING CLOSURE ENVIRONMENT REPRESENTATIONS.
A. W. Appel and T. T. Y. Jim.
[Princeton University. Department of Computer Science. CS-TR-168-88.
1988.]
111155 VECTORIZED GARBAGE COLLECTION.
A. W. Appel and A. Bendiksen.
[Princeton University. Department of Computer Science. CS-TR-169-88.
1988.]
111156 AN IMPLEMENTATION OF RELIABLE BROADCAST USING AN UNRELIABLE MULTICAST
FACILITY.
H. Garcia-Molina and B. Kogan.
[Princeton University. Department of Computer Science. CS-TR-170-88.
1988.]
111157 TRANSITIVE REDUCTION IN PARALLEL VIA BRANCHINGS.
P. Gibbons et al.
[Princeton University. Department of Computer Science. CS-TR-171-88.
1988.]
111158 ON THE SECOND EIGENVALUE AND RANDOM WALKS IN RANDOM D-REGULAR GRAPHS.
J. Friedman.
[Princeton University. Department of Computer Science. CS-TR-172-88.
1988.]
111159 BAKUNIN DATA NETWORKS: AN APPROACH TO DESIGNING HIGHLY AVAILABLE
REPLICATED DATABASES.
B. Kogan.
[Princeton University. Department of Computer Science. CS-TR-173-88.
1988. Thesis (Ph.D).]
111160 A LIBRARY FOR INCREMENTAL UPDATE OF BITMAP IMAGES.
D. Dobkin, E. Koutsofios, and R. Pike.
[Princeton University. Department of Computer Science. CS-TR-174-88.
1988.]
111161 TWO-DIMENSIONAL COMPACTION: COMPUTING THE SHAPE FUNCTION OF A SLICING
LAYOUT.
F.-L. Heng.
[Princeton University. Department of Computer Science. CS-TR-175-88.
1988. Thesis (Ph.D.).]
111162 A CLASS OF RANDOMIZED STRATEGIES FOR LOW-COST COMPARISON OF FILE
COPIES.
D. Barbara and R. J. Lipton.
[Princeton University. Department of Computer Science. CS-TR-176-88.
1988.]
111163 THE DESIGN OF A DOCUMENT DATABASE.
C. Clifton, H. Garcia-Molina, and R. Hagmann.
[Princeton University. Department of Computer Science. CS-TR-177-88.
1988.]
111164 GEOMETRY, GRAPHICS, AND NUMERICAL ANALYSIS.
D. E. Silver.
[Princeton University. Department of Computer Science. CS-TR-178-88.
1988. Thesis (Ph.D).]
111165 FILE ACCESS PATTERNS.
C. Staelin.
[Princeton University. Department of Computer Science. CS-TR-179-88.
1988.]
111166 PRAM: A SCALABLE SHARED MEMORY.
R. J. Lipton and J. S. Sandberg.
[Princeton University. Department of Computer Science. CS-TR-180-88.
1988.]
111167 A DETERMINISTIC VIEW OF RANDOM SAMPLING AND ITS USE IN GEOMETRY.
B. Chazelle and J. Friedman.
[Princeton University. Department of Computer Science. CS-TR-181-88.
1988.]
111168 ALLOCATING WITHOUT LOCKING.
A. W. Appel.
[Princeton University. Department of Computer Science. CS-TR-182-88.
1988.]
111169 CONTINUATION-PASSING, CLOSURE-PASSING STYLE.
A. W. Appel and T. T. Y. Jim.
[Princeton University. Department of Computer Science. CS-TR-183-88.
1988.]
111170 ORDERED AND RELIABLE MULTICAST COMMUNICATION.
H. Garcia-Molina and A. Spauster.
[Princeton University. Department of Computer Science. CS-TR-184-88.
1988.]
111171 ON STRAIGHT SELECTION SORT.
A. C.-C. Yao.
[Princeton University. Department of Computer Science. CS-TR-185-88.
1988.]
111172 A PARALLEL ALGORITHM FOR FINDING A BLOCKING FLOW IN AN ACYCLIC
NETWORK.
A. V. Goldberg and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-186-88.
1988.]
111173 EFFICIENCY OF THE PRIMAL NETWORK SIMPLEX ALGORITHM FOR THE
MINIMAL-COST CIRCULATION PROBLEM.
R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-187-88.
1988.]
111174 FAILURE RECOVERY IN MEMORY-RESIDENT TRANSACTION PROCESSING SYSTEMS.
K. Salem.
[Princeton University. Department of Computer Science. CS-TR-188-88.
1988. Thesis (Ph.D.).]
111175 SIMPLIFIED LINEAR-TIME JORDAN SORTING AND POLYGON CLIPPING.
K. Y. Fung et al.
[Princeton University. Department of Computer Science. CS-TR-189-88.
1988.]
111176 THROUGHPUT OF LONG SELF-TIMED PIPELINES.
M. R. Greenstreet and K. Steiglitz.
[Princeton University. Department of Computer Science. CS-TR-190-88.
1988.]
111177 FAST ALLOCATION AND DEALLOCATION OF MEMORY BASED ON OBJECT LIFETIMES.
D. R. Hanson.
[Princeton University. Department of Computer Science. CS-TR-191-88.
1988.]
111178 APPLIED COMPUTATIONAL GEOMETRY: TOWARDS ROBUST SOLUTIONS OF BASIC
PROBLEMS.
D. Dobkin and D. E. Silver.
[Princeton University. Department of Computer Science. CS-TR-192-88.
1988.]
111179 EFFICIENCY OF THE NETWORK SIMPLEX ALGORITHM FOR THE MAXIMUM FLOW
PROBLEM.
A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan.
[Princeton University. Department of Computer Science. CS-TR-193-88.
1988.]
111180 PROBABLISTIC ANALYSIS OF A CLOSEST PAIR ALGORITHM.
M. Golin.
[Princeton University. Department of Computer Science. CS-TR-194-88.
1988.]
111181 SYSTEM M: A TRANSACTION PROCESSING SYSTEM FOR MEMORY RESIDENT DATA.
H. Garcia-Molina and K. Salem.
[Princeton University. Department of Computer Science. CS-TR-195-88.
1988.]
111182 MAINTENANCE OF GEOMETRIC EXTREMA.
D. Dobkin and S. Suri.
[Princeton University. Department of Computer Science. CS-TR-196-88.
1988.]
111183 PROFILING IN THE PRESENCE OF OPTIMIZATION AND GARBAGE COLLECTION.
A. W. Appel, B. F. Duba, and D. B. MacQueen.
[Princeton University. Department of Computer Science. CS-TR-197-88.
1988.]
111184 MANAGEMENT OF A REMOTE BACKUP COPY FOR DISASTER RECOVERY.
R. P. King et al.
[Princeton University. Department of Computer Science. CS-TR-198-88.
1988.]
111185 AN EXPERIMENTAL COMPARISON OF INITIAL PLACEMENT VS. PROCESS MIGRATION
FOR LOAD BALANCING STRATEGIES.
K. Kyrimis and R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-199-88.
1988.]
111186 DISTRIBUTING WORKLOAD AMONG INDEPENDENTLY OWNED PROCESSORS.
L. L. Cova and R. Alonso.
[Princeton University. Department of Computer Science. CS-TR-200-88.
1988.]
111187 AN EXPERT SYSTEM FOR AUTOMATIC COMPONENT LABELLING IN EVOKED
POTENTIALS.
A. Sehmi.
[Turing Institute. TIRM-88-032. 1988.]
111188 MACHINE REPRESENTATION OF CANCER TREATMENT RESEARCH PROTOCOLS.
N. J. I. Mars.
[Turing Institute. TIRM-89-033. 1989.]
111189 EXEMPLAR-BASED REASONING IN GEOLOGICAL PROSPECT APPRAISAL.
P. Clark.
[Turing Institute. TIRM-89-034. 1989.]
111190 THE HELMHOLTZ INTEGRAL EQUATION FOR A THIN SHELL.
A. G. P. Warham.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 129/88. 1988.]
111191 FEATURE EXTRACTION FOR CURSIVE SCRIPT RECOGNITION.
E. R. Brocklehurst, D. M. Ford, and H. J. Symm.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 130/88. 1988.]
111192 PREPROCESSING FOR CURSIVE SCRIPT RECOGNITION.
E. R. Brocklehurst and P. D. Kenward.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 132/88. 1988.]
111193 POLYNOMIAL FITTING TO NOISY DATA WHERE SUBSETS OF THE DATA ARE
SUBJECT TO UNKNOWN VERTICAL SHIFTS.
H. M. Anthony and P. M. Harris.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 136/88. 1988.]
111194 PROGRAM ANALYSIS OVER ABSTRACT DOMAINS OF INFINITE HEIGHT.
S. K. Debray.
[University of Arizona. Department of Computer Science. TR 88-28.
1988.]
111195 THE DESIGN AND IMPLEMENTATION OF HIGH-LEVEL PROGRAMMING LANGUAGE
FEATURES FOR PATTERN MATCHING IN REAL TIME.
K. Nilsen.
[University of Arizona. Department of Computer Science. TR 88-30.
1988. Thesis (Ph.D.).]
111196 LOGARITHMIC MOMENT BOUNDS FOR EXTREME ORDER STATISTICS.
P. J. Downey and R. S. Maier.
[University of Arizona. Department of Computer Science. TR 88-32.
1988.]
111197 DECLARATIVE EXPRESSION OF DEDUCTIVE DATABASE UPDATES.
S. Manchanda.
[University of Arizona. Department of Computer Science. TR 88-33.
1988.]
111198 A FOUR-RUSSIANS ALGORITHM FOR REGULAR EXPRESSION PATTERN MATCHING.
E. W. Myers.
[University of Arizona. Department of Computer Science. TR 88-34.
1988.]
111199 ANALYSIS OF CONTENTION IN TWO-PHASE LOCKING PROTOCOLS.
J. L. Bruno and P. J. Downey.
[University of Arizona. Department of Computer Science. TR 88-35.
1988.]
111200 INTEGRATING EMERALD INTO A SYSTEM FOR MIXED-LANGUAGE PROGRAMMING.
R. Hayes, N. C. Hutchinson, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 88-36.
1988.]
111201 THE MEAN RESEQUENCING DELAY FOR M/H SUBSCRIPT K/INFINITY SYSTEMS.
S. Chowdhury.
[University of Arizona. Department of Computer Science. TR 88-37.
1988.]
111202 THE COMPLEXITY OF CONTROLLED SELECTION.
K. Pruhs and U. Manber.
[University of Arizona. Department of Computer Science. TR 88-38.
1988.]
111203 ALGORITHMS FOR GENERALIZED MATCHING.
S. Wu and U. Manber.
[University of Arizona. Department of Computer Science. TR 88-39.
1988.]
111204 A TEMPORAL LOGIC FOR PROVING REAL-TIME PROPERTIES OF DISTRIBUTED
PROGRAMS.
K. J. Hay, S. Manchanda, and R. D. Schlichting.
[University of Arizona. Department of Computer Science. TR 88-40.
1988.]
111205 FORMALIZING AN INTEGRATED CIRCUIT DESIGN STYLE IN HIGHER ORDER LOGIC.
I. S. Dhingra.
[University of Cambridge. Computer Laboratory. Technical report 151.
1988. Thesis (Ph.D.).]
111206 MOTION DEVELOPMENT FOR COMPUTER ANIMATION.
A. M. Pullen.
[University of Cambridge. Computer Laboratory. Technical report 152.
1988. Thesis (Ph.D.).]
111207 EFFICIENT DATA SHARING.
M. Burrows.
[University of Cambridge. Computer Laboratory. Technical report 153.
1988. Thesis (Ph.D.).]
111208 A NATURAL LANGUAGE INTERFACE TO AN INTELLIGENT PLANNING SYSTEM.
I. B. Crabtree et al.
[University of Cambridge. Computer Laboratory. Technical report 154.
1989.]
111209 COMPUTATIONAL MORPHOLOGY OF ENGLISH.
S. G. Pulman et al.
[University of Cambridge. Computer Laboratory. Technical report 155.
1989.]
111210 EVENTS AND VP MODIFIERS.
S. G. Pulman.
[University of Cambridge. Computer Laboratory. Technical report 156.
1989.]
111211 TWO PAPERS OF TEMPORALITY IN CHILDREN'S NARRATIVES.
D. I. Slobin and A. Bocaz.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 55.
1989.]
111211 LEARNING TO TALK ABOUT MOVEMENT THROUGH TIME AND SPACE: THE
DEVELOPMENT OF NARRATIVE ABILITIES IN SPANISH AND ENGLISH.
D. I. Slobin and A. Bocaz.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 55.
1988. One of "Two papers on Temporality in Children's Narratives,"
published together as Berkeley cognitive science report no. 55.]
111211 THE DEVELOPMENT OF CLAUSE CHAINING IN TURKISH CHILD LANGUAGE.
D. I. Slobin.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 55.
1988. One of "Two Papers on Temporality in Children's Narratives,"
published together as Berkeley cognitive science report no. 55.]
111212 A DESIGN PARADIGM FOR MULTI-VERSION SOFTWARE.
M. R.-T. Lyu.
[University of California, Los Angeles. Computer Science Department.
CSD-880076. 1988. Thesis (Ph.D.).]
111213 THE PRECONDITIONED GRADIENT METHOD ON THE CONNECTION MACHINE.
C. Tong.
[University of California, Los Angeles. Computer Science Department.
CSD-880077. n.d.]
111214 DIVERSITY IN N-VERSION SOFTWARE: AN ANALYSIS OF SIX PROGRAMS.
W. Schuetz.
[University of California, Los Angeles. Computer Science Department.
CSD-880078. n.d. Thesis (M.S.).]
111215 PX REFERENCE MANUAL, VERSION 0.2.
T. Kim.
[University of California, Los Angeles. Computer Science Department.
CSD-880079. 1988.]
111216 ASPEN: A STREAM PROCESSING ENVIRONMENT.
B. K. Livezey and R. R. Muntz.
[University of California, Los Angeles. Computer Science Department.
CSD-880080. 1988.]
111217 BINARY COUNTER WITH COUNTING PERIOD OF ONE HALF ADDER INDEPENDENT OF
COUNTER SIZE.
M. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880081. 1988.]
111218 DYNAMIC SHARING OF PROCESSORS IN PARALLEL PROCESSING SYSTEMS: A
PERFORMANCE EVALUATION.
J.-H. Huang and L. Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-880082. 1988.]
111219 ON PARALLEL PROCESSING SYSTEMS: AMDAHL'S LAW GENERALIZED AND SOME
RESULTS ON OPTIMAL DESIGN.
L. Kleinrock and J.-H. Huang.
[University of California, Los Angeles. Computer Science Department.
CSD-880083. 1988.]
111220 PERFORMANCE EVALUATION OF DISTRIBUTED COMPUTER-COMMUNICATION SYSTEMS.
L. Kleinrock.
[University of California, Los Angeles. Computer Science Department.
CSD-880084. 1988.]
111221 ON THE BEHAVIOR OF ALGORITHMS IN A MULTIPROCESSING ENVIRONMENT.
J.-H. Huang.
[University of California, Los Angeles. Computer Science Department.
CSD-880085. 1988. Thesis (Ph.D.).]
111222 PARTIAL ORDER PROGRAMMING.
D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-880086. 1988. "Extended abstract."]
111223 LOAD BALANCING ALGORITHMS IN A DISTRIBUTED PROCESSING ENVIRONMENT.
J. J. Green.
[University of California, Los Angeles. Computer Science Department.
CSD-880087. 1988. Thesis (Ph.D.).]
111224 IMPLEMENTING A CONNECTIONIST PRODUCTION SYSTEM USING TENSOR PRODUCTS.
C. P. Dolan and P. Smolensky.
[University of California, Los Angeles. Computer Science Department.
CSD-880088. 1988.]
111225 SYNCHRONIZATION OF ASNYCHRONOUS PROCESSES IN CSP.
R. Bagrodia.
[University of California, Los Angeles. Computer Science Department.
CSD-880089. 1988. April 1987. Revised: August 1988.]
111226 A PERFORMANCE-ORIENTED APPROACH TO THE DESIGN OF DISTRIBUTED SYSTEMS.
R. Bagrodia.
[University of California, Los Angeles. Computer Science Department.
CSD-880090. 1988.]
111227 PERFORMANCE EVALUATION AND PREDICTION FOR LARGE HETEROGENEOUS
DISTRIBUTED SYSTEMS.
J. Betser.
[University of California, Los Angeles. Computer Science Department.
CSD-880091. 1988. Thesis (Ph.D.).]
111228 OPTIMIZING BY NON-DETERMINISTIC, LAZY REWRITING.
S. Narain.
[University of California, Los Angeles. Computer Science Department.
CSD-880092. 1988.]
111229 CONSTRAINT-DIRECTED APPROACH TO DIAGNOSIS.
R. Dechter and J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880093. 1988. Also issued as R-72-I, Cognitive Systems
Laboratory, Computer Science Department, University of California,
Los Angeles.]
111230 ON PROBABILITY INTERVALS.
J. Pearl.
[University of California, Los Angeles. Computer Science Department.
CSD-880094. 1988. Also issued as R-105, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
111231 MEMBERSHIP ALGORITHM FOR MARGINAL INDEPENDENCE.
A. Paz.
[University of California, Los Angeles. Computer Science Department.
CSD-880095. 1988. Also issued as R-117, Cognitive Systems Laboratory,
Computer Science Department, University of California, Los Angeles.]
111232 CLOSURE ALGORITHMS AND DECISION PROBLEMS FOR GRAPHOIDS GENERATED BY
TWO UNDIRECTED GRAPHS.
A. Paz and R. Schulhoff.
[University of California, Los Angeles. Computer Science Department.
CSD-880096. 1988. "Abridged version." "The results shown in this
report are part of the MSC Thesis of the second author [Robert
Schulhoff] done under the supervision of the first author [Azaria
Paz] - to be presented to [the] Graduate School of the TECHNION,
Israel Institute of Technology." Also issued as R-118, Cognitive
Systems Laboratory, Computer Science Department, University of
California, Los Angeles.]
111233 FUNCTIONAL LOGIC GRAMMAR: A NEW SCHEME FOR LANGUAGE ANALYSIS.
H. L. Chau and D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-880097. 1988.]
111234 SUPPORT FOR HIGH-PRIORITY TRAFFIC IN VLSI COMMUNICATION SWITCHES.
Y. Tamir and G. L. Frazier.
[University of California, Los Angeles. Computer Science Department.
CSD-880098. 1988.]
111235 FAULT-TOLERANCE FOR HIGH PERFORMANCE MULTI-MODULE VLSI SYSTEMS USING
MICRO ROLLBACK.
M. Tremblay and Y. Tamir.
[University of California, Los Angeles. Computer Science Department.
CSD-880099. 1988.]
111236 A STUDY OF THE APPLICATION OF FORMAL SPECIFICATION METHODS FOR
FAULT-TOLERANT SOFTWARE.
A. T.-A. Tai.
[University of California, Los Angeles. Computer Science Department.
CSD-880100. 1988. Thesis (M.S.).]
111237 MULTISTAGE NETWORKS WITH TRAFFIC WITH REAL-TIME CONSTRAINTS.
L. Kurisaki and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-880101. 1988.]
111238 THE ASPEN DISTRIBUTED STREAM PROCESSING ENVIRONMENT.
B. K. Livezey.
[University of California, Los Angeles. Computer Science Department.
CSD-880102. 1988. Thesis (M.S.).]
111239 ENCODING INPUT/OUTPUT REPRESENTATIONS IN CONNECTIONIST COGNITIVE
SYSTEMS.
R. Miikkulainen and M. G. Dyer.
[University of California, Los Angeles. Computer Science Department.
CSD-880103. 1988. Also issued as UCLA-AI-88-16, Artificial
Intelligence Laboratory, University of California, Los Angeles.]
111240 MODELS OF SELF-DESCRIPTIVE SET THEORIES.
M. Forti and F. Honsell.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-47. 1988. Also
issued as CSR-259-88, Department of Computer Science, University of
Edinburgh.]
111241 FOUNDATIONS AND PROOF THEORY OF 3-VALUED LOGICS.
A. Arvon.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-48. 1988. Also
issued as CSR-260-88, Department of Computer Science, University of
Edinburgh.]
111242 TEMPORAL ORDERING FOR CONCURRENCY.
C. M. N. Tofts.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-49. 1988. Also
issued as CSR-261-88, Department of Computer Science, University of
Edinburgh.]
111243 XHDL: A DEVELOPMENT OF CIRCAL, ITS GRAPHICAL REPRESENTATION AND
SIMULATION.
S. Zhu.
[University of Edinburgh. Department of Computer Science. CSR-263-88.
1988.]
111244 ON FUNCTORS EXPRESSIBLE IN THE POLYMORPHIC TYPED LAMBDA CALCULUS.
J. C. Reynolds and G. D. Plotkin.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-53. 1988. Also
issued as CSR-265-88, Department of Computer Science, University of
Edinburgh.]
111245 UNIFYING EXCEPTIONS WITH CONSTRUCTORS IN STANDARD ML.
A. Appel et al.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-55. 1988. Also
issued as CSR-266-88, Department of Computer Science, University of
Edinburgh.]
111246 AN ATTEMPT AT TRANSLATING VHDL INTO CIRCAL.
S. Zhu and D. Rees.
[University of Edinburgh. Department of Computer Science. CSR-267-88.
1988.]
111247 A SURVEY OF FORMAL SOFTWARE DEVELOPMENT METHODS.
D. Sannella.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-56. 1988. Also
issued as CSR-268-88, Department of Computer Science, University of
Edinburgh.]
111248 A HIGHER-ORDER CALCULUS AND THEORY ABSTRACTION.
Z. Luo.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-57. 1988. Also
issued as CSR-269-88, Department of Computer Science, University of
Edinburgh.]
111249 CC SUPERSCRIPT INFINITY SUBSCRIPT INCLUSION AND ITS META THEORY.
Z. Luo.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-58. 1988. Also
issued as CSR-270-88, Department of Computer Science, University of
Edinburgh.]
111250 CONSTRUCTING TYPE SYSTEMS OVER AN OPERATIONAL SEMANTICS.
R. Harper.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-59. 1988. Also
issued as CSR-271-88, Department of Computer Science, University of
Edinburgh.]
111251 SOME FUNDAMENTAL ALGEBRAIC TOOLS FOR THE SEMANTICS OF COMPUTATION.
A. Tarlecki, R. M. Burstall, and J. A. Goguen.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-60. 1988. Also
issued as CSR-272-88, Department of Computer Science, University of
Edinburgh.]
111252 THE INTERACTIVE PROOF EDITOR: AN EXPERIMENT IN INTERACTIVE THEOREM
[PROVING].
B. Ritchie and P. Taylor.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-61. 1988. Also
issued as CSR-273-88, Department of Computer Science, University of
Edinburgh.]
111253 APPROXIMATING THE PERMANENT.
M. Jerrum and A. Sinclair.
[University of Edinburgh. Department of Computer Science. CSR-275-88.
1988.]
111254 EDINBURGH UNIVERSITY POSTGRADUATE EXAMINATION QUESTIONS IN
COMPUTATION THEORY, 1978-1988.
D. Sannella.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-64. 1988. Edited by
Donald Sannella. Also issued as CSR-276-88, Department of Computer
Science, University of Edinburgh.]
111255 AN EXPERIMENTER TOOL FOR AN INTEGRATED MODELLING SUPPORT ENVIRONMENT
- ITS ROLE AND DESIGN.
R. Pooley.
[University of Edinburgh. Department of Computer Science. CSR-277-88.
1988.]
111256 CO-INDUCTION IN RELATIONAL SEMANTICS.
R. Milner and M. Tofte.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-65. 1988. Also
issued as CSR-278-88, Department of Computer Science, University of
Edinburgh.]
111257 COMPUTATIONAL LAMBDA-CALCULUS AND MONADS.
E. Moggi.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-66. 1988. Also
issued as CSR-279-88, Department of Computer Science, University of
Edinburgh.]
111258 AN EQUATIONAL FORMULATION OF LF.
R. Harper.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-67. 1988. Also
issued as CSR-280-88, Department of Computer Science, University of
Edinburgh.]
111259 FAST UNIFORM GENERATION OF REGULAR GRAPHS.
M. Jerrum and A. Sinclair.
[University of Edinburgh. Department of Computer Science. CSR-281-88.
1988.]
111260 A NATURAL DEDUCTION TREATMENT OF OPERATIONAL SEMANTICS.
R. M. Burstall and F. Honsell.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-69. 1988. Also
issued as CSR-282-88, Department of Computer Science, University of
Edinburgh.]
111261 SCHEDULING TASKS WITH READY TIMES AND DEADLINES TO MINIMIZE AVERAGE
ERROR.
W.-K. Shih et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1478. 1989.]
111262 IMPLEMENTATION AND PERFORMANCE OF A PARALLEL PROLOG INTERPRETER.
W. Shu, L. V. Kale, and B. Ramkumar.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1480. 1988.]
111263 OBTAINING FIRST SOLUTION FASTER IN PARALLEL PROBLEM SOLVING.
L. V. Kale and V. Saletore.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1481. 1988.]
111264 THE CHARE-KERNEL BASE LANGUAGE: PROGRAMMING EXAMPLES AND PERFORMANCE
ON MULTI-PROCESSORS.
L. V. Kale and W. Shu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1482. 1988.]
111265 PRECONDITIONED ITERATIVE METHODS FOR INDEFINITE SYMMETRIC TOEPLITZ
SYSTEMS.
P. Concus and P. Saylor.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1483. 1989.]
111266 A STRATEGY FOR INSURANCE.
D. K. Selig.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1484. 1989. Thesis (M.S.).]
111267 INCREMENTAL ONLINE NETLIST COMPILATION OF HIERARCHICAL SCHEMATICS.
L. G. Jones.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1487. 1989.]
111268 PROCESS MIGRATION IN DISTRIBUTED SYSTEMS.
C. Lu.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1488. 1989. Thesis (Ph.D.).]
111269 ROSE - A RELIABLE OPERATING SYSTEM ENVIRONMENT.
T. P. Ng.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1489. 1989.]
111270 A STUDY OF THE MANUFACTURING AUTOMATION AND TECHNICAL OFFICE
PROTOCOLS.
D. C. H. Sng.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1490. 1989.]
111271 FAULT-TOLERANT BIBD NETWORKS.
B. E. Aupperle and J. F. Meyer.
[University of Michigan. Computing Research Laboratory. CRL-TR-14-87.
1987.]
111272 ANALYSIS OF WORKLOAD INFLUENCE ON DEPENDABILITY.
J. F. Meyer and L. Wei.
[University of Michigan. Computing Research Laboratory. CRL-TR-15-87.
1987.]
111273 ON MATIJASEVITCH'S NONTRADITIONAL APPROACH TO SEARCH PROBLEMS.
A. Blass and Y. Gurevich.
[University of Michigan. Computing Research Laboratory. CRL-TR-02-88.
1988.]
111274 AN ON-CHIP DOUBLE-BIT ERROR-CORRECTING CODE FOR THREE-DIMENSIONAL
DYNAMIC RANDOM-ACCESS MEMORY.
P. Mazumder.
[University of Michigan. Computing Research Laboratory. CRL-TR-05-88.
1988.]
111275 VLSI CELL PLACEMENT TECHNIQUES.
K. Shahookar and P. Mazumder.
[University of Michigan. Computing Research Laboratory. CRL-TR-07-88.
1988.]
111276 AN INTELLIGENT SEARCH METHOD FOR QUERY OPTIMIZATION BY SEMIJOINS.
H. Yoo and S. Lafortune.
[University of Michigan. Computing Research Laboratory. CRL-TR-10-88.
1988.]
111277 DYNAMIC COMMUNICATION LINKS.
C. M. Holt.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 269. 1988.]
111278 ADEQUACY-PRESERVING TRANSFORMATICS OF COSY PATH PROGRAMS.
M. Koutny.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 270. 1988.]
111279 AN ADVANCED VLSI SECURITY DEVICE EMPLOYING DATA VERIFICATION FEATURES.
V. I. Iliev et al.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 271. 1988.]
111280 REPORT OF THE 11TH IRIS: THE 11TH INFORMATION SYSTEMS RESEARCH
SEMINAR IN SCANDINAVIA (AUGUST 10-12, 1988, ROROS, NORWAY).
J. Kaasboll.
[University of Oslo. Institute for Informatics. Research report 116.
1988. 2 volumes. Edited by Jens Kaasboll.]
111281 A DENOTATIONAL SEMANTICS FOR SIMULA.
C.-E. Ore.
[University of Oslo. Institute for Informatics. Research report 121.
1988. Thesis (Cand.Real.). "This report was originally written in
1984 as a thesis for the Cand. Real. degree at the University of
Oslo. The present report is a corrected and translated version of
that thesis."]
111282 A META-INFORMATION APPROACH TO RELATIONAL DATABASE REPRESENTATION AND
MANIPULATION BASED ON PROLOG.
T. Niemi and K. Jaervelin.
[University of Tampere. Department of Computer Science. A-1988-11.
1988.]
111283 ON IMPLEMENTING TWO ADAPTIVE DATA COMPRESSION SCHEMES.
E. Maekinen.
[University of Tampere. Department of Computer Science. A-1989-1.
n.d.]
111284 DATA TRANSFER SCHEDULING.
K. K. Somalwar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-31. 1988. Thesis (M.A.).]
111285 EVALUATION OF LOGICAL EXTERNAL MEMORY ARCHITECTURES FOR
MULTIPROCESSOR SYSTEMS.
S. Sivaramakrishnan.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-32. 1988. Thesis (M.S.).]
111286 EFFICIENT COMPUTING OF LEAST FIXPOINTS.
K. R. Apt.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-33. 1988.]
111287 STORAGE SCHEMES FOR PARALLEL EIGENVALUE ALGORITHMS.
R. A. van de Geijn.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-34. 1988.]
111288 A COMPARISON OF LED-FROM AND LEADS-TO.
E. Knapp.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-35. 1988.]
111289 CONSTRUCTION OF FILE MANAGEMENT SYSTEMS FROM SOFTWARE COMPONENTS.
D. S. Batory et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-36. 1988.]
111290 TOWARDS SYSTOLIZING COMPILATION: AN OVERVIEW.
C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-37. 1988.]
111291 HOPFIELD NETS - MORE FORMALLY.
N. Soparkar.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-38. 1988.]
111292 CONVERGENCE/RESPONSE TRADEOFFS IN CONCURRENT SYSTEMS.
M. G. Gouda and M. Evangelist.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-39. 1988.]
111293 HIGH-LEVEL SYNTHESIS OF PIPELINED ARCHITECTURES FOR MULTI-RATE
ALGORITHMS.
S. R. Deshpande.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-40. 1988.]
111294 DELIVERY AND DISCRIMINATION: THE SEINE PROTOCOL.
M. G. Gouda et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-41. 1988.]
111295 SUCCESSIVE APPROXIMATION IN PARALLEL GRAPH ALGORITHMS.
D. Fussell and R. Thurimella.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-42. 1988.]
111296 SFL: A PARALLEL SIMULATION PROGRAM FOR BANYAN NETWORKS.
D. W. Kim, G. J. Lipovski, and R. Jenevein.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-43. 1988.]
111297 TELOS: A KNOWLEDGE REPRESENTATION LANGUAGE FOR REQUIREMENTS MODELLING.
M. Koubarakis et al.
[University of Toronto. Department of Computer Science. KRR-TR-89-1.
1989.]
111298 A FRAMEWORK FOR BROWSING IN THE RELATIONAL DATA MODEL.
M. I. Tuori.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-202. 1988. Thesis (Ph.D.).]
111299 THE TURING PLUS REPORT.
R. C. Holt and J. R. Cordy.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-214. 1988. March 1985. Last revised: August
1988.]
111300 THE REALIZATION OF NATURAL LANGUAGE WITH PRAGMATIC EFFECTS.
M. Watt.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-215. 1988. Thesis (M.S.).]
111301 CONCURRENT SEMANTIC ANALYSIS.
V. Seshadri.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-216. 1988. Thesis (Master of Applied Science).]
111302 GENERATING LEXICAL OPTIONS BY MATCHING IN A KNOWLEDGE BASE.
M. A. Miezitis.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-217. 1988. Thesis (M.S.).]
111303 INTELLIGENT DIAGNOSIS OF UNGRAMMATICALITY IN COMPUTER-ASSISTED
LANGUAGE INSTRUCTION.
M. E. Catt.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-218. 1988. Thesis (M.S.).]
111304 DEFINITIVE PROGRAMMING FOR PARALLELISM.
M. Beynon.
[University of Warwick. Department of Computer Science. RR132. 1988.
"Draft paper."]
111305 EVALUATING DEFINITIVE PRINCIPLES FOR INTERACTION IN GRAPHICS.
M. Beynon.
[University of Warwick. Department of Computer Science. RR133. 1988.]
111306 RECRUITMENT AND PERFORMANCE OF FEMALE AND MALE STUDENTS IN SCIENCE.
J. Dain.
[University of Warwick. Department of Computer Science. RR134. 1988.]
111307 OPTIMALLY EDGE-COLOURING OUTERPLANAR GRAPHS IS IN NC.
A. Gibbons and W. Rytter.
[University of Warwick. Department of Computer Science. RR135. 1989.]
111308 ESSENTIAL AND EPHEMERAL KNOWLEDGE: THE CULTURE AND EDUCATION OF
COMPUTER SPECIALISTS.
D. Park.
[University of Warwick. Department of Computer Science. RR137. 1983.
"Text of an Inaugural Lecture, given at Warwick University, on 28
November 1983."]
VOL. 11, NO. 4 05/10/89
111316 ORACLES FOR STRUCTURAL PROPERTIES: THE ISOMORPHISM PROBLEM AND
PUBLIC-KEY CRYPTOGRAPHY.
S. Homer and A. Selman.
[Boston University. Department of Computer Science. Technical report
88-011. 1988. "Extended abstract."]
111317 FINITELY TYPED FUNCTIONAL PROGRAMS. PART II: COMPARISONS TO
IMPERATIVE LANGUAGES.
A. J. Kfoury and P. Urzyczyn.
[Boston University. Department of Computer Science. Technical report
88-012. 1988.]
111318 SOME OPEN PROBLEMS IN THE THEORY OF PROGRAM SCHEMES AND DYNAMIC
LOGICS.
A. J. Kfoury, A. P. Stolboushkin, and P. Urzyczyn.
[Boston University. Department of Computer Science. Technical report
88-013. 1988.]
111319 MASSIVELY PARALLEL RETROGRADE ENDGAME ANALYSIS.
L. Stiller.
[Boston University. Department of Computer Science. Technical report
88-014. 1988.]
111320 ENSEMBLE AVERAGING: A NEW APPROXIMATION TECHNIQUE IN THE PERFORMANCE
ANALYSIS OF LARGE-SCALE SYSTEMS.
E. Pinsky.
[Boston University. Department of Computer Science. Technical report
88-016. 1988.]
111321 METALISP: A REPRESENTATION INDEPENDENT DIALECT OF LISP WITH REDUCTION
SEMANTICS.
R. Muller.
[Boston University. Department of Computer Science. Technical report
88-017. 1989. "Extended abstract." 1988. Revised version: February
13, 1989.]
111322 PROOFS IN THREE ENVELOPS.
L. Levin.
[Boston University. Department of Computer Science. Technical report
88-018. 1988.]
111323 SOLVING TIME-DEPENDENT PLANNING PROBLEMS.
M. Boddy and T. Dean.
[Brown University. Computer Science Department. Technical report
CS-89-03. 1989.]
111324 A MODEL FOR REASONING ABOUT PERSISTENCE AND CAUSATION.
T. Dean and K. Kanazawa.
[Brown University. Computer Science Department. Technical report
CS-89-04. 1989.]
111325 REPRESENTING VISUAL PROGRAMS WITH OBJECT-GRAPHS.
E. J. Golin and S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-89-05. 1989. "Extended abstract."]
111326 PARSING IN A VISUAL LANGUAGE ENVIRONMENT.
E. J. Golin and S. P. Reiss.
[Brown University. Computer Science Department. Technical report
CS-89-06. 1989. "Extended abstract." Preliminary version: February
1989.]
111327 SIMULATING SWITCH-LEVEL NETWORKS WITH UNCERTAIN TRANSISTOR STRENGTHS.
C. L. Harkness and D. P. Lopresti.
[Brown University. Computer Science Department. Technical report
CS-89-07. 1989.]
111328 AN ARCHITECTURE FOR PROGRAMMABLE SYSTOLIC ARRAYS.
R. Hughey and D. P. Lopresti.
[Brown University. Computer Science Department. Technical report
CS-89-08. 1989. "This paper is a slightly modified version of ...
[Richard Hughey's] ...thesis proposal."]
111329 ALGORITHMS FOR DRAWING GRAPHS: AN ANNOTATED BIBLIOGRAPHY.
R. Tamassia and P. Eades.
[Brown University. Computer Science Department. Technical report
CS-89-09. 1989. Revised version: February 1989.]
111330 REPRESENTATIONS OF GRAPHS ON A CYLINDER.
R. Tamassia and I. G. Tollis.
[Brown University. Computer Science Department. Technical report
CS-89-10. 1989.]
111331 AN EFFICIENT ALGORITHM FOR INCREMENTAL DATA-FLOW ANALYSIS.
F. K. Zadeck.
[Brown University. Computer Science Department. Technical report
CS-89-11. 1989. "A preliminary version of this paper, 'Incremental
Data Flow Analysis in a Structured Program Editor,' appeared in [the]
'Proc. [of the] SIGPLAN '84 Symposium on Compiler Construction.'"]
111332 MOTIVATED ACTION THEORY: A FORMAL THEORY OF CAUSAL REASONING.
L. A. Stein and L. Morgenstern.
[Brown University. Computer Science Department. Technical report
CS-89-12. 1989. "A shorter version of this paper appears in 'AAAI 88'
as 'Why Things Go Wrong: a Formal Theory of Causal Reasoning.'"]
111333 INVESTIGATIONS OF MODEL-PREFERENCE DEFAULTS.
M. Boddy et al.
[Brown University. Computer Science Department. Technical report
CS-89-13. 1989.]
111334 SKEPTICAL INHERITANCE: COMPUTING THE INTERSECTION OF CREDULOUS
EXTENSIONS.
L. A. Stein.
[Brown University. Computer Science Department. Technical report
CS-89-14. 1988.]
111335 TOWARDS A UNIFIED METHOD OF SHARING IN OBJECT-ORIENTED PROGRAMMING.
L. A. Stein.
[Brown University. Computer Science Department. Technical report
CS-89-15. 1989.]
111336 CLASSIFYING AND DETECTING PLAN-BASED MISCONCEPTIONS.
R. J. Calistri.
[Brown University. Computer Science Department. Technical report
CS-89-16. 1989.]
111337 IMPLEMENTING A LEARNING SYSTEM FOR SUBSUMPTION ARCHITECTURES.
J. Shewchuk and P. Viola.
[Brown University. Computer Science Department. Technical report
CS-89-17. 1989.]
111338 I/O OVERHEAD AND PARALLEL VLSI ARCHITECTURES FOR LATTICE COMPUTATIONS.
M. H. Nodine, D. P. Lopresti, and J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-89-18. 1989.]
111339 A QUERY ALGEBRA FOR OBJECT-ORIENTED DATABASES.
G. M. Shaw and S. B. Zdonik.
[Brown University. Computer Science Department. Technical report
CS-89-19. 1989.]
111340 OPTIMAL PARALLEL ALGORITHMS FOR TRANSITIVE CLOSURE AND POINT LOCATION
IN PLANAR STRUCTURES.
R. Tamassia and J. S. Vitter.
[Brown University. Computer Science Department. Technical report
CS-89-20. 1989. Preliminary version: March 1989.]
111341 A TIME-DELAY NEURAL NETWORK ARCHITECTURE FOR SPEECH RECOGNITION.
K. J. Lang and G. E. Hinton.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-152. 1988.]
111342 SCHEDULER 1-2-3: AN INTERACTIVE SCHEDULABILITY ANALYZER FOR REAL-TIME
SYSTEMS.
H. Tokuda and M. Kotera.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-178. 1988.]
111343 A REAL-TIME MONITOR FOR A DISTRIBUTED REAL-TIME OPERATING SYSTEM.
H. Tokuda, M. Kotera, and C. W. Mercer.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-179. 1988.]
111344 A REAL-TIME TOOLSET FOR THE ARTS KERNEL.
H. Tokuda and M. Kotera.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-180. 1988.]
111345 CONSTRAINING PICTURES WITH PICTURES.
A. Heydon et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-185. 1988.]
111346 TRANSFORMGEN: AUTOMATING THE MAINTENANCE OF STRUCTURE-ORIENTED
ENVIRONMENTS.
B. Staudt, C. Krueger, and D. Garlan.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-186. 1988.]
111347 DETERMINING LINEAR SHAPE CHANGE: TOWARD AUTOMATIC GENERATION OF
OBJECT RECOGNITION PROGRAMS.
K. Ikeuchi and K. S. Hong.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-188. 1988.]
111348 ELIMINATING EXPENSIVE CHUNKS.
M. Tambe and P. Rosenbloom.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-189. 1988.]
111349 DESIGN VERIFICATION OF SEQUENTIAL MACHINES BASED ON A MODEL CHECKING
ALGORITHM OF EPSILON-FREE REGULAR TEMPORAL LOGIC.
H. Hiraishi.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-195. 1988.]
111350 COMPETITIVE PAGING ALGORITHMS.
A. Fiat et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-196. 1988.]
111351 COMPETITIVE ALGORITHMS FOR SERVER PROBLEMS.
M. S. Manasse, L. A. McGeoch, and D. D. Sleator.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-197. 1988.]
111352 LOCATING CORNERS IN NOISY CURVES BY DELINEATING IMPERFECT SEQUENCES.
Z. Aviad.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-199. 1988.]
111353 METHODS FOR EXPLOITING THE RELATIONSHIP BETWEEN BUILDINGS AND THEIR
SHADOWS IN AERIAL IMAGERY.
R. B. Irvin and D. M. McKeown.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-200. 1988.]
111354 TRANSLATION LOOKASIDE BUFFER CONSISTENCY: A SOFTWARE APPROACH.
D. L. Black et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-201. 1988.]
111355 A TASTE OF CATEGORY THEORY FOR COMPUTER SCIENTISTS.
B. C. Pierce.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-203. 1988.]
111356 MEDIAN SEPARATORS IN D DIMENSIONS.
J. Sipelstein, S. W. Smith, and J. D. Tygar.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-206. 1988.]
111357 SPECIFYING AVALON OBJECTS IN LARCH.
J. M. Wing.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-208. 1988.]
111358 THE AVALON/C++ PROGRAMMING LANGUAGE (VERSION 0).
J. M. Wing et al.
[Carnegie-Mellon University. Department of Computer Science.
CMU-CS-88-209. 1988.]
111359 BOUNDED TIME-STAMPS.
A. Israeli and M. Li.
[Harvard University. Center for Research in Computing Technology.
TR-01-88. 1988.]
111360 TWO DECADES OF APPLIED KOLMOGOROV COMPLEXITY.
M. Li and P. M. B. Vitanyi.
[Harvard University. Center for Research in Computing Technology.
TR-02-88. 1988.]
111361 HYBRID BEAM-RAY TRACING.
J. Marks, R. J. Walsh, and M. Friedell.
[Harvard University. Center for Research in Computing Technology.
TR-03-88. 1988.]
111362 UNSAFE OPERATIONS IN B-TREES.
B. Zhang and M. Hsu.
[Harvard University. Center for Research in Computing Technology.
TR-04-88. 1988.]
111363 THE MEAN VALUE APPROACH TO PERFORMANCE EVALUATION OF CAUTIOUS WAITING.
M. Hsu and B. Zhang.
[Harvard University. Center for Research in Computing Technology.
TR-05-88. 1988.]
111364 AN ARCHITECTURE-INDEPENDENT MODEL FOR PARALLEL PROGRAMMING.
G. W. Sabot.
[Harvard University. Center for Research in Computing Technology.
TR-06-88. 1988. Thesis (Ph.D.).]
111365 MANAGING DATABASES IN DISTRIBUTED VIRTUAL MEMORY.
M. Hsu and V.-O. Tam.
[Harvard University. Center for Research in Computing Technology.
TR-07-88. 1988.]
111366 MODELING PERFORMANCE IMPACT OF HOT SPOTS.
M. Hsu and B. Zhang.
[Harvard University. Center for Research in Computing Technology.
TR-08-88. 1988.]
111367 ANALYTICAL PREPROCESSING FOR LIKELIHOOD RATIO METHODS.
B. Zhang.
[Harvard University. Center for Research in Computing Technology.
TR-09-88. 1988.]
111368 EXEMPLAR-BASED LEARNING: THEORY AND IMPLEMENTATION.
S. Salzberg.
[Harvard University. Center for Research in Computing Technology.
TR-10-88. 1988.]
111369 AN ALGORITHM FOR SELF DIAGNOSIS IN DISTRIBUTED SYSTEMS.
A. A. Bestavros.
[Harvard University. Center for Research in Computing Technology.
TR-11-88. 1988.]
111370 ON COUPLING AND THE APPROXIMATION OF THE PERMANENT.
M. Mihail.
[Harvard University. Center for Research in Computing Technology.
TR-12-88. 1988.]
111371 DISTRIBUTED NON-CRPYTOGRAPHIC OBLIVIOUS TRANSFER WITH CONSTANT ROUNDS
SECRET FUNCTION EVALUATION.
D. Beaver.
[Harvard University. Center for Research in Computing Technology.
TR-13-88. 1988.]
111372 LEARNING BOOLEAN FORMULAE OR FINITE AUTOMATA IS AS HARD AS FACTORING.
M. Kearns and L. G. Valiant.
[Harvard University. Center for Research in Computing Technology.
TR-14-88. 1988.]
111373 MERGING AND ROUTING ON PARALLEL MODELS OF COMPUTATION.
D. D. Krizanc.
[Harvard University. Center for Research in Computing Technology.
TR-15-88. 1988. Thesis (Ph.D).]
111374 PARALLEL BIN PACKING USING FIRST-FIT AND K-DELAYED BEST-FIT
HEURISTICS.
A. Bestavros and W. McKeeman.
[Harvard University. Center for Research in Computing Technology.
TR-16-88. 1988.]
111375 RAY TRACING FOR MASSIVELY-PARALLEL MACHINES.
R. J. Walsh.
[Harvard University. Center for Research in Computing Technology.
TR-17-88. 1988.]
111376 A NEW SCAN-LINE ALGORITHM FOR MASSIVELY PARALLEL MACHINES.
R. J. Walsh.
[Harvard University. Center for Research in Computing Technology.
TR-18-88. 1988.]
111377 SECURE MULTIPARTY PROTOCOLS TOLERATING HALF FAULTY PROCESSORS.
D. Beaver.
[Harvard University. Center for Research in Computing Technology.
TR-19-88. 1988.]
111378 MANAGING EVENT-BASED REPLICATION FOR ABSTRACT DATA TYPES IN
DISTRIBUTED SYSTEMS.
A. A. Heddaya.
[Harvard University. Center for Research in Computing Technology.
TR-20-88. 1988. Thesis (Ph.D.).]
111379 ATTRIBUTE SPECIFICATIONS FOR GRAPHICAL INTERFACE GENERATION.
P. Franchi-Zannettacci.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 937. 1988.]
111380 CONCURRENT USE OF DIFFERENT TECHNIQUES FOR GATHERING DATA ON THE
PROGRAMMING ACTIVITY.
W. Visser and A. Morais.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 939. 1988.]
111381 PERFORMANCE MODELLING OF QUEUES WITH RENDEVOUS SERVICE.
L.-M. Le Ny and C. M. Woodside.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 941. 1988. Also issued as Publication
interne 435, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
111382 EXTENSION OF CHERNIKOVA'S ALGORITHM FOR SOLVING GENERAL MIXED LINEAR
PROGRAMMING PROBLEMS.
F. Fernandez and P. Quinton.
[Institut National de Recherche en Informatique et en Automatique
(INRIA). Rapport de recherche 943. 1988. Also issued as Publication
interne 437, Institut de Recherche en Informatique et Systemes
Aleatoires (IRISA).]
111383 A NAVIER-STOKES SOLVER OF CASCADE FLOWS.
A. Arnone and R. C. Swanson.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-32. 1988.]
111384 ON THE COUPLING OF HYPERBOLIC AND PARABOLIC SYSTEMS: ANALYTICAL AND
NUMERICAL APPROACH.
F. Gastaldi and A. Quarteroni.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-55. 1988.]
111385 NONLINEAR INTERACTION OF NEAR-PLANAR TS WAVES AND LONGITUDINAL
VORTICES IN BOUNDARY-LAYER TRANSITION.
F. T. Smith.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-66. 1988.]
111386 EFFECT OF HEAT RELEASE ON THE SPATIAL STABILITY OF A SUPERSONIC
REACTING MIXING LAYER.
T. L. Jackson and C. E. Grosch.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-68. 1988.]
111387 SINGLE-GRID SPECTRAL COLLOCATION FOR THE NAVIER-STOKES EQUATIONS.
C. Bernardi et al.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-69. 1988.]
111388 RUN-TIME PARALLELIZATION AND SCHEDULING OF LOOPS.
J. H. Saltz, R. Mirchandaney, and D. Baxter.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-70. 1988.]
111389 ON HILBERT-SCHMIDT NORM CONVERGENCE OF GALERKIN APPROXIMATION FOR
OPERATOR RICCATI EQUATIONS.
I. G. Rosen.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-71. 1988.]
111390 ON THE INSTABILITY OF HYPERSONIC FLOW PAST A WEDGE.
S. Cowley and P. Hall.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-72. 1988.]
111391 SPECTRAL ELEMENT MULTIGRID. PART 2: THEORETICAL JUSTIFICATION.
Y. Maday and R. Munoz.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 88-73. 1988.]
111392 SPECTRAL SOLUTION OF THE INCOMPRESSIBLE NAVIER-STOKES EQUATIONS ON
THE CONNECTION MACHINE 2.
S. Tomboulian, C. Streett, and M. Macaraeg.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 89-1. 1988.]
111393 ON THE FREESTREAM MATCHING CONDITION FOR STAGNATION POINT TURBULENT
FLOWS.
C. G. Speziale.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 89-2. 1989.]
111394 A LANGUAGE COMPARISON FOR SCIENTIFIC COMPUTING ON MIMD ARCHITECTURES.
M. T. Jones, M. L. Patrick, and R. G. Voigt.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 89-6. 1989.]
111395 RUN-TIME SCHEDULING AND EXECUTION OF LOOPS ON MESSAGE PASSING
MACHINES.
K. Crowley et al.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 89-7. 1989.]
111396 MULTIGRID SOLUTION OF THE NAVIER-STOKES EQUATIONS ON TRIANGULAR
MESHES.
D. J. Mavriplis, A. Jameson, and L. Martinelli.
[Institute for Computer Applications in Science and Engineering
(ICASE). Report no. 89-11. 1989.]
111397 A BIBLIOGRAPHY ON PARALLEL AND VECTOR NUMERICAL ALGORITHMS.
J. M. Ortega, R. G. Voigt, and C. H. Romine.
[Institute for Computer Applications in Science and Engineering
(ICASE). Interim report 6. 1988.]
111398 MINIMAL CHANGE - A CRITERION FOR CHOOSING BETWEEN COMPETING MODELS.
K. Satoh.
[Institute for New Generation Computer Technology (ICOT). TR-316.
1987.]
111399 NONMONOTONIC REASONING BY MINIMAL BELIEF REVISION.
K. Satoh.
[Institute for New Generation Computer Technology (ICOT). TR-358.
1988.]
111400 LOAD-DISPATCHING STRATEGY ON PARALLEL INFERENCE MACHINES.
M. Sugie et al.
[Institute for New Generation Computer Technology (ICOT). TR-371.
1988.]
111401 KNOWLEDGE REPRESENTATION WITH ABSTRACTIVE LAYERS FOR INFORMATION
RETRIEVAL.
T. Koguchi et al.
[Institute for New Generation Computer Technology (ICOT). TR-372.
1988.]
111402 CO-LODEX: A COOPERATIVE EXPERT SYSTEM FOR LOGIC DESIGN.
F. Maruyama et al.
[Institute for New Generation Computer Technology (ICOT). TR-375.
1988.]
111403 PREFERENCE JUDGEMENT IN COMPREHENDING CONVERSATIONAL SENTENCES USING
MULTI-PARADIGM WORLD KNOWLEDGE.
T. Ukita et al.
[Institute for New Generation Computer Technology (ICOT). TR-376.
1988.]
111404 A PRINCIPLE OF QUERY TRANSFORMATIONS IN DEDUCTIVE DATABASES.
N. Miyazaki et al.
[Institute for New Generation Computer Technology (ICOT). TR-377.
1988. May 1988. Revised: September 1988.]
111405 COOPERATIVE PROBLEM SOLVING APPROACH FOR PORTFOLIO SELECTION.
H. Satoh, H. Ichiki, and F. Suenaga.
[Institute for New Generation Computer Technology (ICOT). TR-378.
1988.]
111406 PROBLEM SOLVING WITH HYPOTHETICAL REASONING.
K. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-379.
1988.]
111407 KNOWLEDGE RETRIEVAL AND UPDATING FOR PARALLEL PROBLEM SOLVING.
H. Yokota, H. Kitakami, and A. Hattori.
[Institute for New Generation Computer Technology (ICOT). TR-380.
1988.]
111408 INTEGRATION OF RELATIONAL KNOWLEDGE BASES AND LOGIC PROGRAMMING
LANGUAGES.
H. Monoi et al.
[Institute for New Generation Computer Technology (ICOT). TR-381.
1988.]
111409 A PARALLEL ALGORITHM FOR INHERITANCE HIERARCHIES WITH CONSTRAINTS.
S. Menju, H. Itoh, and Y. Morita.
[Institute for New Generation Computer Technology (ICOT). TR-382.
1988.]
111410 AN INDEXING SCHEME FOR TERMS USING STRUCTURAL SUPERIMPOSED CODE WORDS.
Y. Morita, A. Nakase, and H. Itoh.
[Institute for New Generation Computer Technology (ICOT). TR-383.
1988.]
111411 THE DESIGN AND IMPLEMENTATION OF A KNOWLEDGE BASE MACHINE MU-X.
H. Sakai et al.
[Institute for New Generation Computer Technology (ICOT). TR-384.
1988.]
111412 FGHC PARTIAL EVALUATOR AS A GENERAL PURPOSE PARALLEL COMPILER.
H. Fujita.
[Institute for New Generation Computer Technology (ICOT). TR-386.
1988.]
111413 KNOWLEDGE ACQUISITION BY OBSERVATION.
H. Taki.
[Institute for New Generation Computer Technology (ICOT). TR-387.
1988.]
111414 A'UM - A STREAM-BASED CONCURRENT OBJECT-ORIENTED LANGUAGE.
K. Yoshida and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-388.
1988.]
111415 MACRO-CALL INSTRUCTION FOR THE EFFICIENT KL1 IMPLEMENTATION ON PIM.
T. Shinogi et al.
[Institute for New Generation Computer Technology (ICOT). TR-389.
1988.]
111416 A NEW EXTERNAL REFERENCE MANAGEMENT AND DISTRIBUTED UNIFICATION FOR
KL1.
N. Ichiyoshi and K. Rokusawa.
[Institute for New Generation Computer Technology (ICOT). TR-390.
1988.]
111417 METHODS FOR PARTITION OF TARGET SYSTEMS IN QUALITATIVE REASONING.
K. Sakane et al.
[Institute for New Generation Computer Technology (ICOT). TR-392.
1988.]
111418 PRELIMINARY EVALUATION OF THE CONNECTION FOR THE MULTI-PS1 SYSTEM.
K. Masuda et al.
[Institute for New Generation Computer Technology (ICOT). TR-393.
1988.]
111419 PROOF THEORETIC APPROACH TO THE EXTRACTION OF REDUNDANCY-FREE
REALIZER CODES.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-395.
1988.]
111420 COGNITIVE MODEL FOR DEPTH PERCEPTION FROM A SINGLE LINE DRAWING.
N. Oka.
[Institute for New Generation Computer Technology (ICOT). TR-396.
1988.]
111421 META-INTERPRETERS AND REFLECTIVE OPERATIONS IN GHC.
J. Tanaka.
[Institute for New Generation Computer Technology (ICOT). TR-397.
1988.]
111422 DETECTING TERMINATION OF LOGIC PROGRAMS BASED ON ABSTRACT HYBRID
INTERPRETATION.
T. Kanamori, T. Kawamura, and K. Horiuchi.
[Institute for New Generation Computer Technology (ICOT). TR-398.
1988.]
111423 PRESERVATION OF STRONGER EQUIVALENCE IN UNFOLD/FOLD LOGIC PROGRAM
TRANSFORMATION I.
T. Kawamura and T. Kanamori.
[Institute for New Generation Computer Technology (ICOT). TR-399.
1988.]
111424 THE ANONYM PROBLEM: A WEAK POINT OF CIRCUMSCRIPTION ON EQUALITY.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TR-400.
1988.]
111425 TERM INDEXING FOR RETRIEVAL BY UNIFICATION.
H. Yokota, H. Kitakami, and A. Hattori.
[Institute for New Generation Computer Technology (ICOT). TR-401.
1988.]
111426 ON STRUCTURES FOR EFFICIENT UNIFICATION JOIN AND SELECT OPERATIONS.
L. Henschen et al.
[Institute for New Generation Computer Technology (ICOT). TR-402.
1988.]
111427 PRESERVATION OF STRONGER EQUIVALENCE IN UNFOLD/FOLD LOGIC PROGRAM
TRANSFORMATION (II).
T. Kanamori and T. Kawamura.
[Institute for New Generation Computer Technology (ICOT). TR-403.
1988.]
111428 A DECLARATIVE SEMANTICS OF PARALLEL LOGIC PROGRAMS WITH PERCEPTUAL
PROCESSES.
M. Murakami.
[Institute for New Generation Computer Technology (ICOT). TR-406.
1988.]
111429 HORN CLAUSE TRANSFORMATION BY RESTRICTOR IN DEDUCTIVE DATABASES.
N. Miyazaki et al.
[Institute for New Generation Computer Technology (ICOT). TR-407.
1988.]
111430 AN EVALUATION OF FGHC ON A SHARED MEMORY MULTIPROCESSOR.
T. Ozawa, A. Hosoi, and A. Hattori.
[Institute for New Generation Computer Technology (ICOT). TR-409.
1988.]
111431 MACRO PROCESSING IN PROLOG.
S. Kondoh and T. Chikayama.
[Institute for New Generation Computer Technology (ICOT). TR-410.
1988.]
111432 COGNITIVE MODEL OF CONSCIOUS/UNCONSCIOUS PROCESSING AND ITS
SIMULATION IN A PARALLEL LOGIC PROGRAMMING LANGUAGE.
N. Oka.
[Institute for New Generation Computer Technology (ICOT). TR-415.
1988.]
111433 A PROGRAMMING SYSTEM BASED ON QJ.
Y. Takayama.
[Institute for New Generation Computer Technology (ICOT). TR-417.
1988.]
111434 PERFORMANCE OF PARALLEL LOGIC PROGRAMMING ARCHITECTURES.
E. Tick.
[Institute for New Generation Computer Technology (ICOT). TR-421.
1988.]
111435 OVERVIEW OF KNOWLEDGE BASE MECHANISM.
S. Shibayama et al.
[Institute for New Generation Computer Technology (ICOT). TR-422.
1988.]
111436 GENERATING RULES WITH EXCEPTIONS.
J. Arima.
[Institute for New Generation Computer Technology (ICOT). TR-423.
1988.]
111437 KNOWLEDGE BASE SYSTEM IN LOGIC PROGRAMMING PARADIGM.
H. Itoh et al.
[Institute for New Generation Computer Technology (ICOT). TR-425.
1988.]
111438 POTENTIALS OF GENERAL-PURPOSE REASONING ASSISTANT SYSTEM EUODHILOS.
H. Sawamura et al.
[Institute for New Generation Computer Technology (ICOT). TR-426.
1988.]
111439 RELATIVE PLAUSIBILITY BASED ON MODEL ORDERING: PRELIMINARY REPORT.
K. Satoh.
[Institute for New Generation Computer Technology (ICOT). TR-429.
1988.]
111440 EUODHILOS: A GENERAL-PURPOSE REASONING ASSISTANT SYSTEM - CONCEPT AND
IMPLEMENTATION.
T. Minami et al.
[Institute for New Generation Computer Technology (ICOT). TR-430.
1988.]
111441 SYSTEM SIZE DEPENDENCY OF MINIMUM LOAD-DISPATCHING RATE IN PARALLEL
INFERENCE MACHINES.
M. Sugie and N. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-431.
1988.]
111442 ENHANCED QUALITATIVE PHYSICAL REASONING SYSTEM.
M. Ohki et al.
[Institute for New Generation Computer Technology (ICOT). TR-432.
1988.]
111443 A PRELIMINARY NOTE ON THE SEMANTICS OF GUARDED HORN CLAUSES.
T. Kanamori and M. Maeji.
[Institute for New Generation Computer Technology (ICOT). TR-434.
1988.]
111444 KNOWLEDGE BASE SYSTEM TOWARD LOGIC PROGRAMMING AND PARALLEL
PROCESSING PARADIGMS.
H. Itoh, H. Monoi, and H. Seki.
[Institute for New Generation Computer Technology (ICOT). TR-435.
1988.]
111445 DESIGN AND PERFORMANCE OF A COHERENT CACHE FOR PARALLEL LOGIC
PROGRAMMING ARCHITECTURES.
A. Goto, A. Matsumoto, and E. Tich.
[Institute for New Generation Computer Technology (ICOT). TR-436.
1988.]
111446 WEIGHTED-GRAPHS - TOOL FOR STUDYING THE HALTING PROBLEM AND TIME
COMPLEXITY IN TERM REWRITING SYSTEMS AND LOGIC PROGRAMMING.
P. Devienne.
[Institute for New Generation Computer Technology (ICOT). TR-437.
1988.]
111447 DISTRIBUTED IMPLEMENTATION OF KL1 ON THE MULTI-PS1/V2.
K. Nakajima et al.
[Institute for New Generation Computer Technology (ICOT). TR-439.
1988.]
111448 FORMALIZING NONMONOTONIC REASONING BY PREFERENCE ORDERING.
K. Sato.
[Institute for New Generation Computer Technology (ICOT). TR-440.
1988.]
111449 A FAILURE SET SEMANTICS OF GUARDED HORN CLAUSES PROGRAMS.
M. Murakami.
[Institute for New Generation Computer Technology (ICOT). TR-442.
1988.]
111450 AMOUNT OF INFORMATION OF A SENTENCE INTERPRETATION AGAINST A
KNOWLEDGE BASE.
K. Sumita, T. Ukita, and S. Amano.
[Institute for New Generation Computer Technology (ICOT). TR-443.
1988.]
111451 HIERARCHICAL REPRESENTATION FOR DEPENDENCY-DIRECTED SEARCH.
K. Inoue.
[Institute for New Generation Computer Technology (ICOT). TR-444.
1988.]
111459 FIGURES OF MERIT.
M. Tompa.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14211. 1988. "A preliminary version of
these results was presented at the 29th Annual Symposium on Follies
[sic] of Computer Science, White Plains, New York, October 24,
1988."]
111460 SOME EXPERIMENTS WITH A LEANING TOWER OF BOOKS.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14260. 1988.]
042024 MODEL-BASED ROBOT LEARNING.
C. G. Atkeson et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1024. 1988.]
111461 A FUNCTIONAL APPROACH TO DATABASE SEMANTICS.
A. Siebes and M. L. Kersten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8804. 1988.]
111462 UNIFORM ABSTRACTION, ATOMICITY AND CONTRACTIONS IN THE COMPARATIVE
SEMANTICS OF CONCURRENT PROLOG.
J. W. de Bakker and J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8834. 1988.]
111463 DATA FLOW SEMANTICS.
J. N. Kok.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8835. 1988.]
111464 BOOLEAN FUNCTIONS, INVARIANCE GROUPS, AND PARALLEL COMPLEXITY.
P. Clote and E. Kranakis.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8836. 1988.]
111465 COMPLETENESS OF RESOLUTION BY TRANSFINITE INDUCTION.
M. Bezem.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8837. 1988.]
111466 AN INTERPOLATION THEOREM IN EQUATIONAL LOGIC.
P. H. Rodenburg and R. J. van Glabbeek.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8838. 1988.]
111467 DETERMINISM -> (EVENT STRUCTURE ISOMORPHISM = STEP SEQUENCE
EQUIVALENCE).
F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8839. 1988.]
111468 COMPARATIVE SEMANTICS FOR FLOW OF CONTROL IN LOGIC PROGRAMMING
WITHOUT LOGIC.
J. W. de Bakker.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8840. 1988.]
111469 DIALOGUE CELL RESOURCE MODEL AND BASIC DIALOGUE CELLS.
H. J. Schouten and P. J. W. ten Hagen.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8841. 1988.]
111470 PARTIALLY SPECIFIED PROBABILITY MEASURES IN EXPERT SYSTEMS.
L. C. van der Gaag.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8842. 1988.]
111471 SEMANTIC CORRECTNESS FOR A PARALLEL OBJECT-ORIENTED LANGUAGE.
J. J. M. M. Rutten.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8843. 1988.]
111472 MODULE ALGEBRA.
J. A. Bergstra, J. Heering, and P. Klint.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8844. 1988. Revised version: November 1988.]
111473 STRUCTURED OPERATIONAL SEMANTICS AND BISIMULATION AS A CONGRUENCE.
J. F. Groote and F. W. Vaandrager.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8845. 1988.]
111474 PARALLEL INFERENCE BASED ON DELTA PROCESSING.
A. Elieens.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. CS-R8846. 1988.]
111475 LINPACK ROUTINES BASED ON THE LEVEL 2 BLAS.
M. Louter-Nool.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8811. 1988.]
111476 CHECKING THE GOLDBACH CONJECTURE ON A VECTOR COMPUTER.
A. Granville, J. van de Lune, and H. J. J. te Riele.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8812. 1988.]
111477 FINITE DIFFERENCE METHODS FOR THE THREE-DIMENSIONAL HYDRODYNAMIC
EQUATIONS.
E. D. de Goede.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8813. 1988.]
111478 NOTE ON EXPLICIT PARALLEL MULTISTEP RUNGE-KUTTA METHODS.
P. J. van der Houwen, B. P. Sommeijer, and P. A. van Mourik.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8814. 1988.]
111479 ON THE EQUIVALENCE OF BS-STABILITY AND B-CONSISTENCY.
W. H. Hundsdorfer and J. Schneid.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8815. 1988.]
111480 PRESSURE CORRECTION SPLITTING METHODS FOR THE COMPUTATION OF
OSCILLARY FREE CONVECTION IN LOW PR FLUIDS.
J. H. M. ten Thije Boonkkamp.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8816. 1988.]
111481 VARIABLE STEP ITERATION OF HIGH-ORDER RUNGE-KUTTA METHODS ON PARALLEL
COMPUTERS.
P. J. van der Houwen and B. P. Sommeijer.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8817. 1988.]
111482 A MOVING-GRID METHOD FOR ONE-DIMESIONAL PDES BASED ON THE METHOD OF
LINES.
J. G. Verwer et al.
[Mathematisch Centrum (Amsterdam). Centrum voor Wiskunde en
Informatica. NM-R8818. 1988.]
111484 OPTIMAL THREE FINGER GRASPS.
J. Demmel and G. Lafferriere.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 399. 1989. Also issued
as Robotics research 170, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111485 COMMON TANGENTS AND COMMON TRANSVERSALS.
J. E. Goodman and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 413. 1988. Also issued
as Robotics research 179, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111486 A DOUBLE EXPONENTIAL LOWER BOUND FOR DEGREE-COMPATIBLE GROEBNER BASES.
C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 415. 1988. Also issued
as Robotics research 181, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111487 A NEW LOWER BOUND CONSTRUCTION FOR THE WORD PROBLEM FOR COMMUTATIVE
THUE SYSTEMS.
C. K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Robotics reseach 416. 1988. Also issued
as Robotics research 182, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111488 ON VERTICAL VISIBILITY IN ARRANGEMENTS OF SEGMENTS AND THE QUEUE SIZE
IN THE BENTLEY-OTTMAN LINE SWEEPING ALGORITHM.
J. Pach and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 417. 1988. Also issued
as Robotics research 183, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111489 THE FURTHEST-SITE GEODESIC VORONOI DIAGRAM.
B. Aronov, S. Fortune, and G. Wilfong.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 420. 1988. "A
preliminary version of this paper appeared in [the] 'Proceedings of
the Fourth ACM Symposium on Computational Geometry, 1988.'" Also
issued as Robotics research 186, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111490 OPTIMAL PARALLEL ALGORITHMS FOR MATCHING PROBLEMS.
Z. Kedem, G. Landau, and K. Palem.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 410. 1988. "Extended
summary."]
111491 COMPUTING ACCURATE EIGENSYSTEMS OF SCALED DIAGONALLY DOMINANT
MATRICES.
J. Barlow and J. Demmel.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 421. 1988.]
111492 LEARNING WITH SYLLABATION AND CLASSIFICATION.
P. Caianiello.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 424. 1988.]
111493 TWISTS, TURNS, CASCADES, DEQUE CONJECTURE, AND SCANNING THEOREM.
R. Sundar.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 427. 1989.]
111494 A LOGIC-BASED APPROACH TO DISCOURSE ANALYSIS.
T. Strzalkowski.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 428. 1989.]
111495 A SINGLE-PASS ALGORITHM FOR ELIMINATING CONSTRAINT CHECKS IN ADA
PROGRAMS.
H. Operowsky and E. Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 430. 1988.]
111496 ON LINEAR CLASSIFICATION AND CHARACTERIZATION OF ELLIPTICALLY
CONTOURED DENSITES.
W. Niemiro.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 622. n.d.]
111497 ABOUT PRIORITY IN COSY SYSTEM.
F. Okulicka.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 624. 1988.]
111498 HIGH-SPEED ADDER COMPOSED OF IDENTICAL ADDER SEGMENTS AND CLA UNITS.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 625. 1988.]
111499 HIGH-SPEED HARDWARE EVALUATION OF THE FUNCTIONS Z = E SUPERSCRIPT Y
AND Z = LOG SUBSCRIPT E Y.
W. Kubera and S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 626. 1988.]
111500 SOLVABILITY OF THE ASYNCHRONOUS RANKING PROBLEM.
A. Mazurkiewicz.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 627. 1988.]
111501 ENVIRONMENT: A PLACE TO HIT DUALITY IN MATHEMATICAL PROGRAMMING.
A. Wieczorek.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 630. 1988.]
111502 HIGH-SPEED COMPUTER ARITHMETIC.
S. Majerski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 631. 1988.]
111503 OBSERVATION EQUIVALENCE OF LABELLED EVENT STRUCTURES.
T. T. Dao.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 632. 1988.]
111504 COMMUNICATION IN M-CONNECTED GRAPHS.
A. Idzik.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 633. 1988.]
111505 THREE-VALUED PREDICATES FOR SOFTWARE SPECIFICATION AND VALIDATION.
A. Blikle.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 634. 1988. "This is a little extended version (in Sec. 3) of a
paper published in the 'Proceedings of VDM-Europe Symposium '88,
September 12-16, 1988, Dublin,' LNCS, Springer-Verlag, 1988."]
111506 A THREE-VALUED LOGIC FOR SOFTWARE SPECIFICATION AND VALIDATION.
B. Konikowska, A. Tarlecki, and A. Blikle.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 635. 1988.]
111507 NONCOOPERATIVE GAMES DEFINED BY RELATIONS.
A. Idzik.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 636. 1988.]
111508 EVENT STRUCTURE REPRESENTATION OF THE BEHAVIOR OF PLACE TRANSITION
SYSTEMS.
J. Winkowski.
[Polish Academy of Sciences. Institute of Computer Science. Report
no. 623. 1988.]
111509 ANALYSIS OF A TABLE-DRIVEN ALGORITHM FOR FAST CONTEXT-FREE PARSING.
J. R. Kipps.
[Rand Corporation. P-7452. 1988.]
111510 AVERAGE CASE ANALYSIS OF HEAP BUILDING BY REPEATED INSERTION.
R. Hayward and C. McDiarmid.
[Rutgers. Department of Computer Science. DCS-TR-246. 1988.]
111511 ON SLIM GRAPHS, EVEN PAIRS, AND STAR-CUTSETS.
C. T. Hoang and F. Maffray.
[Rutgers. Department of Computer Science. DCS-TR-247. 1988.]
111512 EMPIRICAL RESULTS ON LEARNING IN AN ABSTRACTION SPACE.
G. Drastal and S. Raatz.
[Rutgers. Department of Computer Science. DCS-TR-248. 1989.]
111513 SOME CLASSES OF PERFECTLY ORDERABLE GRAPHS.
C. T. Hoang and B. A. Reed.
[Rutgers. Department of Computer Science. DCS-TR-249. 1988.]
111514 CANONICAL FORMS FOR COMPETITIVE BINARY SEARCH TREE ALGORITHMS.
J. M. Lucas.
[Rutgers. Department of Computer Science. DCS-TR-250. 1988.]
111515 TYPE SYSTEMS FOR QUERYING CLASS HIERARCHIES WITH NON-STRICT
INHERITANCE.
A. Borgida.
[Rutgers. Department of Computer Science. DCS-TR-251. 1989. "Extended
abstract."]
111516 REASONING ABOUT RESOURCE GOALS: A THESIS PROPOSAL.
C. W. Liew.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-116.
1988.]
111517 EFFICIENCY OF THE NETWORK SIMPLEX ALGORITHM FOR THE MAXIMUM FLOW
PROBLEM.
A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-117.
1988.]
111518 REAPPR - AN EXPERT SYSTEM SHELL FOR PLANNING.
J. L. Bresina.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-119.
1988.]
111519 CONTROLLABLE DELEGATION: AN EXERCISE IN LAW-GOVERNED SYSTEMS.
N. H. Minsky and D. Rozenshtein.
[Rutgers. Laboratory for Computer Science Research. LCSR-TR-120.
1989.]
111520 SECURE DISTRIBUTED DATA VIEWS. VOL. 2: THE SEAVIEW FORMAL SECURITY
POLICY MODEL.
T. F. Lunt et al.
[SRI International. Computer Science Laboratory. SRI-CSL-88-15. 1989.]
025228 A PARALLEL ALGORITHM FOR FINDING A BLOCKING FLOW IN AN ACYCLIC
NETWORK.
A. V. Goldberg and R. E. Tarjan.
[Stanford University. Department of Computer Science.
STAN-CS-88-1228. November 1988.]
025229 DISTRIBUTING INTELLIGENCE WITHIN AN INDIVIDUAL.
B. Hayes-Roth et al.
[Stanford University. Department of Computer Science.
STAN-CS-88-1229. November 1988. Also issued as KSL-88-50, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025230 SPECIFICATION AND VERIFICATION OF CONCURRENT PROGRAMS BY
FORALL-AUTOMATA.
Z. Manna and A. Pnueli.
[Stanford University. Department of Computer Science.
STAN-CS-88-1230. November 1988. "An abbreviated version of this paper
appeared in the 'Proceedings of the 14th Symp. on Principles of
Programming Languages (January 1987).'"]
025231 THE BETA OPERATION: A PARALLEL PRIMITIVE.
E. R. Cohn.
[Stanford University. Department of Computer Science.
STAN-CS-88-1231. November 1988. Thesis (Ph.D.).]
025232 TEMPORAL LOGIC PROGRAMMING IS COMPLETE AND EXPRESSIVE.
M. Baudinet.
[Stanford University. Department of Computer Science.
STAN-CS-88-1232. October 1988.]
025233 A PROCEDURAL SEMANTICS FOR WELL FOUNDED NEGATION IN LOGIC PROGRAMS.
K. A. Ross.
[Stanford University. Department of Computer Science.
STAN-CS-88-1233. December 1988.]
025234 THE AVERAGE NUMBER OF STABLE MATCHINGS.
B. Pittel.
[Stanford University. Department of Computer Science.
STAN-CS-88-1234. December 1988.]
025235 CONCRETE MATHEMATICS ERRATA.
D. E. Knuth.
[Stanford University. Department of Computer Science.
STAN-CS-88-1235. December 1988. "This is a list of all corrections
made to the first printing (August 1988) of 'Concrete Mathematics' by
[Ronald L.] Graham, [Donald E.] Knuth, and [Oren] Patashnik. The
second printing (December 1988) incorporated these changes."]
025236 TIME FOR ACTION: ON THE RELATION BETWEEN TIME, KNOWLEDGE, AND ACTION.
Y. Shoham.
[Stanford University. Department of Computer Science.
STAN-CS-88-1236. December 1988.]
025237 BELIEF AS DEFEASIBLE KNOWLEDGE.
Y. Shoham and Y. Moses.
[Stanford University. Department of Computer Science.
STAN-CS-88-1237. December 1988.]
025238 EFFICIENTLY COMBINING LOGICAL CONSTRAINTS WITH FUNCTIONS.
P. M. A. Bothner.
[Stanford University. Department of Computer Science.
STAN-CS-88-1238. December 1988. Thesis (Ph.D.).]
025239 SORTING, MINIMAL FEEDBACK SETS AND HAMILTON PATHS IN TOURNAMENTS.
A. Bar-Noy and J. Naor.
[Stanford University. Department of Computer Science.
STAN-CS-88-1239. December 1988.]
025240 ON SEPARATING THE EREW AND CREW PRAM MODELS.
E. Gafni, J. Naor, and P. Ragde.
[Stanford University. Department of Computer Science.
STAN-CS-88-1240. December 1988.]
025241 STABLE HUSBANDS.
D. E. Knuth, R. Motwani, and B. Pittel.
[Stanford University. Department of Computer Science.
STAN-CS-88-1241. December 1988.]
025242 APPRENTICESHIP LEARNING TECHNIQUES FOR KNOWLEDGE BASED SYSTEMS.
D. C. Wilkins.
[Stanford University. Department of Computer Science.
STAN-CS-88-1242. December 1988. Also issued as KSL-88-14, Knowledge
Systems Laboratory, Department of Computer Science, Stanford
University.]
025243 ARGUMENT SYSTEMS: A UNIFORM BASIS FOR NONMONOTONIC REASONING.
F. Lin and Y. Shoham.
[Stanford University. Department of Computer Science.
STAN-CS-89-1243. January 1989.]
025244 SOFTWARE PERFORMANCE ON NONLINEAR LEAST-SQUARE PROBLEMS.
C. Fraley.
[Stanford University. Department of Computer Science.
STAN-CS-89-1244. January 1989. Also issued as CLaSSiC Project report
CLaSSiC-88-06, Center for Large Scale Scientific Computation,
Stanford University.]
048088 EXPERIMENTS ON CAGE AND POLIGON: MEASURING THE PERFORMANCE OF
-66 PARALLEL BLACKBOARD SYSTEMS.
H. P. Nii, N. Aiello, and J. P. Rice.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-66. February 1989.]
048088 THE ADVANCED ARCHITECTURE PROJECT.
-71 J. P. Rice.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-71. March 1989.]
048088 RESEARCH TRAINING IN MEDICAL INFORMATICS: THE STANFORD EXPERIENCE.
-83 Shortliffe E. H. and L. M. Fagan.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-83. February 1989.]
048089 PERFORMANCE OF TWO COMMON LISP PROGRAMS ON SEVERAL SYSTEMS.
-02 R. Acuff.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-02. January 1989.]
048089 VENTPLAN: AN ARCHITECTURE FOR COMBINING QUALITATIVE AND QUANTITATIVE
-04 COMPUTATION.
G. Rutledge et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-04. February 1989.]
048089 INTELLIGENT REAL-TIME MONITORING AND CONTROL.
-05 B. Hayes-Roth et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-05. January 1989.]
048089 DATA MANAGEMENT IN REAL-TIME AI SYSTEMS.
-06 R. Washington and B. Hayes-Roth.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-06. March 1989.]
048089 SEE HOW THEY RUN...THE ARCHITECTURE AND PERFORMANCE OF TWO CONCURRENT
-08 BLACKBOARD SYSTEMS.
J. P. Rice and N. Aiello.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-08. March 1989.]
048089 WIDENING THE KNOWLEDGE-ACQUISITION BOTTLENECK: AUTOMATED TOOLS FOR
-09 BUILDING AND EXTENDING CLINICAL MODELS.
M. A. Musen.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-09. February 1989.]
048089 AN ANALYSIS OF THE DISINCTION BETWEEN DEEP AND SHALLOW EXPERT SYSTEMS.
-10 P. D. Karp and D. C. Wilkins.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-10. January 1989.]
048089 HYPERMEDIA AND RANDOMIZED ALGORITHMS FOR MEDICAL EXPERT SYSTEMS.
-14 R. M. Chavez.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-14. March 1989.]
048089 SUPPORT FOR FINE-GRAINED MESSAGE PASSING IN SHARED MEMORY
-15 MULTIPROCESSORS.
G. T. Byrd and B. A. Delagi.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-15. March 1989.]
048089 PROBABILISTIC INFERENCE IN MULTIPLY CONNECTED BELIEF NETWORKS USING
-17 LOOP CUTSETS.
H. J. Suermondt and G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-17. March 1989.]
048089 A COOPERATIVE HYPERTEXT INTERFACE TO RELATIONAL DATABASES.
-18 T. Barsalou and G. Wiederhold.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-18. March 1989.]
048089 A METHODOLOGY FOR IMPLEMENTING CLINICAL ALGORITHMS USING EXPERT
-19 SYSTEM AND DATABASE TOOLS.
D. W. Rucker and E. H. Shortliffe.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-19. March 1989.]
048089 DECISION-THEORETIC EVALUATION OF THERAPY PLANS.
-20 B. R. Farr.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-20. March 1989.]
048089 BUILDING DECISION MODELS THAT MODIFY DECISION SYSTEMS.
-21 J. Reed.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-21. March 1989.]
048089 PROBABILISTIC PREDICTION OF THE OUTCOME OF BONE-MARROW
-23 TRANSPLANTATION.
H. J. Suermondt and M. D. Amylon.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-23. March 1989.]
048089 HEURISTIC ABSTRACTION IN THE DECISION-THEORETIC PATHFINDER SYSTEM.
-24 E. J. Horvitz et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-24. March 1989.]
048089 TOWARD EFFECTIVE NORMATIVE DECISION SYSTEMS: UPDATING ON THE
-25 PATHFINDER PROJECT.
D. E. Heckerman, E. J. Horvitz, and B. N. Nathwani.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-25. March 1989.]
048089 AUTOMATED SUPPORT FOR BUILDING AND EXTENDING EXPERT MODELS.
-26 M. A. Musen.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-26. March 1989.]
048089 KNOWLEDGE ENGINEERING FOR CLINICAL CONSULTATION PROGRAMS: MODELING
-28 THE APPLICATION AREA.
M. A. Musen and J. van der Lei.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-28. March 1989.]
111521 INCREMENTAL AND REVERSIBLE ACQUISITION OF TAXONOMIES.
J.-U. Kietz.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 66. 1988.]
111522 UNDECIDABILITY OF SUBSUMPTION IN U.
K. Schild.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 67. 1988.]
111523 TEMPORAL CONSTRAINT NETWORKS.
A. Schmiedel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 69. 1988.]
111524 A TEMPORAL CONSTRAINT HANDLER FOR THE BACK SYSTEM.
A. Schmiedel.
[Technische Universitaet Berlin. Fachbereich Informatik. Institut
fuer Angewandte Informatik. Projektgruppe KIT (Kuenstliche
Intelligenz und Textverstehen). Report no. 70. 1988.]
111525 EXPERT SYSTEMS ON MULTIPROCESSOR ARCHITECTURES: PHASE ONE FINAL
REPORT.
E. A. Feigenbaum and R. S. Engelmore.
[United States. Rome Air Development Center, Griffiss AFB, New York.
RADC-TR-88-187. August 1988.]
111526 ROBOT DIRECT DYNAMICS ALGORITHMS USING SYMBOLIC GENERATION.
R. W. Toogood.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 88-02. 1988.]
111527 DESIGN OF ROBUST PID CONTROL OF INTERPOLATED JOINT TRAJECTORIES.
H. Zhang and G. Trott.
[University of Alberta. Alberta Centre for Machine Intelligence and
Robotics. Technical report 89-01. 1989.]
111528 IMAGE EXPANSION USING INTERPOLATION AND HEURISTIC EDGE FOLLOWING.
G. H. Atwood and W. A. Davis.
[University of Alberta. Alberta Centre for Macine Intelligence and
Robotics. Technical report 89-02. 1989.]
054417 THREE CHARACTERIZATIONS OF GEOMETRIC CONTINUITY FOR PARAMETRIC CURVES.
B. A. Barsky and T. D. DeRose.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/417. 1988. "ACM/SIGGRAPH'88 Course 25, Atlanta, Georgia, 1
August 1988."]
054427 IMPROVING THE EFFICIENCY OF THE ISO CHECKSUM CALCULATION.
K. Sklower.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/427. 1988. Also issued as PROGRES report 88.4, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054434 ON THE TIME AND SPACE COMPLEXITY OF COMPUTATION USING WRITE-ONCE
MEMORY -OR- IS PEN REALLY WORSE THAN PENCIL?
S. Irani, M. Naor, and R. Rubinfeld.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/434. 1988.]
054437 MACHINE CHARACTERIZATION AND BENCHMARK PERFORMANCE PREDICTION.
R. H. Saavedra-Barrera.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/437. 1988.]
054438 EVALUATION OF "PERFORMANCE ENHANCEMENTS" IN ALGEBRAIC MANIPULATION
SYSTEMS.
C. G. Ponder.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/438. 1988. Thesis (Ph.D.).]
054439 SOME ALGEBRAIC AND GEOMETRIC COMPUTATIONS IN PSPACE.
J. Canny.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/439. 1988.]
054440 GENERALIZED CHARACTERISTIC POLYNOMIALS.
J. Canny.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/440. 1988.]
054441 DYNAMICALLY RECONFIGURABLE SYSTEMS RESEARCH.
V. P. Srini.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/441. 1988.]
054442 BETA BAR-CONTINUITY AND ITS APPLICATION TO RATIONAL BETA-SPLINES.
R. N. Goldman and B. A. Barsky.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/442. 1988.]
054443 A PROLOG GARBAGE COLLECTOR FOR AQUARIUS.
H. Touati.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/443. 1988.]
054444 HIGH PERFORMANCE NUMERICAL CALCULATION IN PROLOG EXECUTION.
R. Yung et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/444. 1988.]
054445 AN EXTENDED PROLOG ARCHITECTURE FOR INTEGRATED SYMBOLIC AND NUMERIC
EXECUTIONS.
R. Yung, A. M. Despain, and Y. N. Patt.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/445. 1988.]
054446 MACHE: NO-LOSS TRACE COMPACTION.
A. D. Samples.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/446. 1988.]
054447 CODE REORGANIZATION FOR INSTRUCTION CACHES.
A. D. Samples and P. N. Hilfinger.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/447. 1988.]
054449 MIGRATING VLSI INTO THE UNDERGRADUATE CURRICULUM: COURSE NOTES FOR A
DIGITAL LOGIC DESIGN COURSE.
R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/449. 1988. Notes for Computer Science 150, Fall 1986.]
054450 MAINTAINING TOPOLOGY IN GEOMETRIC DESCRIPTIONS WITH NUMERICAL
UNCERTAINTY.
M. G. Segal and C. H. Sequin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/450. 1988.]
054451 INTERNALS OF VORTEX: THE SOURCE EDITOR.
J. Coker.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/451. 1988.]
054452 A PERFORMANCE EVALUATION OF THE DASH MESSAGE-PASSING SYSTEM.
S.-Y. Tzou and D. P. Anderson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/452. 1988.]
054453 PORTING PAN I TO ALLEGRO COMMON LISP.
D. J. Lane.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/453. 1988.]
054454 DESIGNING BIBLIOTEXT: AN EXPERIMENT IN USER INTERFACE DESIGN.
M. Van De Vanter.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/454. 1988. Also issued as Working paper 88-1, PIPER Group,
Computer Science Division, University of California, Berkeley.]
054455 BIBLIOTEXT: A HYPERTEXT BROWSER FOR BIBLIOGRAPHIC DATA AND NOTES.
M. Van De Vanter.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/455. 1988. Also issued as Working paper 88-2, PIPER Group,
Computer Science Division, University of California, Berkeley.]
054456 TRUST RELATIONSHIPS, NAMING, AND SECURE COMMUNICATION IN LARGE
DISTRIBUTED COMPUTER SYSTEMS.
P. Venkata Rangan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/456. 1988. Thesis (Ph.D.). Also issued as PROGRES report
88.5, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054457 A CLIENT-SERVER SHELL ARCHITECTURE FOR DISTRIBUTED PROGRAMMING.
S. Sechrest.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/457. 1988. Thesis (Ph.D.). Also issued as PROGRES report
88.6, PROGRES Group, Computer Science Division, University of
California, Berkeley.]
054458 THE PPM ENVIRONMENT MANAGER.
S. Sechrest.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/458. 1988. Also issued as PROGRES report 88.7, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054459 IMPLEMENTATION OF MULTIPROCESSING SPUR LISP.
K. Ho and P. N. Hilfinger.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/459. 1988.]
054460 MARIONETTE: A SYSTEM FOR PARALLEL DISTRIBUTED PROGRAMMING USING A
MASTER/SLAVE MODEL.
M. Sullivan and D. P. Anderson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/460. 1988.]
054461 THE DASH VIRTUAL MEMORY SYSTEM.
D. P. Anderson, S.-Y. Tzou, and G. S. Graham.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/461. 1988.]
054462 THE DASH NETWORK COMMUNICATION ARCHITECTURE.
D. P. Anderson and R. Wahbe.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/462. 1988.]
054464 A PERFORMANCE STUDY OF REMOTE EXECUTIONS IN A WIDE-AREA DATAKIT
NETWORK.
R. S. Arbo.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/464. 1988.]
054465 A COMPUTATIONAL THEORY OF METAPHOR.
J. H. Martin.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/465. 1988. Thesis (Ph.D.).]
054467 BEATING THE I/O BOTTLENECK: A CASE FOR LOG-STRUCTURED FILE SYSTEMS.
J. Ousterhout and F. Douglis.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/467. 1988.]
054468 LIMITS ON THE PROVABLE CONSEQUENCES OF ONE-WAY FUNCTIONS.
S. Rudich.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/468. 1988. Thesis (Ph.D.).]
054469 VLSI DESIGN TECHNIQUES FOR FLOATING-POINT COMPUTATION.
B. K. Bose.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/469. 1988. Thesis (Ph.D.).]
054470 TRAP ARCHITECTURES FOR LISP SYSTEMS.
D. Johnson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/470. 1988.]
054471 PHYSICAL MEMORY MANAGEMENT IN A NETWORK OPERATING SYSTEM.
M. N. Nelson.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/471. 1988. Thesis (Ph.D.).]
054472 REAL: A NETWORK SIMULATOR.
S. Keshav.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/472. 1988. Also issued as PROGRES report 88.10, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054473 EXPLOITING INHERITANCE AND STRUCTURE SEMANTICS FOR EFFECTIVE
CLUSTERING AND BUFFERING IN AN OBJECT-ORIENTED DBMS.
E. E. Chang and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/473. 1988.]
054474 DELAY AND THROUGHPUT MEASUREMENTS OF THE XUNET DATAKIT NETWORK.
T. VandeWater.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/474. 1988.]
054475 THE EFFECT OF SHARING ON THE CACHE AND BUS PERFORMANCE OF PARALLEL
PROGRAMS.
S. J. Eggers and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/475. 1988.]
054476 A PROTOTYPE SILICON COMPILER IN PROLOG.
W. Bush et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/476. 1988.]
054477 CODING TECHNIQUES FOR HANDLING FAILURES IN LARGE DISK ARRAYS.
G. Gibson et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/477. 1988.]
054478 EVALUATING THE PERFORMANCE OF FOUR SNOOPING CACHE COHERENCY PROTOCOLS.
S. J. Eggers and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/478. 1988.]
054479 TWO PAPERS ON RAIDS.
P. Chen et al.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/479. 1988.]
054481 IMPLEMENTATION OF TWO RELATIVISTIC RENDERERS.
H. P. Nguyen.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/481. 1988.]
054482 ANALYSIS OF SIMPLE NEURAL NETWORKS.
C. Chinrungrueng.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/482. 1988.]
054483 SCALE-SPACE AND EDGE DETECTION USING ANISOTROPIC DIFFUSION.
P. Perona and J. Malik.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/483. 1988.]
054485 GUARANTEEING PERFORMANCE FOR REAL-TIME COMMUNICATION IN WIDE-AREA
NETWORKS.
D. Ferrari.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/485. 1988. Also issued as PROGRES report 88.13, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054486 USING HARD PROBLEMS TO CREATE PSEUDORANDOM GENERATORS.
N. Nisan.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/486. 1989. Thesis (Ph.D.).]
054487 AI IN OPERATING SYSTEMS: AN EXPERT SCHEDULER.
D. Tonogai.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/487. 1988. Also issued as PROGRES report 88.12, PROGRES
Group, Computer Science Division, University of California,
Berkeley.]
054488 CALCULATING TIMEOUTS FOR MINIMUM COST RPC.
P. B. Danzig.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/488. 1988.]
054489 FINITE BUFFERS AND FAST MULTICAST.
P. B. Danzig.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/489. 1988.]
054490 VERIFYING A MULTIPROCESSOR CACHE CONTROLLER USING RANDOM CASE
GENERATION.
D. A. Wood, G. A. Gibson, and R. H. Katz.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 89/490. 1988.]
054491 A COMPUTATIONAL MODEL OF TEXTURE PERCEPTION.
J. Malik and P. Perona.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 89/491. 1989.]
054493 MASSIVE INFORMATION STORAGE, MANAGEMENT, AND USE (NSF INSTITUTIONAL
INFRASTRUCTURE PROPOSAL).
S. L. Graham.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 89/493. 1989. "This report is an edited version of a proposal
submitted to the NSF Institutional Infrastructure program in
September 1987 and funded in July 1988. The financial data and other
supplementary material have been omitted, but the technical sections
are unchanged." Project Director: Susan L. Graham. Faculty
Investigators: David Anderson, Brian A. Barsky, Richard J. Fateman,
Domenico Ferrari, Susan L. Graham, Michael A. Harrison, William
Kahan, Richard M. Karp, Randy H. Katz, Jitendra Malik, John
Ousterhout, David A. Patterson, C. V. Ramamoorthy, Lawrence A. Rowe,
Stuart Russell, Raimund Seidel, Carlo H. Sequin, Alan J. Smith,
Michael J. Stonebraker, Robert Wilensky.]
054494 MACHINE CHARACTERIZATION BASED ON AN ABSTRACT HIGH LEVEL MACHINE.
R. H. Saavedra-Barrera, A. J. Smith, and E. Miya.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 89/494. 1989.]
054495 MODELING THE BEHAVIORAL SUBSTRATES OF ASSOCIATE LEARNING AND MEMORY:
ADAPTIVE NEURONAL MODELS.
C.-C. Lee.
[University of California, Berkeley. Computer Science Division.
UCB/CSD 88/495. 1989.]
111529 CEDAR FORTRAN PROGRAMMER'S HANDBOOK.
M. D. Guzzi.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 601. 1987.]
111531 COMPILE-TIME REDUCTION OF INTERPROCESSOR COMMUNICATION FOR PARALLEL
COMPUTERS.
C. D. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 642. 1989.]
111539 THE CEDAR PARALLEL PROCESSOR: MACHINE ORGANIZATION AND SOFTWARE.
D. A. Padua.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 712. n.d.]
111540 A FAULT-DIAGNOSIS SCHEME FOR THE CEDAR PROCESSOR-MEMORY
INTERCONNECTION NETWORK.
J. A. Szczypek.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 716. 1988. Thesis (M.S.).]
111541 INTERPROCEDURAL ANALYSIS AND PROGRAM RESTRUCTURING FOR PARALLEL
PROGRAMS.
Z. Li and P.-C. Yew.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 720. 1988.]
111542 NUMERICAL LINEAR ALGEBRA ALGORITHMS ON THE CEDAR SYSTEM.
H.-C. Chen and A. H. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 724. 1988.]
111543 MACHINES, LANGUAGES, AND COMPILERS FOR PARALLEL SYMBOLIC COMPUTING.
D. A. Padua, W. L. Harrison III, and D. J. Kuck.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 729. 1988.]
111544 MULTIPROCESSOR SCHEMES FOR SOLVING BLOCK TRIDIAGONAL LINEAR SYSTEMS.
M. Berry and A. H. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 739. 1988.]
111545 IMPACT OF SELF-SCHEDULING ORDER ON PERFORMANCE OF MULTIPROCESSOR
SYSTEMS.
P. Tang, P.-C. Yew, and C.-Q. Zhu.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 741. n.d.]
111546 MEASUREMENT-BASED ANALYSIS OF MULTIPLE ERRORS AND NEAR-COINCIDENT
FAULT DISCOVERY IN A SHARED MEMORY MULTIPROCESSOR.
S. G. Mitra.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 743. 1988. Thesis (M.S.).]
111547 PERFORMANCE OF A SHARED MEMORY SYSTEM FOR VECTOR MULTIPROCESSORS.
S. W. Turner and A. V. Veidenbaum.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 745. n.d.]
111548 BOUNDARY INTEGRAL DOMAIN DECOMPOSITION ON HIERARCHICAL MEMORY
MULTIPROCESSORS.
E. Gallopoulos and D. Lee.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 752. 1988.]
111549 THE SAS DOMAIN DECOMPOSITION METHOD FOR STRUCTURAL ANALYSIS.
H.-C. Chen.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 754. 1988. Thesis (Ph.D.).]
111550 FAUST: AN ENVIRONMENT FOR PROGRAMMING PARALLEL SCIENTIFIC
APPLICATIONS.
V. A. Guarna Jr. et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 757. n.d.]
111551 MATRIX COMPUTATION ON SHARED-MEMORY MULTIPROCESSORS.
K. A. Gallivan and A. H. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 760. 1988.]
111552 PARTITIONING PROGRAMS FOR PARALLEL EXECUTION.
M. Girkar and C. D. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 765. 1988.]
111553 PARALLEL DISCRETE EVENT SIMULATION: THE CHANDY-MISRA APPROACH.
D. A. Reed and A. D. Malony.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 767. 1988.]
111554 PROGRAM PARALLELIZATION WITH INTERPROCEDURAL ANALYSIS.
Z. Li and P.-C. Yew.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 775. 1988.]
111555 A SOFTWARE TOOL FOR BUILDING SUPERCOMPUTER APPLICATIONS.
D. Gannon et al.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 777. 1988.]
111557 TOWARD AUTO-SCHEDULING COMPILERS.
C. D. Polychronopoulos.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 789. 1988.]
111558 METHODS OF REDUCING THE BRANCH PENALTY IN PIPELINED PROCESSORS.
D. J. Lilja.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 790. 1988.]
111559 THE SOLUTION OF A PARABOLIC PARTIAL DIFFERENTIAL EQUATION VIA DOMAIN
DECOMPOSITION: THE SYNTHESIS OF ASYMPTOTIC AND NUMERICAL ANALYSIS.
J. S. Scroggs.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 791. 1988. Thesis (Ph.D.).]
111560 SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS.
E. C. Anderson and Y. Saad.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 794. 1988.]
111561 CEDAR ARCHITECTURE AND ITS SOFTWARE.
P. Emrath, D. A. Padua, and P.-C. Yew.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 796. 1988.]
111562 COMPUTER VISUALIZATION OF ELECTRON MOVEMENT IN GALLIUM ARSENIDE
SIMULATION.
J. Zhong.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 797. 1988. Thesis (M.S.).]
111563 PARALLEL IMPLEMENTATION OF PRECONDITIONED CONJUGATE GRADIENT METHODS
FOR SOLVING SPARSE SYSTEMS OF LINEAR EQUATIONS.
E. C. Anderson.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 805. 1988. Thesis (M.S.).]
111564 A ROBUST PARALLEL SOLVER FOR BLOCK TRIDIAGONAL SYSTEMS.
R. Bramley and A. H. Sameh.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 806. 1988.]
111565 VISUALIZING PARALLEL COMPUTER SYSTEM PERFORMANCE.
A. D. Malony and D. A. Reed.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 812. 1988. Thesis (M.S.).]
111567 SOME LEARNABILITY RESULTS FOR ANALOGICAL GENERALIZATION.
C. Lewis.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-384-88. 1988.]
111568 AN OVERVIEW OF DINO --- A NEW LANGUAGE FOR NUMERICAL COMPUTATION ON
DISTRIBUTED MEMORY MULTIPROCESSORS.
M. Rosing and R. B. Schnabel.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-385-88. 1988.]
111569 ANALYZING A CONNECTIONIST MODEL AS A SYSTEM OF SOFT RULES.
C. McMillan and P. Smolensky.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-393-88. 1988.]
111570 THE CONSTITUENT STRUCTURE OF CONNECTIONIST MENTAL STATES: A REPLY TO
FODOR AND PYLYSHYN.
P. Smolensky.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-394-88. 1988.]
111571 PARALLEL QUASI-NEWTON METHODS FOR UNCONSTRAINED OPTIMIZATION.
R. H. Byrd, R. B. Schnabel, and G. A. Shultz.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-396-88. 1988.]
111572 ACTOR GRAMMARS.
D. Janssens and G. Rozenberg.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-407-88. 1988.]
111573 SOME EXPERIMENTS WITH REPROGRAMMING LINPACK ROUTINES FOR PARALLEL
MACHINES.
L. D. Fosdick et al.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-408-88. 1988.]
111574 EFFICIENT DISTRIBUTION OF BACK-PROPAGATION MODELS ON PARALLEL
ARCHITECTURES.
L. G. Ceci, P. Lynn, and P. E. Gardner.
[University of Colorado. Department of Computer Science.
CU-CS-409-88. 1988.]
111575 IMPLEMENTING A CONNECTIONIST PRODUCTION SYSTEM USING TENSOR PRODUCTS.
C. P. Dolan and P. Smolensky.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-411-88. 1988. Also issued as UCLA-AI-88-15, Artificial
Intelligence Laboratory, University of California, Los Angeles.]
111576 SEQUENTIAL AND PARALLEL METHODS FOR UNCONSTRAINED OPTIMIZATION.
R. B. Schnabel.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-414-88. 1988.]
111577 A NEW MODIFIED CHOLESKY FACTORIZATION.
R. B. Schnabel and E. Eskow.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-415-88. 1988.]
111578 CONNECTIONISM, CONSTITUENCY, AND THE LANGUAGE OF THOUGHT.
P. Smolensky.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-416-88. 1988.]
111579 MODELING PARALLEL, DISTRIBUTED COMPUTATIONS USING PARADIGM - A CASE
STUDY: THE ADAPTIVE GLOBAL OPTIMIZATION ALGORITHM.
I. M. Demeure, S. L. Smith, and G. J. Nutt.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-419-88. 1988.]
111580 ALMOST-OPTIMUM PARALLEL SPEEDUPS OF ALGORITHMS FOR BIPARTITE MATCHING
AND RELATED PROBLEMS.
H. N. Gabow and R. E. Tarjan.
[University of Colorado. Department of Computer Science. Technical
report CU-CS-425-89. 1989. "This is an expanded version of a paper
appearing in the 'Proceedings of the 20th Annual ACM Symposium on
Theory of Computing, 1988.'"]
111581 RAY TRACING WITH SPACE SUBDIVISION ON A VECTOR-MULTIPROCESSOR SYSTEM
L. H. Quek.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1491. 1989. Thesis (M.S.).]
111582 STOCHASTICALLY MODELLED NATURAL PHENOMENA IN A PARALLEL VECTORIZED
ENVIRONMENT.
E.-K. Koh.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1492. 1989. Thesis (M.S.).]
111583 EXECUTING QUANTIFIERS IN FASE SPECIFICATIONS.
S. T. Jefferson.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1493. 1989. Thesis (Ph.D.).]
111584 GLUE: A TREE-BASED PROGRAM DEVELOPMENT AND MAINTENANCE SYSTEM WHICH
USES EXPLICIT, TYPED, HIGHER ORDER CLICHES.
D. J. Carr.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1495. 1989. Thesis (M.S.).]
111585 KYMA: AN INTERACTIVE GRAPHIC ENVIRONMENT FOR OBJECT-ORIENTED MUSIC
COMPOSITION AND REAL-TIME SOFTWARE SOUND SYNTHESIS WRITTEN IN
SMALLTALK-80.
C. Scaletti.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1498. 1989. Thesis (M.C.S.). "Project report
submitted in partial fulfillment of the requirements for the degree
of Master of Computer Science in the Graduate College of the
University of Illinois at Urbana-Champaign, 1988."]
111586 THE MINIMUM CONSISTENT DFA PROBLEM CANNOT BE APPROXIMATED WITHIN ANY
POLYNOMIAL.
L. Pitt and M. K. Warmuth.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1499. 1989.]
111587 AN ACYCLICITY THEOREM FOR CELL COMPLEXES IN D DIMENSION.
H. Edelsbrunner.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1500. 1989.]
111588 A CASE-STUDY IN POST-DEVELOPMENT TESTING.
C. M. Gessner.
[University of Iowa. Department of Computer Science. Technical report
89-01. 1989. Thesis (M.S.).]
111589 SECURITY AND DATABASES: A METHODOLOGICAL APPROACH.
J. E. Dobson.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 264. 1988.]
111590 PROVING CORRECTNESS PROPERTIES OF A REPLICATED SYNCHRONOUS PROGRAM.
L. V. Mancini and G. Pappalardo.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 266. 1988.]
111591 MODELLING REAL-WORLD ISSUES FOR DEPENDABLE SOFTWARE.
J. E. Dobson.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 268. 1988.]
111592 ASYNCHRONOUS EXTENSIONS TO THE STRICT HIGH LEVEL DESIGN SYSTEM.
A. M. Koelmans, M. R. McLauchlan, and D. J. Kinniment.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 272. 1988.]
111593 EXPRESSIBILITY, COMPLEXITY, AND COMPARATIVE SCHEMATOLOGY.
I. A. Stewart.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 273. 1988.]
111594 CONSTRUCTING REPLICATED SYSTEMS USING PROCESSORS WITH POINT TO POINT
COMMUNICATION LINKS.
P. D. Ezhilchelvan, S. K. Shrivastava, and A. Tully.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 274. 1988.]
111595 AN EMPIRICAL STUDY OF THE PERFORMANCE OF DISTRIBUTED REPLICATED
SYSTEMS.
P. D. Ezhilchelvan, I. Mitrani, and S. K. Shrivastava.
[University of Newcastle upon Tyne. Computing Laboratory. Technical
report 278. 1989.]
111596 A BROADBAND LOCAL AREA NETWORK USING THE INTELLIGENT HEAD-END.
S. Saito, T. L. Kunii, and H. Yoshida.
[University of Tokyo. Department of Information Science. Technical
report 88-017. 1988.]
111597 SOLVING SYSTEMS OF ALGEBRAIC EQUATIONS.
H. Kobayashi, S. Moritsugu, and R. W. Hogan.
[University of Tokyo. Department of Information Science. Technical
report 88-018. 1988.]
111598 THE STAR ARBORICITY OF COMPLETE BIPARTITE GRAPHS.
H. Enomoto and Y. Usami.
[University of Tokyo. Department of Information Science. Technical
report 88-019. 1988.]
111599 A SIMPLE PROOF OF NASH-WILLIAM'S FORMULA ON THE ARBORICITY OF A GRAPH.
H. Enomoto.
[University of Tokyo. Department of Information Science. Technical
report 88-020. 1988.]
111600 MIRROR-SYMMETRIC GRAPHS.
K. Ando, H. Enomoto, and M. Kano.
[University of Tokyo. Department of Information Science. Technical
report 88-021. 1988.]
111601 A GENERALIZATION OF THE KATONA THEOREM FOR CROSS T-INTERSECTING
FAMILIES.
M. Matsumoto and N. Tokushige.
[University of Tokyo. Department of Information Science. Technical
report 88-022. 1988.]
111602 WALKING THROUGH A HUMAN EAR.
Y. Nomura et al.
[University of Tokyo. Department of Information Science. Technical
report 88-023. 1988.]
111603 ERROR-FREE IMAGE COMPRESSION USING GRAY SCALE QUADTREES.
M. J. Duerst and T. L. Kunii.
[University of Tokyo. Department of Information Science. Technical
report 88-024. 1988.]
111604 BOUNDS FOR THE VERTEX LINEAR ARBORICITY.
M. Matsumoto.
[University of Tokyo. Department of Information Science. Technical
report 88-025. 1988.]
111605 A MIXED VERSION OF MENGER'S THEOREM.
Y. Egawa, A. Kaneko, and M. Matsumoto.
[University of Tokyo. Department of Information Science. Technical
report 88-026. 1988.]
111606 THE FIXED POINT OF AN M-SEQUENCE AND LOCAL NON-RANDOMNESS.
M. Matsumoto and Y. Kurita.
[University of Tokyo. Department of Information Science. Technical
report 88-027. 1988.]
111607 TACL: TRON APPLICATION CONTROL-FLOW LANGUAGE.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-028. 1988.]
111608 TULS: TRON UNIVERSAL LANGUAGE SYSTEM.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-029. 1988.]
111609 THE TYPE MECHANISM OF THE TIPE/L PROGRAMMING LANGUAGE.
H. Takada and K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-030. 1988.]
111610 CTRON REFERENCE MANUAL.
T. Wasano, Y. Kobayashi, and K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-031. 1988.]
111611 NATURAL LANGUAGE TRANSLATION SERVICES IN BTRON.
R. T. Myers and K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-032. 1988.]
111612 DESIGN OF MTRON: CONSTRUCTION OF THE HFDS.
K. Sakamura.
[University of Tokyo. Department of Information Science. Technical
report 88-033. 1988.]
111613 EXTENDING THE MEMORY HIERARCHY INTO MULTIPROCESSOR INTERCONNECTION
NETWORKS: A PERFORMANCE ANALYSIS.
H. E. Mizrahi et al.
[University of Washington. Department of Computer Science. Technical
report 88-11-04. 1988.]
111614 TOWARD A UNIFIED THEORY OF THE PARALLELISM AVAILABLE FOR CIRCUIT
SIMULATION.
M. L. Bailey and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 88-11-08. 1988.]
111615 POLYNOMIAL ISOMORPHS AND NEAR-TESTABLE SETS.
J. Goldsmith.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 816. 1988. Thesis (Ph.D.).]
111616 PERFORMANCE ENHANCEMENT THROUGH REPLICATION IN AN OBJECT-ORIENTED
DBMS.
E. J. Shekita and M. J. Carey.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 817. 1988.]
111617 PERCEPTUAL DEVELOPMENT AND LEARNING: FROM BEHAVIORAL,
NEUROPHYSIOLOGICAL, AND MORPHOLOGICAL EVIDENCE TO COMPUTATIONAL
MODELS.
V. Honavar.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 818. 1989.]
111618 DEMONSTRATION OF A PROTOTYPE TOOL FOR PROGRAM INTEGRATION.
T. Reps.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 819. 1989.]
111619 ON POLYNOMIAL IDEALS OF FINITE CODIMENSION WITH APPLICATIONS TO BOX
SPLINE THEORY.
C. de Boor and A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 821. 1989.]
111620 EVALUATING ASSOCIATIVITY IN CPU CACHES.
M. D. Hill and A. J. Smith.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 823. 1989.]
111621 THE DESIGN OF THE E PROGRAMMING LANGUAGE.
J. E. Richardson, M. J. Carey, and D. T. Schuh.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 824. 1989.]
111622 AN ANALYSIS OF DISTRIBUTED SHARED MEMORY ALGORITHMS.
R. E. Kessler and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 825. 1989.]
111623 CONFLICT DETECTION TRADEOFFS FOR REPLICATED DATA.
M. J. Carey and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 826. 1989.]
111624 ILLUSTRATING INTERFERENCE IN INTERFERING VERSIONS OF PROGRAMS.
T. Reps and T. Bricker.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 827. 1989.]
VOL. 11, NO. 5 06/09/89
111625 MODAL SPECIFICATIONS.
K. G. Larsen.
[Aalborg Universitetscenter. Institut for Elektroniske Systemer.
Afdeling for Matematik og Datalogi. Report no. 89-9. 1989.]
111626 FUNCTIONAL OCCUPATION MEASURES AND ERGODIC COST PROBLEMS FOR
SINGULARLY PERTURBED STOCHASTIC SYSTEMS.
H. J. Kushner.
[Brown University. Division of Applied Mathematics. Lefschetz Center
for Dynamical Systems. Report no. 89-6. 1989.]
111627 ROUTING AND SINGULAR CONTROL FOR QUEUEING NETWORKS IN HEAVY TRAFFIC.
L. F. Martins and H. J. Kushner.
[Brown University. Division of Applied Mathematics. Lefschetz Center
for Dynamical Systems. Report no. 89-9. 1989.]
111628 OPTIMAL AND APPROXIMATELY OPTIMAL CONTROL POLICIES FOR QUEUES IN
HEAVY TRAFFIC.
H. J. Kushner and K. M. Ramachandran.
[Brown University. Division of Applied Mathematics. Lefschetz Center
for Dynamical Systems. 1988. Revised: November 1988.]
111629 1988 YEAR END REPORT FOR ROAD FOLLOWING AT CARNEGIE MELLON.
J. Crisman et al.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-5.
1989. "This report describes progress in vision and navigation for
outdoor mobile robots at the Carnegie Mellon Robotics Institute
during 1988." Charles Thorpe and Takeo Kanade, principal
investigators.]
111630 SURFACE REFLECTION: PHYSICAL AND GEOMETRICAL PERSPECTIVES.
S. K. Nayar, K. Ikeuchi, and T. Kanade.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-7.
1989.]
111631 A NEW APPROACH TO CONTROL SINGLE-LINK FLEXIBLE ARMS. PART I:
MODELLING AND IDENTIFICATION IN THE PRESENCE OF JOINT FRICTION.
V. Feliu, K. S. Rattan, and H. B. Brown Jr.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-8.
1989.]
111632 GLOBALAPPROACH FOR USING KINEMATIC REDUNDANCY TO MINIMIZE BASE
REACTIONS OF MANIPULATORS.
C. L. Chung and S. Desa.
[Carnegie-Mellon University. Robotics Institute. CMU-RI-TR-89-9.
1989.]
111633 GENERIC SINGULARITIES OF ROBOT MANIPULATORS.
Pai. D. K. and Leu. M. C..
[Cornell University. Department of Computer Science. Technical report
88-943. 1988.]
111634 ON THE STRUCTURE OF BOUNDED QUERIES TO ARBITRARY NP SETS.
R. Chang.
[Cornell University. Department of Computer Science. Technical report
88-944. 1988.]
111635 PROVIDING DESIGN ABSTRACTIONS IN DISTRIBUTED SYSTEMS.
G. Neiger and S. Toueg.
[Cornell University. Department of Computer Science. Technical report
88-945. 1988.]
111636 FINDING A MINIMAL COVER FOR BINARY IMAGES: AN OPTIMAL PARALLEL
ALGORITHM.
D. Moitra.
[Cornell University. Department of Computer Science. Technical report
88-946. 1988.]
111637 A PROVABLE GOOD APPROXIMATION FOR OPTIMAL-TIME TRAJECTORY PLANNING.
B. Donald and P. Xavier.
[Cornell University. Department of Computer Science. Technical report
88-947. 1988.]
111638 QUANTIFIER ELIMINATION IN THE FIRST-ORDER THEORY OF ALGEBRAIC CLOSED
FIELDS.
D. Ierardi.
[Cornell University. Department of Computer Science. Technical report
88-948. 1988.]
111639 CAUSALLY CONSISTENT RECOVERY OF PARTIALLY REPLICATED LOGS.
K. P. Kane and K. P. Birman.
[Cornell University. Department of Computer Science. Technical report
88-949. 1988.]
111640 CONDITIONS FOR UNIQUE GRAPH EMBEDDINGS.
B. Hendrickson.
[Cornell University. Department of Computer Science. Technical report
88-950. 1988.]
111641 DETERMINISTIC SIMULATION OF PRAMS ON BOUNDED DEGREE NETWORKS.
K. T. Herley and G. Bilardi.
[Cornell University. Department of Computer Science. Technical report
88-951. 1988.]
111642 ACCUMULATORS: NEW LOGIC VARIABLE ABSTRACTIONS FOR FUNCTIONAL
LANGUAGES.
K. Pingali and K. Ekanadham.
[Cornell University. Department of Computer Science. Technical report
88-952. 1988.]
111643 BOUNDING THE ERROR IN GAUSSIAN ELIMINATION FOR TRIDIAGONAL SYSTEMS.
N. J. Higham.
[Cornell University. Department of Computer Science. Technical report
88-953. 1988.]
111644 ON THE APPLICATION OF SYNTACTIC METHODOLOGIES IN AUTOMATIC TEXT
ANALYSIS.
G. Salton and M. Smith.
[Cornell University. Department of Computer Science. Technical report
88-954. 1988.]
111645 COMPUTING POLYNOMIAL COMPOSITION FACTORS AND INVERSES OF
AUTOMORPHISMS IN POLYNOMIAL TIME.
M. Dickerson.
[Cornell University. Department of Computer Science. Technical report
88-955. 1988.]
111646 THE COMPUTATIONAL STRUCTURE AND CHARACTERIZATION OF NONLINEAR
DISCRETE CHEBYSHEV PROBLEMS.
A. R. Conn and Y. Li.
[Cornell University. Department of Computer Science. Technical report
88-956. 1988.]
111647 A CATEGORY-THEORETIC SEMANTICS FOR UNBOUNDED INDETERMINACY.
P. Panangaden and J. Russell.
[Cornell University. Department of Computer Science. Technical report
88-957. 1988.]
111648 L-DOMAINS AND LOSSLESS POWERDOMAINS.
R. Jagadeesan.
[Cornell University. Department of Computer Science. Technical report
88-958. 1988.]
111649 RANDOM POLYNOMIAL TIME IS EQUAL TO SEMI-RANDOM POLYNOMIAL TIME.
U. V. Vazirani and V. V. Vazirani.
[Cornell University. Department of Computer Science. Technical report
88-959. 1988.]
111650 PROCESSOR EFFICIENT PARALLEL ALGORITHMS FOR THE TWO DISJOINT PATHS
PROBLEM, AND FOR FINDING A KURATOWSKI HOMEOMORPH.
S. Khuller, S. G. Mitchell, and V. V. Vazirani.
[Cornell University. Department of Computer Science. Technical report
89-960. 1989.]
111651 ON THE IMPORTANCE OF BEING PI SUBSCRIPT 2-HARD.
J. Hartmanis.
[Cornell University. Department of Computer Science. Technical report
89-961. 1989.]
111652 LOGICS OF PROGRAMS.
D. Kozen and J. Tiuryn.
[Cornell University. Department of Computer Science. Technical report
89-962. 1989.]
111653 INTERPOLATING POLYNOMIALS FROM THEIR VALUES.
R. Zippel.
[Cornell University. Department of Computer Science. Technical report
89-963. 1989.]
111654 PLACING THE LARGEST SIMILAR COPY OF A CONVEX POLYGON AMONG POLYGONAL
OBSTACLES.
L. P. Chew and K. Kedem.
[Cornell University. Department of Computer Science. Technical report
89-964. 1989.]
111655 AN EXPLICIT SEPARATION OF RELATIVISED RANDOM POLYNOMIAL TIME AND
RELATIVISED DETERMINISTIC TIME.
R. Zippel.
[Cornell University. Department of Computer Science. Technical report
89-965. 1989.]
111656 TRACE-BASED NETWORK PROOF SYSTEMS: EXPRESSIVENESS AND COMPLETENESS.
D. Gries, F. B. Schneider, and J. Widom.
[Cornell University. Department of Computer Science. Technical report
89-966. 1989.]
111657 TRANSFIG: PORTABLE FIGURES FOR TEX.
M. Beck.
[Cornell University. Department of Computer Science. Technical report
89-967. 1989. Version 1.4 TFX Release 4.]
111658 EXTENDING ATTRIBUTE GRAMMAR AND TYPE INFERENCE ALGORITHMS.
J. A. Walz.
[Cornell University. Department of Computer Science. Technical report
89-968. 1989. Thesis (Ph.D.).]
111659 EXPLOITING FAST MATRIX MULTIPLICATION WITHIN THE LEVEL 3 BLAS.
N. J. Higham.
[Cornell University. Department of Computer Science. Technical report
89-984. 1989.]
111660 RULER, COMPASS, AND COMPUTER: THE DESIGN AND ANALYSIS OF GEOMETRIC
ALGORITHMS.
L. J. Guibas and J. Stolfi.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 37. 1989. "An earlier version of this work was presented at the
NATO Advanced Study Institute on Theoretical Foundations of Computer
Graphics and CAD held at Il Ciocco, Italy, 1987" and appears on pages
11-165 of the proceedings of the conference, "Theoretical Foundations
of Computer Graphics and CAD," edited by R. A. Earnshaw
(Springer-Verlag, 1988).]
111661 CAN FAIR CHOICE BE ADDED TO DIJKSTRA'S CALCULUS?
M. Broy and G. Nelson.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 38. 1989.]
111662 A LOGIC OF AUTHENTICATION.
M. Burrows, M. Abadi, and R. Needham.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 39. 1989. "This report is a major extension of 'Authentication: a
Practical Study in Belief and Action,' which appeared in [the]
'Proceedings of the Second Conference on Theoretical Aspects of
Reasoning about Knowledge,' edited by Moshe Vardi and published by
Morgan Kaufmann, Los Altos, Calfornia, 1988."]
111663 IMPLEMENTING EXCEPTIONS IN C.
E. S. Roberts.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 40. 1989.]
111664 EVALUATING THE PERFORMANCE OF SOFTWARE CACHE COHERENCE.
S. Owicki and A. Agarwal.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 41. 1989.]
111665 WORKCREWS: AN ABSTRACTION FOR CONTROLLING PARALLELISM.
E. S. Roberts and M. T. Vandevoorde.
[Digital Equipment Corporation (DEC). Systems Research Center. Report
no. 42. 1989.]
111666 ALGORITHMS FOR THE POLAR DECOMPOSITION.
W. Gander.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 101. 1989.]
111667 RECURSIVE DATA TYPES AND REPORT ON THE MONA NOTATION FOR ALGORITHMS.
M. Odersky.
[Eidgenoessische Technische Hochschule Zuerich (ETH). Institut fuer
Informatik. Report no. 102. 1989. This report contains two papers by
Martin Odersky ("Recursive Data Types" and "Report on the Mona
Notation for Algorithms").]
111668 TREESPH: A UNIFICATION OF SPH WITH THE HIERARCHICAL TREE METHOD.
L. Hernquist and N. Katz.
[Institute for Advanced Study. Astrophysics preprint
IASSNS-AST-88/63. 1988.]
111669 VECTORIZATION OF TREE TRAVERSALS.
L. Hernquist.
[Institute for Advanced Study. Astrophysics preprint
IASSNS-AST-88/64. 1988.]
111670 THE PARADOX OF TREE CODES FOR GRAVITATIONAL N-BODY PROBLEMS.
J. E. Barnes.
[Institute for Advanced Study. Astrophysics preprint IASSNS-AST-89/6.
1989.]
111671 FAULT-TOLERANCE OF A NEURAL NETWORK SOLVING THE TRAVELING SALESMAN
PROBLEM.
P. Protzel, D. Palumbo, and M. Arras.
[Institute for Computer Applications in Science and Engineering
(ICASE). Interim report 89-12. 1989.]
111672 PARALLEL SOLUTION OF SPARSE ONE-DIMENSIONAL DYNAMIC PROGRAMMING
PROBLEMS.
D. M. Nicol.
[Institute for Computer Applications in Science and Engineering
(ICASE). Interim report 89-17. 1989.]
111673 AN APPLICATION OF THE PRINCIPLE OF MAXIMUM INFORMATION PRESERVATION
TO LINEAR SYSTEMS.
R. Linsker.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14195. 1988.]
111674 OVERVIEW OF A UNIFIED CALIBRATION TRIO FOR ROBOT EYE, EYE-TO-HAND,
AND HAND CALIBRATION USING 3D MACHINE VISION.
R. Y. Tsai and R. K. Lenz.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14218. 1988.]
111675 RELATIONSHIP BETWEEN S-BOUNDS AND ACTIVE ZONES IN CONSTRUCTIVE SOLID
GEOMETRY.
S. Cameron and J. R. Rossignac.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14246. 1988.]
111676 ANALYSIS OF A THREESHOLD POLICY FOR SCHEDULING READERS AND WRITERS.
A. Thomasian and V. Nicola.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14252. 1988.]
111677 CONTEXTS: DYNAMIC IDENTIFICATION OF COMMON PARAMETERS IN DISTRIBUTED
ANALYSIS OF COMPLEX DEVICES.
S. Addanki, R. Cremonini, and J. S. Penberthy.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14273. 1988.]
111678 A TECHNIQUE FOR FINDING THE FOOTPRINT SIZE OF A MIXTURE OF PROGRAMS.
K. S. Natarajan.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14278. 1988.]
111679 SYNTHESIS OF RANDOM PATTERN TESTABLE DESIGNS.
V. Iyengar and D. Brand.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14281. 1988.]
111680 DESIGN REPRESENTATION FOR THE SYNTHESIS OF BEHAVIORAL VHDL MODELS.
R. Camposano and R. M. Tabet.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14282. 1988.]
111681 ON THE USE OF MUTUAL INFORMATION FOR FEATURE SELECTION.
E. D. Karnin.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14411. 1988.]
111682 ON LINEAR DEPENDENCE RELATIONS FOR INTEGER TRANSLATES OF COMPACTLY
SUPPORTED DISTRIBUTIONS.
W. Dahmen, R. Q. Jia, and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14416. 1989.]
111683 COMMUNICATION-OPTIMAL MAINTENANCE OF DYNAMICAL TREES OR MEMORY HELPS
TO REDUCE COMMUNICATION.
B. Awerbuch, I. Cidon, and S. Kutten.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14420. 1988.]
111684 A TOOL FOR SUPPORTING APPROPRIATE PROGRAM UNDERSTANDING AND
MAINTENANCE.
L. Cleveland.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14426. 1989.]
111685 A COMPUTER MODEL OF SOME ASPECTS OF HUMAN BINOCULAR VISION.
R. Bonner.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14428. 1989.]
111686 ON THE N-WIDTH FOR WEIGHTED APPROXIMATION OF ENTIRE FUNCTIONS.
H. N. Mhaskar and C. A. Micchelli.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14430. 1989.]
111687 AUTOMATIC GENERATION OF NESTED, FORK-JOIN PARALLELISM.
M. Burke et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14433. 1989.]
111688 EXPERT OPERATOR: DEPLOYING YES/MVS II.
R. A. Chekaluk et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14437. 1989.]
111689 PARALLEL CALCULATIONS ON THE WIND-DRIVEN OCEANIC CIRCULATION USING
FOURIER PSEUDOSPECTRAL METHODS.
Z. D. Christidis.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14438. 1989.]
111690 MEMORY VERSUS RANDOMIZATION IN ON-LINE ALGORITHMS.
P. Raghavan and M. Snir.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14439. 1989. Draft paper: February 21,
1989.]
111691 QUALITATIVE REASONING IN THE COMMERCIAL LENDING DECISION: THE ROLE OF
NAIVE MATHEMATICS.
L. Braden-Harder, R. Bhaskar, and S. S. Murthy.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14441. 1988.]
111692 OPTIMAL PARTITIONING OF CACHE MEMORY.
H. S. Stone, J. L. Wolf, and J. Turek.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14444. 1989.]
111693 TAKING ARTIFACTS SERIOUSLY.
J. M. Carroll.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14452. 1988.]
111694 THE TF-1 PROCESSING ELEMENT.
M. Beakes et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14454. 1989.]
111695 EFFICIENT DELAUNAY TRIANGULATION USING RATIONAL ARITHETIC.
M. Karasick, D. Lieber, and L. R. Nackman.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14455. 1989.]
111696 PROCESS SEMANTICS: TESTING FOR DIFFERENCES.
V. Nguyen and R. Strom.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14456. 1989.]
111697 COMPUTER VIRUSES AND RELATED THREATS TO COMPUTER AND NETWORK
INTEGRITY.
D. M. Chess.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14460. 1989.]
111698 RECENT RESULTS IN HALFTONING FOR A 600 PEL-PER-INCH PRINTER.
G. Thompson, G. Goertzel, and F. Mintzer.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14464. 1989.]
111699 PICTURING RANDOMNESS ON A GRAPHIC SUPERCOMPUTER.
C. A. Pickover.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14468. 1989. "This article is number 40
in a forty part 'Mathematics and Beauty' series which emphasizes the
aesthetic side of mathematics and scientific visualization."]
111700 OPTIMAL TRADEOFFS FOR ADDITION ON SYSTOLIC ARRAYS.
A. Aggarwal, J. L. Carter, and S. R. Kosaraju.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14469. 1989.]
111701 A PROCESSING ELEMENT FOR MASSIVELY PARALLEL SCIENTIFIC SUPERCOMPUTERS
- WHEN, WHY, AND HOW.
M. Beakes et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14471. 1989.]
111702 SEGMENTATION OF GRAYTONE IMAGES BY SIMULATION OF HUMAN VISUAL SYSTEM
PROPERTIES.
A. A. Rodriguez.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14475. 1989.]
111703 DYNAMIC SOLID MODELLING OF FLEXIBLE AND BRITTLE OBJECTS.
A. Norton et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RC 14479. 1989.]
111704 ENDMARKERS CAN MAKE A DIFFERENCE.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6694. 1989.]
111705 COMPACT DISTRIBUTED DATA STRUCTURES FOR ADAPTIVE ROUTING.
B. Awerbuch et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6701. 1989.]
111706 ON THE COMPLEXITY OF RADIO COMMUNICATION.
N. Alon et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6702. 1989. "Extended abstract."]
111707 A DIVIDE-AND-CONQUER ALGORITHM FOR THE AUTOMATIC LAYOUT OF LARGE
DIRECTED GRAPHS.
E. B. Messinger, L. A. Rowe, and R. H. Henry.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6709. 1989.]
111708 ON THE COMPLEXITY OF EPISTEMIC REASONING.
M. Y. Vardi.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6717. 1989.]
111709 DYNAMIC FAULT-TOLERANT CLOCK SYNCHRONIZATION.
D. Dolev et al.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6722. 1989. "This is a revised version
of a paper entitled 'Fault-tolerant Clock Synchronization' which
appeared in [the] 'Proceedings of the 3rd ACM Symposium on the
Principles of Distributed Computing, 1984.'"]
111710 BALANCING EXTENSIONS VIA BRUNN-MINKOWSKI.
J. Kahn and N. Linial.
[International Business Machines Corporation (IBM). Research
Division. Research report RJ 6723. 1989.]
111711 MEASURED PERFORMANCE OF TRANSPORT SERVICE IN LANS.
L. Svobodova.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1799. 1989.]
111712 INCLUDING A QUEUE IN A FORMAL-DESCRIPTION-DRIVEN PROTOCOL PERFORMANCE
ANALYSIS.
J. Gustafsson and H. Rudin.
[International Business Machines Corporation (IBM). Research
Division. Research report RZ 1800. 1989.]
041810 USING THE GAUSSIAN IMAGE TO FIND THE ORIENTATION OF OBJECTS.
P. Brou.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 810. 1984.]
041945 OFFICES ARE OPEN SYSTEMS.
C. E. Hewitt.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 945. 1987.]
041952 PARALLEL SOLUTIONS TO GEOMETRIC PROBLEMS ON THE SCAN MODEL OF
COMPUTATION.
G. E. Blelloch and J. L. Little.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 952. 1988.]
042008 SOFTWARE STRUCTURING PRINCIPLES FOR VLSI CAD.
J. Katzenelson and R. Zippel.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1008. 1987.]
042017 PATTERN-DIRECTED INVOCATION WITH CHANGING EQUALITIES.
Y. A. Feldman and C. Rich.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1017. 1988.]
042019 THE COMBINATORICS OF OBJECT RECOGNITION IN CLUTTERED ENVIRONMENTS
USING CONSTRAINED SEARCH.
W. E. L. Grimson.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1019. 1988.]
042021 A DEXTERITY MEASURE FOR THE KINEMATIC CONTROL OF ROBOT MANIPULATOR
WITH REDUNDANCY.
P. H. Chang.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1021. 1988.]
042026A DEMYSTIFYING QUANTUM MECHANICS - A SIMPLE UNIVERSE WITH QUANTUM
UNCERTAINTY.
G. L. Drescher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1026a. 1988. Revised: December 1988.]
042044 ON THE SENSITIVITY OF THE HOUGH TRANSFORM FOR OBJECT RECOGNITION.
W. E. L. Grimson and D. P. Huttenlocher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1044. 1988.]
042050 WHAT ARE PLANS FOR?
P. E. Agre and D. Chapman.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A. I. memo 1050. 1988.]
042070 AN OPERATING ENVIRONMENT FOR THE JELLYBEAN MACHINE.
B. K. Totty.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1070. 1988. Thesis (B.S.).]
042071 PARALLEL NETWORKS FOR MACHINE VISION.
B. K. P. Horn.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1071. 1988.]
042073 SEEING "GHOST" SOLUTIONS IN STEREO VISION.
D. Weinshall.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1073. 1988. Also issued as C.B.I.P. memo 33,
Center for Biological Information Processing, Whitaker College.]
042078 AN OPTIMAL SCALE FOR EDGE DETECTION.
D. Geiger and T. Poggio.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1078. 1988.]
042091 A ROBOT THAT WALKS: EMERGENT BEHAVIORS FROM A CAREFULLY EVOLVED
NETWORK.
R. A. Brooks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1091. 1989.]
042094 INTELLIGENCE IN SCIENTIFIC COMPUTING.
H. Abelson et al.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1094. 1988.]
042096 USING ENGLISH FOR INDEXING AND RETRIEVING.
B. Katz.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1096. 1988. "A shorter version of this paper
appears in the 'Proceedings of the Conference on User-oriented
Content-based Text and Image Handling, RIAO '88.'"]
042100 INTELLIGENT ASSISTANCE FOR PROGRAM RECOGNITION, DESIGN, OPTIMIZATION,
AND DEBUGGING.
C. Rich and R. C. Waters.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. A.I. memo 1100. 1989.]
042022 ANALYSIS AND CONTROL OF ROBOT MANIPULATORS WITH KINEMATIC REDUNDANCY.
P. H. Chang.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1022. 1988. Thesis (Ph.D.).]
042023 THE USE OF GROUPING IN VISUAL OBJECT RECOGNITION.
D. W. Jacobs.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1023. 1988. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science, January, 1988, in partial
fulfillment of the requirements for the degree of Master of
Science."]
042031 AUTOMATIC QUALITATIVE ANALYSIS OF ORDINARY DIFFERENTIAL EQUATIONS
USING PIECEWISE LINEAR APPROXIMATIONS.
E. P. Sacks.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1031. 1988. Thesis (Ph.D.). Also issued
as MIT/LCS/TR-416, Laboratory for Computer Science, Massachusetts
Institute of Technology.]
042036 HEURISTICS FOR JOB-SHOP SCHEDULING.
K. A. Pasch.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1036. 1988. Thesis (D.Sci.).]
042043 COMPUTATION AND PRE-PARAMETRIC DESIGN.
K. T. Ulrich.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1043. 1988. Thesis (D.Sci.). "This
technical report is a revised version" of a thesis "submitted to the
Department of Mechanical Engineering on July 29, 1988, in partial
fulfillment of the requirements for the degree of Doctor of Science
in Mechanical Engineering."]
042045 THREE-DIMENSIONAL RECOGNITION OF SOLID OBJECTS FROM A TWO-DIMENSIONAL
IMAGE.
D. P. Huttenlocher.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1045. 1988. Thesis (Ph.D.).]
042048 COMBINING ASSOCIATIONAL AND CAUSAL REASONING TO SOLVE INTERPRETATION
AND PLANNING PROBLEMS.
R. G. Simmons.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1048. 1988. Thesis (Ph.D.). "This report
is a revised version of a thesis submitted to the Department of
Electrical Engineering and Computer Science on May 10, 1988 in
partial fulfillment of the requirement for the degree of Doctor of
Philosophy."]
042051 TEST GENERATION GUIDED DESIGN FOR TESTABILITY.
P. Wu.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1051. 1988. Thesis (M.S.).]
042052 GENERALIZING ON MULTIPLE GROUNDS: PERFORMANCE LEARNING IN MODEL-BASED
TROUBLESHOOTING.
P. Resnick.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1052. 1988. Thesis (M.S.). "Revised
version of a thesis submitted to the Department of Electrical
Engineering and Computer Science in May 1988 in partial fulfillment
of the requirements for the degree of Master of Science in Computer
Science."]
042080 A CONCURRENT SMALLTALK COMPILER FOR THE MESSAGE-DRIVEN PROCESSOR.
W. Horwat.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1080. 1988. Thesis (B.S.).]
042085 THE DYNAMIC STRUCTURE OF EVERYDAY LIFE.
P. E. Agre.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1085. 1988. Thesis (Ph.D.).]
042092 THE ROLE OF KNOWLEDGE IN VISUAL SHAPE RECOGNITION.
E. Saund.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1092. 1988. Thesis (Ph.D.).]
042099 GENERATING CIRCUIT TESTS BY EXPLOITING DESIGNED BEHAVIOR.
M. H. Shirley.
[Massachusetts Institute of Technology. Artificial Intelligence
Laboratory. Technical report 1099. 1988. Thesis (Ph.D.).]
099091 A SYNERGISTIC COMBINATION OF TEST GENERATION AND DESIGN FOR
-497 TESTABILITY.
M. Shirley et al.
[1988.]
099091 THE ORGANIZATION OF PERMUTATION ARCHITECTURES WITH BUSSED
-500 INTERCONNECTIONS.
J. Kilian, S. Kipnis, and C. E. Leiserson.
[1989.]
099091 A FAST TRANSLATION METHOD FOR PAGING ON TOP OF SEGMENTATION.
-502 W. J. Dally.
[1989.]
099091 VLSI PROCESSOR DESIGN FOR COMMUNICATION NETWORKS.
-504 J. A. Fried.
[n.d. Thesis (M.S.). "Submitted to the Department of Electrical
Engineering and Computer Science in partial fulfillment of the
requirements of the degrees of Electrical Engineer and Master of
Science...at the Massachusetts Institute of Technology, January 26,
1989."]
099091 HDTV, DIGITAL COMMUNICATIONS, AND COMPETITIVENESS: IMPLICATIONS FOR
-506 U.S. HIGH TECHNOLOGY POLICY.
C. H. Ferguson.
[1989.]
099091 A FAST MULTIPOLE ALGORITHM FOR CAPACITANCE EXTRACTION OF COMPLEX 3-D
-508 GEOMETRIES.
K. Nabors and J. K. White.
[1989.]
111713 PREORDER HEAPSORT.
H. W. Leong.
[National University of Singapore. Department of Information Systems
and Computer Science. TRA1/89. 1989.]
111714 TRIANGLES IN SPACE OR BUILDING (AND ANALYZING) CASTLES IN THE AIR.
B. Aronov and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 407. 1988. "A
preliminary version of this paper has...appeared in [the] 'Proc. [of
the] 4th ACM Symp. on Computational Geometry,' Urbana, Illinois,
1988." Also issued as Robotics research 175, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
111715 FUZZY DISK MODELING AND RENDERING OF TEXTURED COMPLEX 3D SURFACES OF
REAL OBJECTS.
X. D. Yang.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 414. 1988. Thesis
(Ph.D.). Also issued as Robotics research 180, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
111716 THE COMPLEXITY OF MANY CELLS IN ARRANGEMENTS OF PLANES AND RELATED
PROBLEMS.
H. Edelsbrunner, L. J. Guibas, and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 418. 1988. "An abstract
of this paper has appeared in the 'Proc. of the 13th International
Mathematical Programming Symposium,' Tokyo, Japan, 1988." Also issued
as Robotics research 184, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111717 EFFICIENT MOTION PLANNING FOR AN L-SHAPED OBJECT.
D. Halperin, M. H. Overmars, and M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 419. 1988. Also issued
as Robotics research 185, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111718 ON-LINE MOTION PLANNING: CASE OF A PLANAR ROD.
J. Cox and C.-K. Yap.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 425. 1988. Also issued
as Robotics research 187, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111719 A NOTE ON THE PAPADIMITRIOU-SILVERBERG ALGORITHM FOR PLANNING OPTIMAL
PIECEWISE-LINEAR MOTION OF A LADDER.
M. Sharir.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 426. 1989. Also issued
as Robotics research 188, Robotics Research, Computer Science
Division, Courant Institute of Mathematical Sciences, New York
University.]
111720 COMBINATORIAL AND ALGORITHMIC ANALYSIS OF SPACE DECOMPOSITION
PROBLEMS.
B. Aronov.
[New York University. Courant Institute of Mathematical Sciences.
Computer Science Department. Technical report 429. 1989. Thesis
(Ph.D.). Also issued as Robotics research 189, Robotics Research,
Computer Science Division, Courant Institute of Mathematical
Sciences, New York University.]
111721 OPTIMAL ITERATIVE REFINEMENT METHODS.
O. Widlund.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 146. 1988. "The
initial version of this paper was submitted as...[the
author's]...Master's Thesis."]
111722 SIMD ALGORITHMS FOR 2-D ARRAYS IN SHUFFLE NETWORKS.
Y. Ben-Asher, D. Egozi, and A. Schuster.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 147. 1988.]
111723 EFFICIENT SYNCHRONIZATION ALGORITHMS USING FETCH & ADD ON MULTIPLE
BITFIELD INTEGERS.
E. Freudenthal and O. Peze.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 148. 1988.]
111724 ON-THE-FLY DETECTION OF ACCESS ANOMALIES.
E. Schonberg.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 149. 1988.]
111725 PARALLEL QUEUES AND POOLS, AN EVALUATION.
D. Wood.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 150. 1989.]
111726 A CACHE TECHNIQUE FOR SYNCHRONIZATION VARIABLES IN HIGHLY PARALLEL,
SHARED MEMORY SYSTEMS.
W. Berke.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 151. 1988.]
111727 ULTRACOMPUTER PACKAGING AND PROTOTYPES.
R. Bianchini.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 152. 1989.]
111728 MODELS FOR QUEUE LENGTH IN CLOCKED QUEUEING NETWORKS.
O. E. Percus and J. K. Percus.
[New York University. Courant Institute of Mathematical Sciences.
Ultracomputer Research Laboratory. Ultracomputer note 153. 1989.]
111729 COMPUTING THE GCD OF TWO POLYNOMIALS OVER AN ALGEBRAIC NUMBER FIELD.
L. Langemyr.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8804. 1989.]
111730 DIRECT MANIPULATION OF INTEGRATED DOCUMENTS: AN APPROACH TO
INTERACTIVELY MANIPULATE SPATIAL RELATIONSHIPS BASED ON CONSTRAINT
PROGRAMMING TECHNIQUES.
J. Li.
[Royal Institute of Technology, Stockholm. Department of Numerical
Analysis and Computing Science. TRITA-NA-8901. 1989.]
048087 EPISODIC MONITORING OF TIME-ORIENTED DATA FOR HEURISTIC SKELETAL-PLAN
-70 REFINEMENT.
S. W. Tu et al.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL 87-70. August 1988.]
048088 VALIDATING THE KNOWLEDGE BASE OF A THERAPY-PLANNING SYSTEM.
-70 M. A. Shwe, S. W. Tu, and Fagan. L. M..
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-88-70. October 1988.]
048089 REVIEW OF THE UNCERTAINTY IN AI WORKSHOPS.
-13 H. P. Lehmann.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-13. March 1989.]
048089 DESIGN AND PERFORMANCE EVALUATION OF A PARALLEL REPORT INTEGRATION
-16 SYSTEM.
N. P. Saraiya, B. A. Delagi, and S. Nishimura.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-16. April 1989. "A condensed version of
this paper was presented [under the title: 'ELINT in LAMINA:
Application of a Concurrent Object Language'] to the 1988 SIGPLAN
Workshop on Object-Based Concurrent Programming" and published in
"SIGPLAN Notices," v.24, no. 4 (April 1989), pp.194-196.]
048089 AN EMPIRICAL EVALUATION OF A RANDOMIZED ALGORITHM FOR PROBABILISTIC
-31 INFERENCE.
R. M. Chavez and G. F. Cooper.
[Stanford University. Department of Computer Science. Knowledge
Systems Laboratory. KSL-89-31. April 1989.]
111731 ALGORITHMIC ASPECTS OF INTUITIONISTIC PROPOSITIONAL LOGIC.
T. Franzen.
[Swedish Institute of Computer Science. Research report R87010B.
1987.]
111732 LOGIC PROGRAMMING AND THE INTUITIONISTIC SEQUENT CALCULUS.
T. Franzen.
[Swedish Institute of Computer Science. Research report R88002. 1988.]
111733 REASONING ABOUT PROCEDURAL PROGRAMS IN A CHESS ENDING.
M. Rayner and A. Hugosson.
[Swedish Institute of Computer Science. Research report R88003. 1988.]
111734 AN IMPLEMENTATION TECHNIQUE FOR THE ABSTRACT INTERPRETATION OF PROLOG.
A. Waern.
[Swedish Institute of Computer Science. Research report R88004. 1988.]
111735 A PROOF-THEORETIC APPROACH TO LOGIC PROGRAMMING. I. GENERALIZED HORN
CLAUSES.
L. Hallnaes and P. Schroder-Heister.
[Swedish Institute of Computer Science. Research report R88005. 1988.]
111736 A HIGHER ORDER LOGIC PARSER FOR NATURAL LANGUAGE IMPLEMENTED IN
LAMBDA PROLOG.
P. Kreuger.
[Swedish Institute of Computer Science. Research report R88008. 1988.]
111737 ON THE APPLICABILITY OF DEFAULT LOGIC: TWO SHORT PAPERS.
M. Rayner.
[Swedish Institute of Computer Science. Research report R88009. 1988.
Part I: Logic programming and the frame problem. Part 2: Yoav Shoham
and default logic.]
111738 OR PARALLEL EXECUTION OF HORN CLAUSE PROGRAMS BASED ON WAM AND SHARED
CONTROL INFORMATION.
K. A. M. Ali.
[Swedish Institute of Computer Science. Research report R88010. 1988.]
111739 OR PARALLEL EXECUTION OF PROLOG ON BC-MACHINE.
K. A. M. Ali.
[Swedish Institute of Computer Science. Research report R88011B.
1988.]
111740 A PROGRAMMING CALCULUS BASED ON PARTIAL INDUCTIVE DEFINITIONS, WITH
AN INTRODUCTION TO THE THEORY OF PARTIAL INDUCTIVE DEFINITIONS.
L.-H. Eriksson and L. Hallnaes.
[Swedish Institute of Computer Science. Research report R88013. 1988.]
111741 GCLA: GENERALIZED HORN CLAUSES AS A PROGRAMMING LANGUAGE.
M. Aronsson and L. Hallnaes.
[Swedish Institute of Computer Science. Research report R88014. 1988.]
111742 AN APPROACH TO HANDLING POLYMORPHIC TYPES IN HIGHER ORDER UNIFICATION.
P. Kreuger.
[Swedish Institute of Computer Science. Research report R88015. 1988.]
111743 A FULLY ABSTRACT TRACE MODEL FOR DATAFLOW NETWORKS.
B. Jonsson.
[Swedish Institute of Computer Science. Research report R88016. 1988.
"This research report is a revised version of a paper that
...[appeared]... under the same title in the 'Proceedings of the 16th
Annual ACM Symposium on Principles of Programming Languages, Austin,
Texas, January 1989.'"]
111744 AN INVESTIGATION OF AN OR PARALLEL EXECUTION MODEL FOR HORN CLAUSE
PROGRAMS.
K. A. M. Ali and M. Wong.
[Swedish Institute of Computer Science. Research report R88017. 1988.]
111745 VERIFYING SAFETY AND DEADLOCK PROPERTIES OF NETWORKS OF
ASYNCHRONOUSLY COMMUNICATING PROCESSES.
F. Orava.
[Swedish Institute of Computer Science. Research report R88020. 1988.]
111746 DFS TREE CONSTRUCTION: ALGORITHMS AND CHARACTERIZATIONS.
E. Korach and Z. Ostfeld.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 515. 1988. Extended version of [TECHION
Department of Computer Science] technical report 470.]
111747 LOGIC PROGRAMS AND A NEW APPROACH TO PARALLELISM.
O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 516. 1988.]
111748 INITIAL FAILURES IN DISTRIBUTED COMPUTATIONS.
G. Taubenfeld, S. Katz, and S. Moran.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 517. 1988.]
111749 UPP GRAPHS AND UMFA NETWORKS - ARCHITECTURE FOR PARALLEL SYSTEMS.
D. Goldfeld and T. Etzion.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 518. 1988.]
111750 LACK OF GLOBAL CLOCK DOES NOT SLOW DOWN THE COMPUTATION IN
DISTRIBUTED NETWORKS.
S. Even and S. Rajsbaum.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 522. 1988.]
111751 WHY A SINGLE PARALLELIZATION STRATEGY IS NOT ENOUGH IN KNOWLEDGE
BASES.
S. Cohen and O. Wolfson.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 523. n.d.]
111752 THE DISTRIBUTED BIT COMPLEXITY OF THE RING: FROM THE ANONYMOUS TO THE
NON-ANONYMOUS CASE.
H. L. Bodlaender, S. Moran, and M. F. Warmuth.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 525. 1988.]
111753 CONNECTIONS BETWEEN TWO CYCLES - A NEW DESIGN OF DENSE PROCESSOR
INTERCONNECTION NETWORKS.
R. Bar-Yehuda and T. Etzion.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 528. 1988.]
111754 TOWARDS A THEORY OF AVERAGE CASE COMPLEXITY (A SURVEY).
O. Goldreich.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 531. 1988. Revised version of [TECHNION
Department of Computer Science] technical report 507. March 1988.
Revised: July 1988.]
111755 NET-BASED MODELING OF COMMUNICATING PARALLEL PROCESSES WITH
APPLICATIONS TO VLSI DESIGN.
I. Reicher and M. Yoeli.
[TECHNION - Israel Institute of Technology. Department of Computer
Science. Technical report 532. 1988.]
111756 PERSONAL MODELS OF RATIONALITY.
D. Michie.
[Turing Institute. TIRM-88-035. 1989.]
111757 A DISCRETE APPROACH TO SIGNAL MATCHING.
Z. P. Jin and P. Mowforth.
[Turing Institute. TIRM-89-036. 1989.]
111758 MULTIPLE SPLITTING OF NUMERICAL VARIABLES IN INDUCTIVE LEARNING.
A. T. Hooke.
[Turing Institute. TIRM-89-037. 1989.]
111759 A PROTOTYPE FOR INTERACTIVE INPUT OF CURSIVE INFORMATION.
P. J. Pobgee.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 125/88. 1988.]
111760 SEGMENTATION AND REDUCTION ANALYSIS FOR CURSIVE SCRIPT RECOGNITION.
D. M. Ford and H. J. Symm.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 131/88. 1988.]
111761 THE NPL ELECTRONIC PAPER PROJECT.
E. R. Brocklehurst.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 133/88. 1988.]
111762 EPT, A DYNAMIC TUTORIAL FOR INTRODUCING USERS TO ELECTRONIC PAPER.
P. J. Pobgee.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 134/88. 1988.]
111763 INSECURITIES IN THE ADA PROGRAMMING LANGUAGE.
B. A. Wichmann.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 137/89. 1989.]
111764 EXPERIENCE WITH A COMPILER TESTING TOOL.
B. A. Wichmann and M. Davies.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 138/89. 1989.]
111765 APPRAISAL OF SECURITY OF DATA HANDLING SYSTEMS AND PRODUCTS - A
TUTORIAL AND DISCUSSION DOCUMENT.
W. L. Price.
[U.K. National Physical Laboratory (NPL). Division of Information
Technology & Computing. DITC 141/89. 1989.]
111766 UNTERSUCHUNG DIFFERENTIELLER ANSAETZE ZUR SCHAETZUNG DES OPTISCHEN
FLUSSES IN GRAUWERT- UND FARBBILDFOLGEN.
R. Sprengel.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 137. 1988.]
111767 UNTERSUCHUNGEN ZUR DETEKTION VON KANTEN IN DIGITALEN FARBBILDERN.
C. Drewniok.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 138. 1988.]
111768 SCHALTUNGSENTWUERFE AM FB INFORMATIK DER UNIVERSITAET HAMBURG
1986-1987.
R. Buschke.
[Universitaet Hamburg. Fachbereich Informatik. Report no. 139. 1988.]
111769 MOTIVATING THE NOTION OF GENERIC DESIGN WITHIN INFORMATION PROCESSING
THEORY: THE DESIGN PROBLEM SPACE.
V. Goel and P. Pirolli.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 56.
1989.]
111770 FUZZY LOGIC.
L. A. Zadeh.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 57.
1989.]
111771 TRANSCRIPTION AND THE NEW FUNCTIONALISM: A COUNTERPROPOSAL TO
CHILDES' CHAT CONVENTION.
J. A. Edwards.
[University of California, Berkeley. Institute of Cognitive Studies.
Cognitive Science Program. Berkeley cognitive science report 58.
1989.]
111772 STREAM DATA ANALYSIS IN PROLOG.
D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-890004. 1989.]
111773 STREAM PROCESSING: AN EFFECTIVE WAY TO INTEGRATE AI AND DBMS.
D. S. Parker.
[University of California, Los Angeles. Computer Science Department.
CSD-890005. 1989.]
111774 A COMPARISON OF CONTINUOUS AND DISCRETE LEARNING THROUGH A GEOMETRIC
REPRESENTATION.
J. C. Pemberton.
[University of California, Los Angeles. Computer Science Department.
CSD-890006. 1989. Thesis (M.S.).]
111775 STATISTICAL RULES: A NOTION OF DATABASE ABSTRACT AND ITS ROLE IN
QUERY PROCESSING.
C.-D. Shum and R. R. Muntz.
[University of California, Los Angeles. Computer Science Department.
CSD-890007. 1989.]
111776 3-WAY HASH JOIN QUERY PROCESSING IN DISTRIBUTED RELATIONAL DATABASE
SYSTEMS.
S. E. Spetka and G. J. Popek.
[University of California, Los Angeles. Computer Science Department.
CSD-890008. 1989.]
111777 SUPPORT FOR FAULT TOLERANCE IN VLSI PROCESORS.
M. Tremblay and Y. Tamir.
[University of California, Los Angeles. Computer Science Department.
CSD-890009. 1989.]
111778 PERFORMANCE MODELING OF CONCURRENCY CONTROL.
F. Mehovic.
[University of California, Los Angeles. Computer Science Department.
CSD-890011. 1989. Thesis (Ph.D.).]
111779 AN OBJECT-ORIENTED MODELING ENVIRONMENT.
T. W. Page Jr. et al.
[University of California, Los Angeles. Computer Science Department.
CSD-890012. 1989.]
111780 RADIX-4 SQUARE ROOT WITHOUT INITIAL PLA.
M. D. Ercegovac and T. Lang.
[University of California, Los Angeles. Computer Science Department.
CSD-890013. 1989.]
111781 DIRECTLY MANIPULATING DATA: AN IMPLEMENTATION STUDY OF DIRECT CONTROL.
D. Owen.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8801. 1988.]
111782 THE LEARNING AND PLANNING OF ACTION.
Y. Miyata.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8802. 1988.]
111783 THE PERCEPTION OF MULTIPLE OBJECTS: A PARALLEL DISTRIBUTED PROCESSING
APPROACH.
M. C. Mozer.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8803. 1988.]
111784 THE TECHNOLOGY OF TEAM NAVIGATION.
E. Hutchins.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8804. 1988.]
111785 A LEARNING ALGORITHM FOR CONTINUALLY RUNNING FULLY RECURRENT NEURAL
NETWORKS.
R. J. Williams and D. Zipser.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8805. 1988.]
111786 COGNITIVE AND ECOLOGICAL APPROACHES TO PERCEPTION.
W. W. Gaver.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8806. 1988.]
111787 DYNAMIC NODE CREATION IN BACKPROPAGATION NETWORKS.
T. Ash.
[University of California, San Diego. Institute for Cognitive
Science. Report no. 8901. 1989.]
111788 INTRODUCING A PRIORITY OPERATOR TO CCS.
J. Cammilleri.
[University of Cambridge. Computer Laboratory. Technical report 157.
1989.]
111789 TAILORING OUTPUT TO THE USER: WHAT DOES USER MODELLING IN GENERATION
MEAN?
K. S. Jones.
[University of Cambridge. Computer Laboratory. Technical report 158.
1989.]
111790 NON-TRIVIAL POWER TYPES CAN'T BE SUBTYPES OF POLYMORPHIC TYPES.
A. M. Pitts.
[University of Cambridge. Computer Laboratory. Technical report 159.
1989.]
111791 PFL+: A KERNEL SCHEME FOR FUNCTIONAL I/O.
A. Gordon.
[University of Cambridge. Computer Laboratory. Technical report 160.
1989.]
111792 PAPERS ON POLY/ML.
D. C. J. Matthews.
[University of Cambridge. Computer Laboratory. Technical report 161.
1989.]
111793 HOW TO BREED HYBRID COMPILER/INTERPRETERS.
A. D. Gordon.
[University of Edinburgh. Department of Computer Science. Laboratory
for Foundations of Computer Science. ECS-LFCS-88-50. 1988. Also
issued as CSR-262-88, Department of Computer Science, University of
Edinburgh.]
111794 AN EVALUATION OF CRAY-1 AND CRAY X-MP PERFORMANCE ON VECTORIZABLE
LIVERMORE FORTRAN LOOPS.
J. Tang and E. S. Davidson.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 785. 1988.]
111795 A MULTIPROCESSOR CACHE PERFORMANCE METRIC.
D. M. Marcovitz.
[University of Illinois, Urbana-Champaign. Center for Supercomputing
Research and Development. Report no. 813. 1988. Thesis (M.S.).]
111796 THE SME USER'S MANUAL (SME VERSION 2E).
B. Falkenhainer.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-88-1421. 1988.]
111797 ANALYSIS OF BACKTRACKING ROUTING IN BINARY HYPERCUBE COMPUTERS.
D. C. Grunwald and D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1486. 1989. Also issued as TTR9, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111798 PRIORITY CONTROLLED INCREMENTAL ATTRIBUTIVE EVALUATION IN ATTRIBUTED
GRAPH GRAMMARS.
S. M. Kaplan and S. K. Goering.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1496. 1989.]
111799 DERIVATION OF UNIX PROGRAMS USING ANALOGY.
S. Bhansali.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1497. 1989. Thesis (M.S.).]
111800 INSTRUMENTING DISTRIBUTED MEMORY PARALLEL SYSTEMS: A REPORT.
D. A. Reed.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1501. 1989. Also issued as TTR10, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111801 MODELLING OF SEMICONDUCTORS SUBJECT TO PRESCRIBED CURRENTS.
T. Kerkhoven.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1502. 1989.]
111802 A NEW RESPONSIVE DISTRIBUTED SHORTEST-PATH ROUTING ALGORITHM.
B. Rajagopalan and M. Faiman.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1503. 1989.]
111803 AN INTEGRATED PERFORMANCE DATA COLLECTION, ANALYSIS, AND
VISUALIZATION SYSTEM.
A. D. Malony et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1504. 1989. Also issued as TTR11, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111804 DIFFERENTIAL ALGEBRAIC EQUATIONS, INDICES, AND INTEGRAL ALGEBRAIC
EQUATIONS.
C. W. Gear.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1505. 1989.]
111805 A CLASS HIERARCHY FOR BUILDING STREAM-ORIENTED FILE SYSTEMS.
P. W. Madany et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1507. 1989. Also issued as TTR12, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111806 AUTOMATED PROCESSING OF NARRATIVES WRITTEN BY BILINGUAL STUDENTS: THE
BILING PROGRAM.
L. Iwanska.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1508. 1989.]
111807 VIRTUAL MEMORY AND BACKING STORAGE MANAGEMENT IN MULTIPROCESSOR
OPERATING SYSTEMS USING OBJECT-ORIENTED DESIGN TECHNIQUES.
V. F. Russo and R. H. Campbell.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1509. 1989. Also issued as TTR89-13, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111808 PRINCIPLES OF OBJECT-ORIENTED OPERATING SYSTEM DESIGN.
R. H. Campbell et al.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1510. 1989. Also issued as TTR89-14, TAPESTRY
Project, Department of Computer Science, University of Illinois,
Urbana-Champaign.]
111809 DYNAMIC PRIORITY CEILINGS: A CONCURRENCY CONTROL PROTOCOL FOR
REAL-TIME SYSTEMS.
M.-I. Chen and K.-J. Lin.
[University of Illinois, Urbana-Champaign. Department of Computer
Science. UIUCDCS-R-89-1511. 1989.]
111810 ON HOW TO MOVE MOUNTAINS "ASSOCIATIVELY AND COMMUTATIVELY."
M. Lai.
[University of London. Department of Computer Science. CSD-TR-607.
1989.]
111811 POLYNOMIAL METHODS FOR STRUCTURE FROM MOTION.
C. Jerian and R. Jain.
[University of Michigan. Department of Electrical Engineering and
Computer Science. Computer Science and Engineering Division.
CSE-TR-03-88. 1988.]
111812 A LINEAR APPROACH TO UPDATING IN LOGIC-BASED MODELS OF MANUFACTURING
SYSTEMS AND OTHER DISCRETE-EVENT SYSTEMS.
A. W. Naylor and M. B. Shademhr.
[University of Michigan. Department of Electrical Engineering and
Computer Science. Computer Science and Engineering Division.
CSE-TR-11-89. 1989.]
111813 ROBUST SURFACE APPROXIMATION USING LEAST MEDIAN SQUARES REGRESSION.
A. Tirumalai and B. G. Schunck.
[University of Michigan. Department of Electrical Engineering and
Computer Science. Computer Science and Engineering Division.
CSE-TR-13-89. 1989.]
111814 LINGUISTIC SUPPORT FOR DATAFLOW.
C. V. Ravishankar and R. A. Finkel.
[University of Michigan. Department of Electrical Engineering and
Computer Science. Computer Science and Engineering Division.
CSE-TR-14-89. 1989.]
111815 TIME, SPACE, AND FORM IN VISION.
J. A. Feldman.
[University of Rochester. Department of Computer Science. TR 244.
1988.]
111816 ANALYSIS OF RECURRENT BACKPROPAGATION.
P. Y. Simard, M. B. Ottaway, and D. H. Ballard.
[University of Rochester. Department of Computer Science. TR 253.
1988.]
111817 A FORMAL APPROACH TO PLANNING WITH CONCURRENT ACTIONS AND EXTERNAL
EVENTS.
R. N. Pelavin.
[University of Rochester. Department of Computer Science. TR 254.
1988. Thesis (Ph.D.).]
111818 PARALLELISM AND DOMAIN DEPENDENCE IN CONSTRAINT SATISFACTION.
P. R. Cooper and M. J. Swain.
[University of Rochester. Department of Computer Science. TR 255.
1988.]
111819 THE ROCHESTER ROBOT.
D. H. Ballard et al.
[University of Rochester. Department of Computer Science. TR 257.
1988. Editor: Christopher M. Brown.]
111820 THE THEORY AND PRACTICE OF BAYESIAN IMAGE LABELING.
P. B.-L. Chou.
[University of Rochester. Department of Computer Science. TR 258.
1988. Thesis (Ph.D.).]
111821 ON LANGUAGE INSTANCE CONSTRUCTORS AND GENERATORS.
L. A. Sanchis.
[University of Rochester. Department of Computer Science. TR 260.
1988.]
111822 LEXICAL ANALYSIS ON A MODERATELY SIZED MULTIPROCESSOR.
J. R. Low.
[University of Rochester. Department of Computer Science. TR 261.
1988.]
111823 AN OVERVIEW OF PLATINUM: A PLATFORM FOR INVESTIGATING NON-UNIFORM
MEMORY.
R. J. Fowler and A. L. Cox.
[University of Rochester. Department of Computer Science. TR 262.
1988. Preliminary version: November 1988.]
111824 REAL-TIME VERGENCE CONTROL.
T. J. Olson and R. D. Potter.
[University of Rochester. Department of Computer Science. TR 264.
1988.]
111825 LOCAL PROPAGATION AS A CONSTRAINT SATISFACTION TECHNIQUE.
J. Mulac and D. Baldwin.
[University of Rochester. Department of Computer Science. TR 265.
1989.]
111826 MILKING THE AANDERAA ARGUMENT.
R. Paturi et al.
[University of Rochester. Department of Computer Science. TR 266.
1988.]
111827 IN DEFENSE OF INTERVALS.
H. E. Kyburg Jr.
[University of Rochester. Department of Computer Science. TR 268.
1988.]
111828 A NOTE ON ALMOST-EVERYWHERE-COMPLEX SETS AND SEPARATING
DETERMINISTIC-TIME-COMPLEXITY CLASSES.
J. G. Geske, D. T. Huynh, and J. I. Seiferas.
[University of Rochester. Department of Computer Science. TR 270.
1989.]
111829 TRANSPARENCY IN DISTRIBUTED FILE SYSTEMS.
Floyd. R. A..
[University of Rochester. Department of Computer Science. TR 272.
1989. Thesis (Ph.D.).]
111830 MACHINE-INDEPENDENT COMPLEXITY THEORY.
J. I. Seiferas.
[University of Rochester. Department of Computer Science. TR 273.
1989.]
111831 ON THE POWER OF PROBABILISTIC POLYNOMIAL TIME: P SUPERSCRIPT NP[LOG]
IS INCLUDED IN PP.
R. Beigel, L. A. Hemachandra, and G. Wechsung.
[University of Rochester. Department of Computer Science. TR 275.
1989. "This report expands and supersedes" Columbia University
Department of Computer Science technical report CUCS-372-88, a report
of the same title by Lane A. Hemachandra and Gerd Wechsung. "This
report will appear in contracted form in" the 'Proceedings of the 4th
Structure in Complexity Theory Conference,' IEEE Computer Society
Press, 1989.]
111832 CONGESTION CONTROL IN SHARED MEMORY MULTIPROCESSOR SYSTEMS.
W. S. Ho.
[University of Saskatchewan. Department of Computational Science.
Research report 89-1. 1989. Thesis (M.S.).]
111833 A NEW EXPLANATION OF THE GLITCH PHENOMENON.
J. H. Anderson and M. G. Gouda.
[University of Texas, Austin. Department of Computer Sciences.
TR-88-23. 1989. June 1988. Revised: March 1989.]
111834 ILLUMINATION NETWORKS: FAST REALISTIC RENDERING WITH ARBITRARY
REFLECTANCE FUNCTIONS.
C. Buckalew and D. Fussell.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-01. 1989.]
111835 BLOCK ACKNOWLEDGEMENT: REDESIGNING THE WINDOW PROTOCOL.
G. M. Brown, M. G. Gouda, and R. E. Miller.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-02. 1989.]
111836 TOPOLOGICAL TESTING.
M. Malek, A. Mourad, and M. Pandya.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-03. 1989.]
111837 DISTRIBUTED FILE SYSTEMS: CONCEPTS AND EXAMPLES.
E. Levy and A. Silberschatz.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-04. 1989.]
111838 A FRAMEWORK FOR PARALLEL PROCESSING OF DATALOG QUERIES.
S. Ganguly, A. Silberschatz, and S. Tsur.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-05. 1989.]
111839 A HYBRID ALGORITHM TECHNIQUE.
M. Malek et al.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-06. 1989.]
111840 A SYSTOLIC PROGRAM FOR GAUSS-JORDAN ELIMINATION.
D. Hudson and C. Lengauer.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-07. 1989.]
111841 MECHANICAL THEOREM PROVING IN DIFFERENTIAL GEOMETRY. I. SPACE CURVES.
S.-C. Chou and X.-S. Gao.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-08. 1989.]
111842 RITT-WU'S DECOMPOSITION ALGORITHM AND GEOMETRY THEOREM PROVING.
S.-C. Chou and X.-S. Gao.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-09. 1989.]
111843 USING (N-1)-PROCESS ELECTION TO SOLVE N-PROCESS ELECTION.
J. H. Anderson.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-10. 1989.]
111844 AUTOMATED REASONING IN MECHANICS USING RITT-WU'S METHOD.
S.-C. Chou and X.-S. Gao.
[University of Texas, Austin. Department of Computer Sciences.
TR-89-11. 1989.]
111845 LEXICAL COHESION, THE THESAURUS, AND THE STRUCTURE OF TEXT.
J. Morris.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-219. 1988. Thesis (M.S.).]
111846 SHARED VIRTUAL MEMORY ACCOMODATING HETEROGENEITY.
K. Li et al.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-220. 1988.]
111847 SEMANTIC-DATA MODELS CAN BE IMPLEMENTED EFFICIENTLY: A PERFORMANCE
ANALYSIS PERSPECTIVE.
D. Rios-Zertuche.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-221. 1988.]
111848 TELOS: A KNOWLEDGE REPRESENTATION LANGUAGE FOR REQUIREMENTS MODELLING.
M. Koubarakis et al.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-222. 1988.]
111849 QUERIES ON GRAPHS.
P. T. Wood.
[University of Toronto. Computer Systems Research Institute.
Technical report CSRI-223. 1988. Thesis (Ph.D.).]
111850 NUMERICAL TESTING OF EXPLICIT RUNGE-KUTTA PAIRS.
P. Sharp.
[University of Toronto. Department of Computer Science. Technical
report 216/88. 1988.]
111851 THE COMPLEXITY OF DECISION PROCEDURES IN RELEVANCE LOGIC.
A. Urquhart.
[University of Toronto. Department of Computer Science. Technical
report 217/88. 1989.]
111852 TELOS: FEATURES AND FORMALIZATION.
M. Koubarakis et al.
[University of Toronto. Department of Computer Science. KRR-TR-89-4.
1989.]
111853 TOWARDS A UNIFIED THEORY OF THE PARALLELISM AVAILABLE FOR CIRCUIT
SIMULATION.
M. L. Bailey and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 88-11-08. 1988.]
111854 CONSTRAINT HIERARCHIES AND LOGIC PROGRAMMING.
A. Borning et al.
[University of Washington. Department of Computer Science. Technical
report 88-11-10. 1988.]
111855 THE INFLUENCE OF ON-CHIP PARALLELISM IN THE PERFORMANCE OF
EVENT-BASED PARALLEL SIMULATION.
M. L. Bailey and L. Snyder.
[University of Washington. Department of Computer Science. Technical
report 88-11-11. 1988.]
111856 THE COMPLEXITY OF PARALLEL COMPUTATIONS: INHERENTLY SEQUENTIAL
ALGORITHMS AND P-COMPLETE PROBLEMS.
R. Greenlaw.
[University of Washington. Department of Computer Science. Technical
report 88-12-01. 1988. Thesis (Ph.D.).]
111857 SOME TOPICS IN COMMUNICATION COMPLEXITY THEORY.
T. W. Lam.
[University of Washington. Department of Computer Science. Technical
report 88-12-02. 1988. Thesis (Ph.D.).]
111858 AN INQUIRY INTO PARALLEL ALGORITHMS FOR SEARCHING GAME TREES.
K. Almquist, N. McKenzie, and K. Sloan.
[University of Washington. Department of Computer Science. Technical
report 88-12-03. 1988.]
111859 A TIMESTAMP-BASED CACHE COHERENCE SCHEME.
S. L. Min and J.-L. Baer.
[University of Washington. Department of Computer Science. Technical
report 88-12-05. 1988.]
111860 OBJECT MOBILITY IN A DISTRIBUTED OBJECT-ORIENTED SYSTEM.
E. Jul.
[University of Washington. Department of Computer Science. Technical
report 88-12-06. 1988. Thesis (Ph.D.).]
111861 THE MEASURED PERFORMANCE OF PARALLEL DYNAMIC PROGRAMMING
IMPLEMENTATIONS.
K. Almquist, R. J. Anderson, and E. D. Lazowska.
[University of Washington. Department of Computer Science. Technical
report 89-01-03. 1989.]
111862 A COMPOSITIONAL MODEL FOR SOFTWARE REUSE.
B. K. Raj and H. M. Levy.
[University of Washington. Department of Computer Science. Technical
report 89-01-04. 1989.]
111863 A LOWER BOUND ON THE SIZE OF SHELLSORT SORTING NETWORKS.
R. Cypher.
[University of Washington. Department of Computer Science. Technical
report 89-01-06. 1989.]
111864 THEORETICAL ASPECTS OF VLSI PIN LIMITATION.
R. Cypher.
[University of Washington. Department of Computer Science. Technical
report 89-02-01. 1989.]
111865 PERFORMANCE OF TABLE-DRIVEN CODE GENERATORS USING TREE-PATTERN
MATCHING.
R. R. Henry and P. C. Damron.
[University of Washington. Department of Computer Science. Technical
report 89-02-02. 1989.]
111866 ALGORITHMS FOR TABLE-DRIVEN CODE GENERATORS USING TREE-PATTERN
MATCHING.
R. R. Henry and P. C. Damron.
[University of Washington. Department of Computer Science. Technical
report 89-02-03. 1989.]
111867 ENCODING OPTIMAL PATTERN SELECTION IN A TABLE-DRIVEN BOTTOM-UP
TREE-PATTERN MATCHER.
R. R. Henry.
[University of Washington. Department of Computer Science. Technical
report 89-02-04. 1989.]
111868 LOWER BOUNDS ON THE LENGTH OF UNIVERSAL TRAVERSAL SEQUENCES.
A. Borodin, W. L. Ruzzo, and M. Tompa.
[University of Washington. Department of Computer Science. Technical
report 89-03-02. 1989.]
111869 ALGORITHMS FOR REDUCED HYPERCUBES AND RELATED COMPUTERS.
R. Cypher and J. L. C. Sanz.
[University of Washington. Department of Computer Science. Technical
report 89-04-05. 1989.]
111870 ON MULTIVARIATE POLYNOMIAL INTERPOLATION.
N. Dyn and A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 820. 1989.]
111871 ON MULTIVARIATE POLYNOMIAL INTERPOLATION.
C. de Boor and A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 822. 1989.]
111872 PRIORITY IN DBMS RESOURCE SCHEDULING.
M. J. Carey, R. Jauhari, and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 828. 1989.]
111873 FACTORIZATION THEOREMS FOR UNIVARIATE SPLINES ON REGULAR GRIDS.
A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 829. 1989.]
111874 AN EMPIRICAL STUDY OF THE RELIABILITY OF OPERATING SYSTEM UTILITIES.
B. P. Miller, L. Fredriksen, and B. So.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 830. 1989.]
111875 PARALLELISM AND CONCURRENCY CONTROL PERFORMANCE IN DISTRIBUTED
DATABASE MACHINES.
M. J. Carey and M. Livny.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 831. 1989.]
111876 SPECIFICATION AND VERIFICATION OF NETWORK MANAGERS FOR LARGE
INTERNETS.
D. L. Cohrs and B. P. Miller.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 832. 1989.]
111877 CONFLICT RESOLUTION OF RULES ASSIGNING VALUES TO VIRTUAL ATTRIBUTES.
Y. E. Ioannidis and T. K. Sellis.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 833. 1989.]
111878 THE LIMIT AT THE ORIGIN OF A SMOOTH FUNCTION SPACE.
C. de Boor and A. Ron.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 834. 1989.]
111879 SCALABILITY AND ITS APPLICATION TO MULTICUBE.
J. R. Goodman, M. D. Hill, and P. J. Woest.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 835. 1989.]
111880 A PERFORMANCE EVALUATION OF FOUR PARALLEL JOIN ALGORITHMS IN A
SHARED-NOTHING MULTIPROCESSOR ENVIRONMENT.
D. A. Schneider and D. J. DeWitt.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 836. 1989.]
111881 LEARNING IN MATHEMATICALLY-BASED DOMAINS: UNDERSTANDING AND
GENERALIZING OBSTACLE CANCELLATIONS.
J. W. Shavlik and G. F. DeJong.
[University of Wisconsin, Madison. Computer Sciences Department.
Computer sciences technical report 837. 1989.]
111882 NONBLOCKING MULTIRATE NETWORKS.
R. Melen and J. S. Turner.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-2. 1988.]
111883 PROBABLE PERFORMANCE OF STEINER TREE ALGORITHMS.
B. M. Waxman.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-4. 1988.]
111884 BUFFER MANAGEMENT SYSTEM.
J. S. Turner.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-6. 1988.]
111885 TOWARDS A FRAMEWORK FOR HIGH SPEED COMMUNICATION IN A HETEROGENEOUS
NETWORKING ENVIRONMENT.
G. M. Parulkar and J. S. Turner.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-7. 1988.]
111886 HIERARCHICAL DISCRETE-EVENT SIMULATION ON HYPERCUBE ARCHITECTURES.
R. D. Chamberlain and M. A. Franklin.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-8. 1988.]
111887 A SHARED DATASPACE LANGUAGE SUPPORTING LARGE-SCALE CONCURRENCY.
G.-C. Roman, H. C. Cunningham, and M. E. Ehlers.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-9. 1988.]
111888 MEMORY CAPACITY OF A NEURAL NETWORK.
T. D. Kimura.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-11. 1988.]
111889 PARALLEL SIMULATED ANNEALING.
R. D. Chamberlain et al.
[Washington University (St. Louis). Department of Computer Science
Technical report WUCS-88-12. 1988.]
111890 WORST CASE PERFORMANCE OF RAYWARD-SMITH'S STEINER TREE HEURISTIC.
B. M. Waxman and M. Imase.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-13. 1988.]
111891 RELATIONAL COMPLETENESS OF SHOW AND TELL VISUAL PROGRAMMING LANGUAGE.
T. D. Kimura.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-25. 1988.]
111892 DECLARATIVE VISUALIZATION IN THE SHARED DATASPACE PARADIGM.
G.-C. Roman and K. C. Cox.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-27. 1988.]
111893 PRACTICAL WIDE-SENSE NONBLOCKING GENERALIZED CONNECTORS.
J. S. Turner.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-29. 1988.]
111894 A TRANSACTION SYSTEM FOR THE NCUBE.
K. C. Cox and G.-C. Roman.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-31. 1988.]
111895 A SHARED DATASPACE MODEL OF CONCURRENCY - LANGUAGE AND PROGRAMMING
IMPLICATIONS.
G.-C. Roman and H. C. Cunningham.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-33. 1988.]
111896 IMPLEMENTING A SHARED DATASPACE LANGUAGE ON A MESSAGE-BASED
MULTIPROCESSOR.
G.-C. Roman and K. C. Cox.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-34. 1988.]
111897 PERFORMANCE EVALUATION OF HIERARCHICAL SIMULATION SYSTEMS.
M. N. Edelman and M. A. Franklin.
[Washington University (St. Louis). Department of Computer Science.
Technical report WUCS-88-35. 1988.]